Term Rewriting System R:

   [x, y]
   f(x, x) -> a
   f(g(x), y) -> f(x, y)

Termination of R to be shown.


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

   f(x, x) -> a
   f(g(x), y) -> f(x, y)

where the Polynomial interpretation:
POL(g(x_1)) = 2 + x_1
POL(a) = 0
POL(f(x_1, x_2)) = 1 + x_1 + x_2
was used. 



All Rules of R can be deleted.



Termination of R successfully shown.


Duration: 0.352 seconds.