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