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