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