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))}
 LMPO:
  Quasi-Precedence:
  odd > not
  empty
  
Normal:
   pi(+) = [1,2], pi(odd) = [1]
  
Safe:
   pi(not) = [1]
  
Predicative System:
   { 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;);)}
  

   
  

  Qed