YES

TRS:

  exp(x,0()) -> s(0())
  exp(x,s(y)) -> *(x,exp(x,y))
  *(0(),y) -> 0()
  *(s(x),y) -> +(y,*(x,y))
  -(0(),y) -> 0()
  -(x,0()) -> x
  -(s(x),s(y)) -> -(x,y)

max/plus interpretations on N:

  exp_A(x1,x2) = max{0, x1, x2}
  exp#_A(x1,x2) = max{0, x1, x2}
  0_A = 0
  0#_A = 0
  s_A(x1) = max{0, x1}
  s#_A(x1) = max{0, x1}
  *_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:

  exp > s = * > 0 = + > -