Term Rewriting System R:
[x, y]
h(f(x), y) -> f(g(x, y))
g(x, y) -> h(x, y)
Termination of R to be shown.
R
↳Removing Redundant Rules
Removing the following rules from R which fullfill a polynomial ordering:
h(f(x), y) -> f(g(x, y))
where the Polynomial interpretation:
| POL(g(x1, x2)) | = 2·x1 + x2 |
| POL(h(x1, x2)) | = 2·x1 + x2 |
| POL(f(x1)) | = 1 + x1 |
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:
g(x, y) -> h(x, y)
where the Polynomial interpretation:
| POL(g(x1, x2)) | = 1 + x1 + x2 |
| POL(h(x1, x2)) | = x1 + 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