“In 2029, AI will not be able to take arbitrary proofs from the mathematical literature written in natural language and convert them into a symbolic form suitable for symbolic verification.”
Our reading, the sentence that was checked:
In 2029, AI will not be able to take arbitrary proofs written in natural language from the mathematical literature and convert them into a symbolic form suitable for symbolic verification.
Assessment: Unresolved Not yet due on 2026-10-29 Evidence as of
Where and when Gary Marcus wrote it
Marcus on AI, Dear Elon Musk, here are five things you might want to consider about AGI, prediction 5 of 5.
- Said
- Source observed
- live page, full text, public
- Evidence as of
- the cutoff for this assessment
- Assessment recorded
- assessment marcus-dear-elon-musk-here-are-five-things-720a9f-a1
We recorded 21 claims from this post. See every claim from this post.
The wording above is the version this site observed on 2026-10-28. The source may have been edited after 2022-05-31. This page does not claim the wording was captured then.
What the claim commits to
- Kind
- Forecast
- Deadline, as the speaker wrote it
- “In 2029”
- Deadline state when assessed
- Not yet due
- Deadline state on 2026-10-29
- Not yet due (the release’s reference date)
Conditions
- from the mathematical literature (scope, stated by the speaker)
From the speaker
- In 2029
- AI will not be able to take arbitrary proofs
- from the mathematical literature
- written in natural language
- convert them into a symbolic form suitable for symbolic verification
Our interpretation
- The deadline is December 31, 2029, allowing the whole named year.
- Arbitrary means broad applicability to independently selected proofs across mathematical literature, rather than selected showcases or one narrow class. It does not require successfully verifying false arguments.
- Converting proofs means preserving their mathematical content and substantive reasoning while supplying formal details. Producing a different proof of the same theorem alone does not demonstrate faithful conversion.
- Successful checking by a proof assistant is the practical test of suitability for symbolic verification. Statements alone, unchecked proof holes and unsupported assumptions do not establish success.
- Marcus specifies neither a representative sampling method nor an acceptable failure rate; those must be disclosed rather than silently invented.
- The literature restriction defines the task, rather than a conditional forecast requiring a separate antecedent.
- This assessment concerns the individual formalization prediction, not winning the broader three-of-five AGI bet.
Counts as supported if: Broad evaluations during 2029 find that leading systems still cannot faithfully formalize independently selected natural-language proofs from diverse mathematical literature, with recurring substantive failures rather than merely occasional errors. Absence of a demonstration alone is insufficient.
Counts as contradicted if: Reproducible evaluations establish broad successful conversion of independently selected literature proofs into checked symbolic proofs, preserving the original mathematical content and reasoning without substantial expert completion.
Prospective: these criteria were frozen before the deadline, while the outcome was not yet public.
Current assessment
Did the forecast come true?
Outcome: Unresolved
The record was checked, and the evidence available by the cutoff does not settle it.
Scored on a plain reading. The speaker named no measure for this claim, so it was judged on the reading an informed reader would take, stated below under our interpretation. Both reviews had to find that reading fair.
- Evidence as of
- Deadline state when assessed
- Not yet due
- Assessment recorded
- Policy version
- 2026-10-28.7
Rationale
The deadline is December 31, 2029. Textbook-scale formalization and the reported checked proof of Fermat's Last Theorem are substantial counterevidence to any suggestion that literature-proof formalization is wholly beyond AI. They do not establish the broad arbitrary-proof capability in this forecast. The broader benchmark also supplies human-formalized statements. No reviewed evidence meets the early-resolution rule, and current gaps cannot establish failure in 2029.
Limitations
- The research and developer reports were read, but their generated proof artifacts were not independently rerun in this assessment.
- Breadth and proof fidelity require judgments the speaker did not fully specify.
- A checked proof of a theorem does not alone establish faithful translation of its source argument.
Evidence (3 items)
Context only: arXiv,
large-scale automated formalization of mathematical literature
Why it matters here: M2F reports 153,853 lines of Lean from 479 textbook pages on real and convex analysis. This is material progress, but those selected corpora and the reported statement audits do not establish faithful conversion of arbitrary literature proofs across mathematics.
- Publisher
- arXiv
- Kind of source
- Preprint, not peer reviewed
- Describes events of
- Public from
Context only: Anthropic,
computer-checked proof of Fermat’s Last Theorem.
Why it matters here: Anthropic reports a checked formalization following a published exposition of Wiles's proof, with limited high-level human input; its quoted completion log dates the achievement to August 18 UTC. This strongly challenges a reading that AI cannot formalize major literature proofs, but a selected project does not establish the forecast's arbitrary-proof breadth.
- Where
- Opening paragraph
- Publisher
- Anthropic
- Kind of source
- Company disclosure: the company describing itself, not an independent finding
- Describes events of
- Public from
Context only: Meta AI,
leaving the corresponding Lean proof
Why it matters here: AutoformBench covers 341 tasks from 24 advanced mathematical sources and supplies informal proofs, making it relevant to breadth. Human-formalized target statements provide part of the translation, and the announcement does not establish general faithful conversion of arbitrary literature proofs.
- Publisher
- Meta AI
- Kind of source
- Company disclosure: the company describing itself, not an independent finding
- Describes events of
- Public from
What would settle it
An independent, reproducible evaluation across diverse literature proofs, selected without favoring the system, with source-fidelity review, complete checker results and disclosed human interventions. Such evidence could establish capability early; otherwise evaluations during 2029 must settle the forecast.
Where it was said (1)
Said once in the sources this register covers.
: Marcus on AI, Dear Elon Musk, here are five things you might want to consider about AGI
In 2029, AI will not be able to take arbitrary proofs from the mathematical literature written in natural language and convert them into a symbolic form suitable for symbolic verification.
- Where
- prediction 5 of 5
- Published
- 2022-05-31
- Source observed
- , live page
- Access
- full text, public
History
Assessment versions
- Assessment marcus-dear-elon-musk-here-are-five-things-720a9f-a1: Current. Outcome: Unresolved. Evidence as of 2026-10-28. Public date not recorded.
Recorded events
Assessment publishedBy this site
First assessment published after both reviews and the final-text check passed.
About assessment marcus-dear-elon-musk-here-are-five-things-720a9f-a1.