{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/proofnet-autoformalizing-and-formally-proving","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","arxiv_id":"2302.12433","date":"2023-02-24","proceeding":null,"authors":["Zhangir Azerbayev","Bartosz Piotrowski","Hailey Schoelkopf","Edward W. Ayers","Dragomir Radev","Jeremy Avigad"],"abstract":"We introduce ProofNet, a benchmark for autoformalization and formal proving of undergraduate-level mathematics. The ProofNet benchmarks consists of 371 examples, each consisting of a formal theorem statement in Lean 3, a natural language theorem statement, and a natural language proof. The problems are primarily drawn from popular undergraduate pure mathematics textbooks and cover topics such as real and complex analysis, linear algebra, abstract algebra, and topology. We intend for ProofNet to be a challenging benchmark that will drive progress in autoformalization and automatic theorem proving. We report baseline results on statement autoformalization via in-context learning. Moreover, we introduce two novel statement autoformalization methods: prompt retrieval and distilled backtranslation.","url_abs":"https://arxiv.org/abs/2302.12433v1","url_pdf":"https://arxiv.org/pdf/2302.12433v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"proofnet-autoformalizing-and-formally-proving","repo_url":"https://github.com/eleutherai/gpt-neox","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"proofnet-autoformalizing-and-formally-proving","repo_url":"https://github.com/zhangir-azerbayev/proofnet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"abstract-algebra","task_name":"Abstract Algebra"},{"task_slug":"automated-theorem-proving","task_name":"Automated Theorem Proving"},{"task_slug":"in-context-learning","task_name":"In-Context Learning"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[{"slug":"proofnet","name":"ProofNet","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2302.12433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12433"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/eleutherai/gpt-neox","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zhangir-azerbayev/proofnet","reach":null}],"summary":{"ran_draft_wrong":2,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"4af48447fee40a03","entry":"get_formal_dict","repo":"zhangir-azerbayev/proofnet","repo_kind":"official","path":"benchmark/parse_files.py","file_url":"https://github.com/zhangir-azerbayev/proofnet/blob/HEAD/benchmark/parse_files.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4af48447fee40a03"}},{"code_sha256_prefix":"cbe0f551455ad6e5","entry":"get_informal_dict","repo":"zhangir-azerbayev/proofnet","repo_kind":"official","path":"benchmark/parse_files.py","file_url":"https://github.com/zhangir-azerbayev/proofnet/blob/HEAD/benchmark/parse_files.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cbe0f551455ad6e5"}},{"code_sha256_prefix":"dc4f7398a06100d5","entry":"header_of_author","repo":"zhangir-azerbayev/proofnet","repo_kind":"official","path":"benchmark/parse_files.py","file_url":"https://github.com/zhangir-azerbayev/proofnet/blob/HEAD/benchmark/parse_files.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"dc4f7398a06100d5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}