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 -> c,
     f(f(c)) -> h(a,h(h(c,c),b)),
     f(f(a)) -> b,
     b -> f(f(b)) ]

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

Make it Complete (R^):
   [ h(c,!cr_1) = f(!cl_1),
     f(!cl_0) = h(a,!cr_1),
     h(a,!cr_1) = f(!cr_2),
     h(c,!cr_1) = f(!cr_2),
     h(c,!cr_1) = f(!cl_0),
     h(c,!cr_1) = h(a,!cr_1),
     h(c,!cr_1) = b,
     h(a,!cr_1) = b,
     f(!cl_1) = h(a,!cr_1),
     f(!cl_1) = b,
     f(!cl_1) = f(!cl_0),
     f(!cl_1) = f(!cr_2),
     f(!cl_0) = f(!cr_2),
     f(!cl_0) = b,
     f(a) = !cl_1,
     !cl_1 = !cl_0,
     f(c) = !cl_1,
     !cr_2 = f(b),
     b = f(!cr_2),
     f(c) = f(a),
     f(c) = !cl_0,
     f(a) = !cl_0,
     h(c,a) = !cr_0,
     h(a,a) = !cr_0,
     h(c,a) = h(a,c),
     h(c,a) = h(a,a),
     h(a,c) = h(a,a),
     h(c,a) = h(c,c),
     h(a,a) = h(c,c),
     h(a,c) = h(c,c),
     h(a,c) = !cr_0,
     a = c,
     !cr_0 = h(c,c),
     !cr_1 = h(!cr_0,b) ]
Time: 0.007 [s]

CPNF:
   [ !cr_0 … h(c,c),
     !cl_0 … !cl_1,
     a … c ]
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.008 [s]

problems/717.trs: Success(UNC)
real 0.02
user 0.01
sys 0.01