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