*** 1 Progress [(O(1),O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        +(*(x,y),*(x,z)) -> *(x,+(y,z))
        +(*(x,y),+(*(x,z),u())) -> +(*(x,+(y,z)),u())
        +(+(x,y),z) -> +(x,+(y,z))
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {+/2} / {*/2,u/0}
      Obligation:
        Innermost
        basic terms: {+}/{*,u}
    Applied Processor:
      Bounds {initialAutomaton = minimal, enrichment = match}
    Proof:
      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
*** 1.1 Progress [(O(1),O(1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        +(*(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
        basic terms: {+}/{*,u}
    Applied Processor:
      EmptyProcessor
    Proof:
      The problem is already closed. The intended complexity is O(1).