file: tree_K4_N6.jsonl  N=6 K=4
order-feasible patterns per K-subset: 6
nodes=45 branching=35 solution_nodes=10 continued=44 refuted=166
nodes per depth: {0: 1, 1: 6, 2: 12, 3: 14, 4: 11, 5: 1}
certificates: max entry denominator=9, max lcm of denominators=9, nonzero entries 1..5
explicit multipliers computed and identity re-checked for 166 certificates
VERDICT: NOT CLOSED (exact solution points verified)
