Term Rewriting System R:

   [x, y, z]
   f(0, 1, x) -> f(x, x, x)
   f(x, y, z) -> 2
   0 -> 2
   1 -> 2

Termination of R to be shown.


R contains the following Dependency Pairs: 


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

R contains no SCCs.




Termination of R successfully shown.


Duration: 0.387 seconds.