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

Make it flat:
   [ h(b,!cl_5) -> h(a,!cr_0),
     !cl_5 -> !cl_5,
     h(a,!cl_4) -> !cl_5,
     !cl_3 -> !cl_3,
     h(a,!cl_2) -> !cl_3,
     b -> h(b,a),
     h(!cl_0,c) -> f(c),
     !cl_1 -> !cl_1,
     f(!cl_0) -> !cl_1,
     f(b) -> !cl_0,
     !cl_0 -> !cl_0,
     c -> c,
     b -> f(c),
     !cr_0 -> f(a),
     f(!cl_1) -> !cl_2,
     !cl_2 -> !cl_2,
     f(!cl_3) -> !cl_4,
     !cl_4 -> !cl_4 ]
Time: 0.001 [s]

Make it Complete (R^):
   [ h(b,!cl_5) = h(a,!cr_0),
     h(a,!cl_4) = !cl_5,
     h(a,!cl_2) = !cl_3,
     h(b,a) = f(c),
     h(b,a) = h(!cl_0,c),
     b = h(b,a),
     h(!cl_0,c) = b,
     h(!cl_0,c) = f(c),
     f(!cl_0) = !cl_1,
     f(b) = !cl_0,
     b = f(c),
     !cr_0 = f(a),
     f(!cl_1) = !cl_2,
     f(!cl_3) = !cl_4 ]
Time: 0.001 [s]

CPNF:
   [ !cr_0 … f(a),
     a … a ]
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.003 [s]

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