Term Rewriting System R:

   [X, Y]
   f(0, 1, X) -> f(X, X, X)
   g(X, Y) -> X
   g(X, Y) -> Y

Innermost Termination of R to be shown.


R contains the following Dependency Pairs: 


   F(0, 1, X) -> F(X, X, X)

R contains no SCCs.




Innermost Termination of R successfully shown.


Duration: 0.337 seconds.