{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/draft-sketch-and-prove-guiding-formal-theorem","title":"Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs","arxiv_id":"2210.12283","date":"2022-10-21","proceeding":null,"authors":["Albert Q. Jiang","Sean Welleck","Jin Peng Zhou","Wenda Li","Jiacheng Liu","Mateja Jamnik","Timothée Lacroix","Yuhuai Wu","Guillaume Lample"],"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.","url_abs":"https://arxiv.org/abs/2210.12283v3","url_pdf":"https://arxiv.org/pdf/2210.12283v3.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":"draft-sketch-and-prove-guiding-formal-theorem","repo_url":"https://github.com/facebookresearch/minif2f","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"draft-sketch-and-prove-guiding-formal-theorem","repo_url":"https://github.com/albertqjiang/draft_sketch_prove","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"draft-sketch-and-prove-guiding-formal-theorem","repo_url":"https://github.com/rah4927/lean-dojo-mew","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"automated-theorem-proving","task_name":"Automated Theorem Proving"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"mathematical-proofs","task_name":"Mathematical Proofs"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-test","task":"Automated Theorem Proving","dataset":"miniF2F-test","model":"DSP (540B Minerva informal)","rank_in_archive_order":12,"of":29,"metrics":{"ITP":"Isabelle","Pass@100":"38.9","cumulative":"38.9"},"uses_additional_data":false},{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-test","task":"Automated Theorem Proving","dataset":"miniF2F-test","model":"Sledgehammer + heuristics","rank_in_archive_order":25,"of":29,"metrics":{"ITP":"Isabelle","Pass@1":"20.9","cumulative":"20.9"},"uses_additional_data":false},{"leaderboard":"/sota/automated-theorem-proving-on-minif2f-valid","task":"Automated Theorem Proving","dataset":"miniF2F-valid","model":"DSP (62B Minerva informal)","rank_in_archive_order":10,"of":10,"metrics":{"Pass@100":"43.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2210.12283","atlas_url":"https://app.syntology.ai/?focus=2210.12283","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2210.12283"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2210.12283\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2210.12283"},"call":"get_concepts_for_paper(arxiv_id=\"2210.12283\")"}],"by_repo":[{"repo":"facebookresearch/minif2f","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.00110"],"harvested_for_calls":[{"arxiv_id":"2109.00110","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.00110"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.00110\")"}]},{"repo":"albertqjiang/draft_sketch_prove","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rah4927/lean-dojo-mew","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"aac458e65e8e4c4610d24a4b7f4341ffa2681e2d070cf05ffd840d800fc6af4a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}