* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            *(x,0()) -> 0()
            *(1(),y) -> y
            *(i(x),x) -> 1()
        - Signature:
            {*/2} / {0/0,1/0,i/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {*} and constructors {0,1,i}
    + 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) -> 1
          0_0() -> 1
          0_0() -> 2
          0_1() -> 1
          1_0() -> 1
          1_0() -> 2
          1_1() -> 1
          i_0(2) -> 1
          i_0(2) -> 2
          2 -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            *(x,0()) -> 0()
            *(1(),y) -> y
            *(i(x),x) -> 1()
        - Signature:
            {*/2} / {0/0,1/0,i/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {*} and constructors {0,1,i}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))