Term Rewriting System R:
[x]
not(true) -> false
not(false) -> true
evenodd(x, 0) -> not(evenodd(x, s(0)))
evenodd(0, s(0)) -> false
evenodd(s(x), s(0)) -> evenodd(x, 0)

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

EVENODD(x, 0) -> NOT(evenodd(x, s(0)))
EVENODD(x, 0) -> EVENODD(x, s(0))
EVENODD(s(x), s(0)) -> EVENODD(x, 0)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Polynomial Ordering


Dependency Pairs:

EVENODD(s(x), s(0)) -> EVENODD(x, 0)
EVENODD(x, 0) -> EVENODD(x, s(0))


Rules:


not(true) -> false
not(false) -> true
evenodd(x, 0) -> not(evenodd(x, s(0)))
evenodd(0, s(0)) -> false
evenodd(s(x), s(0)) -> evenodd(x, 0)





The following dependency pair can be strictly oriented:

EVENODD(s(x), s(0)) -> EVENODD(x, 0)


Additionally, the following rules can be oriented:

not(true) -> false
not(false) -> true
evenodd(x, 0) -> not(evenodd(x, s(0)))
evenodd(0, s(0)) -> false
evenodd(s(x), s(0)) -> evenodd(x, 0)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(0)=  0  
  POL(evenodd(x1, x2))=  0  
  POL(false)=  0  
  POL(EVENODD(x1, x2))=  x1  
  POL(true)=  0  
  POL(s(x1))=  1 + x1  
  POL(not(x1))=  0  

resulting in one new DP problem.



   R
DPs
       →DP Problem 1
Polo
           →DP Problem 2
Dependency Graph


Dependency Pair:

EVENODD(x, 0) -> EVENODD(x, s(0))


Rules:


not(true) -> false
not(false) -> true
evenodd(x, 0) -> not(evenodd(x, s(0)))
evenodd(0, s(0)) -> false
evenodd(s(x), s(0)) -> evenodd(x, 0)





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes