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