YES

TRS:

  +(0(),y) -> y
  +(s(x),y) -> s(+(x,y))
  +(p(x),y) -> p(+(x,y))
  minus(0()) -> 0()
  minus(s(x)) -> p(minus(x))
  minus(p(x)) -> s(minus(x))
  *(0(),y) -> 0()
  *(s(x),y) -> +(*(x,y),y)
  *(p(x),y) -> +(*(x,y),minus(y))

max/plus interpretations on N:

  +_A(x1,x2) = max{0, x1, x2}
  +#_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}
  p_A(x1) = max{0, x1}
  p#_A(x1) = max{0, x1}
  minus_A(x1) = max{0, x1}
  minus#_A(x1) = max{0, x1}
  *_A(x1,x2) = max{0, x1, x2}
  *#_A(x1,x2) = max{0, x1, x2}

precedence:

  0 > * > + = minus > p > s