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