YES
(ignored inputs)COMMENT submitted by: Takahito Aoto , Junichi Yoshida , and Yoshihito Toyama
Input:
   [ F(?x,?x) -> G(?x),
     A -> B ]

Make it flat:
   [ F(?x,?x) -> G(?x),
     A -> B ]
Time: 0.000 [s]

Make it Complete (R^):
   [ F(?x,?x) = G(?x),
     A = B ]
Time: 0.000 [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.000 [s]

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