YES

TRS:

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

max/plus interpretations on N:

  f_A(x1) = max{0, x1}
  f#_A(x1) = max{0, x1}
  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}

precedence:

  0 > f = + > s = *