n=2: 10 classes; exact OR_k-tie classes: 4
step 1 (float tree): 256 boxes, 1536 (box,class) leaves, 0.0s
step 2 (exact integers): 1536 leaves checked, failures: 0, 0.0s
coverage check: classes whose certified boxes do not tile [0,1/2]: 0
CERTIFIED (exact): for every LTF f on n=2 variables not identical to OR_k/negation, P_f(q) < max_k k(1-q)^(2k-2) on [0,1/2].
n=3: 34 classes; exact OR_k-tie classes: 6
step 1 (float tree): 256 boxes, 7168 (box,class) leaves, 0.0s
step 2 (exact integers): 7168 leaves checked, failures: 0, 0.0s
coverage check: classes whose certified boxes do not tile [0,1/2]: 0
CERTIFIED (exact): for every LTF f on n=3 variables not identical to OR_k/negation, P_f(q) < max_k k(1-q)^(2k-2) on [0,1/2].
n=4: 178 classes; exact OR_k-tie classes: 8
step 1 (float tree): 256 boxes, 43520 (box,class) leaves, 0.0s
step 2 (exact integers): 43520 leaves checked, failures: 0, 0.1s
coverage check: classes whose certified boxes do not tile [0,1/2]: 0
CERTIFIED (exact): for every LTF f on n=4 variables not identical to OR_k/negation, P_f(q) < max_k k(1-q)^(2k-2) on [0,1/2].
n=5: 1720 classes; exact OR_k-tie classes: 10
step 1 (float tree): 550 boxes, 438164 (box,class) leaves, 0.1s
step 2 (exact integers): 438164 leaves checked, failures: 0, 1.3s
coverage check: classes whose certified boxes do not tile [0,1/2]: 0
CERTIFIED (exact): for every LTF f on n=5 variables not identical to OR_k/negation, P_f(q) < max_k k(1-q)^(2k-2) on [0,1/2].
n=6: 38456 classes; exact OR_k-tie classes: 12
step 1 (float tree): 3349 boxes, 9850676 (box,class) leaves, 3.0s
step 2 (exact integers): 9850676 leaves checked, failures: 0, 45.2s
coverage check: classes whose certified boxes do not tile [0,1/2]: 0
CERTIFIED (exact): for every LTF f on n=6 variables not identical to OR_k/negation, P_f(q) < max_k k(1-q)^(2k-2) on [0,1/2].
