{"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/premise-selection-for-theorem-proving-by-deep","title":"Premise Selection for Theorem Proving by Deep Graph Embedding","arxiv_id":"1709.09994","date":"2017-09-28","proceeding":"NeurIPS 2017 12","authors":["Mingzhe Wang","Yihe Tang","Jian Wang","Jia Deng"],"abstract":"We propose a deep learning-based approach to the problem of premise\nselection: selecting mathematical statements relevant for proving a given\nconjecture. We represent a higher-order logic formula as a graph that is\ninvariant to variable renaming but still fully preserves syntactic and semantic\ninformation. We then embed the graph into a vector via a novel embedding method\nthat preserves the information of edge ordering. Our approach achieves\nstate-of-the-art results on the HolStep dataset, improving the classification\naccuracy from 83% to 90.3%.","url_abs":"http://arxiv.org/abs/1709.09994v1","url_pdf":"http://arxiv.org/pdf/1709.09994v1.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":"premise-selection-for-theorem-proving-by-deep","repo_url":"https://github.com/princeton-vl/FormulaNet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"automated-theorem-proving","task_name":"Automated Theorem Proving"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/automated-theorem-proving-on-holstep","task":"Automated Theorem Proving","dataset":"HolStep (Conditional)","model":"FormulaNet","rank_in_archive_order":2,"of":5,"metrics":{"Classification Accuracy":"0.903"},"uses_additional_data":false},{"leaderboard":"/sota/automated-theorem-proving-on-holstep","task":"Automated Theorem Proving","dataset":"HolStep (Conditional)","model":"FormulaNet-basic","rank_in_archive_order":3,"of":5,"metrics":{"Classification Accuracy":"0.891"},"uses_additional_data":false},{"leaderboard":"/sota/automated-theorem-proving-on-holstep-1","task":"Automated Theorem Proving","dataset":"HolStep (Unconditional)","model":"FormulaNet","rank_in_archive_order":1,"of":4,"metrics":{"Classification Accuracy":"0.900"},"uses_additional_data":false},{"leaderboard":"/sota/automated-theorem-proving-on-holstep-1","task":"Automated Theorem Proving","dataset":"HolStep (Unconditional)","model":"FormulaNet-basic","rank_in_archive_order":2,"of":4,"metrics":{"Classification Accuracy":"0.890"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1709.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.09994"}},"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/princeton-vl/FormulaNet","reach":null}],"summary":{"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":1,"ran":1,"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":"2e8cb138d11b892d","entry":"add_conj","repo":"princeton-vl/FormulaNet","repo_kind":"official","path":"src/batch_train.py","file_url":"https://github.com/princeton-vl/FormulaNet/blob/HEAD/src/batch_train.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":"BSD-3-Clause","inline_ok":true,"mcp_get_code":{"code_sha256":"2e8cb138d11b892d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}