YES

TRS:

  not(true()) -> false()
  not(false()) -> true()
  odd(0()) -> false()
  odd(s(x)) -> not(odd(x))
  +(x,0()) -> x
  +(x,s(y)) -> s(+(x,y))
  +(s(x),y) -> s(+(x,y))

max/plus interpretations on N:

  not_A(x1) = max{2, 3}
  not#_A(x1) = max{2, -2}
  true_A = 3
  true#_A = 1
  false_A = 3
  false#_A = 0
  odd_A(x1) = max{1, 3}
  odd#_A(x1) = max{3, -1}
  0_A = 1
  0#_A = 1
  s_A(x1) = max{2, 4}
  s#_A(x1) = max{1, 4}
  +_A(x1,x2) = max{4, 1 + x1, 3 + x2}
  +#_A(x1,x2) = max{4, 4, 4}

precedence:

  + > s > true = odd = 0 > false > not