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