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