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

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

Make it Complete (R^):
   [ b = f(!cl_0),
     f(!cl_0) = c,
     c = b,
     f(a) = !cl_0 ]
Time: 0.000 [s]

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

Now checking all the pairs...

Time to check pairs: 0.001 [s]

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

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