WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            AND(z0,false()) -> c5()
            AND(false(),z0) -> c6()
            AND(true(),true()) -> c4()
            COND(true(),z0,z1) -> c(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),AND(gr(z0,0()),gr(z1,0())),GR(z0,0()))
            COND(true(),z0,z1) -> c1(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),AND(gr(z0,0()),gr(z1,0())),GR(z1,0()))
            COND(true(),z0,z1) -> c2(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),P(z0))
            COND(true(),z0,z1) -> c3(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),P(z1))
            GR(0(),z0) -> c8()
            GR(0(),0()) -> c7()
            GR(s(z0),0()) -> c9()
            GR(s(z0),s(z1)) -> c10(GR(z0,z1))
            P(0()) -> c11()
            P(s(z0)) -> c12()
        - Weak TRS:
            and(z0,false()) -> false()
            and(false(),z0) -> false()
            and(true(),true()) -> true()
            cond(true(),z0,z1) -> cond(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1))
            gr(0(),z0) -> false()
            gr(0(),0()) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(z1)) -> gr(z0,z1)
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {AND/2,COND/3,GR/2,P/1,and/2,cond/3,gr/2,p/1} / {0/0,c/3,c1/3,c10/1,c11/0,c12/0,c2/2,c3/2,c4/0,c5/0,c6/0
            ,c7/0,c8/0,c9/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {AND,COND,GR,P,and,cond,gr,p} and constructors {0,c,c1,c10
            ,c11,c12,c2,c3,c4,c5,c6,c7,c8,c9,false,s,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            AND(z0,false()) -> c5()
            AND(false(),z0) -> c6()
            AND(true(),true()) -> c4()
            COND(true(),z0,z1) -> c(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),AND(gr(z0,0()),gr(z1,0())),GR(z0,0()))
            COND(true(),z0,z1) -> c1(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),AND(gr(z0,0()),gr(z1,0())),GR(z1,0()))
            COND(true(),z0,z1) -> c2(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),P(z0))
            COND(true(),z0,z1) -> c3(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),P(z1))
            GR(0(),z0) -> c8()
            GR(0(),0()) -> c7()
            GR(s(z0),0()) -> c9()
            GR(s(z0),s(z1)) -> c10(GR(z0,z1))
            P(0()) -> c11()
            P(s(z0)) -> c12()
        - Weak TRS:
            and(z0,false()) -> false()
            and(false(),z0) -> false()
            and(true(),true()) -> true()
            cond(true(),z0,z1) -> cond(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1))
            gr(0(),z0) -> false()
            gr(0(),0()) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(z1)) -> gr(z0,z1)
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {AND/2,COND/3,GR/2,P/1,and/2,cond/3,gr/2,p/1} / {0/0,c/3,c1/3,c10/1,c11/0,c12/0,c2/2,c3/2,c4/0,c5/0,c6/0
            ,c7/0,c8/0,c9/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {AND,COND,GR,P,and,cond,gr,p} and constructors {0,c,c1,c10
            ,c11,c12,c2,c3,c4,c5,c6,c7,c8,c9,false,s,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            AND(z0,false()) -> c5()
            AND(false(),z0) -> c6()
            AND(true(),true()) -> c4()
            COND(true(),z0,z1) -> c(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),AND(gr(z0,0()),gr(z1,0())),GR(z0,0()))
            COND(true(),z0,z1) -> c1(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),AND(gr(z0,0()),gr(z1,0())),GR(z1,0()))
            COND(true(),z0,z1) -> c2(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),P(z0))
            COND(true(),z0,z1) -> c3(COND(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1)),P(z1))
            GR(0(),z0) -> c8()
            GR(0(),0()) -> c7()
            GR(s(z0),0()) -> c9()
            GR(s(z0),s(z1)) -> c10(GR(z0,z1))
            P(0()) -> c11()
            P(s(z0)) -> c12()
        - Weak TRS:
            and(z0,false()) -> false()
            and(false(),z0) -> false()
            and(true(),true()) -> true()
            cond(true(),z0,z1) -> cond(and(gr(z0,0()),gr(z1,0())),p(z0),p(z1))
            gr(0(),z0) -> false()
            gr(0(),0()) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(z1)) -> gr(z0,z1)
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {AND/2,COND/3,GR/2,P/1,and/2,cond/3,gr/2,p/1} / {0/0,c/3,c1/3,c10/1,c11/0,c12/0,c2/2,c3/2,c4/0,c5/0,c6/0
            ,c7/0,c8/0,c9/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {AND,COND,GR,P,and,cond,gr,p} and constructors {0,c,c1,c10
            ,c11,c12,c2,c3,c4,c5,c6,c7,c8,c9,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)) ->^+ c10(GR(x,y))
              = C[GR(x,y) = GR(x,y){}]

WORST_CASE(Omega(n^1),?)