YES
(ignored inputs)COMMENT full experiments for [35] submitted by: Takahito Aoto and Yoshihito Toyama
Input:
   [ f(0,0) -> f(0,1),
     f(1,0) -> f(0,0),
     f(?x,?y) -> f(?y,?x) ]

Make it flat:
   [ f(0,0) -> f(0,1),
     f(1,0) -> f(0,0),
     f(?x,?y) -> f(?y,?x) ]
Time: 0.000 [s]

Make it Complete (R^):
   [ f(0,1) = f(1,0),
     f(0,0) = f(0,1),
     f(1,0) = f(0,0),
     f(?x,?y) = f(?y,?x) ]
Time: 0.000 [s]

The number of normal forms that must be checked: 6
Time: 0.001 [s]

Now checking all the pairs...

Time to check pairs: 0.000 [s]

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

problems/150.trs: Success(UNC)
real 0.01
user 0.01
sys 0.00