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