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

WORST_CASE(Omega(n^1),?)