YES
(ignored inputs)COMMENT Cops #647 - #721: generated ground TRSs; evenly distributed in the UNR/UNC/NFP/CR hierarchy submitted by: Bertram Felgenhauer
Input:
   [ b -> c,
     b -> f(c),
     c -> c ]

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

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

The number of normal forms that must be checked: 6
Time: 0.000 [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/684.trs: Success(UNC)
real 0.04
user 0.01
sys 0.01