What tactic will prove the most mathlib lemmas at the end of 2026?
7
310Ṁ7022027
2%
simp
38%
aesop
2%
rw_search
1.7%
sorry
4%
duper
52%
Sometime around the resolution date, I will write a script that samples random tactic-mode lemmas from mathlib, and replaces the proof of those lemmas with an invocation of a single tactic. This market resolves to whichever tactic of the ones provided as answers proves the biggest fraction of lemmas.
This question is managed and resolved by Manifold.
Get 
1,000 to start trading!
1,000People are also trading
Related questions
Will aesop be able to replace >50% of mathlib proofs by 2025-11-26?
41% chance
Will rw_search be able to replace >50% of mathlib proofs by 2025-11-26?
19% chance
Which theorems will be formally proven in Lean by the end of 2028?
Which theorem prover will have proved the most theorems on Freek's list by end of 2025?
Will the best public LLM at the end of 2025 solve more than 5 of the first 10 Project Euler problems published in 2026?
75% chance
Will reinforcement learning overtake LMs on math before 2028?
70% chance
Will the majority of mathematicians rely on formal computer proof assistants before the end of 2040?
60% chance
Will an AI win a Gold Medal on the International Math Olympiad by 2027?
89% chance
Will an AI win a Gold Medal on the International Math Olympiad by 2032?
93% chance
Will an AI win a Gold Medal on the International Math Olympiad by 2029?
91% chance