Term Rewriting System R:

   [X, Y]
   f(s(X)) -> f(X)
   g(cons(0, Y)) -> g(Y)
   g(cons(s(X), Y)) -> s(X)
   h(cons(X, Y)) -> h(g(cons(X, Y)))

Termination of R to be shown.


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

   f(s(X)) -> f(X)
   g(cons(0, Y)) -> g(Y)

where the Polynomial interpretation:
POL(g(x_1)) = x_1
POL(s(x_1)) = 1 + x_1
POL(h(x_1)) = 1 + x_1
POL(f(x_1)) = 2 + x_1
POL(0) = 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: 

   g(cons(s(X), Y)) -> s(X)

where the Polynomial interpretation:
POL(g(x_1)) = x_1
POL(s(x_1)) = 1 + x_1
POL(h(x_1)) = 1 + x_1
POL(cons(x_1, x_2)) = 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.


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


R contains the following Dependency Pairs: 


   H(cons(X, Y)) -> H(g(cons(X, Y)))

R contains no SCCs.




Termination of R successfully shown.


Duration: 0.420 seconds.