Term Rewriting System R:
[x, y]
not(x) -> xor(x, true)
implies(x, y) -> xor(and(x, y), xor(x, true))
or(x, y) -> xor(and(x, y), xor(x, y))
=(x, y) -> xor(x, xor(y, true))

Innermost Termination of R to be shown.

Dependency Pair Analysis

R contains no Dependency Pairs and therefore no SCCs.

Innermost Termination of R successfully shown.
0:00 minutes