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

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

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

CPNF:
   [ b … 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/700.trs: Success(UNC)
real 0.02
user 0.01
sys 0.01