Term Rewriting System R:

   [x, y]
   double(0) -> 0
   double(s(x)) -> s(s(double(x)))
   double(x) -> +(x, x)
   +(x, 0) -> x
   +(x, s(y)) -> s(+(x, y))
   +(s(x), y) -> s(+(x, y))

Termination of R to be shown.


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

   double(0) -> 0
   +(x, 0) -> x

where the Polynomial interpretation:
POL(s(x_1)) = x_1
POL(double(x_1)) = 2*x_1
POL(+(x_1, x_2)) = x_1 + x_2
POL(0) = 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: 

   double(x) -> +(x, x)

where the Polynomial interpretation:
POL(s(x_1)) = x_1
POL(double(x_1)) = 1 + 2*x_1
POL(+(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: 

   +(x, s(y)) -> s(+(x, y))

where the Polynomial interpretation:
POL(s(x_1)) = 1 + x_1
POL(double(x_1)) = 2*x_1
POL(+(x_1, x_2)) = x_1 + 2*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: 

   +(s(x), y) -> s(+(x, y))

where the Polynomial interpretation:
POL(s(x_1)) = 1 + x_1
POL(double(x_1)) = 2*x_1
POL(+(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: 


   DOUBLE(s(x)) -> DOUBLE(x)

Furthermore, R contains one SCC.


SCC1:

DOUBLE(s(x)) -> DOUBLE(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(DOUBLE(x_1)) = 1 + x_1

The following Dependency Pairs can be deleted:

   DOUBLE(s(x)) -> DOUBLE(x)



 This transformation is resulting in no new subcycles.




Termination of R successfully shown.


Duration: 0.500 seconds.