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

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

Make it Complete (R^):
   [ f(a) = f(b),
     f(a) = c,
     f(b) = c,
     a = f(c),
     f(c) = b,
     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/662.trs: Success(UNC)
real 0.02
user 0.01
sys 0.01