n=13 classes=55 expansive_for_all_C=True fails=[] max|T(C)|=11 rowsum_ok=True idrow_ok=True times: MN 0.0s tables 0.0s structconst 0.1s total 0.1s
   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=14 classes=72 expansive_for_all_C=True fails=[] max|T(C)|=15 rowsum_ok=True idrow_ok=True times: MN 0.0s tables 0.0s structconst 0.2s total 0.2s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
n=15 classes=94 expansive_for_all_C=True fails=[] max|T(C)|=19 rowsum_ok=True idrow_ok=True times: MN 0.1s tables 0.0s structconst 0.4s total 0.5s
   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=16 classes=123 expansive_for_all_C=True fails=[] max|T(C)|=22 rowsum_ok=True idrow_ok=True times: MN 0.1s tables 0.0s structconst 0.7s total 0.9s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
n=17 classes=156 expansive_for_all_C=True fails=[] max|T(C)|=24 rowsum_ok=True idrow_ok=True times: MN 0.2s tables 0.0s structconst 1.4s total 1.7s
   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=18 classes=200 expansive_for_all_C=True fails=[] max|T(C)|=34 rowsum_ok=True idrow_ok=True times: MN 0.3s tables 0.0s structconst 2.9s total 3.3s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
n=19 classes=254 expansive_for_all_C=True fails=[] max|T(C)|=48 rowsum_ok=True idrow_ok=True times: MN 0.5s tables 0.1s structconst 6.0s total 6.8s
   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=20 classes=324 expansive_for_all_C=True fails=[] max|T(C)|=56 rowsum_ok=True idrow_ok=True times: MN 0.9s tables 0.1s structconst 12.8s total 14.1s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
n=21 classes=408 expansive_for_all_C=True fails=[] max|T(C)|=58 rowsum_ok=True idrow_ok=True times: MN 1.5s tables 0.2s structconst 25.2s total 27.5s
   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=22 classes=513 expansive_for_all_C=True fails=[] max|T(C)|=77 rowsum_ok=True idrow_ok=True times: MN 2.5s tables 0.3s structconst 50.8s total 54.9s
   Theorem B tight sets: 3:T=E 2.2:T=E 5:T=E 3.3:T=E 4.2:T=E
