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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering


Dependency Pairs:

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


Rule:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


Additionally, the following usable rule for innermost can be oriented:

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


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

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 2
             ↳Narrowing Transformation


Dependency Pair:

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


Rule:


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


Strategy:

innermost




On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

F(f(x, a), a) -> F(f(f(x, a), f(a, a)), a)
one new Dependency Pair is created:

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

The transformation is resulting in no new DP problems.


Innermost Termination of R successfully shown.
Duration:
0:00 minutes