WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            G(f(z0,z1)) -> c(G(g(z0)),G(z0))
            G(f(z0,z1)) -> c1(G(g(z1)),G(z1))
            G(f(z0,z1)) -> c2(G(g(z0)),G(z0))
            G(f(z0,z1)) -> c3(G(g(z1)),G(z1))
        - Weak TRS:
            g(f(z0,z1)) -> f(f(g(g(z0)),g(g(z1))),f(g(g(z0)),g(g(z1))))
        - Signature:
            {G/1,g/1} / {c/2,c1/2,c2/2,c3/2,f/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {G,g} and constructors {c,c1,c2,c3,f}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            G(f(z0,z1)) -> c(G(g(z0)),G(z0))
            G(f(z0,z1)) -> c1(G(g(z1)),G(z1))
            G(f(z0,z1)) -> c2(G(g(z0)),G(z0))
            G(f(z0,z1)) -> c3(G(g(z1)),G(z1))
        - Weak TRS:
            g(f(z0,z1)) -> f(f(g(g(z0)),g(g(z1))),f(g(g(z0)),g(g(z1))))
        - Signature:
            {G/1,g/1} / {c/2,c1/2,c2/2,c3/2,f/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {G,g} and constructors {c,c1,c2,c3,f}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            G(f(z0,z1)) -> c(G(g(z0)),G(z0))
            G(f(z0,z1)) -> c1(G(g(z1)),G(z1))
            G(f(z0,z1)) -> c2(G(g(z0)),G(z0))
            G(f(z0,z1)) -> c3(G(g(z1)),G(z1))
        - Weak TRS:
            g(f(z0,z1)) -> f(f(g(g(z0)),g(g(z1))),f(g(g(z0)),g(g(z1))))
        - Signature:
            {G/1,g/1} / {c/2,c1/2,c2/2,c3/2,f/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {G,g} and constructors {c,c1,c2,c3,f}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          G(x){x -> f(x,y)} =
            G(f(x,y)) ->^+ c(G(g(x)),G(x))
              = C[G(x) = G(x){}]

WORST_CASE(Omega(n^1),?)