Term Rewriting System R:
[x]
f(a, f(x, a)) -> f(f(x, f(f(a, a), a)), a)
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(a, f(x, a)) -> F(f(x, f(f(a, a), a)), a)
F(a, f(x, a)) -> F(x, f(f(a, a), a))
F(a, f(x, a)) -> F(f(a, a), a)
F(a, f(x, a)) -> F(a, a)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
F(a, f(x, a)) -> F(x, f(f(a, a), a))
Rule:
f(a, f(x, a)) -> f(f(x, f(f(a, a), a)), a)
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes