Subsumption Demodulation in First-Order Theorem Proving
Paper i proceeding, 2020

Motivated by applications of first-order theorem proving to software analysis, we introduce a new inference rule, called subsumption demodulation, to improve support for reasoning with conditional equalities in superposition-based theorem proving. We show that subsumption demodulation is a simplification rule that does not require radical changes to the underlying superposition calculus. We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component. Our experiments, using the TPTP and SMT-LIB repositories, show that subsumption demodulation in Vampire can solve many new problems that could so far not be solved by state-of-the-art reasoners.


B. Gleiss

Technische Universität Wien

Laura Kovacs

Chalmers, Data- och informationsteknik, Formella metoder

Technische Universität Wien

Jakob Rath

Technische Universität Wien

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 12166 LNAI 297-315

10th International Joint Conference on Automated Reasoning, IJCAR 2020
Virtual, Online, ,



Datavetenskap (datalogi)




Mer information

Senast uppdaterat