Interactive Visualization of Saturation Attempts in Vampire

01/13/2020
by   Bernhard Gleiss, et al.
0

Many applications of formal methods require automated reasoning about system properties, such as system safety and security. To improve the performance of automated reasoning engines, such as SAT/SMT solvers and first-order theorem prover, it is necessary to understand both the successful and failing attempts of these engines towards producing formal certificates, such as logical proofs and/or models. Such an analysis is challenging due to the large number of logical formulas generated during proof/model search. In this paper we focus on saturation-based first-order theorem proving and introduce the SATVIS tool for interactively visualizing saturation-based proof attempts in first-order theorem proving. We build SATVIS on top of the world-leading theorem prover VAMPIRE, by interactively visualizing the saturation attempts of VAMPIRE in SATVIS. Our work combines the automatic layout and visualization of the derivation graph induced by the saturation attempt with interactive transformations and search functionality. As a result, we are able to analyze and debug (failed) proof attempts of VAMPIRE. Thanks to its interactive visualisation, we believe SATVIS helps both experts and non-experts in theorem proving to understand first-order proofs and analyze/refine failing proof attempts of first-order provers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2018

Proof Simplification and Automated Theorem Proving

The proofs first generated by automated theorem provers are far from opt...
research
10/21/2022

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

The formalization of existing mathematical proofs is a notoriously diffi...
research
07/05/2019

From LCF to Isabelle/HOL

Interactive theorem provers have developed dramatically over the past fo...
research
08/26/2019

Reconstructing veriT Proofs in Isabelle/HOL

Automated theorem provers are now commonly used within interactive theor...
research
01/28/2020

Subsumption Demodulation in First-Order Theorem Proving

Motivated by applications of first-order theorem proving to software ana...
research
05/10/2015

Automating change of representation for proofs in discrete mathematics

Representation determines how we can reason about a specific problem. So...
research
04/06/2022

Modular pre-processing for automated reasoning in dependent type theory

The power of modern automated theorem provers can be put at the service ...

Please sign up or login with your details

Forgot password? Click here to reset