Term Rewriting System R:

   [X]
   c -> f(g(c))
   f(g(X)) -> g(X)

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: 


   C -> F(g(c))
   C -> C

Furthermore, R contains one SCC.


SCC1:

C -> C

Found an infinite P-chain over R:
P = C -> C
R = []
s = C evaluates to t = C
Thus, s starts an infinite reduction.


Non-Termination of R could be shown.

Duration: 0.635 seconds.