*** 1 Progress [(O(1),O(n^1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        a(0(),x) -> c(c(x))
        c(c(x)) -> b(c(b(c(x))))
        c(c(b(c(x)))) -> b(a(0(),c(x)))
      Weak DP Rules:
        
      Weak TRS Rules:
        
      Signature:
        {a/2,c/1} / {0/0,b/1}
      Obligation:
        Full
        basic terms: {a,c}/{0,b}
    Applied Processor:
      Bounds {initialAutomaton = minimal, enrichment = match}
    Proof:
      The problem is match-bounded by 2.
      The enriched problem is compatible with follwoing automaton.
        0_0() -> 2
        a_0(2,2) -> 1
        b_0(2) -> 2
        b_2(4) -> 1
        b_2(6) -> 5
        c_0(2) -> 1
        c_1(2) -> 3
        c_1(3) -> 1
        c_2(2) -> 6
        c_2(5) -> 4
*** 1.1 Progress [(O(1),O(1))]  ***
    Considered Problem:
      Strict DP Rules:
        
      Strict TRS Rules:
        
      Weak DP Rules:
        
      Weak TRS Rules:
        a(0(),x) -> c(c(x))
        c(c(x)) -> b(c(b(c(x))))
        c(c(b(c(x)))) -> b(a(0(),c(x)))
      Signature:
        {a/2,c/1} / {0/0,b/1}
      Obligation:
        Full
        basic terms: {a,c}/{0,b}
    Applied Processor:
      EmptyProcessor
    Proof:
      The problem is already closed. The intended complexity is O(1).