NO
af/ONE-SORTED/719.trs
Input rules:
   [ b -> f(b),
     c -> b,
     f(f(f(c))) -> a,
     f(h(b,b)) -> h(h(c,a),b) ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ b -> f(b),
     c -> b,
     f(f(f(c))) -> a,
     f(h(b,b)) -> h(h(c,a),b) ]
Constructor pattern: [f(?x_1),a,h(?x_1,?x_2)]
Defined pattern: [c,b]
Constructor subsystem:
   [ ]
Modified Constructor subsystem:
   [ ]
candidate for c:
   [ 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),a,h(?x_1,?x_2),b]
Defined pattern: [c]
Constructor subsystem:
   [ b -> f(b) ]
Modified Constructor subsystem:
   [ b -> f(b) ]
candidate for c:
   [ 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),a,h(?x_1,?x_2),b,c]
Defined pattern: []
Constructor subsystem:
   [ b -> f(b),
     c -> b,
     f(f(f(c))) -> a,
     f(h(b,b)) -> h(h(c,a),b) ]
Modified Constructor subsystem:
   [ b -> f(b),
     c -> b,
     f(f(f(c))) -> a,
     f(h(b,b)) -> h(h(c,a),b) ]
Find a quasi-ordering ...
order successfully found
Precedence:
 c : Mul,  b : Mul;
 f : Mul;
 h : Mul;
 a : Mul;
Rules:
   [ f(f(f(c))) -> a,
     f(h(b,b)) -> h(h(c,a),b),
     c -> b ]
Check confluence of constructor subsystem...
Check Termination...
unknown Terminating, Linear, unknown Oostrom, unknown strongly closed: Can't judge
...failed
failed to find an ordering.
Try to supplement auxiliary rules.
{b}{}{}{}Supplemented Rules:
   [ ]
failed to supplement auxiliary rules
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 100 candidates for checking non-joinability
check by TCAP-Approximation (failure)
check by Ordering(rpo), check by Tree-Automata Approximation (success)
Witness for Non-Confluence: <f(f(f(b))) <- f(f(f(c))) -> a>
: Success(not GCR)
(103 msec.)
0.14