* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            if(false(),x,y) -> nil()
            if(true(),x,y) -> cons(x,int(s(x),y))
            int(x,y) -> if(le(x,y),x,y)
            le(0(),y) -> true()
            le(s(x),0()) -> false()
            le(s(x),s(y)) -> le(x,y)
        - Signature:
            {if/3,int/2,le/2} / {0/0,cons/2,false/0,nil/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {if,int,le} and constructors {0,cons,false,nil,s,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            if(false(),x,y) -> nil()
            if(true(),x,y) -> cons(x,int(s(x),y))
            int(x,y) -> if(le(x,y),x,y)
            le(0(),y) -> true()
            le(s(x),0()) -> false()
            le(s(x),s(y)) -> le(x,y)
        - Signature:
            {if/3,int/2,le/2} / {0/0,cons/2,false/0,nil/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {if,int,le} and constructors {0,cons,false,nil,s,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          le(x,y){x -> s(x),y -> s(y)} =
            le(s(x),s(y)) ->^+ le(x,y)
              = C[le(x,y) = le(x,y){}]

WORST_CASE(Omega(n^1),?)