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