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

WORST_CASE(NON_POLY,?)