Term Rewriting System R:

   [x]
   f(x, g(x)) -> f(1, g(x))
   g(1) -> g(0)

Innermost Termination of R to be shown.


R contains the following Dependency Pairs: 


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

R contains no SCCs.




Innermost Termination of R successfully shown.


Duration: 0.355 seconds.