HackerPapers

arXiv:2210.12283cs.AI

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

Albert Q. Jiang, Sean Welleck, Jin Peng Zhou, Wenda Li, Jiacheng Liu, Mateja Jamnik, Timothée Lacroix, Yuhuai Wu, Guillaume Lample

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The formalization of existing mathematical proofs is a notoriously difficult process. Despite decades of research on automation and proof assistants, writing formal proofs remains arduous and only accessible to a few experts. While previous studies to automate formalization focused on powerful search algorithms, no attempts were made to take advantage of available informal proofs. In this work, we introduce Draft, Sketch, and Prove (DSP), a method that maps informal proofs to formal proof sketches, and uses the sketches to guide an automated prover by directing its search to easier sub-problems. We investigate two relevant setups where informal proofs are either written by humans or generated by a language model. Our experiments and ablation studies show that large language models are able to produce well-structured formal sketches that follow the same reasoning steps as the informal proofs. Guiding an automated prover with these sketches enhances its performance from 20.9% to 39.3% on a collection of mathematical competition problems.

arXiv comments
Journal reference
DOI
Subjects
cs.AIArtificial Intelligence cs.LGMachine Learning

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jul 2024 to Jul 2024. Found in 2 HN submissions from Oct 2022 to Oct 2022. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • >Then ask it to convert the problem into each of those formal methods. Then use something like Mathematica on each formal method. Draft, Sketch, and Prove from 2022 does something like this: https://arxiv.org/abs/2210.12283

      sbierwagenView on HNParent context

Submitted to Hacker News

  • Ask HN: Proof Irrelevance and De Morgan's Laws

    I'm reading two things at the same time 99 Variations on a Proof https://press.princeton.edu/books/hardcover/9780691158839/99... and the newly published paper Draft, Sketch, and Prove: Guiding Formal Theorem Provers With Informal Proofs https://arxiv.org/pdf/2210.12283.pdf As you all know De Morgan's Laws provide great simplification of terms to canonical forms. Application of these laws improved circuit design forever. My question: Can "Irrelevance Laws" be developed in proofs so one style of…

  • Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

Connected through shared HN threads, not inferred similarity or a recommendation.