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