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