YES

TRS:

  bin(x,0()) -> s(0())
  bin(0(),s(y)) -> 0()
  bin(s(x),s(y)) -> +(bin(x,s(y)),bin(x,y))

max/plus interpretations on N:

  bin_A(x1,x2) = max{0, x1, x2}
  bin#_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}

precedence:

  bin > s = + > 0