YES

Consider the TRS R consisting of the following rewrite rule:

	-(-(neg(x),neg(x)),-(neg(y),neg(y))) -> -(-(x,y),-(x,y))

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.004 seconds) - April 13, 2007
Source file - /home/ami/mkorp/Testbench/tpdb-3.2/TRS/SK90/4.19.trs