{"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":"/task/automated-theorem-proving/papers/ran/1","list_of":"/task/automated-theorem-proving","task":"Automated Theorem Proving","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,46],"of":46,"counts":{"archive_papers_tagged":288,"with_a_code_link":110,"where_syntology_ran_a_sample":46,"not_listed_spam_title":0,"listed":288,"listed_where_code_ran":46,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":35,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":35,"listed_every_run_a_failure_of_syntologys_instrument":11,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/automated-theorem-proving/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/leanexplore-a-search-engine-for-lean-4","slug":"leanexplore-a-search-engine-for-lean-4","title":"LeanExplore: A search engine for Lean 4 declarations","date":"2025-06-04","arxiv_id":"2506.11085","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/leanexplore-a-search-engine-for-lean-4#ran","syntology_url":"https://syntology.ai/paper/2506.11085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.11085"}},"official":{"repos":["justincasher/lean-explore"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deeptheorem-advancing-llm-reasoning-for","slug":"deeptheorem-advancing-llm-reasoning-for","title":"DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning","date":"2025-05-29","arxiv_id":"2505.23754","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deeptheorem-advancing-llm-reasoning-for#ran","syntology_url":"https://syntology.ai/paper/2505.23754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23754"}},"official":{"repos":["jiahao004/deeptheorem"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ineq-comp-benchmarking-human-intuitive","slug":"ineq-comp-benchmarking-human-intuitive","title":"Ineq-Comp: Benchmarking Human-Intuitive Compositional Reasoning in Automated Theorem Proving on Inequalities","date":"2025-05-19","arxiv_id":"2505.12680","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ineq-comp-benchmarking-human-intuitive#ran","syntology_url":"https://syntology.ai/paper/2505.12680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12680"}},"official":{"repos":["haoyuzhao123/leanineqcomp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kimina-prover-preview-towards-large-formal","slug":"kimina-prover-preview-towards-large-formal","title":"Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning","date":"2025-04-15","arxiv_id":"2504.11354","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kimina-prover-preview-towards-large-formal#ran","syntology_url":"https://syntology.ai/paper/2504.11354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11354"}},"official":{"repos":["moonshotai/kimina-prover-preview"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/goedel-prover-a-frontier-model-for-open","slug":"goedel-prover-a-frontier-model-for-open","title":"Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving","date":"2025-02-11","arxiv_id":"2502.07640","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/goedel-prover-a-frontier-model-for-open#ran","syntology_url":"https://syntology.ai/paper/2502.07640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.07640"}},"official":{"repos":["Goedel-LM/Goedel-Prover"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rm-p-small-roof-w-small-ala-multilingual","slug":"rm-p-small-roof-w-small-ala-multilingual","title":"ProofWala: Multilingual Proof Data Synthesis and Theorem-Proving","date":"2025-02-07","arxiv_id":"2502.04671","repositories_listed":2,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rm-p-small-roof-w-small-ala-multilingual#ran","syntology_url":"https://syntology.ai/paper/2502.04671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04671"}},"official":{"repos":["trishullab/itp-interface","trishullab/proof-wala"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/stp-self-play-llm-theorem-provers-with","slug":"stp-self-play-llm-theorem-provers-with","title":"STP: Self-play LLM Theorem Provers with Iterative Conjecturing and Proving","date":"2025-01-31","arxiv_id":"2502.00212","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/stp-self-play-llm-theorem-provers-with#ran","syntology_url":"https://syntology.ai/paper/2502.00212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00212"}},"official":{"repos":["kfdong/STP"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-autoregression-fast-llms-via-self","slug":"beyond-autoregression-fast-llms-via-self","title":"Beyond Autoregression: Fast LLMs via Self-Distillation Through Time","date":"2024-10-28","arxiv_id":"2410.21035","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/beyond-autoregression-fast-llms-via-self#ran","syntology_url":"https://syntology.ai/paper/2410.21035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21035"}},"official":{"repos":["jdeschena/sdtt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/internlm2-5-stepprover-advancing-automated","slug":"internlm2-5-stepprover-advancing-automated","title":"InternLM2.5-StepProver: Advancing Automated Theorem Proving via Expert Iteration on Large-Scale LEAN Problems","date":"2024-10-21","arxiv_id":"2410.15700","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/internlm2-5-stepprover-advancing-automated#ran","syntology_url":"https://syntology.ai/paper/2410.15700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15700"}},"official":{"repos":["internlm/internlm-math"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pantograph-a-machine-to-machine-interaction","slug":"pantograph-a-machine-to-machine-interaction","title":"Pantograph: A Machine-to-Machine Interaction Interface for Advanced Theorem Proving, High Level Reasoning, and Data Extraction in Lean 4","date":"2024-10-21","arxiv_id":"2410.16429","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pantograph-a-machine-to-machine-interaction#ran","syntology_url":"https://syntology.ai/paper/2410.16429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16429"}},"official":{"repos":["lenianiva/pypantograph","stanford-centaur/pypantograph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepseek-prover-v1-5-harnessing-proof","slug":"deepseek-prover-v1-5-harnessing-proof","title":"DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Search","date":"2024-08-15","arxiv_id":"2408.08152","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepseek-prover-v1-5-harnessing-proof#ran","syntology_url":"https://syntology.ai/paper/2408.08152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08152"}},"official":{"repos":["deepseek-ai/deepseek-prover-v1.5"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/minictx-neural-theorem-proving-with-long","slug":"minictx-neural-theorem-proving-with-long","title":"miniCTX: Neural Theorem Proving with (Long-)Contexts","date":"2024-08-05","arxiv_id":"2408.03350","repositories_listed":4,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/minictx-neural-theorem-proving-with-long#ran","syntology_url":"https://syntology.ai/paper/2408.03350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.03350"}},"official":{"repos":["cmu-l3/minictx-eval"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/putnambench-evaluating-neural-theorem-provers","slug":"putnambench-evaluating-neural-theorem-provers","title":"PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition","date":"2024-07-15","arxiv_id":"2407.11214","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/putnambench-evaluating-neural-theorem-provers#ran","syntology_url":"https://syntology.ai/paper/2407.11214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11214"}},"official":{"repos":["trishullab/putnam","trishullab/putnambench"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/theoremllama-transforming-general-purpose","slug":"theoremllama-transforming-general-purpose","title":"TheoremLlama: Transforming General-Purpose LLMs into Lean4 Experts","date":"2024-07-03","arxiv_id":"2407.03203","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/theoremllama-transforming-general-purpose#ran","syntology_url":"https://syntology.ai/paper/2407.03203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03203"}},"official":{"repos":["RickySkywalker/TheoremLlama"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-formal-mathematics-from-intrinsic","slug":"learning-formal-mathematics-from-intrinsic","title":"Learning Formal Mathematics From Intrinsic Motivation","date":"2024-06-30","arxiv_id":"2407.00695","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-formal-mathematics-from-intrinsic#ran","syntology_url":"https://syntology.ai/paper/2407.00695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.00695"}},"official":{"repos":["gpoesia/minimo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fvel-interactive-formal-verification","slug":"fvel-interactive-formal-verification","title":"FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Proving","date":"2024-06-20","arxiv_id":"2406.14408","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fvel-interactive-formal-verification#ran","syntology_url":"https://syntology.ai/paper/2406.14408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14408"}},"official":{"repos":["fveler/fvel"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/verification-and-refinement-of-natural","slug":"verification-and-refinement-of-natural","title":"Verification and Refinement of Natural Language Explanations through LLM-Symbolic Theorem Proving","date":"2024-05-02","arxiv_id":"2405.01379","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/verification-and-refinement-of-natural#ran","syntology_url":"https://syntology.ai/paper/2405.01379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01379"}},"official":{"repos":["neuro-symbolic-ai/explanation_refinement"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-large-language-models-as-copilots-for","slug":"towards-large-language-models-as-copilots-for","title":"Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean","date":"2024-04-18","arxiv_id":"2404.12534","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-large-language-models-as-copilots-for#ran","syntology_url":"https://syntology.ai/paper/2404.12534","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12534"}},"official":{"repos":["lean-dojo/leancopilot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/don-t-trust-verify-grounding-llm-quantitative","slug":"don-t-trust-verify-grounding-llm-quantitative","title":"Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalization","date":"2024-03-26","arxiv_id":"2403.18120","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/don-t-trust-verify-grounding-llm-quantitative#ran","syntology_url":"https://syntology.ai/paper/2403.18120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.18120"}},"official":{"repos":["jinpz/dtv"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/leanreasoner-boosting-complex-logical","slug":"leanreasoner-boosting-complex-logical","title":"LeanReasoner: Boosting Complex Logical Reasoning with Lean","date":"2024-03-20","arxiv_id":"2403.13312","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/leanreasoner-boosting-complex-logical#ran","syntology_url":"https://syntology.ai/paper/2403.13312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13312"}},"official":{"repos":["some-random/theorem-proving-reasoning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bait-benchmarking-embedding-architectures-for","slug":"bait-benchmarking-embedding-architectures-for","title":"BAIT: Benchmarking (Embedding) Architectures for Interactive Theorem-Proving","date":"2024-03-06","arxiv_id":"2403.03401","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bait-benchmarking-embedding-architectures-for#ran","syntology_url":"https://syntology.ai/paper/2403.03401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03401"}},"official":null}},{"url":"/paper/refactor-learning-to-extract-theorems-from-1","slug":"refactor-learning-to-extract-theorems-from-1","title":"REFACTOR: Learning to Extract Theorems from Proofs","date":"2024-02-26","arxiv_id":"2402.17032","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":10,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/refactor-learning-to-extract-theorems-from-1#ran","syntology_url":"https://syntology.ai/paper/2402.17032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17032"}},"official":{"repos":["jinpz/refactor"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-study-of-data-ability-boundary","slug":"an-empirical-study-of-data-ability-boundary","title":"An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning","date":"2024-02-23","arxiv_id":"2403.00799","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-empirical-study-of-data-ability-boundary#ran","syntology_url":"https://syntology.ai/paper/2403.00799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00799"}},"official":{"repos":["cyzhh/MMOS"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mustard-mastering-uniform-synthesis-of","slug":"mustard-mastering-uniform-synthesis-of","title":"MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data","date":"2024-02-14","arxiv_id":"2402.08957","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mustard-mastering-uniform-synthesis-of#ran","syntology_url":"https://syntology.ai/paper/2402.08957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.08957"}},"official":{"repos":["eleanor-h/mustard"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/trigo-benchmarking-formal-mathematical-proof","slug":"trigo-benchmarking-formal-mathematical-proof","title":"TRIGO: Benchmarking Formal Mathematical Proof Reduction for Generative Language Models","date":"2023-10-16","arxiv_id":"2310.10180","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":11,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/trigo-benchmarking-formal-mathematical-proof#ran","syntology_url":"https://syntology.ai/paper/2310.10180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10180"}},"official":{"repos":["menik1126/TRIGO"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/llemma-an-open-language-model-for-mathematics","slug":"llemma-an-open-language-model-for-mathematics","title":"Llemma: An Open Language Model For Mathematics","date":"2023-10-16","arxiv_id":"2310.10631","repositories_listed":4,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llemma-an-open-language-model-for-mathematics#ran","syntology_url":"https://syntology.ai/paper/2310.10631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10631"}},"official":{"repos":["EleutherAI/math-lm","eleutherai/gpt-neox","wellecks/llmstep"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/lyra-orchestrating-dual-correction-in","slug":"lyra-orchestrating-dual-correction-in","title":"Lyra: Orchestrating Dual Correction in Automated Theorem Proving","date":"2023-09-27","arxiv_id":"2309.15806","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lyra-orchestrating-dual-correction-in#ran","syntology_url":"https://syntology.ai/paper/2309.15806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15806"}},"official":{"repos":["chuanyang-zheng/lyra-theorem-prover"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/leandojo-theorem-proving-with-retrieval-1","slug":"leandojo-theorem-proving-with-retrieval-1","title":"LeanDojo: Theorem Proving with Retrieval-Augmented Language Models","date":"2023-06-27","arxiv_id":"2306.15626","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/leandojo-theorem-proving-with-retrieval-1#ran","syntology_url":"https://syntology.ai/paper/2306.15626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15626"}},"official":{"repos":["lean-dojo/leandojo","lean-dojo/leandojochatgpt","lean-dojo/reprover"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-ensemble-approach-for-automated-theorem","slug":"an-ensemble-approach-for-automated-theorem","title":"An Ensemble Approach for Automated Theorem Proving Based on Efficient Name Invariant Graph Neural Representations","date":"2023-05-15","arxiv_id":"2305.08676","repositories_listed":1,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/an-ensemble-approach-for-automated-theorem#ran","syntology_url":"https://syntology.ai/paper/2305.08676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08676"}},"official":{"repos":["IBM/TRAIL"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/proofnet-autoformalizing-and-formally-proving","slug":"proofnet-autoformalizing-and-formally-proving","title":"ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics","date":"2023-02-24","arxiv_id":"2302.12433","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/proofnet-autoformalizing-and-formally-proving#ran","syntology_url":"https://syntology.ai/paper/2302.12433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12433"}},"official":{"repos":["eleutherai/gpt-neox","zhangir-azerbayev/proofnet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parsel-a-unified-natural-language-framework","slug":"parsel-a-unified-natural-language-framework","title":"Parsel: Algorithmic Reasoning with Language Models by Composing Decompositions","date":"2022-12-20","arxiv_id":"2212.10561","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parsel-a-unified-natural-language-framework#ran","syntology_url":"https://syntology.ai/paper/2212.10561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10561"}},"official":{"repos":["ezelikman/parsel"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/naturalprover-grounded-mathematical-proof","slug":"naturalprover-grounded-mathematical-proof","title":"NaturalProver: Grounded Mathematical Proof Generation with Language Models","date":"2022-05-25","arxiv_id":"2205.12910","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/naturalprover-grounded-mathematical-proof#ran","syntology_url":"https://syntology.ai/paper/2205.12910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12910"}},"official":{"repos":["wellecks/naturalprover"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-unification-for-logic-reasoning-over","slug":"neural-unification-for-logic-reasoning-over","title":"Neural Unification for Logic Reasoning over Natural Language","date":"2021-09-17","arxiv_id":"2109.08460","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-unification-for-logic-reasoning-over#ran","syntology_url":"https://syntology.ai/paper/2109.08460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08460"}},"official":{"repos":["ibm/neural_unification_for_logic_reasoning_over_language"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/minif2f-a-cross-system-benchmark-for-formal","slug":"minif2f-a-cross-system-benchmark-for-formal","title":"MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics","date":"2021-08-31","arxiv_id":"2109.00110","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/minif2f-a-cross-system-benchmark-for-formal#ran","syntology_url":"https://syntology.ai/paper/2109.00110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00110"}},"official":{"repos":["openai/minif2f"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/naturalproofs-mathematical-theorem-proving-in","slug":"naturalproofs-mathematical-theorem-proving-in","title":"NaturalProofs: Mathematical Theorem Proving in Natural Language","date":"2021-03-24","arxiv_id":"2104.01112","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/naturalproofs-mathematical-theorem-proving-in#ran","syntology_url":"https://syntology.ai/paper/2104.01112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01112"}},"official":{"repos":["wellecks/naturalproofs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/proof-artifact-co-training-for-theorem","slug":"proof-artifact-co-training-for-theorem","title":"Proof Artifact Co-training for Theorem Proving with Language Models","date":"2021-02-11","arxiv_id":"2102.06203","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/proof-artifact-co-training-for-theorem#ran","syntology_url":"https://syntology.ai/paper/2102.06203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06203"}},"official":{"repos":["jasonrute/lean-proof-recording-public","jasonrute/lean_proof_recording","jesse-michael-han/lean-step-public"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/measuring-systematic-generalization-in-neural","slug":"measuring-systematic-generalization-in-neural","title":"Measuring Systematic Generalization in Neural Proof Generation with Transformers","date":"2020-09-30","arxiv_id":"2009.14786","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/measuring-systematic-generalization-in-neural#ran","syntology_url":"https://syntology.ai/paper/2009.14786","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14786"}},"official":{"repos":["NicolasAG/SGinPG"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/int-an-inequality-benchmark-for-evaluating","slug":"int-an-inequality-benchmark-for-evaluating","title":"INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving","date":"2020-07-06","arxiv_id":"2007.02924","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/int-an-inequality-benchmark-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2007.02924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02924"}},"official":{"repos":["albertqjiang/INT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/logical-neural-networks","slug":"logical-neural-networks","title":"Logical Neural Networks","date":"2020-06-23","arxiv_id":"2006.13155","repositories_listed":2,"syntology":{"n":15,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":13,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/logical-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.13155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13155"}},"official":{"repos":["IBM/LNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/logical-inferences-with-comparatives-and","slug":"logical-inferences-with-comparatives-and","title":"Logical Inferences with Comparatives and Generalized Quantifiers","date":"2020-05-16","arxiv_id":"2005.07954","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":1,"n_ran_checked":4,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":3,"n_no_contract":1,"n_pointer_only":9,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 3 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/logical-inferences-with-comparatives-and#ran","syntology_url":"https://syntology.ai/paper/2005.07954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07954"}},"official":{"repos":["izumi-h/ccgcomp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-prove-theorems-by-learning-to-1","slug":"learning-to-prove-theorems-by-learning-to-1","title":"Learning to Prove Theorems by Learning to Generate Theorems","date":"2020-02-17","arxiv_id":"2002.07019","repositories_listed":2,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-to-prove-theorems-by-learning-to-1#ran","syntology_url":"https://syntology.ai/paper/2002.07019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07019"}},"official":{"repos":["princeton-vl/MetaGen"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-graph-neural-network","slug":"improving-graph-neural-network","title":"Improving Graph Neural Network Representations of Logical Formulae with Subgraph Pooling","date":"2019-11-15","arxiv_id":"1911.06904","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/1911.06904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06904"}},"official":null}},{"url":"/paper/g2sat-learning-to-generate-sat-formulas","slug":"g2sat-learning-to-generate-sat-formulas","title":"G2SAT: Learning to Generate SAT Formulas","date":"2019-10-29","arxiv_id":"1910.13445","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/g2sat-learning-to-generate-sat-formulas#ran","syntology_url":"https://syntology.ai/paper/1910.13445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13445"}},"official":null}},{"url":"/paper/gamepad-a-learning-environment-for-theorem","slug":"gamepad-a-learning-environment-for-theorem","title":"GamePad: A Learning Environment for Theorem Proving","date":"2018-06-02","arxiv_id":"1806.00608","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gamepad-a-learning-environment-for-theorem#ran","syntology_url":"https://syntology.ai/paper/1806.00608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.00608"}},"official":{"repos":["ml4tp/gamepad"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/premise-selection-for-theorem-proving-by-deep","slug":"premise-selection-for-theorem-proving-by-deep","title":"Premise Selection for Theorem Proving by Deep Graph Embedding","date":"2017-09-28","arxiv_id":"1709.09994","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/premise-selection-for-theorem-proving-by-deep#ran","syntology_url":"https://syntology.ai/paper/1709.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.09994"}},"official":{"repos":["princeton-vl/FormulaNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/holophrasm-a-neural-automated-theorem-prover","slug":"holophrasm-a-neural-automated-theorem-prover","title":"Holophrasm: a neural Automated Theorem Prover for higher-order logic","date":"2016-08-08","arxiv_id":"1608.02644","repositories_listed":4,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/holophrasm-a-neural-automated-theorem-prover#ran","syntology_url":"https://syntology.ai/paper/1608.02644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.02644"}},"official":{"repos":["dwhalen/holophrasm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}}],"record_sha256":"75d4a0986973da4432b6cd3a50cb9a605dd58141cbf364e842c2cdf3594c8211","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}