Term Rewriting System R:
[x, y, z]
and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)
Innermost Termination of R to be shown.
R
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)
where the Polynomial interpretation:
| POL(and(x1, x2, x3)) | = 1 + x1 + x2 + x3 |
| POL(band(x1, x2)) | = x1 + x2 |
| POL(not(x1)) | = 1 + 2·x1 |
was used.
All Rules of R can be deleted.
R
↳RRRPolo
→TRS2
↳Dependency Pair Analysis
R contains no Dependency Pairs and therefore no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes