n=23 classes=641 expansive_for_all_C=True fails=[] max|T(C)|=101 rowsum_ok=True idrow_ok=True times: MN 4.0s tables 0.4s structconst 99.1s total 106.0s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
   Theorem C: Lemma 7.0 (halves/C+- do not matter): True; n-cycle rule l(K)+l(L)<=n+1 (K,L != 1): True; proof permutation valid on exact supports: True
n=24 classes=804 expansive_for_all_C=True fails=[] max|T(C)|=121 rowsum_ok=True idrow_ok=True times: MN 6.6s tables 0.7s structconst 191.6s total 203.7s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
