YES
(ignored inputs)COMMENT doi:10.1007/s00200-004-0148-6 [40] Example 3
Input:
   [ -(+(x,-(x))) -> 0,
     +(x,-(x)) -> 0,
     0 -> -(0) ]

Make it flat:
   [ -(!cl_1) -> 0,
     !cl_1 -> 0,
     !cl_1 -> !cl_1,
     +(x,!cl_0) -> !cl_1,
     0 -> -(0),
     -(x) -> !cl_0 ]
Time: 0.000 [s]

Make it Complete (R^):
   [ -(!cl_1) = 0,
     !cl_1 = -(0),
     -(!cl_1) = !cl_1,
     -(!cl_1) = -(0),
     -(!cl_1) = +(x,!cl_0),
     +(x,!cl_0) = -(0),
     0 = +(x,!cl_0),
     !cl_1 = 0,
     +(x,!cl_0) = !cl_1,
     0 = -(0),
     -(x) = !cl_0 ]
Time: 0.001 [s]

CPNF:
   [ x … x,
     !cl_0 … !cl_0 ]
Time: 0.000 [s]

Now checking all the pairs in CW...

Time to check pairs: 0.000 [s]

The TRS has Uniqueness of Normal Forms.
Total Time: 0.002 [s]

problems/224.trs: Success(UNC)
real 0.02
user 0.00
sys 0.02