PutnamBench in Lean
More Putnam competition problems proved in Lean 4 within a fixed search budget (placeholder)
State the benchmark (placeholder)
浏览文件+11 −0 README.md 新增 查看文件
| @@ -0,0 +1,11 @@ | ||
| 1 | +# PutnamBench in Lean | |
| 2 | + | |
| 3 | +> **Placeholder.** This benchmark is here so the benchmark panel can be tried out. Its baseline is from the blueprint or the literature as of 2026-10-19 and must be checked again; every route and score after it is made up. | |
| 4 | + | |
| 5 | +## Task | |
| 6 | + | |
| 7 | +Prove theorems from PutnamBench, the Putnam competition problems formalized in Lean 4, within a fixed budget of proof attempts. A proof counts when it compiles against the pinned Mathlib with no sorry and no new axioms. The score is the number of problems proved out of 657; the baseline is a best-first tactic search with an open prover. | |
| 8 | + | |
| 9 | +## How to take part | |
| 10 | + | |
| 11 | +Start a route from `main` (the baseline) or from any route on the leaderboard, keep your files in the route's folder, and push: the verifier scores every commit. Say what your route changes with tags, and keep the misses: a route that scores worse is a result too. | |