NO
af/ONE-SORTED/653.trs
Input rules:
   [ c -> a,
     b -> f(h(a,a)),
     f(a) -> b,
     h(a,b) -> a ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ c -> a,
     b -> f(h(a,a)),
     f(a) -> b,
     h(a,b) -> a ]
Constructor pattern: [a,f(?x_1),h(?x_1,?x_2)]
Defined pattern: [b,c]
Constructor subsystem:
   [ ]
Modified Constructor subsystem:
   [ ]
candidate for b:
   [ b -> f(h(a,a)) ]
candidate for c:
   [ c -> a ]
Find a quasi-ordering ...
order successfully found
Precedence:
 c : Mul,  b : Mul;
 h : Mul;
 f : Mul;
 a : Mul;
Rules:
   [ b -> f(h(a,a)),
     c -> a ]
Conjectures:
   [ h(a,b) = a,
     f(a) = b ]
STEP 0
ES:
   [ h(a,b) = a,
     f(a) = b ]
HS:
   [ ]
ES0:
   [ h(a,f(h(a,a))) = a,
     f(a) = f(h(a,a)) ]
HS0:
   [ ]
ES1:
   [ h(a,f(h(a,a))) = a,
     f(a) = f(h(a,a)) ]
HS1:
   [ ]
No equation to expand
check Non-Ground-Confluence...
ground constructor terms for instantiation: {a,f(a),h(a,a)}
ground terms for instantiation: {a:o,f(a):o,h(a,a):o}
obtain 10 rules by 3 steps unfolding
obtain 13 candidates for checking non-joinability
check by TCAP-Approximation (success)
Witness for Non-Confluence: <h(a,f(h(a,a))) <- h(c,b) -> a>
: Success(not GCR)
(5 msec.)
0.02