Term Rewriting System R:
[x]
f(x, f(f(a, a), a)) -> f(f(a, f(a, a)), x)

Termination of R to be shown.

R
Dependency Pair Analysis

R contains the following Dependency Pairs:

F(x, f(f(a, a), a)) -> F(f(a, f(a, a)), x)
F(x, f(f(a, a), a)) -> F(a, f(a, a))

Furthermore, R contains one SCC.

R
DPs
→DP Problem 1
Polynomial Ordering

Dependency Pairs:

F(x, f(f(a, a), a)) -> F(a, f(a, a))
F(x, f(f(a, a), a)) -> F(f(a, f(a, a)), x)

Rule:

f(x, f(f(a, a), a)) -> f(f(a, f(a, a)), x)

The following dependency pair can be strictly oriented:

F(x, f(f(a, a), a)) -> F(a, f(a, a))

Additionally, the following usable rule using the Ce-refinement can be oriented:

f(x, f(f(a, a), a)) -> f(f(a, f(a, a)), x)

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(a) =  0 POL(f(x1, x2)) =  1 + x1 + x2 POL(F(x1, x2)) =  x1 + x2

resulting in one new DP problem.

R
DPs
→DP Problem 1
Polo
→DP Problem 2
Remaining Obligation(s)

The following remains to be proven:
Dependency Pair:

F(x, f(f(a, a), a)) -> F(f(a, f(a, a)), x)

Rule:

f(x, f(f(a, a), a)) -> f(f(a, f(a, a)), x)

Termination of R could not be shown.
Duration:
0:00 minutes