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