Term Rewriting System R:
[x]
f(a, f(b, f(a, x))) -> f(a, f(b, f(b, f(a, x))))
f(b, f(b, f(b, x))) -> f(b, f(b, x))
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(a, f(b, f(a, x))) -> F(a, f(b, f(b, f(a, x))))
F(a, f(b, f(a, x))) -> F(b, f(b, f(a, x)))
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes