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

WORST_CASE(Omega(n^1),?)