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