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

WORST_CASE(NON_POLY,?)