*** 1 Progress [(O(1),O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        p(m,n,s(r)) -> p(m,r,n)
        p(m,0(),0()) -> m
        p(m,s(n),0()) -> p(0(),n,m)
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {p/3} / {0/0,s/1}
      Obligation:
        Innermost
        basic terms: {p}/{0,s}
    Applied Processor:
      Bounds {initialAutomaton = minimal, enrichment = match}
    Proof:
      The problem is match-bounded by 1.
      The enriched problem is compatible with follwoing automaton.
        0_0() -> 1
        0_0() -> 2
        0_1() -> 1
        0_1() -> 2
        p_0(2,2,2) -> 1
        p_1(2,2,2) -> 1
        s_0(2) -> 1
        s_0(2) -> 2
        2 -> 1
*** 1.1 Progress [(O(1),O(1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        p(m,n,s(r)) -> p(m,r,n)
        p(m,0(),0()) -> m
        p(m,s(n),0()) -> p(0(),n,m)
      Signature:
        {p/3} / {0/0,s/1}
      Obligation:
        Innermost
        basic terms: {p}/{0,s}
    Applied Processor:
      EmptyProcessor
    Proof:
      The problem is already closed. The intended complexity is O(1).