YES
(ignored inputs)COMMENT doi:10.1145/2528934 [109] Example 3.5
Input:
   [ a -> b,
     a -> f(a),
     f(?x) -> ?x ]

Make it flat:
   [ a -> b,
     a -> f(a),
     f(?x) -> ?x ]
Time: 0.000 [s]

Make it Complete (R^):
   [ f(b) = a,
     f(b) = b,
     f(a) = f(b),
     b = f(a),
     a = b,
     a = f(a),
     f(?x) = ?x ]
Time: 0.001 [s]

CPNF:
   [ a … b ]
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.001 [s]

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