YES
(ignored inputs)COMMENT Cops #647 - #721: generated ground TRSs; evenly distributed in the UNR/UNC/NFP/CR hierarchy submitted by: Bertram Felgenhauer
input TRS:
   [ a -> f(h(c,h(h(h(h(f(h(a,b)),a),h(h(h(f(f(a)),c),h(f(b),a)),a)),b),c))),
     h(f(f(b)),h(c,h(f(f(h(h(b,h(c,c)),h(f(a),c)))),f(a)))) -> h(b,b),
     f(c) -> c,
     f(f(h(f(h(c,h(a,f(a)))),f(c)))) -> b ]
TRS:
   [ a -> f(h(c,h(h(h(h(f(h(a,b)),a),h(h(h(f(f(a)),c),h(f(b),a)),a)),b),c))),
     h(f(f(b)),h(c,h(f(f(h(h(b,h(c,c)),h(f(a),c)))),f(a)))) -> h(b,b),
     f(c) -> c,
     f(f(h(f(h(c,h(a,f(a)))),f(c)))) -> b ]
New rules by rule reversing:
   [ a -> a,
     f(h(c,h(h(h(h(f(h(a,b)),a),h(h(h(f(f(a)),c),h(f(b),a)),a)),b),c))) -> a,
     h(f(f(b)),h(c,h(f(f(h(h(b,h(c,c)),h(f(a),c)))),f(a)))) -> h(b,b),
     f(c) -> c,
     f(f(h(f(h(c,h(a,f(a)))),f(c)))) -> b ]
confluent TRS:
   [ a -> a,
     f(h(c,h(h(h(h(f(h(a,b)),a),h(h(h(f(f(a)),c),h(f(b),a)),a)),b),c))) -> a,
     h(f(f(b)),h(c,h(f(f(h(h(b,h(c,c)),h(f(a),c)))),f(a)))) -> h(b,b),
     f(c) -> c,
     f(f(h(f(h(c,h(a,f(a)))),f(c)))) -> b,
     f(f(h(f(h(c,h(a,f(a)))),c))) -> b ]
UNC Completion (Development Closed)
problems/654.trs: Success(UNC)
(2592 msec.)