Term Rewriting System R:

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

Termination of R to be shown.


This program has no overlaps, so it is sufficient to show innermost termination. 


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.




Termination of R successfully shown.


Duration: 0.398 seconds.