YES(?,O(n^1))

We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).

Strict Trs:
  { c(y) -> y
  , c(c(c(y))) -> c(c(a(y, 0())))
  , c(a(a(0(), x), y)) -> a(c(c(c(0()))), y) }
Obligation:
  runtime complexity
Answer:
  YES(?,O(n^1))

The problem is match-bounded by 2. The enriched problem is
compatible with the following automaton.
{ c_0(2) -> 1
, c_1(4) -> 3
, c_1(5) -> 3
, c_1(5) -> 4
, c_1(6) -> 3
, c_1(6) -> 4
, c_1(6) -> 5
, c_2(7) -> 3
, c_2(8) -> 3
, c_2(8) -> 7
, a_0(2, 2) -> 1
, a_0(2, 2) -> 2
, a_1(3, 2) -> 1
, a_2(6, 9) -> 3
, a_2(6, 9) -> 7
, a_2(6, 9) -> 8
, 0_0() -> 1
, 0_0() -> 2
, 0_1() -> 3
, 0_1() -> 4
, 0_1() -> 5
, 0_1() -> 6
, 0_2() -> 9
, 2 -> 1
, 4 -> 3
, 5 -> 3
, 5 -> 4
, 6 -> 3
, 6 -> 4
, 6 -> 5
, 7 -> 3
, 8 -> 3
, 8 -> 7 }

Hurray, we answered YES(?,O(n^1))