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