K4: interval superset [0.105572809000, 0.133974596216], g = [1, -8, 4] irreducible: True
K4 n=3: 256 functions, 39 distinct H_f, failures 0
   H_f == 0 for: []
   H_f(q_end) == 0 (not identically) for: ["[('-OR', (0, 1, 2))]", "[('OR', (0, 1, 2))]"]
   equality lists as claimed in the paper: True
K4 n=4: 65536 functions, 1630 distinct H_f, failures 0
   H_f == 0 for: ["[('-OR', (0, 1, 2, 3))]", "[('OR', (0, 1, 2, 3))]"]
   H_f(q_end) == 0 (not identically) for: ["[('-OR', (0, 1, 2))]", "[('-OR', (0, 1, 3))]", "[('-OR', (0, 2, 3))]", "[('-OR', (1, 2, 3))]", "[('OR', (0, 1, 2))]", "[('OR', (0, 1, 3))]", "[('OR', (0, 2, 3))]", "[('OR', (1, 2, 3))]"]
   equality lists as claimed in the paper: True
K5: interval superset [0.087129070825, 0.105572809000], g = [1, -10, 5] irreducible: True
K5 n=3: 256 functions, 39 distinct H_f, failures 0
   H_f == 0 for: []
   H_f(q_end) == 0 (not identically) for: []
   equality lists as claimed in the paper: True
K5 n=4: 65536 functions, 1630 distinct H_f, failures 0
   H_f == 0 for: []
   H_f(q_end) == 0 (not identically) for: ["[('-OR', (0, 1, 2, 3))]", "[('OR', (0, 1, 2, 3))]"]
   equality lists as claimed in the paper: True
negative controls (H_OR3 fails above q4; H_OR4 fails above q5 for K5; constant 15 fails for 18 H_f): True [True, True, True]
BITS SUMMARY: K4 claims C1,C2: True ; K5 claims C1,C2: True ; negative controls: True
