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