Term Rewriting System R:

   [X]
   f(0) -> cons(0, n__f(s(0)))
   f(s(0)) -> f(p(s(0)))
   f(X) -> n__f(X)
   p(s(0)) -> 0
   activate(n__f(X)) -> f(X)
   activate(X) -> X

Termination of R to be shown.


Removing the following rules from R which fullfill a polynomial ordering: 

   f(0) -> cons(0, n__f(s(0)))
   f(X) -> n__f(X)
   activate(X) -> X

where the Polynomial interpretation:
POL(s(x_1)) = x_1
POL(activate(x_1)) = 1 + x_1
POL(f(x_1)) = 1 + x_1
POL(0) = 0
POL(n__f(x_1)) = x_1
POL(p(x_1)) = x_1
POL(cons(x_1, x_2)) = x_1 + x_2
was used. 



Not all Rules of R can be deleted, so we still have to regard a part of R.


Removing the following rules from R which fullfill a polynomial ordering: 

   p(s(0)) -> 0

where the Polynomial interpretation:
POL(s(x_1)) = 2*x_1
POL(activate(x_1)) = x_1
POL(f(x_1)) = x_1
POL(0) = 1
POL(n__f(x_1)) = x_1
POL(p(x_1)) = x_1
was used. 



Not all Rules of R can be deleted, so we still have to regard a part of R.


Removing the following rules from R which fullfill a polynomial ordering: 

   activate(n__f(X)) -> f(X)

where the Polynomial interpretation:
POL(s(x_1)) = x_1
POL(activate(x_1)) = 1 + x_1
POL(f(x_1)) = x_1
POL(0) = 0
POL(n__f(x_1)) = x_1
POL(p(x_1)) = x_1
was used. 



Not all Rules of R can be deleted, so we still have to regard a part of R.


This program has no overlaps, so it is sufficient to show innermost termination. 


R contains the following Dependency Pairs: 


   F(s(0)) -> F(p(s(0)))

R contains no SCCs.




Termination of R successfully shown.


Duration: 0.492 seconds.