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

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

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

CPNF:
   [ a … h(f(f(c)),c),
     !cr_0 … f(f(c)),
     a … f(c),
     c … c ]
Time: 0.000 [s]

The TRS doesn't have Uniqueness of Normal Forms.
Counter Example: 
     h(f(f(c)),c)
<->* f(c)

proof:
     h(f(f(c)),c)
->R^ h(f(a),c)
->R^ h(!cr_0,c)
->R^ a

     f(c)
->R^ a
Total Time: 0.001 [s]

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