Term Rewriting System R:

   [X]
   f(X) -> g(h(f(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: 


   F(X) -> F(X)

Furthermore, R contains one SCC.


SCC1:

F(X) -> F(X)

Found an infinite P-chain over R:
P = F(X) -> F(X)
R = []
s = F(X') evaluates to t = F(X')
Thus, s starts an infinite reduction.


Non-Termination of R could be shown.

Duration: 0.636 seconds.