Term Rewriting System R:

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

Termination of R to be shown.


R contains the following Dependency Pairs: 


   F(s(x)) -> G(f(x))
   F(s(x)) -> F(x)

Furthermore, R contains one SCC.


SCC1:

F(s(x)) -> F(x)

Removing rules from R by ordering and analyzing Dependency Pairs, Usable Rules, and Usable Equations.

This is possible by using the following (C_E-compatible) Polynomial ordering.

Polynomial interpretation:
POL(s(x_1)) = 1 + x_1
POL(F(x_1)) = 1 + x_1

The following Dependency Pairs can be deleted:

   F(s(x)) -> F(x)



 This transformation is resulting in no new subcycles.




Termination of R successfully shown.


Duration: 0.466 seconds.