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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Usable Rules (Innermost)


Dependency Pair:

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


Rule:


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


Strategy:

innermost




As we are in the innermost case, we can delete all 1 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
           →DP Problem 2
             ↳Instantiation Transformation


Dependency Pair:

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


Rule:

none


Strategy:

innermost




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

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

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

The transformation is resulting in no new DP problems.


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