* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(y,x) -> y
            a(y,c(b(a(0(),x),0()))) -> b(a(c(b(0(),y)),x),0())
            b(x,y) -> c(a(c(y),a(0(),x)))
        - Signature:
            {a/2,b/2} / {0/0,c/1}
        - Obligation:
             runtime complexity wrt. defined symbols {a,b} and constructors {0,c}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 2
          0_1() -> 5
          0_1() -> 6
          a_0(2,2) -> 1
          a_1(4,5) -> 3
          a_1(6,2) -> 5
          b_0(2,2) -> 1
          c_0(2) -> 1
          c_0(2) -> 2
          c_1(2) -> 3
          c_1(2) -> 4
          c_1(3) -> 1
          2 -> 1
          4 -> 3
          6 -> 5
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(y,x) -> y
            a(y,c(b(a(0(),x),0()))) -> b(a(c(b(0(),y)),x),0())
            b(x,y) -> c(a(c(y),a(0(),x)))
        - Signature:
            {a/2,b/2} / {0/0,c/1}
        - Obligation:
             runtime complexity wrt. defined symbols {a,b} and constructors {0,c}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))