Exploiting instantiations from paramodulation proofs in Isabelle/HOL

  • Metis is an ordered paramodulation prover built into the Isabelle/HOL proof assistant. It attempts to close the current goal using a given list of lemmas. Typically these lemmas are found by Sledgehammer, a tool that integrates external automatic provers. We present a new tool that analyzes successful Metis proofs to derive variable instantiations. These increase Sledgehammer’s success rate, improve the speed of Sledgehammer-generated proofs, and help users understand why a goal follows from the lemmas.

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Lukas BartlORCiDGND, Jasmin BlanchetteORCiD, Tobias NipkowORCiD
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/126705
URL:https://dl.acm.org/doi/10.1007/978-3-031-99984-0_30
ISBN:978-3-031-99983-3OPAC
Parent Title (English):Automated Deduction – CADE 30: 30th International Conference on Automated Deduction, Stuttgart, Germany, July 28-31, 2025, proceedings
Publisher:Springer
Place of publication:Berlin
Editor:Clark Barrett, Uwe Waldmann
Type:Conference Proceeding
Language:English
Date of Publication (online):2025/12/02
Year of first Publication:2025
Publishing Institution:Universität Augsburg
Release Date:2025/12/09
First Page:573
Last Page:593
Series:Lecture Notes in Computer Science
DOI:https://doi.org/10.1007/978-3-031-99984-0_30
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Theorie verteilter und paralleler Systeme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Latest Publications (not yet published in print):Aktuelle Publikationen (noch nicht gedruckt erschienen)
Licence (German):CC-BY 4.0: Creative Commons: Namensnennung