resolvents.add(i);
}
}
final int axioms = length - resolvents.size();
if (resolvents.min()<axioms) {
final int[] position = new int[length];
for(int i = 0, axiomIndex = 0, resolventIndex = axioms; i < length; i++) {
if (resolvents.contains(i)) {
position[i] = resolventIndex++;
int[] resolvent = trace[i];