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