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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering


Dependency Pairs:

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


Rule:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


The following usable rule for innermost w.r.t. to the AFS can be oriented:

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


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(a)=  1  
  POL(f)=  0  

resulting in one new DP problem.
Used Argument Filtering System:
F(x1, x2) -> x2
f(x1, x2) -> f


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




The following remains to be proven:
Dependency Pairs:

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


Rule:


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


Strategy:

innermost



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