tree_K4_N7.jsonl: N=7 K=4 required patterns per node=6; nodes reached=30 of 30; certificates with explicit multipliers=151; branch children=29 (exact lists); max depth=4
MY VERDICT: tree is a complete refutation (no N positive reals with all K-subsets non-dissociated)
tree_K4_N7_v2nogoods.jsonl: N=7 K=4 required patterns per node=6; nodes reached=56 of 56; certificates with explicit multipliers=281; branch children=55 (exact lists); max depth=6
MY VERDICT: tree is a complete refutation (no N positive reals with all K-subsets non-dissociated)
tree_K4_N8.jsonl: N=8 K=4 required patterns per node=6; nodes reached=79 of 79; certificates with explicit multipliers=396; branch children=78 (exact lists); max depth=5
MY VERDICT: tree is a complete refutation (no N positive reals with all K-subsets non-dissociated)
tree_K4_N8_v2nogoods.jsonl: N=8 K=4 required patterns per node=6; nodes reached=65 of 65; certificates with explicit multipliers=326; branch children=64 (exact lists); max depth=5
MY VERDICT: tree is a complete refutation (no N positive reals with all K-subsets non-dissociated)

MUTATIONS (my checker / attack checker):
m1_dropcase.jsonl: mine: PROBLEMS: 1 | attack: VERDICT: INVALID TREE (1 problems)
m2_perturb_y.jsonl: mine: PROBLEMS: 1 | attack: VERDICT: INVALID TREE (1 problems)
m3_flip_rel.jsonl: mine: PROBLEMS: 1 | attack: VERDICT: INVALID TREE (1 problems)
m4_dup_case.jsonl: mine: PROBLEMS: 2 | attack: VERDICT: INVALID TREE (2 problems)
m5_fake_infeasible.jsonl: mine: PROBLEMS: 1 | attack: VERDICT: INVALID TREE (1 problems)
