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