Term Rewriting System R:
[x]
f(0, 1, x) -> f(x, x, x)
Termination of R to be shown.
R
↳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
↳OC
→TRS2
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(0, 1, x) -> F(x, x, x)
R contains no SCCs.
Termination of R successfully shown.
Duration:
0:00 minutes