WORST_CASE(Omega(n^1),?)
* Step 1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            APP(cons(z0,z1),z2) -> c1(APP(z1,z2))
            APP(nil(),z0) -> c()
            FROM(z0) -> c2(FROM(s(z0)))
            PREFIX(z0) -> c7(ZWADR(z0,prefix(z0)),PREFIX(z0))
            ZWADR(z0,nil()) -> c4()
            ZWADR(cons(z0,z1),cons(z2,z3)) -> c5(APP(z2,cons(z0,nil())))
            ZWADR(cons(z0,z1),cons(z2,z3)) -> c6(ZWADR(z1,z3))
            ZWADR(nil(),z0) -> c3()
        - Weak TRS:
            app(cons(z0,z1),z2) -> cons(z0,app(z1,z2))
            app(nil(),z0) -> z0
            from(z0) -> cons(z0,from(s(z0)))
            prefix(z0) -> cons(nil(),zWadr(z0,prefix(z0)))
            zWadr(z0,nil()) -> nil()
            zWadr(cons(z0,z1),cons(z2,z3)) -> cons(app(z2,cons(z0,nil())),zWadr(z1,z3))
            zWadr(nil(),z0) -> nil()
        - Signature:
            {APP/2,FROM/1,PREFIX/1,ZWADR/2,app/2,from/1,prefix/1,zWadr/2} / {c/0,c1/1,c2/1,c3/0,c4/0,c5/1,c6/1,c7/2
            ,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {APP,FROM,PREFIX,ZWADR,app,from,prefix
            ,zWadr} and constructors {c,c1,c2,c3,c4,c5,c6,c7,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            APP(cons(z0,z1),z2) -> c1(APP(z1,z2))
            APP(nil(),z0) -> c()
            FROM(z0) -> c2(FROM(s(z0)))
            PREFIX(z0) -> c7(ZWADR(z0,prefix(z0)),PREFIX(z0))
            ZWADR(z0,nil()) -> c4()
            ZWADR(cons(z0,z1),cons(z2,z3)) -> c5(APP(z2,cons(z0,nil())))
            ZWADR(cons(z0,z1),cons(z2,z3)) -> c6(ZWADR(z1,z3))
            ZWADR(nil(),z0) -> c3()
        - Weak TRS:
            app(cons(z0,z1),z2) -> cons(z0,app(z1,z2))
            app(nil(),z0) -> z0
            from(z0) -> cons(z0,from(s(z0)))
            prefix(z0) -> cons(nil(),zWadr(z0,prefix(z0)))
            zWadr(z0,nil()) -> nil()
            zWadr(cons(z0,z1),cons(z2,z3)) -> cons(app(z2,cons(z0,nil())),zWadr(z1,z3))
            zWadr(nil(),z0) -> nil()
        - Signature:
            {APP/2,FROM/1,PREFIX/1,ZWADR/2,app/2,from/1,prefix/1,zWadr/2} / {c/0,c1/1,c2/1,c3/0,c4/0,c5/1,c6/1,c7/2
            ,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {APP,FROM,PREFIX,ZWADR,app,from,prefix
            ,zWadr} and constructors {c,c1,c2,c3,c4,c5,c6,c7,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 3: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            APP(cons(z0,z1),z2) -> c1(APP(z1,z2))
            APP(nil(),z0) -> c()
            FROM(z0) -> c2(FROM(s(z0)))
            PREFIX(z0) -> c7(ZWADR(z0,prefix(z0)),PREFIX(z0))
            ZWADR(z0,nil()) -> c4()
            ZWADR(cons(z0,z1),cons(z2,z3)) -> c5(APP(z2,cons(z0,nil())))
            ZWADR(cons(z0,z1),cons(z2,z3)) -> c6(ZWADR(z1,z3))
            ZWADR(nil(),z0) -> c3()
        - Weak TRS:
            app(cons(z0,z1),z2) -> cons(z0,app(z1,z2))
            app(nil(),z0) -> z0
            from(z0) -> cons(z0,from(s(z0)))
            prefix(z0) -> cons(nil(),zWadr(z0,prefix(z0)))
            zWadr(z0,nil()) -> nil()
            zWadr(cons(z0,z1),cons(z2,z3)) -> cons(app(z2,cons(z0,nil())),zWadr(z1,z3))
            zWadr(nil(),z0) -> nil()
        - Signature:
            {APP/2,FROM/1,PREFIX/1,ZWADR/2,app/2,from/1,prefix/1,zWadr/2} / {c/0,c1/1,c2/1,c3/0,c4/0,c5/1,c6/1,c7/2
            ,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {APP,FROM,PREFIX,ZWADR,app,from,prefix
            ,zWadr} and constructors {c,c1,c2,c3,c4,c5,c6,c7,cons,nil,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          APP(y,z){y -> cons(x,y)} =
            APP(cons(x,y),z) ->^+ c1(APP(y,z))
              = C[APP(y,z) = APP(y,z){}]

WORST_CASE(Omega(n^1),?)