NO
af/ONE-SORTED/687.trs
Input rules:
   [ b -> f(b),
     h(a,c) -> b,
     f(a) -> c,
     c -> a,
     c -> b ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ b -> f(b),
     h(a,c) -> b,
     f(a) -> c,
     c -> a,
     c -> b ]
Constructor pattern: [f(?x_1),h(?x_1,?x_2),a]
Defined pattern: [c,b]
Constructor subsystem:
   [ ]
Modified Constructor subsystem:
   [ ]
candidate for c:
   [ c -> a ]
   [ c -> b ]
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),h(?x_1,?x_2),a,b]
Defined pattern: [c]
Constructor subsystem:
   [ b -> f(b) ]
Modified Constructor subsystem:
   [ b -> f(b) ]
candidate for c:
   [ c -> a ]
   [ c -> b ]
Find a quasi-ordering ...
encodeSameNthStatus h/0, h/1
encodeSameNthStatus(sub) logArF:1, logArG:1
failed to find an ordering.
Try to supplement auxiliary rules.
{b}{}{}{}{}Supplemented Rules:
   [ ]
failed to supplement auxiliary rules
Retry with a different D/C-partition.
Constructor pattern: [f(?x_1),h(?x_1,?x_2),a,b,c]
Defined pattern: []
Constructor subsystem:
   [ b -> f(b),
     h(a,c) -> b,
     f(a) -> c,
     c -> a,
     c -> b ]
Modified Constructor subsystem:
   [ b -> f(b),
     h(a,c) -> b,
     f(a) -> c,
     c -> a,
     c -> b ]
Find a quasi-ordering ...
order successfully found
Precedence:
 f : Mul;
 b : Mul;
 c : Mul;
 h : Mul;
 a : Mul;
Rules:
   [ f(a) -> c,
     c -> a ]
Check confluence of constructor subsystem...
Check Termination...
Terminating, WCR: CR
Conjectures:
   [ b = f(b),
     h(a,c) = b,
     c = b ]
STEP 0
ES:
   [ b = f(b),
     h(a,c) = b,
     c = b ]
HS:
   [ ]
ES0:
   [ b = f(b),
     h(a,a) = b,
     a = b ]
HS0:
   [ ]
ES1:
   [ b = f(b),
     h(a,a) = b,
     a = b ]
HS1:
   [ ]
No equation to expand
check Non-Ground-Confluence...
ground constructor terms for instantiation: {a,f(a),h(a,a)}
ground terms for instantiation: {a:o,f(a):o,h(a,a):o}
obtain 11 rules by 3 steps unfolding
obtain 60 candidates for checking non-joinability
check by TCAP-Approximation (failure)
check by Ordering(rpo), check by Tree-Automata Approximation (success)
Witness for Non-Confluence: <a <- f(c) -> b>
: Success(not GCR)
(14 msec.)
0.03