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