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