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

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

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

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

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

proof:
     f(f(c))
->R^ f(f(b))
->R^ f(!cr_0)
->R^ b

     c
->R^ b
Total Time: 0.003 [s]

problems/720.trs: Success(not UNC)
real 0.05
user 0.00
sys 0.02