{"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/3","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,288],"of":288,"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","prev":"/task/automated-theorem-proving/papers/2","next":null,"papers":[{"url":null,"slug":"selection-strategies-for-commonsense","title":"Selection Strategies for Commonsense Knowledge","date":"2022-02-18","arxiv_id":"2202.09163","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-the-string-landscape-to-the-mathematical","title":"From the String Landscape to the Mathematical Landscape: a Machine-Learning Outlook","date":"2022-02-12","arxiv_id":"2202.06086","repositories_listed":0,"syntology":null},{"url":null,"slug":"vehicle-interfacing-neural-network-verifiers","title":"Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers","date":"2022-02-10","arxiv_id":"2202.05207","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-10th-international-workshop-on","title":"Proceedings 10th International Workshop on Theorem Proving Components for Educational Software","date":"2022-02-02","arxiv_id":"2202.02144","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-of-the-13th-international-9","title":"Proceedings of the 13th International Conference on Automated Deduction in Geometry","date":"2021-12-28","arxiv_id":"2112.14770","repositories_listed":0,"syntology":null},{"url":null,"slug":"proving-theorems-using-incremental-learning-1","title":"Proving Theorems using Incremental Learning and Hindsight Experience Replay","date":"2021-12-20","arxiv_id":"2112.10664","repositories_listed":0,"syntology":null},{"url":null,"slug":"logically-sound-arguments-for-the","title":"Logically Sound Arguments for the Effectiveness of ML Safety Measures","date":"2021-11-04","arxiv_id":"2111.02649","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-second-order-quantifier-elimination","title":"Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof","date":"2021-10-21","arxiv_id":"2110.11108","repositories_listed":0,"syntology":null},{"url":null,"slug":"proof-extraction-for-logical-neural-networks","title":"Proof Extraction for Logical Neural Networks","date":"2021-10-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-algebra-with-transformers","title":"Linear algebra with transformers","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-37th-international-conference-on","title":"Proceedings 37th International Conference on Logic Programming (Technical Communications)","date":"2021-09-15","arxiv_id":"2109.07914","repositories_listed":0,"syntology":null},{"url":null,"slug":"conjectures-tests-and-proofs-an-overview-of","title":"Conjectures, Tests and Proofs: An Overview of Theory Exploration","date":"2021-09-07","arxiv_id":"2109.03721","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-horn-non-clausal-class-and-its","title":"The Horn Non-Clausal Class and its Polynomiality","date":"2021-08-31","arxiv_id":"2108.13744","repositories_listed":0,"syntology":null},{"url":"/paper/graph-contrastive-pre-training-for-effective","slug":"graph-contrastive-pre-training-for-effective","title":"Graph Contrastive Pre-training for Effective Theorem Reasoning","date":"2021-08-24","arxiv_id":"2108.10821","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-guide-a-saturation-based-theorem","title":"Learning to Guide a Saturation-Based Theorem Prover","date":"2021-06-07","arxiv_id":"2106.03906","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-role-of-entropy-in-guiding-a-connection","title":"The Role of Entropy in Guiding a Connection Prover","date":"2021-05-31","arxiv_id":"2105.14706","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-a-first-order-theorem-prover-from","title":"Training a First-Order Theorem Prover from Synthetic Data","date":"2021-03-05","arxiv_id":"2103.03798","repositories_listed":0,"syntology":null},{"url":null,"slug":"tacticzero-learning-to-prove-theorems-from","title":"TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement Learning","date":"2021-02-19","arxiv_id":"2102.09756","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-equational-theorem-proving","title":"Learning Equational Theorem Proving","date":"2021-02-10","arxiv_id":"2102.05547","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-continuous-vector","title":"A Study of Continuous Vector Representationsfor Theorem Proving","date":"2021-01-22","arxiv_id":"2101.09142","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-curious-new-result-of-resolution-strategies","title":"A Curious New Result of Resolution Strategies in Negation-Limited Inverters Problem","date":"2020-11-02","arxiv_id":"2011.00775","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-9th-international-workshop-on","title":"Proceedings 9th International Workshop on Theorem Proving Components for Educational Software","date":"2020-10-28","arxiv_id":"2010.15832","repositories_listed":0,"syntology":null},{"url":null,"slug":"deriving-theorems-in-implicational-linear","title":"Deriving Theorems in Implicational Linear Logic, Declaratively","date":"2020-09-22","arxiv_id":"2009.10241","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-36th-international-conference-on","title":"Proceedings 36th International Conference on Logic Programming (Technical Communications)","date":"2020-09-19","arxiv_id":"2009.09158","repositories_listed":0,"syntology":null},{"url":"/paper/generative-language-modeling-for-automated","slug":"generative-language-modeling-for-automated","title":"Generative Language Modeling for Automated Theorem Proving","date":"2020-09-07","arxiv_id":"2009.03393","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoding-legal-balancing-automating-an","title":"Modelling Value-oriented Legal Reasoning in LogiKEy","date":"2020-06-23","arxiv_id":"2006.12789","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-prove-from-synthetic-theorems","title":"Learning to Prove from Synthetic Theorems","date":"2020-06-19","arxiv_id":"2006.11259","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-united-reasoning-for-automatic","title":"Towards United Reasoning for Automatic Induction in Isabelle/HOL","date":"2020-05-25","arxiv_id":"2005.12737","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-concise-machine-discovered-proofs-of","title":"Towards Concise, Machine-discovered Proofs of Gödel's Two Incompleteness Theorems","date":"2020-05-06","arxiv_id":"2005.02576","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-dataset-for-proof-method","title":"Simple Dataset for Proof Method Recommendation in Isabelle/HOL (Dataset Description)","date":"2020-04-21","arxiv_id":"2004.10667","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-geometry-automated-provers","title":"Towards a Geometry Automated Provers Competition","date":"2020-02-28","arxiv_id":"2002.12556","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-8th-international-workshop-on","title":"Proceedings 8th International Workshop on Theorem Proving Components for Educational Software","date":"2020-02-27","arxiv_id":"2002.11895","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-experimental-study-of-formula-embeddings","title":"An Experimental Study of Formula Embeddings for Automated Theorem Proving in First-Order Logic","date":"2020-02-02","arxiv_id":"2002.00423","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-quantified-modal-theorem-proving-for","title":"On Quantified Modal Theorem Proving for Modeling Ethics","date":"2019-12-30","arxiv_id":"1912.12959","repositories_listed":0,"syntology":null},{"url":null,"slug":"property-invariant-embedding-for-automated","title":"Property Invariant Embedding for Automated Reasoning","date":"2019-11-27","arxiv_id":"1911.12073","repositories_listed":0,"syntology":null},{"url":null,"slug":"csplib-twenty-years-on","title":"CSPLib: Twenty Years On","date":"2019-09-30","arxiv_id":"1909.13430","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-35th-international-conference-on","title":"Proceedings 35th International Conference on Logic Programming (Technical Communications)","date":"2019-09-17","arxiv_id":"1909.07646","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-game-of-theorems","title":"Designing Game of Theorems","date":"2019-06-20","arxiv_id":"1906.08549","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-logical-inference-system-for","title":"Multimodal Logical Inference System for Visual-Textual Entailment","date":"2019-06-10","arxiv_id":"1906.03952","repositories_listed":0,"syntology":null},{"url":null,"slug":"nil-learning-nonlinear-interpolants","title":"NIL: Learning Nonlinear Interpolants","date":"2019-05-28","arxiv_id":"1905.11625","repositories_listed":0,"syntology":null},{"url":"/paper/learning-to-reason-in-large-theories-without","slug":"learning-to-reason-in-large-theories-without","title":"Learning to Reason in Large Theories without Imitation","date":"2019-05-25","arxiv_id":"1905.10501","repositories_listed":0,"syntology":null},{"url":"/paper/graph-representations-for-higher-order-logic","slug":"graph-representations-for-higher-order-logic","title":"Graph Representations for Higher-Order Logic and Theorem Proving","date":"2019-05-24","arxiv_id":"1905.10006","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-neural-theorem-proving-on-knowledge","title":"Scalable Neural Theorem Proving on Knowledge Bases and Natural Language","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-evolutionary-theorem-proving-for","title":"Towards Evolutionary Theorem Proving for Isabelle/HOL","date":"2019-04-17","arxiv_id":"1904.08468","repositories_listed":0,"syntology":null},{"url":null,"slug":"hammering-mizar-by-learning-clause-guidance","title":"Hammering Mizar by Learning Clause Guidance","date":"2019-04-02","arxiv_id":"1904.01677","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-7th-international-workshop-on","title":"Proceedings 7th International Workshop on Theorem proving components for Educational software","date":"2019-03-29","arxiv_id":"1903.12402","repositories_listed":0,"syntology":null},{"url":null,"slug":"enigma-ng-efficient-neural-and-gradient","title":"ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E","date":"2019-03-07","arxiv_id":"1903.03182","repositories_listed":0,"syntology":null},{"url":null,"slug":"review-on-dna-strand-algebra-and-its","title":"Review on DNA Strand Algebra and its Application","date":"2019-03-04","arxiv_id":"1903.04260","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-machine-learning-mathematical","title":"Towards Machine Learning Induction","date":"2018-12-04","arxiv_id":"1812.04088","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-theorem-proving-in-intuitionistic","title":"Automated Theorem Proving in Intuitionistic Propositional Logic by Deep Reinforcement Learning","date":"2018-11-02","arxiv_id":"1811.00796","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-reason","title":"Learning to Reason","date":"2018-10-12","arxiv_id":"1810.05315","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-rule-induction-and-theory-learning","title":"Logical Rule Induction and Theory Learning Using Neural Theorem Proving","date":"2018-09-06","arxiv_id":"1809.02193","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-neural-theorem-proving-at-scale","title":"Towards Neural Theorem Proving at Scale","date":"2018-07-21","arxiv_id":"1807.08204","repositories_listed":0,"syntology":null},{"url":null,"slug":"ml-fv-heartsuit-a-survey-on-the-application","title":"ML + FV = $\\heartsuit$? A Survey on the Application of Machine Learning to Formal Verification","date":"2018-06-10","arxiv_id":"1806.03600","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-of-theorem-proving","title":"Reinforcement Learning of Theorem Proving","date":"2018-05-19","arxiv_id":"1805.07563","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-checking-wordnet-and-sumo-using","title":"Cross-checking WordNet and SUMO Using Meronymy","date":"2018-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-ccg-parsing-over-multiple","title":"Consistent CCG Parsing over Multiple Sentences for Improved Logical Reasoning","date":"2018-04-19","arxiv_id":"1804.07068","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-qed-tutrix-by-automating-the","title":"Improving QED-Tutrix by Automating the Generation of Proofs","date":"2018-03-05","arxiv_id":"1803.01468","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-6th-international-workshop-on","title":"Proceedings 6th International Workshop on Theorem proving components for Educational software","date":"2018-03-02","arxiv_id":"1803.00722","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-neural-networks-that-learn-to","title":"Artificial Neural Networks that Learn to Satisfy Logic Constraints","date":"2017-12-08","arxiv_id":"1712.03049","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-of-the-fifth-workshop-on-proof","title":"Proceedings of the Fifth Workshop on Proof eXchange for Theorem Proving","date":"2017-12-04","arxiv_id":"1712.00898","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-intelligent-tutoring-for","title":"Interactive, Intelligent Tutoring for Auxiliary Constructions in Geometry Proofs","date":"2017-11-20","arxiv_id":"1711.07154","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-an-automata-approach-to-query","title":"Evaluating an Automata Approach to Query Containment","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-computer-algebra-theorem-proving-and","title":"Robust Computer Algebra, Theorem Proving, and Oracle AI","date":"2017-08-08","arxiv_id":"1708.02553","repositories_listed":0,"syntology":null},{"url":null,"slug":"count-invariance-including-exponentials","title":"Count-Invariance Including Exponentials","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cover-covering-the-semantically-tractable","title":"COVER: Covering the Semantically Tractable Questions","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"theorem-proving-based-on-semantics-of-dna","title":"Theorem Proving Based on Semantics of DNA Strand Graph","date":"2017-02-15","arxiv_id":"1702.05383","repositories_listed":0,"syntology":null},{"url":null,"slug":"jscoq-towards-hybrid-theorem-proving","title":"jsCoq: Towards Hybrid Theorem Proving Interfaces","date":"2017-01-25","arxiv_id":"1701.07125","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-parsing-of-mathematics-by-context","title":"Semantic Parsing of Mathematics by Context-based Learning from Aligned Corpora and Theorem Proving","date":"2016-11-29","arxiv_id":"1611.09703","repositories_listed":0,"syntology":null},{"url":null,"slug":"blocking-and-other-enhancements-for-bottom-up","title":"Blocking and Other Enhancements for Bottom-Up Model Generation Methods","date":"2016-11-28","arxiv_id":"1611.09014","repositories_listed":0,"syntology":null},{"url":null,"slug":"blistrtune-hierarchical-invention-of-theorem","title":"BliStrTune: Hierarchical Invention of Theorem Proving Strategies","date":"2016-11-26","arxiv_id":"1611.08733","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-connection-prover","title":"Monte Carlo Tableau Proof Search","date":"2016-11-18","arxiv_id":"1611.05990","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepalgebra-an-outline-of-a-program","title":"DeepAlgebra - an outline of a program","date":"2016-10-04","arxiv_id":"1610.01044","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-network-processes-in-the-isabelle-and","title":"Social Network Processes in the Isabelle and Coq Theorem Proving Communities","date":"2016-09-22","arxiv_id":"1609.07127","repositories_listed":0,"syntology":null},{"url":null,"slug":"verifier-theory-and-unverifiability","title":"Verifier Theory and Unverifiability","date":"2016-09-01","arxiv_id":"1609.00331","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-solution-to-fracas-entailment","title":"Natural Solution to FraCaS Entailment Problems","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-higher-order-goals-from-the-mizar","title":"Extracting Higher-Order Goals from the Mizar Mathematical Library","date":"2016-05-23","arxiv_id":"1605.06996","repositories_listed":0,"syntology":null},{"url":null,"slug":"geogebra-tools-with-proof-capabilities","title":"GeoGebra Tools with Proof Capabilities","date":"2016-03-03","arxiv_id":"1603.01228","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-algorithms-and-partial-algorithms","title":"Analysis of Algorithms and Partial Algorithms","date":"2016-01-13","arxiv_id":"1601.03411","repositories_listed":0,"syntology":null},{"url":null,"slug":"rare-speed-up-in-automatic-theorem-proving","title":"Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value","date":"2015-06-14","arxiv_id":"1506.04349","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-formal-fault-tree-analysis-using","title":"Towards Formal Fault Tree Analysis using Theorem Proving","date":"2015-05-08","arxiv_id":"1505.02648","repositories_listed":0,"syntology":null},{"url":null,"slug":"graatp-a-graph-theoretic-approach-for","title":"GraATP: A Graph Theoretic Approach for Automated Theorem Proving in Plane Geometry","date":"2014-12-18","arxiv_id":"1412.5980","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-guarantees-for-schatten-p-quasi","title":"Performance Guarantees for Schatten-$p$ Quasi-Norm Minimization in Recovery of Low-Rank Matrices","date":"2014-07-14","arxiv_id":"1407.3716","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-assisted-theorem-proving-with","title":"Learning-assisted Theorem Proving with Millions of Lemmas","date":"2014-02-11","arxiv_id":"1402.3578","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learner-for-automated-reasoning-04","title":"Machine Learner for Automated Reasoning 0.4 and 0.5","date":"2014-02-11","arxiv_id":"1402.2359","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-state-vector-algebra-for-algorithmic","title":"A state vector algebra for algorithmic implementation of second-order logic","date":"2013-12-09","arxiv_id":"1312.2551","repositories_listed":0,"syntology":null},{"url":null,"slug":"read-eval-print-in-parallel-and-asynchronous","title":"READ-EVAL-PRINT in Parallel and Asynchronous Proof-checking","date":"2013-07-08","arxiv_id":"1307.1944","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-in-owl-2-without-restrictions","title":"Modeling in OWL 2 without Restrictions","date":"2012-12-12","arxiv_id":"1212.2902","repositories_listed":0,"syntology":null}],"record_sha256":"0e5475f578b562877f78f429280314ef15c0da8bcaeab40db86d1f68e0b1833a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}