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 -> c, h(h(b,b),f(f(h(h(c,c),c)))) -> c, f(b) -> b, f(h(a,c)) -> a ] Make it flat: [ h(!cl_1,!cl_5) -> c, f(!cl_4) -> !cl_5, h(!cl_2,c) -> !cl_3, f(b) -> b, f(!cl_0) -> a, !cl_1 -> !cl_1, h(b,b) -> !cl_1, h(a,c) -> !cl_0, b -> c, h(c,c) -> !cl_2, f(!cl_3) -> !cl_4 ] Time: 0.000 [s] Make it Complete (R^): [ b = h(!cl_1,!cl_5), h(!cl_2,!cl_5) = c, h(!cl_1,!cl_5) = f(c), f(c) = h(!cl_2,!cl_5), h(!cl_2,!cl_5) = b, h(!cl_2,!cl_5) = h(!cl_1,!cl_5), h(!cl_2,!cl_5) = f(b), h(!cl_1,!cl_5) = f(b), h(!cl_1,!cl_5) = c, f(!cl_4) = !cl_5, h(!cl_2,b) = !cl_3, h(!cl_1,b) = !cl_3, h(!cl_2,b) = h(!cl_1,c), h(!cl_2,b) = h(!cl_1,b), h(!cl_1,c) = h(!cl_1,b), h(!cl_2,b) = h(!cl_2,c), h(!cl_1,b) = h(!cl_2,c), h(!cl_1,c) = h(!cl_2,c), h(!cl_1,c) = !cl_3, h(!cl_2,c) = !cl_3, c = f(b), c = f(c), f(c) = f(b), f(c) = b, f(b) = b, f(!cl_0) = a, h(b,c) = !cl_1, h(c,b) = !cl_1, !cl_1 = h(c,c), !cl_1 = !cl_2, h(b,b) = !cl_1, h(a,b) = h(a,c), h(a,b) = !cl_0, h(a,c) = !cl_0, h(c,b) = !cl_2, h(b,b) = !cl_2, h(c,b) = h(b,c), h(c,b) = h(b,b), h(b,c) = h(b,b), h(c,b) = h(c,c), h(b,b) = h(c,c), h(b,c) = h(c,c), h(b,c) = !cl_2, b = c, h(c,c) = !cl_2, f(!cl_3) = !cl_4 ] Time: 0.013 [s] CPNF: [ b … h(!cl_2,!cl_5), !cl_5 … !cl_5, a … a, !cl_0 … !cl_0, b … c, !cl_1 … !cl_2, !cl_3 … !cl_3, !cl_4 … !cl_4 ] Time: 0.000 [s] The TRS doesn't have Uniqueness of Normal Forms. Counter Example: h(!cl_2,!cl_5) <->* c proof: h(!cl_2,!cl_5) ->R^ h(!cl_1,!cl_5) ->R^ c ->R^ b c ->R^ b Total Time: 0.015 [s] problems/675.trs: Success(not UNC) real 0.03 user 0.02 sys 0.01