WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            AND(z0,false()) -> c3()
            AND(false(),z0) -> c4()
            AND(true(),true()) -> c5()
            COND(true(),z0) -> c(COND(and(even(z0),gr(z0,0())),p(z0)),AND(even(z0),gr(z0,0())),EVEN(z0))
            COND(true(),z0) -> c1(COND(and(even(z0),gr(z0,0())),p(z0)),AND(even(z0),gr(z0,0())),GR(z0,0()))
            COND(true(),z0) -> c2(COND(and(even(z0),gr(z0,0())),p(z0)),P(z0))
            EVEN(0()) -> c6()
            EVEN(s(0())) -> c7()
            EVEN(s(s(z0))) -> c8(EVEN(z0))
            GR(0(),z0) -> c9()
            GR(s(z0),0()) -> c10()
            GR(s(z0),s(y())) -> c11(GR(z0,y()))
            P(0()) -> c12()
            P(s(z0)) -> c13()
        - Weak TRS:
            and(z0,false()) -> false()
            and(false(),z0) -> false()
            and(true(),true()) -> true()
            cond(true(),z0) -> cond(and(even(z0),gr(z0,0())),p(z0))
            even(0()) -> true()
            even(s(0())) -> false()
            even(s(s(z0))) -> even(z0)
            gr(0(),z0) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(y())) -> gr(z0,y())
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {AND/2,COND/2,EVEN/1,GR/2,P/1,and/2,cond/2,even/1,gr/2,p/1} / {0/0,c/3,c1/3,c10/0,c11/1,c12/0,c13/0,c2/2
            ,c3/0,c4/0,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 {AND,COND,EVEN,GR,P,and,cond,even,gr
            ,p} and constructors {0,c,c1,c10,c11,c12,c13,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:
            AND(z0,false()) -> c3()
            AND(false(),z0) -> c4()
            AND(true(),true()) -> c5()
            COND(true(),z0) -> c(COND(and(even(z0),gr(z0,0())),p(z0)),AND(even(z0),gr(z0,0())),EVEN(z0))
            COND(true(),z0) -> c1(COND(and(even(z0),gr(z0,0())),p(z0)),AND(even(z0),gr(z0,0())),GR(z0,0()))
            COND(true(),z0) -> c2(COND(and(even(z0),gr(z0,0())),p(z0)),P(z0))
            EVEN(0()) -> c6()
            EVEN(s(0())) -> c7()
            EVEN(s(s(z0))) -> c8(EVEN(z0))
            GR(0(),z0) -> c9()
            GR(s(z0),0()) -> c10()
            GR(s(z0),s(y())) -> c11(GR(z0,y()))
            P(0()) -> c12()
            P(s(z0)) -> c13()
        - Weak TRS:
            and(z0,false()) -> false()
            and(false(),z0) -> false()
            and(true(),true()) -> true()
            cond(true(),z0) -> cond(and(even(z0),gr(z0,0())),p(z0))
            even(0()) -> true()
            even(s(0())) -> false()
            even(s(s(z0))) -> even(z0)
            gr(0(),z0) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(y())) -> gr(z0,y())
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {AND/2,COND/2,EVEN/1,GR/2,P/1,and/2,cond/2,even/1,gr/2,p/1} / {0/0,c/3,c1/3,c10/0,c11/1,c12/0,c13/0,c2/2
            ,c3/0,c4/0,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 {AND,COND,EVEN,GR,P,and,cond,even,gr
            ,p} and constructors {0,c,c1,c10,c11,c12,c13,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:
            AND(z0,false()) -> c3()
            AND(false(),z0) -> c4()
            AND(true(),true()) -> c5()
            COND(true(),z0) -> c(COND(and(even(z0),gr(z0,0())),p(z0)),AND(even(z0),gr(z0,0())),EVEN(z0))
            COND(true(),z0) -> c1(COND(and(even(z0),gr(z0,0())),p(z0)),AND(even(z0),gr(z0,0())),GR(z0,0()))
            COND(true(),z0) -> c2(COND(and(even(z0),gr(z0,0())),p(z0)),P(z0))
            EVEN(0()) -> c6()
            EVEN(s(0())) -> c7()
            EVEN(s(s(z0))) -> c8(EVEN(z0))
            GR(0(),z0) -> c9()
            GR(s(z0),0()) -> c10()
            GR(s(z0),s(y())) -> c11(GR(z0,y()))
            P(0()) -> c12()
            P(s(z0)) -> c13()
        - Weak TRS:
            and(z0,false()) -> false()
            and(false(),z0) -> false()
            and(true(),true()) -> true()
            cond(true(),z0) -> cond(and(even(z0),gr(z0,0())),p(z0))
            even(0()) -> true()
            even(s(0())) -> false()
            even(s(s(z0))) -> even(z0)
            gr(0(),z0) -> false()
            gr(s(z0),0()) -> true()
            gr(s(z0),s(y())) -> gr(z0,y())
            p(0()) -> 0()
            p(s(z0)) -> z0
        - Signature:
            {AND/2,COND/2,EVEN/1,GR/2,P/1,and/2,cond/2,even/1,gr/2,p/1} / {0/0,c/3,c1/3,c10/0,c11/1,c12/0,c13/0,c2/2
            ,c3/0,c4/0,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 {AND,COND,EVEN,GR,P,and,cond,even,gr
            ,p} and constructors {0,c,c1,c10,c11,c12,c13,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:
          EVEN(x){x -> s(s(x))} =
            EVEN(s(s(x))) ->^+ c8(EVEN(x))
              = C[EVEN(x) = EVEN(x){}]

WORST_CASE(Omega(n^1),?)