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 -> h(a,f(b)),
     f(f(h(a,a))) -> f(f(f(a))),
     f(h(a,h(a,a))) -> f(a),
     f(h(h(b,a),h(f(c),c))) -> c ]
TRS:
   [ a -> h(a,f(b)),
     f(f(h(a,a))) -> f(f(f(a))),
     f(h(a,h(a,a))) -> f(a),
     f(h(h(b,a),h(f(c),c))) -> c ]
New rules by rule reversing:
   [ a -> a,
     h(a,f(b)) -> a,
     f(f(h(a,a))) -> f(f(f(a))),
     f(h(a,h(a,a))) -> f(a),
     f(h(h(b,a),h(f(c),c))) -> c ]
confluent TRS:
   [ a -> a,
     h(a,f(b)) -> a,
     f(f(h(a,a))) -> f(f(f(a))),
     f(h(a,h(a,a))) -> f(a),
     f(h(h(b,a),h(f(c),c))) -> c ]
UNC Completion (Development Closed)
problems/716.trs: Success(UNC)
(0 msec.)