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