Primary evidence
- Generative language modeling for automated theorem provingS2 · Official institutional · Official announcement · 2020-09-07
- Generative Language Modeling for Automated Theorem ProvingS1 · Primary research · Paper · 2020-09-07
OpenAI researchers Stanislas Polu and Ilya Sutskever trained generative models over formal mathematical text and integrated them into proof search for the Metamath language.
GPT-f used a generative transformer model to search for proofs in Metamath and found new shorter proofs that were accepted into the main Metamath library.
OpenAI researchers Stanislas Polu and Ilya Sutskever trained generative models over formal mathematical text and integrated them into proof search for the Metamath language. The work framed theorem proving as sequence generation and showed that learned generation could contribute usable proof artifacts to an established formal library.
The result is a useful starting point for the later LLM-plus-proof-assistant line of AI4Math, where language models propose proof actions and formal systems provide exact feedback.
Significance rationale: GPT-f was an early demonstration that transformer language models could generate formal proof steps rather than only score or classify them, and its authors reported new shorter proofs accepted into the Metamath library.
—
—
OpenAI and the arXiv paper reported the Metamath prover and the adoption of generated shorter proofs into the library.
No corrections recorded.