=== own_tree_K3_N4.jsonl 3 4 ===
file own_tree_K3_N4.jsonl: 1 lines; F-choices expected 1, seen 1, missing 0, unexpected/duplicate/failed 0
nodes: bad leaves 8, branching nodes 1, solution leaves 0 (verified 0)
VERDICT: CLOSED (valid complete case analysis; under (H) g+(2) <= 3, no 4 positive reals lack a dissociated 3-subset)
=== own_tree_K4_N6.jsonl 4 6 ===
  FAIL: F=((1, 0, 0), (0, 1, 0), (0, 0, 1), (0, 1, -1), (0, 1, 1), (1, 1, 1)): children do not cover exactly the candidate set for Q=((1, 0, 0), (0, 1, 0), (0, 1, -1), (0, 1, 1)) (got 10, need 31)
  FAIL: F=((1, 0, 0), (0, 1, 0), (0, 0, 1), (0, 1, -1), (1, -1, -1), (1, -1, 0)): children do not cover exactly the candidate set for Q=((1, 0, 0), (0, 1, 0), (0, 1, -1), (1, -1, -1)) (got 6, need 31)
  FAIL: F=((1, 0, 0), (0, 1, 0), (0, 0, 1), (0, 1, -1), (1, -1, -1), (1, -1, 1)): children do not cover exactly the candidate set for Q=((1, 0, 0), (0, 1, 0), (0, 1, -1), (1, -1, -1)) (got 8, need 31)
VERDICT: REJECTED (log is not a valid proof)
=== own_tree_K4_N7.jsonl 4 7 ===
file own_tree_K4_N7.jsonl: 210 lines; F-choices expected 210, seen 210, missing 0, unexpected/duplicate/failed 0
nodes: bad leaves 229692, branching nodes 7631, solution leaves 0 (verified 0)
VERDICT: CLOSED (valid complete case analysis; under (H) g+(3) <= 6, no 7 positive reals lack a dissociated 4-subset)
=== own_tree_K4_N8.jsonl 4 8 ===
file own_tree_K4_N8.jsonl: 252 lines; F-choices expected 252, seen 252, missing 0, unexpected/duplicate/failed 0
nodes: bad leaves 175032, branching nodes 5826, solution leaves 0 (verified 0)
VERDICT: CLOSED (valid complete case analysis; under (H) g+(3) <= 7, no 8 positive reals lack a dissociated 4-subset)
