Term Rewriting System R:

   [y, x, z]
   ++(nil, y) -> y
   ++(x, nil) -> x
   ++(.(x, y), z) -> .(x, ++(y, z))
   ++(++(x, y), z) -> ++(x, ++(y, z))

Termination of R to be shown.


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

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

where the Polynomial interpretation:
POL(nil) = 1
POL(++(x_1, x_2)) = x_1 + x_2
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, y), z) -> .(x, ++(y, z))

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

where the Polynomial interpretation:
POL(++(x_1, x_2)) = 1 + 2*x_1 + x_2
was used. 



All Rules of R can be deleted.



Termination of R successfully shown.


Duration: 0.389 seconds.