The question
A proof assistant can check a formal step, but finding the next useful step may be difficult. GPT-f uses language models to propose Metamath proof steps and guide backward search. The selected 2020 preprint reports reproducing proofs from a held-out test set and shortening some existing library proofs. These outputs differ from discovering arbitrary new open theorems, and their human-library context is essential.
The idea
A model proposes a theorem and substitutions; a search explores resulting subgoals, with a learned value model helping prioritize the work. The selected version reports 56.22% held-out test reproduction under its stated search budget, including 32 attempts per theorem. Separately, 23 shorter proofs were contributed to the community library. The linked pull requests show human discussion and curation. A shorter proof of an existing statement is not a new theorem, although it can still be a useful contribution.
Why it matters
The system places model generation beside a precise formal checker. WRS's B grade concerns the recorded proof-search and library contribution. Formal derivation depends on the exact statement, hypotheses, axioms and library. OpenAI provenance does not make those targets appropriate for a different informal question. Human authorship of the library, development of the model, checking and community integration should remain separately visible rather than collapsed into a single AI victory.
A teaching example
Imagine a search proposing a step that proves A implies B when your task is to prove B without assuming A. A verifier could correctly accept a derivation of the first statement while your original task remains unfinished. That is why the exact target matters as much as a green checker result. This hypothetical example is not an allegation about GPT-f's published outputs. It shows what a participant should inspect before reusing any formal certificate as evidence for a broader claim.
Scope and a useful next step
Read arXiv 2009.03393v1 and the identified library pull requests. A bounded contribution could trace one shortened proof to its library statement and inspect its axiom dependencies, preserving the exact revision. WRS has not independently rerun the model training, benchmark or verifier. Report precisely what you inspected or replayed; neither a reported benchmark percentage nor repeated successful checks settles a different mathematical problem.
Scientific scope
The assessed target is arXiv 2009.03393v1. The reported 56.22% result is held-out test performance under its stated proof-search budget; 56.50% is a different validation result. The 23 contributed proofs shorten proofs of existing library theorems and are not 23 newly discovered mathematical theorems. Metamath checking depends on the chosen library statements and hypotheses. Human model development, existing library authorship and model proof execution retain separate credit. WRS has not independently trained or replayed the system.
Read the original work
- Polu and Sutskever2020: Generative Language Modeling for Automated Theorem Proving — arXiv2009.03393v1
- Metamath set.mm PR1547: Shortening of various proofs based on OpenAI provers
- Metamath set.mm PR1561: OpenAI prover shortening of supmax, dprdwd, unitg, bnj538
Sources and reading locations for this explanation
- Polu and Sutskever2020: Generative Language Modeling for Automated Theorem Proving — arXiv2009.03393v1
Identified original contribution source. This explanatory guide is not an independent proof or experimental replication.
- Metamath set.mm PR1547: Shortening of various proofs based on OpenAI provers
Identified original contribution source. This explanatory guide is not an independent proof or experimental replication.
- Metamath set.mm PR1561: OpenAI prover shortening of supmax, dprdwd, unitg, bnj538
Identified original contribution source. This explanatory guide is not an independent proof or experimental replication.
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Stanislas Polu; Ilya Sutskever
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
GPT-f · OpenAI · GPT-f custom decoder-only transformer (reported700m model; architecture described as774M)
Source-reported Metamath proof-step generation with guided search; existing-theorem reproduction and curated shorter proofs.. Source-reported attribution; provider attestation is unavailable.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.