Term Rewriting System R:

   [x]
   f(x) -> f(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: 


   F(x) -> F(g(x))

Furthermore, R contains one SCC.


SCC1:

F(x) -> F(g(x))

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


Non-Termination of R could be shown.

Duration: 0.709 seconds.