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, x1}
  not#_A(x1) = max{2, x1}
  true_A = 0
  true#_A = 0
  false_A = 1
  false#_A = 1
  odd_A(x1) = max{2, 1 + x1}
  odd#_A(x1) = max{2, 1 + x1}
  0_A = 2
  0#_A = 2
  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:

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