YES

TRS:

  D(t()) -> 1()
  D(constant()) -> 0()
  D(+(x,y)) -> +(D(x),D(y))
  D(*(x,y)) -> +(*(y,D(x)),*(x,D(y)))
  D(-(x,y)) -> -(D(x),D(y))

max/plus interpretations on N:

  D_A(x1) = max{0, x1}
  D#_A(x1) = max{0, x1}
  t_A = 0
  t#_A = 0
  1_A = 0
  1#_A = 0
  constant_A = 0
  constant#_A = 0
  0_A = 0
  0#_A = 0
  +_A(x1,x2) = max{0, x1, x2}
  +#_A(x1,x2) = max{0, x1, x2}
  *_A(x1,x2) = max{0, x1, x2}
  *#_A(x1,x2) = max{0, x1, x2}
  -_A(x1,x2) = max{0, x1, x2}
  -#_A(x1,x2) = max{0, x1, x2}

precedence:

  t > 1 = constant > D = 0 = * = - > +