about
Generative Language Modeling for Automated Theorem Proving (arxiv.org)
3 points by colinhb on Sep 9, 2020 | hide | past | pdf | 1 comment on HN

In plain words: A language model writes proof steps for the Metamath formal math system, inventing new mathematical terms instead of only picking from a fixed list like usual provers. It found short new proofs accepted into the main Metamath library, a first for a deep-learning prover.

Abstract

We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans -- the generation of original mathematical terms -- might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance. GPT-f found new short proofs that were accepted into the main Metamath library, which is to our knowledge, the first time a deep-learning based system has contributed proofs that were adopted by a formal mathematics community.

Stanislas Polu, Ilya Sutskever
arXiv:2009.03393 · cs.LG, cs.AI, cs.CL, stat.ML · submitted Sep 7, 2020
abstract · pdf · html · 15+5 pages

add comment on HN
Also discussed: Sep 2020 (88 points, 28 comments)

Abstract:

> We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans – the generation of original mathematical terms – might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance. GPT-f found new short proofs that were accepted into the main Metamath library, which is to our knowledge, the first time a deep learning based system has contributed proofs that were adopted by a formal mathematics community.