YES(?,O(n^1))

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

Strict Trs:
  { a(c(d(x))) -> c(x)
  , u(b(d(d(x)))) -> b(x)
  , v(a(a(x))) -> u(v(x))
  , v(a(c(x))) -> u(b(d(x)))
  , v(c(x)) -> b(x)
  , w(a(a(x))) -> u(w(x))
  , w(a(c(x))) -> u(b(d(x)))
  , w(c(x)) -> b(x) }
Obligation:
  runtime complexity
Answer:
  YES(?,O(n^1))

The problem is match-bounded by 1. The enriched problem is
compatible with the following automaton.
{ a_0(2) -> 1
, c_0(2) -> 2
, c_1(2) -> 1
, d_0(2) -> 2
, u_0(2) -> 1
, b_0(2) -> 2
, b_1(2) -> 1
, v_0(2) -> 1
, w_0(2) -> 1 }

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