Term Rewriting System R:

   [x]
   f(0, 1, x) -> f(x, x, 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(0, 1, x) -> F(x, x, x)

R contains no SCCs.




Termination of R successfully shown.


Duration: 0.358 seconds.