GPT-5.6 Sol Pro has successfully produced a mathematical proof that resolves a long-standing complexity gap in deterministic zeroth-order convex optimization. By utilizing a specialized prompt, the model determined that the quadratic dimension dependence is optimal, finally settling a problem that has remained open since 1996.