YES

TRS:

  +(0(),y) -> y
  +(s(x),y) -> s(+(x,y))
  -(0(),y) -> 0()
  -(x,0()) -> x
  -(s(x),s(y)) -> -(x,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}
  -_A(x1,x2) = max{1, 1 + x1, 1 + x2}
  -#_A(x1,x2) = max{1, 1 + x1, 1 + x2}

precedence:

  + = 0 > s = -