Termination w.r.t. Q of the given QTRS could be proven:

0 QTRS
↳1 QTRSRRRProof (⇔)
↳2 QTRS
↳3 QTRSRRRProof (⇔)
↳4 QTRS
  ↳5 RisEmptyProof (⇔)
    ↳6 TRUE
  ↳7 RisEmptyProof (⇔)
    ↳8 TRUE

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

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))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(+(x1, x2)) = 1 + x1 + x2   
POL(0) = 0   
POL(false) = 0   
POL(not(x1)) = 1 + x1   
POL(odd(x1)) = 1 + x1   
POL(s(x1)) = 2 + x1   
POL(true) = 0   
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

not(true) → false
not(false) → true
odd(0) → false
odd(s(x)) → not(odd(x))
+(x, 0) → x


(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

+(x, s(y)) → s(+(x, y))
+(s(x), y) → s(+(x, y))

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(+(x1, x2)) = 2 + 2·x1 + 2·x2   
POL(s(x1)) = 1 + x1   
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

+(x, s(y)) → s(+(x, y))
+(s(x), y) → s(+(x, y))


(4) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(5) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(6) TRUE

(7) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(8) TRUE