Term Rewriting System R:

   [X, Y]
   f(X, g(X), Y) -> f(Y, Y, Y)
   g(b) -> c
   b -> c

Termination of R to be shown.


R contains the following Dependency Pairs: 


   F(X, g(X), Y) -> F(Y, Y, Y)

Furthermore, R contains one SCC.


SCC1:

F(X, g(X), Y) -> F(Y, Y, Y)

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


Non-Termination of R could be shown.

Duration: 0.507 seconds.