Term Rewriting System R:

   []
   g(a) -> g(b)
   b -> f(a, a)
   f(a, a) -> g(d)

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: 


   G(a) -> G(b)
   G(a) -> B
   B -> F(a, a)
   F(a, a) -> G(d)

R contains no SCCs.




Termination of R successfully shown.


Duration: 0.408 seconds.