YES

Consider the TRS R consisting of the following rewrite rules:

	f(x,y) -> h(x,y)
	f(x,y) -> h(y,x)
	h(x,x) -> x

The TRS R is transformed (by dropping rewrite rules whose left-hand
sides contain a function symbol which does not occur in any right-hand
side) into a TRS R' which is empty. Hence R is terminating.

___________________________________________________________________
TTTbox (0.003 seconds) - April 13, 2007
Source file - /home/ami/mkorp/Testbench/tpdb-3.2/TRS/various/07.trs