mode=Fp5:2 target=A k=5 field=F_2 pool=26 fixed basis=5 subset size=9 number of sets=14950
pool: [(0, 0, 0, 1, 1), (0, 0, 1, 0, 1), (0, 0, 1, 1, 0), (0, 0, 1, 1, 1), (0, 1, 0, 0, 1), (0, 1, 0, 1, 0), (0, 1, 0, 1, 1), (0, 1, 1, 0, 0), (0, 1, 1, 0, 1), (0, 1, 1, 1, 0), (0, 1, 1, 1, 1), (1, 0, 0, 0, 1), (1, 0, 0, 1, 0), (1, 0, 0, 1, 1), (1, 0, 1, 0, 0), (1, 0, 1, 0, 1), (1, 0, 1, 1, 0), (1, 0, 1, 1, 1), (1, 1, 0, 0, 0), (1, 1, 0, 0, 1), (1, 1, 0, 1, 0), (1, 1, 0, 1, 1), (1, 1, 1, 0, 0), (1, 1, 1, 0, 1), (1, 1, 1, 1, 0), (1, 1, 1, 1, 1)]
sample_class=1 (1 = exact freeness test for every set), time cap 500s
  ... progress: 50/75 chunks, sets 10000, class 1135, free 1135, violations 0, 5s
  class (numerics, irreducible, formal): 1365
  class and supersolvable: 1365
  essential: 14950
  free and supersolvable: 1365
  free with target exponents: 1365
  free: (u,v)=(4, 0): 1365
  numerics ok: 2480
  numerics ok, irreducible: 1695
  numerics ok, irreducible, NOT formal: 330
  numerics ok, reducible: 785
  subsets: 14950
VIOLATIONS: 0
time 7.6s
