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

WORST_CASE(Omega(n^1),?)