NO
af/ONE-SORTED/678.trs
Input rules:
   [ b -> a,
     b -> c,
     b -> h(h(c,a),f(f(b))),
     a -> f(a),
     b -> h(a,a) ]
Sorts having no ground terms: 
Rules applicable to ground terms:
   [ b -> a,
     b -> c,
     b -> h(h(c,a),f(f(b))),
     a -> f(a),
     b -> h(a,a) ]
Constructor pattern: [c,h(?x_1,?x_2),f(?x_1)]
Defined pattern: [a,b]
Constructor subsystem:
   [ ]
Modified Constructor subsystem:
   [ ]
No orientable rules for a. Add rules, and retry...
failed to construct defining rules
Retry with a different D/C-partition.
Constructor pattern: [c,h(?x_1,?x_2),f(?x_1),a]
Defined pattern: [b]
Constructor subsystem:
   [ a -> f(a) ]
Modified Constructor subsystem:
   [ a -> f(a) ]
candidate for b:
   [ b -> a ]
   [ b -> c ]
   [ b -> h(a,a) ]
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}{a}{}Supplemented Rules:
   [ ]
failed to supplement auxiliary rules
Retry with a different D/C-partition.
Constructor pattern: [c,h(?x_1,?x_2),f(?x_1),a,b]
Defined pattern: []
Constructor subsystem:
   [ b -> a,
     b -> c,
     b -> h(h(c,a),f(f(b))),
     a -> f(a),
     b -> h(a,a) ]
Modified Constructor subsystem:
   [ b -> a,
     b -> c,
     b -> h(h(c,a),f(f(b))),
     a -> f(a),
     b -> h(a,a) ]
Find a quasi-ordering ...
order successfully found
Precedence:
 a : Mul;
 c : Mul,  b : Mul;
 h : Mul;
 f : Mul;
Rules:
   [ b -> c ]
Check confluence of constructor subsystem...
Check Termination...
unknown Terminating, Linear, Oostrom: CR
Conjectures:
   [ b = a,
     b = h(h(c,a),f(f(b))),
     a = f(a),
     b = h(a,a) ]
STEP 0
ES:
   [ b = a,
     b = h(h(c,a),f(f(b))),
     a = f(a),
     b = h(a,a) ]
HS:
   [ ]
ES0:
   [ b = a,
     b = h(h(c,a),f(f(b))),
     a = f(a),
     b = h(a,a) ]
HS0:
   [ ]
ES1:
   [ b = a,
     b = h(h(c,a),f(f(b))),
     a = f(a),
     b = h(a,a) ]
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 11 rules by 3 steps unfolding
obtain 100 candidates for checking non-joinability
check by TCAP-Approximation (success)
Witness for Non-Confluence: <f(a) <- b -> c>
: Success(not GCR)
(13 msec.)
0.03