* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(*(x,y),*(x,z)) -> *(x,+(y,z))
            +(*(x,y),+(*(x,z),u())) -> +(*(x,+(y,z)),u())
            +(+(x,y),z) -> +(x,+(y,z))
        - Signature:
            {+/2} / {*/2,u/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {*,u}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(*(x,y),*(x,z)) -> *(x,+(y,z))
            +(*(x,y),+(*(x,z),u())) -> +(*(x,+(y,z)),u())
            +(+(x,y),z) -> +(x,+(y,z))
        - Signature:
            {+/2} / {*/2,u/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {*,u}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          *_0(2,2) -> 2
          *_1(2,3) -> 1
          *_1(2,3) -> 3
          +_0(2,2) -> 1
          +_1(2,2) -> 3
          u_0() -> 2
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            +(*(x,y),*(x,z)) -> *(x,+(y,z))
            +(*(x,y),+(*(x,z),u())) -> +(*(x,+(y,z)),u())
            +(+(x,y),z) -> +(x,+(y,z))
        - Signature:
            {+/2} / {*/2,u/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {*,u}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))