mode=Fp4:3 target=B k=4 field=F_3 pool=36 fixed basis=4 subset size=8 number of sets=58905
pool: [(0, 0, 1, 1), (0, 0, 1, 2), (0, 1, 0, 1), (0, 1, 0, 2), (0, 1, 1, 0), (0, 1, 1, 1), (0, 1, 1, 2), (0, 1, 2, 0), (0, 1, 2, 1), (0, 1, 2, 2), (1, 0, 0, 1), (1, 0, 0, 2), (1, 0, 1, 0), (1, 0, 1, 1), (1, 0, 1, 2), (1, 0, 2, 0), (1, 0, 2, 1), (1, 0, 2, 2), (1, 1, 0, 0), (1, 1, 0, 1), (1, 1, 0, 2), (1, 1, 1, 0), (1, 1, 1, 1), (1, 1, 1, 2), (1, 1, 2, 0), (1, 1, 2, 1), (1, 1, 2, 2), (1, 2, 0, 0), (1, 2, 0, 1), (1, 2, 0, 2), (1, 2, 1, 0), (1, 2, 1, 1), (1, 2, 1, 2), (1, 2, 2, 0), (1, 2, 2, 1), (1, 2, 2, 2)]
sample_class=1 (1 = exact freeness test for every set), time cap 1500s
  ... progress: 50/295 chunks, sets 10000, class 684, free 684, violations 0, 4s
  ... progress: 100/295 chunks, sets 20000, class 1223, free 1223, violations 0, 7s
  ... progress: 150/295 chunks, sets 30000, class 1598, free 1598, violations 0, 10s
  ... progress: 200/295 chunks, sets 40000, class 1752, free 1752, violations 0, 13s
  ... progress: 250/295 chunks, sets 50000, class 2057, free 2057, violations 0, 16s
  class (numerics, irreducible, formal): 2172
  class and supersolvable: 2172
  essential: 58905
  free and supersolvable: 2172
  free with target exponents: 2172
  free: (u,v)=(2, 1): 1212
  free: (u,v)=(5, 0): 960
  numerics ok: 2412
  numerics ok, irreducible: 2172
  numerics ok, reducible: 240
  subsets: 58905
VIOLATIONS: 0
time 18.8s
