Seed-Prover 1.5: Mastering Undergraduate-Level Theorem Proving via Learning from Experience
Large language models have recently made significant progress to generate rigorous mathematical proofs. In contrast, utilizing LLMs for theorem proving in formal languages (such as Lean) remains challenging and computationally expensive, particularly when addressing problems at the undergraduate level and beyond. In this work, we present Seed-Prover 1.5, a formal theorem-proving model trained via large-scale agentic reinforcement learning, alongside an efficient test-time scaling (TTS) workflow. Through extensive interactions with Lean and other tools, the model continuously accumulates experience during the RL process, substantially enhancing the capability and efficiency of formal theorem proving. Furthermore, leveraging recent advancements in natural language proving, our TTS workflow efficiently bridges the gap between natural and formal languages. Compared to state-of-the-art methods, Seed-Prover 1.5 achieves superior performance with a smaller compute budget. It solves 88\% of PutnamBench (undergraduate-level), 80\% of Fate-H (graduate-level), and 33\% of Fate-X (PhD-level) problems. Notably, using our system, we solved 11 out of 12 problems from Putnam 2025 within 9 hours. Our findings suggest that scaling learning from experience, driven by high-quality formal feedback, holds immense potential for the future of formal mathematical reasoning.
6948afc434f46eaf46cbb1f1
Jiangjie Chen
6948afc434f46eaf46cbb1f2
Wenxiang Chen
6948afc434f46eaf46cbb1f3
Jiacheng Du
6948afc434f46eaf46cbb1f4
Jinyi Hu
claimed_verified
2025-12-22T10:58:50.739Z
637a06580a77f602dc4ac922
https://cdn-avatars.huggingface.co/v1/production/uploads/637a06580a77f602dc4ac922/qOJAhHOEE2N-HzRcZOu1L.jpeg
Jinyi Hu
JamesHujy
user
JamesHujy
6948afc434f46eaf46cbb1f5
Zhicheng Jiang
6948afc434f46eaf46cbb1f6
Allan Jie
claimed_verified
2025-12-22T10:58:49.005Z
5f729da2f1e7ef6e919a1c27
/avatars/bdf48f0d3290fab54d7e9636a3d14158.svg
Zhanming (Allan) Jie
allanjie
user
allanjie
6948afc434f46eaf46cbb1f7
Xiaoran Jin
6948afc434f46eaf46cbb1f8
Xing Jin
6948afc434f46eaf46cbb1f9
Chenggang Li
6948afc434f46eaf46cbb1fa
Wenlei Shi
6948afc434f46eaf46cbb1fb
Zhihong Wang
6948afc434f46eaf46cbb1fc
Mingxuan Wang
6948afc434f46eaf46cbb1fd
Chenrui Wei
6948afc434f46eaf46cbb1fe
Shufa Wei
6948afc434f46eaf46cbb1ff
Huajian Xin
6948afc434f46eaf46cbb200
Fan Yang
6948afc434f46eaf46cbb201
Weihao Gao
6948afc434f46eaf46cbb202
Zheng Yuan
claimed_verified
2026-01-04T20:32:08.404Z
5f694b8b5e78cc6b0ed31bd2
/avatars/63f21d30918c34fff9ea592e1039b3f0.svg
Zheng Yuan
GanjinZero
user
GanjinZero
6948afc434f46eaf46cbb203
Tianyang Zhan
claimed_verified
2025-12-25T20:52:11.470Z
64245d68089d5fae56b447ec
/avatars/e57e78c5553cf691b26ab22ee7ab54e2.svg
Tianyang Zhan
Neptune233
user
Neptune233
6948afc434f46eaf46cbb204
Zeyu Zheng
claimed_verified
2026-02-02T17:02:33.850Z
67cffe31d6f5c181e523610c
/avatars/8706e09fc4397456baeddb8942c8b0ee.svg
Zeyu Zheng
zeyu-zheng
user
zeyu-zheng
6948afc434f46eaf46cbb205
Tianxi Zhou
6948afc434f46eaf46cbb206
Thomas Hanwen Zhu
claimed_verified
2025-12-25T20:52:14.103Z
654ac8b57ed5797e22eb85e2
/avatars/cb618f9e69ca0362a35b2f1bf4050064.svg
Thomas Zhu
hanwenzhu
user
hanwenzhu
Seed-Prover 1.5: Mastering Undergraduate-Level Theorem Proving via Learning from Experience
Large language models have recently made significant progress to generate rigorous mathematical proofs. In contrast, utilizing LLMs for theorem proving in formal languages (such as Lean) remains challenging and computationally expensive, particularly when addressing problems at the undergraduate level and beyond. In this work, we present Seed-Prover 1.5, a formal theorem-proving model trained via large-scale agentic reinforcement learning, alongside an efficient test-time scaling (TTS) workflow. Through extensive interactions with Lean and other tools, the model continuously accumulates experience during the RL process, substantially enhancing the capability and efficiency of formal theorem proving. Furthermore, leveraging recent advancements in natural language proving, our TTS workflow efficiently bridges the gap between natural and formal languages. Compared to state-of-the-art methods, Seed-Prover 1.5 achieves superior performance with a smaller compute budget. It solves 88\% of PutnamBench (undergraduate-level), 80\% of Fate-H (graduate-level), and 33\% of Fate-X (PhD-level) problems. Notably, using our system, we solved 11 out of 12 problems from Putnam 2025 within 9 hours. Our findings suggest that scaling learning from experience, driven by high-quality formal feedback, holds immense potential for the future of formal mathematical reasoning.
Seed-Prover 1.5, a formal theorem-proving model using large-scale agentic reinforcement learning and an efficient test-time scaling workflow, demonstrates superior performance in solving mathematical problems across various levels with reduced computational resources.
large language models theorem proving formal languages Lean reinforcement learning test-time scaling PutnamBench Fate-H Fate-X formal mathematical reasoning