From Expert-Guided Proof Search to Automated Open-Problem Solving
Organizations: Computer Science Institute, Charles University · Institute of Formal and Applied Linguistics, Charles University · Department of Applied Mathematics, Charles University · Institute of Mathematics, Czech Academy of Sciences
Abstract
Large language models are increasingly contributing to mathematical research, where progress often depends on efficient proof search, incremental improvements and careful verification. We describe Bolzano, a multi-agent open-source system that uses parallel prover agents with a verifier agent and maintains a human-readable research state. Initial manual use on expert-selected problems yielded 8 results whose proofs were checked by domain experts. Motivated by these case studies, we ran Bolzano without problem-specific human guidance on about 3,800 open problems extracted from four sets of papers, solving about 200 open problems. One experiment used papers accepted to STOC 2026, a top conference in theoretical computer science. There, we answered four questions raised in the papers, as confirmed by their authors.
Figures & tables
| Collection | Problems | Model | Rounds | Promising 1 1 1 Outputs flagged by Bolzano as candidate resolutions and selected for human assessment of correctness and relevance to the source question. Outputs not flagged as promising were not systematically reviewed. | Solved 2 2 2 Except for STOC 2026, the solved counts are estimates. These estimates are partially informed by LLM-based assessments of whether the output addresses the source question and whether its argument is substantially correct. We received feedback from authors on many of the results, which suggests that these estimates are reasonable. For STOC 2026, we report only the four results that we checked carefully and that authors of the source papers verified. |
|---|---|---|---|---|---|
| arXiv: math.CO , cs.DS | 1,600 | GPT-5.5 | 4 | 250 | 90 |
| STOC 2026 | 420 | GPT-5.5 | 4 | 41 | 4 |
| Earlier FOCS/SODA/STOC | 900 | GPT-5.6 Sol | 2 | 57 | 40 |
| Midsummer Combinatorial Workshop | 880 | GPT-5.6 Sol | 2 | 137 | 80 |
| Total | 3,800 | – | – | 485 | 214 |