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