Term Rewriting System R:
[X]
f(X, X) -> f(a, b)
b -> c

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(X, X) -> F(a, b)
F(X, X) -> B

Furthermore, R contains one SCC. 


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


Dependency Pair:

F(X, X) -> F(a, b)


Rules:


f(X, X) -> f(a, b)
b -> c


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
             ↳Rewriting Transformation


Dependency Pair:

F(X, X) -> F(a, b)


Rule:


b -> c


Strategy:

innermost




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

F(X, X) -> F(a, b)
one new Dependency Pair is created:

F(X, X) -> F(a, c)

The transformation is resulting in no new DP problems.


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