* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            active(app(X1,X2)) -> app(X1,active(X2))
            active(app(X1,X2)) -> app(active(X1),X2)
            active(app(cons(X,XS),YS)) -> mark(cons(X,app(XS,YS)))
            active(app(nil(),YS)) -> mark(YS)
            active(cons(X1,X2)) -> cons(active(X1),X2)
            active(from(X)) -> from(active(X))
            active(from(X)) -> mark(cons(X,from(s(X))))
            active(prefix(L)) -> mark(cons(nil(),zWadr(L,prefix(L))))
            active(prefix(X)) -> prefix(active(X))
            active(s(X)) -> s(active(X))
            active(zWadr(X1,X2)) -> zWadr(X1,active(X2))
            active(zWadr(X1,X2)) -> zWadr(active(X1),X2)
            active(zWadr(XS,nil())) -> mark(nil())
            active(zWadr(cons(X,XS),cons(Y,YS))) -> mark(cons(app(Y,cons(X,nil())),zWadr(XS,YS)))
            active(zWadr(nil(),YS)) -> mark(nil())
            app(X1,mark(X2)) -> mark(app(X1,X2))
            app(mark(X1),X2) -> mark(app(X1,X2))
            app(ok(X1),ok(X2)) -> ok(app(X1,X2))
            cons(mark(X1),X2) -> mark(cons(X1,X2))
            cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
            from(mark(X)) -> mark(from(X))
            from(ok(X)) -> ok(from(X))
            prefix(mark(X)) -> mark(prefix(X))
            prefix(ok(X)) -> ok(prefix(X))
            proper(app(X1,X2)) -> app(proper(X1),proper(X2))
            proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
            proper(from(X)) -> from(proper(X))
            proper(nil()) -> ok(nil())
            proper(prefix(X)) -> prefix(proper(X))
            proper(s(X)) -> s(proper(X))
            proper(zWadr(X1,X2)) -> zWadr(proper(X1),proper(X2))
            s(mark(X)) -> mark(s(X))
            s(ok(X)) -> ok(s(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
            zWadr(X1,mark(X2)) -> mark(zWadr(X1,X2))
            zWadr(mark(X1),X2) -> mark(zWadr(X1,X2))
            zWadr(ok(X1),ok(X2)) -> ok(zWadr(X1,X2))
        - Signature:
            {active/1,app/2,cons/2,from/1,prefix/1,proper/1,s/1,top/1,zWadr/2} / {mark/1,nil/0,ok/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {active,app,cons,from,prefix,proper,s,top
            ,zWadr} and constructors {mark,nil,ok}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            active(app(X1,X2)) -> app(X1,active(X2))
            active(app(X1,X2)) -> app(active(X1),X2)
            active(app(cons(X,XS),YS)) -> mark(cons(X,app(XS,YS)))
            active(app(nil(),YS)) -> mark(YS)
            active(cons(X1,X2)) -> cons(active(X1),X2)
            active(from(X)) -> from(active(X))
            active(from(X)) -> mark(cons(X,from(s(X))))
            active(prefix(L)) -> mark(cons(nil(),zWadr(L,prefix(L))))
            active(prefix(X)) -> prefix(active(X))
            active(s(X)) -> s(active(X))
            active(zWadr(X1,X2)) -> zWadr(X1,active(X2))
            active(zWadr(X1,X2)) -> zWadr(active(X1),X2)
            active(zWadr(XS,nil())) -> mark(nil())
            active(zWadr(cons(X,XS),cons(Y,YS))) -> mark(cons(app(Y,cons(X,nil())),zWadr(XS,YS)))
            active(zWadr(nil(),YS)) -> mark(nil())
            app(X1,mark(X2)) -> mark(app(X1,X2))
            app(mark(X1),X2) -> mark(app(X1,X2))
            app(ok(X1),ok(X2)) -> ok(app(X1,X2))
            cons(mark(X1),X2) -> mark(cons(X1,X2))
            cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
            from(mark(X)) -> mark(from(X))
            from(ok(X)) -> ok(from(X))
            prefix(mark(X)) -> mark(prefix(X))
            prefix(ok(X)) -> ok(prefix(X))
            proper(app(X1,X2)) -> app(proper(X1),proper(X2))
            proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
            proper(from(X)) -> from(proper(X))
            proper(nil()) -> ok(nil())
            proper(prefix(X)) -> prefix(proper(X))
            proper(s(X)) -> s(proper(X))
            proper(zWadr(X1,X2)) -> zWadr(proper(X1),proper(X2))
            s(mark(X)) -> mark(s(X))
            s(ok(X)) -> ok(s(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
            zWadr(X1,mark(X2)) -> mark(zWadr(X1,X2))
            zWadr(mark(X1),X2) -> mark(zWadr(X1,X2))
            zWadr(ok(X1),ok(X2)) -> ok(zWadr(X1,X2))
        - Signature:
            {active/1,app/2,cons/2,from/1,prefix/1,proper/1,s/1,top/1,zWadr/2} / {mark/1,nil/0,ok/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {active,app,cons,from,prefix,proper,s,top
            ,zWadr} and constructors {mark,nil,ok}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          app(x,y){y -> mark(y)} =
            app(x,mark(y)) ->^+ mark(app(x,y))
              = C[app(x,y) = app(x,y){}]

WORST_CASE(Omega(n^1),?)