Term Rewriting System R:
[y, x]
+(0, y) -> y
+(s(x), 0) -> s(x)
+(s(x), s(y)) -> s(+(s(x), +(y, 0)))
Termination of R to be shown.
R
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
+(0, y) -> y
+(s(x), 0) -> s(x)
where the Polynomial interpretation:
| POL(0) | = 0 |
| POL(s(x1)) | = 2 + x1 |
| POL(+(x1, x2)) | = 1 + x1 + 2·x2 |
was used.
Not all Rules of R can be deleted, so we still have to regard a part of R.
R
↳RRRPolo
→TRS2
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
+(s(x), s(y)) -> s(+(s(x), +(y, 0)))
where the Polynomial interpretation:
| POL(0) | = 0 |
| POL(s(x1)) | = 1 + x1 |
| POL(+(x1, x2)) | = x1 + 2·x2 |
was used.
All Rules of R can be deleted.
R
↳RRRPolo
→TRS2
↳RRRPolo
→TRS3
↳Overlay and local confluence Check
The TRS is overlay and locally confluent (all critical pairs are trivially joinable).Hence, we can switch to innermost.
R
↳RRRPolo
→TRS2
↳RRRPolo
→TRS3
↳OC
...
→TRS4
↳Dependency Pair Analysis
R contains no Dependency Pairs and therefore no SCCs.
Termination of R successfully shown.
Duration:
0:00 minutes