Unsatisfiable constraints
Proving a set of constraints has no possible solution. As of 2026-10-18, the strongest model on this domain is OpenAI: GPT-5.5 (100% — 16 of 16 questions correct).
What this domain tests
Constraint-satisfaction problems that are deliberately UNSATISFIABLE — the model must prove no assignment can work, not guess a plausible one. Confident hallucination of a “solution” fails hard here.
Why it resists contamination
Instances are generated with a known satisfiability status, so each one is brand-new and self-verifying — there is nothing to leak. Because instances are generated with a programmatic ground truth, this is a “generator-as-oracle” domain — effectively unlimited fresh, self-verifying items. See the full methodology.
Best AI models for Unsatisfiable constraints
Primary sources & further reading
Frequently asked questions
What does the meo Unsatisfiable constraints benchmark test?
Constraint-satisfaction problems that are deliberately UNSATISFIABLE — the model must prove no assignment can work, not guess a plausible one. Confident hallucination of a “solution” fails hard here.
Why can't AI models game the Unsatisfiable constraints benchmark?
Instances are generated with a known satisfiability status, so each one is brand-new and self-verifying — there is nothing to leak.
Which AI model is best at Unsatisfiable constraints?
OpenAI: GPT-5.5 leads the Unsatisfiable constraints domain on the meo benchmark with 100% accuracy (as of 2026-10-18).
Related: all domains · Unsatisfiable constraints ranking · methodology · full leaderboard.