Term Rewriting System R:

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

Innermost Termination of R to be shown.


R contains the following Dependency Pairs: 


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

Furthermore, R contains one SCC.


SCC1:

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

On this Scc, 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 subcycles.




Innermost Termination of R successfully shown.


Duration: 0.398 seconds.