YES
O(n)
TRS:
 {
     d(x) -> e(u(x)),
  d(u(x)) -> c(x),
  c(u(x)) -> b(x),
  b(u(x)) -> a(e(x)),
  v(e(x)) -> x
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
       d(x) -> e(u(x)),
    d(u(x)) -> c(x),
    c(u(x)) -> b(x),
    b(u(x)) -> a(e(x)),
    v(e(x)) -> x
   }
  BOUND:
   Automaton:
    {
     a_2(37) -> 38,
     a_1(16) -> 17,
      a_0(7) -> 7,
      v_0(7) -> 7,
     b_2(28) -> 29,
     b_1(24) -> 25,
     b_1(10) -> 11,
      b_0(7) -> 7,
     c_1(20) -> 21,
      c_1(8) -> 9,
      c_0(7) -> 7,
      d_0(7) -> 7,
     u_1(12) -> 13,
      u_0(7) -> 7,
     e_2(36) -> 37,
     e_1(32) -> 33,
     e_1(15) -> 16,
     e_1(13) -> 14,
      e_0(7) -> 7,
          38 -> 29 | 25 | 11,
          33 -> 16,
          29 -> 21 | 9,
          25 -> 7,
          21 -> 7,
          17 -> 29 | 25 | 11 | 7,
          14 -> 7,
          13 -> 7,
          12 -> 36 | 32 | 28 | 24 | 20,
          11 -> 21 | 9 | 7,
           9 -> 7,
           7 -> 15 | 12 | 10 | 8
    }
   Strict:
    {}
   Qed