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

WORST_CASE(Omega(n^1),?)