file: tree_K4_N8.jsonl  N=8 K=4
order-feasible patterns per K-subset: 6
nodes=79 branching=79 solution_nodes=0 continued=78 refuted=396
nodes per depth: {0: 1, 1: 6, 2: 17, 3: 23, 4: 26, 5: 6}
certificates: max entry denominator=16, max lcm of denominators=16, nonzero entries 1..7
explicit multipliers computed and identity re-checked for 396 certificates
VERDICT: CLOSED
