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

WORST_CASE(Omega(n^1),?)