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