YES
af/ONE-SORTED/671.trs
Input rules:
   [ f(f(f(b))) -> b,
     h(h(a,a),h(f(f(a)),h(c,b))) -> f(c) ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ f(f(f(b))) -> b,
     h(h(a,a),h(f(f(a)),h(c,b))) -> f(c) ]
Constructor pattern: [f(?x_1),b,h(?x_1,?x_2),a,c]
Defined pattern: []
Constructor subsystem:
   [ f(f(f(b))) -> b,
     h(h(a,a),h(f(f(a)),h(c,b))) -> f(c) ]
Modified Constructor subsystem:
   [ f(f(f(b))) -> b,
     h(h(a,a),h(f(f(a)),h(c,b))) -> f(c) ]
Find a quasi-ordering ...
order successfully found
Precedence:
 c : Mul,  b : Mul;
 h : Mul;
 a : Mul;
 f : Mul;
Rules:
   [ f(f(f(b))) -> b,
     h(h(a,a),h(f(f(a)),h(c,b))) -> f(c) ]
Check confluence of constructor subsystem...
Check Termination...
Terminating, WCR: CR
Conjectures:
   [ ]
STEP 0
ES:
   [ ]
HS:
   [ ]
ES0:
   [ ]
HS0:
   [ ]
ES1:
   [ ]
HS1:
   [ ]
: Success(GCR)
(4 msec.)
0.02