NO
af/ONE-SORTED/694.trs
Input rules:
   [ c -> b,
     h(b,a) -> b,
     a -> f(a),
     h(a,h(c,c)) -> f(h(b,f(c))),
     f(h(b,f(c))) -> f(a) ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ c -> b,
     h(b,a) -> b,
     a -> f(a),
     h(a,h(c,c)) -> f(h(b,f(c))),
     f(h(b,f(c))) -> f(a) ]
Constructor pattern: [b,h(?x_1,?x_2),f(?x_1)]
Defined pattern: [a,c]
Constructor subsystem:
   [ ]
Modified Constructor subsystem:
   [ ]
No orientable rules for a. Add rules, and retry...
failed to construct defining rules
Retry with a different D/C-partition.
Constructor pattern: [b,h(?x_1,?x_2),f(?x_1),a]
Defined pattern: [c]
Constructor subsystem:
   [ h(b,a) -> b,
     a -> f(a) ]
Modified Constructor subsystem:
   [ h(b,a) -> b,
     a -> f(a) ]
candidate for c:
   [ c -> b ]
Find a quasi-ordering ...
order successfully found
Precedence:
 c : Mul;
 a : Mul;
 b : Mul;
 h : Mul;
 f : Mul;
Rules:
   [ c -> b,
     h(b,a) -> b ]
Check confluence of constructor subsystem...
Check Termination...
Terminating, WCR: CR
Conjectures:
   [ h(a,h(c,c)) = f(h(b,f(c))),
     f(h(b,f(c))) = f(a),
     a = f(a) ]
STEP 0
ES:
   [ h(a,h(c,c)) = f(h(b,f(c))),
     f(h(b,f(c))) = f(a),
     a = f(a) ]
HS:
   [ ]
ES0:
   [ h(a,h(b,b)) = f(h(b,f(b))),
     f(h(b,f(b))) = f(a),
     a = f(a) ]
HS0:
   [ ]
ES1:
   [ h(a,h(b,b)) = f(h(b,f(b))),
     f(h(b,f(b))) = f(a),
     a = f(a) ]
HS1:
   [ ]
No equation to expand
check Non-Ground-Confluence...
ground constructor terms for instantiation: {b,h(b,b),f(b)}
ground terms for instantiation: {b:o,h(b,b):o,f(b):o}
obtain 12 rules by 3 steps unfolding
obtain 100 candidates for checking non-joinability
check by TCAP-Approximation (success)
Witness for Non-Confluence: <f(h(b,f(b))) <- h(a,h(c,c)) -> h(a,h(b,b))>
: Success(not GCR)
(9 msec.)
0.02