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