WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            COND1(true(),z0) -> c(COND2(even(z0),z0),EVEN(z0))
            COND2(false(),z0) -> c3(COND1(neq(z0,0()),p(z0)),NEQ(z0,0()))
            COND2(false(),z0) -> c4(COND1(neq(z0,0()),p(z0)),P(z0))
            COND2(true(),z0) -> c1(COND1(neq(z0,0()),div2(z0)),NEQ(z0,0()))
            COND2(true(),z0) -> c2(COND1(neq(z0,0()),div2(z0)),DIV2(z0))
            DIV2(0()) -> c12()
            DIV2(s(0())) -> c13()
            DIV2(s(s(z0))) -> c14(DIV2(z0))
            EVEN(0()) -> c9()
            EVEN(s(0())) -> c10()
            EVEN(s(s(z0))) -> c11(EVEN(z0))
            NEQ(0(),0()) -> c5()
            NEQ(0(),s(z0)) -> c6()
            NEQ(s(z0),0()) -> c7()
            NEQ(s(z0),s(y())) -> c8(NEQ(z0,y()))
            P(0()) -> c15()
            P(s(z0)) -> c16()
        - Weak TRS:
            cond1(true(),z0) -> cond2(even(z0),z0)
            cond2(false(),z0) -> cond1(neq(z0,0()),p(z0))
            cond2(true(),z0) -> cond1(neq(z0,0()),div2(z0))
            div2(0()) -> 0()
            div2(s(0())) -> 0()
            div2(s(s(z0))) -> s(div2(z0))
            even(0()) -> true()
            even(s(0())) -> false()
            even(s(s(z0))) -> even(z0)
            neq(0(),0()) -> false()
            neq(0(),s(z0)) -> true()
            neq(s(z0),0()) -> true()
            neq(s(z0),s(y())) -> neq(z0,y())
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {COND1/2,COND2/2,DIV2/1,EVEN/1,NEQ/2,P/1,cond1/2,cond2/2,div2/1,even/1,neq/2,p/1} / {0/0,c/2,c1/2,c10/0
            ,c11/1,c12/0,c13/0,c14/1,c15/0,c16/0,c2/2,c3/2,c4/2,c5/0,c6/0,c7/0,c8/1,c9/0,false/0,s/1,true/0,y/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {COND1,COND2,DIV2,EVEN,NEQ,P,cond1,cond2,div2,even,neq
            ,p} and constructors {0,c,c1,c10,c11,c12,c13,c14,c15,c16,c2,c3,c4,c5,c6,c7,c8,c9,false,s,true,y}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            COND1(true(),z0) -> c(COND2(even(z0),z0),EVEN(z0))
            COND2(false(),z0) -> c3(COND1(neq(z0,0()),p(z0)),NEQ(z0,0()))
            COND2(false(),z0) -> c4(COND1(neq(z0,0()),p(z0)),P(z0))
            COND2(true(),z0) -> c1(COND1(neq(z0,0()),div2(z0)),NEQ(z0,0()))
            COND2(true(),z0) -> c2(COND1(neq(z0,0()),div2(z0)),DIV2(z0))
            DIV2(0()) -> c12()
            DIV2(s(0())) -> c13()
            DIV2(s(s(z0))) -> c14(DIV2(z0))
            EVEN(0()) -> c9()
            EVEN(s(0())) -> c10()
            EVEN(s(s(z0))) -> c11(EVEN(z0))
            NEQ(0(),0()) -> c5()
            NEQ(0(),s(z0)) -> c6()
            NEQ(s(z0),0()) -> c7()
            NEQ(s(z0),s(y())) -> c8(NEQ(z0,y()))
            P(0()) -> c15()
            P(s(z0)) -> c16()
        - Weak TRS:
            cond1(true(),z0) -> cond2(even(z0),z0)
            cond2(false(),z0) -> cond1(neq(z0,0()),p(z0))
            cond2(true(),z0) -> cond1(neq(z0,0()),div2(z0))
            div2(0()) -> 0()
            div2(s(0())) -> 0()
            div2(s(s(z0))) -> s(div2(z0))
            even(0()) -> true()
            even(s(0())) -> false()
            even(s(s(z0))) -> even(z0)
            neq(0(),0()) -> false()
            neq(0(),s(z0)) -> true()
            neq(s(z0),0()) -> true()
            neq(s(z0),s(y())) -> neq(z0,y())
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {COND1/2,COND2/2,DIV2/1,EVEN/1,NEQ/2,P/1,cond1/2,cond2/2,div2/1,even/1,neq/2,p/1} / {0/0,c/2,c1/2,c10/0
            ,c11/1,c12/0,c13/0,c14/1,c15/0,c16/0,c2/2,c3/2,c4/2,c5/0,c6/0,c7/0,c8/1,c9/0,false/0,s/1,true/0,y/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {COND1,COND2,DIV2,EVEN,NEQ,P,cond1,cond2,div2,even,neq
            ,p} and constructors {0,c,c1,c10,c11,c12,c13,c14,c15,c16,c2,c3,c4,c5,c6,c7,c8,c9,false,s,true,y}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            COND1(true(),z0) -> c(COND2(even(z0),z0),EVEN(z0))
            COND2(false(),z0) -> c3(COND1(neq(z0,0()),p(z0)),NEQ(z0,0()))
            COND2(false(),z0) -> c4(COND1(neq(z0,0()),p(z0)),P(z0))
            COND2(true(),z0) -> c1(COND1(neq(z0,0()),div2(z0)),NEQ(z0,0()))
            COND2(true(),z0) -> c2(COND1(neq(z0,0()),div2(z0)),DIV2(z0))
            DIV2(0()) -> c12()
            DIV2(s(0())) -> c13()
            DIV2(s(s(z0))) -> c14(DIV2(z0))
            EVEN(0()) -> c9()
            EVEN(s(0())) -> c10()
            EVEN(s(s(z0))) -> c11(EVEN(z0))
            NEQ(0(),0()) -> c5()
            NEQ(0(),s(z0)) -> c6()
            NEQ(s(z0),0()) -> c7()
            NEQ(s(z0),s(y())) -> c8(NEQ(z0,y()))
            P(0()) -> c15()
            P(s(z0)) -> c16()
        - Weak TRS:
            cond1(true(),z0) -> cond2(even(z0),z0)
            cond2(false(),z0) -> cond1(neq(z0,0()),p(z0))
            cond2(true(),z0) -> cond1(neq(z0,0()),div2(z0))
            div2(0()) -> 0()
            div2(s(0())) -> 0()
            div2(s(s(z0))) -> s(div2(z0))
            even(0()) -> true()
            even(s(0())) -> false()
            even(s(s(z0))) -> even(z0)
            neq(0(),0()) -> false()
            neq(0(),s(z0)) -> true()
            neq(s(z0),0()) -> true()
            neq(s(z0),s(y())) -> neq(z0,y())
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {COND1/2,COND2/2,DIV2/1,EVEN/1,NEQ/2,P/1,cond1/2,cond2/2,div2/1,even/1,neq/2,p/1} / {0/0,c/2,c1/2,c10/0
            ,c11/1,c12/0,c13/0,c14/1,c15/0,c16/0,c2/2,c3/2,c4/2,c5/0,c6/0,c7/0,c8/1,c9/0,false/0,s/1,true/0,y/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {COND1,COND2,DIV2,EVEN,NEQ,P,cond1,cond2,div2,even,neq
            ,p} and constructors {0,c,c1,c10,c11,c12,c13,c14,c15,c16,c2,c3,c4,c5,c6,c7,c8,c9,false,s,true,y}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          DIV2(x){x -> s(s(x))} =
            DIV2(s(s(x))) ->^+ c14(DIV2(x))
              = C[DIV2(x) = DIV2(x){}]

WORST_CASE(Omega(n^1),?)