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

WORST_CASE(Omega(n^1),?)