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

WORST_CASE(Omega(n^1),?)