WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            ADD(0(),z0) -> c5()
            ADD(s(z0),z1) -> c6(ADD(z0,z1))
            COND(true(),z0,z1) -> c(COND(gr(z0,z1),z0,add(z0,z1)),GR(z0,z1))
            COND(true(),z0,z1) -> c1(COND(gr(z0,z1),z0,add(z0,z1)),ADD(z0,z1))
            GR(0(),z0) -> c2()
            GR(s(z0),0()) -> c3()
            GR(s(z0),s(z1)) -> c4(GR(z0,z1))
        - Weak TRS:
            add(0(),z0) -> z0
            add(s(z0),z1) -> s(add(z0,z1))
            cond(true(),z0,z1) -> cond(gr(z0,z1),z0,add(z0,z1))
            gr(0(),z0) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(z1)) -> gr(z0,z1)
        - Signature:
            {ADD/2,COND/3,GR/2,add/2,cond/3,gr/2} / {0/0,c/2,c1/2,c2/0,c3/0,c4/1,c5/0,c6/1,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {ADD,COND,GR,add,cond,gr} 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:
            ADD(0(),z0) -> c5()
            ADD(s(z0),z1) -> c6(ADD(z0,z1))
            COND(true(),z0,z1) -> c(COND(gr(z0,z1),z0,add(z0,z1)),GR(z0,z1))
            COND(true(),z0,z1) -> c1(COND(gr(z0,z1),z0,add(z0,z1)),ADD(z0,z1))
            GR(0(),z0) -> c2()
            GR(s(z0),0()) -> c3()
            GR(s(z0),s(z1)) -> c4(GR(z0,z1))
        - Weak TRS:
            add(0(),z0) -> z0
            add(s(z0),z1) -> s(add(z0,z1))
            cond(true(),z0,z1) -> cond(gr(z0,z1),z0,add(z0,z1))
            gr(0(),z0) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(z1)) -> gr(z0,z1)
        - Signature:
            {ADD/2,COND/3,GR/2,add/2,cond/3,gr/2} / {0/0,c/2,c1/2,c2/0,c3/0,c4/1,c5/0,c6/1,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {ADD,COND,GR,add,cond,gr} 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:
            ADD(0(),z0) -> c5()
            ADD(s(z0),z1) -> c6(ADD(z0,z1))
            COND(true(),z0,z1) -> c(COND(gr(z0,z1),z0,add(z0,z1)),GR(z0,z1))
            COND(true(),z0,z1) -> c1(COND(gr(z0,z1),z0,add(z0,z1)),ADD(z0,z1))
            GR(0(),z0) -> c2()
            GR(s(z0),0()) -> c3()
            GR(s(z0),s(z1)) -> c4(GR(z0,z1))
        - Weak TRS:
            add(0(),z0) -> z0
            add(s(z0),z1) -> s(add(z0,z1))
            cond(true(),z0,z1) -> cond(gr(z0,z1),z0,add(z0,z1))
            gr(0(),z0) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(z1)) -> gr(z0,z1)
        - Signature:
            {ADD/2,COND/3,GR/2,add/2,cond/3,gr/2} / {0/0,c/2,c1/2,c2/0,c3/0,c4/1,c5/0,c6/1,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {ADD,COND,GR,add,cond,gr} 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:
          ADD(x,y){x -> s(x)} =
            ADD(s(x),y) ->^+ c6(ADD(x,y))
              = C[ADD(x,y) = ADD(x,y){}]

WORST_CASE(Omega(n^1),?)