YES

TRS:

  d(x) -> e(u(x))
  d(u(x)) -> c(x)
  c(u(x)) -> b(x)
  v(e(x)) -> x
  b(u(x)) -> a(e(x))

max/plus interpretations on N:

  d_A(x1) = max{0, x1}
  d#_A(x1) = max{0, x1}
  e_A(x1) = max{0, x1}
  e#_A(x1) = max{0, x1}
  u_A(x1) = max{0, x1}
  u#_A(x1) = max{0, x1}
  c_A(x1) = max{0, x1}
  c#_A(x1) = max{0, x1}
  b_A(x1) = max{0, x1}
  b#_A(x1) = max{0, x1}
  v_A(x1) = max{0, x1}
  v#_A(x1) = max{0, x1}
  a_A(x1) = max{0, x1}
  a#_A(x1) = max{0, x1}

precedence:

  d = v > c = b > e > u > a