Filters








1,135 Hits in 3.0 sec

EPiC Series in Computing SAT Solving Experiments in Vampire *

Armin Biere, Ioan Dragan, Laura Kovács, Andrei Voronkov
2014 EPiC Series in Computing   unpublished
Our experiments show that by using a state of the art SAT solver in Vampire we manage to solve more problems.  ...  In this paper we propose two ways of integrating a SAT solver inside of Vampire and evaluate overall performance of this combination.  ...  Our experiments show that in general using a state of the art SAT solver for guiding the splitting process in AVATAR proves to perform better with regard to number of solved problems.  ... 
fatcat:mq3z63y55ncevhk7zbewhman4m

AVATAR: The Architecture for First-Order Theorem Provers [chapter]

Andrei Voronkov
2014 Lecture Notes in Computer Science  
Nearly all problems solved with one of 481 variants of splitting previously implemented in Vampire can also be solved with AVATAR.  ...  Its implementation in our theorem prover Vampire resulted in drastic improvements over all previous implementations of splitting.  ...  This alternative is not yet implemented in Vampire and requires further experiments.  ... 
doi:10.1007/978-3-319-08867-9_46 fatcat:jpi5e5ag4nbyxljltjtgxf55na

Playing with AVATAR [chapter]

Giles Reger, Martin Suda, Andrei Voronkov
2015 Lecture Notes in Computer Science  
This paper considers the new AVATAR (Advanced Vampire Architecture for Theories And Resolution) approach to splitting which places a SAT (or SMT) solver at the centre of the theorem prover and uses it  ...  One approach that has proved successful in taming the search space is splitting where clauses are split into components with disjoint variables and the components are asserted in turn.  ...  We only include problems in our experiment that we know are solvable by some prover, e.g., Vampire.  ... 
doi:10.1007/978-3-319-21401-6_28 fatcat:qelxxzlrvbhjlmsujj6vxbewwu

Bound Propagation for Arithmetic Reasoning in Vampire

Ioan Dragan, Konstantin Korovin, Laura Kovacs, Andrei Voronkov
2013 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
The implementation is part of the first-order theorem prover Vampire. The input problems are systems of linear inequalities over reals or rationals.  ...  This paper describes an implementation and experimental evaluation of a recently introduced bound propagation method for solving systems of linear inequalities over the reals and rationals.  ...  We describe how bound propagation is implemented and used in Vampire for solving systems of linear inequalities. Also we made an overview of options we have implemented.  ... 
doi:10.1109/synasc.2013.30 dblp:conf/synasc/DraganKKV13 fatcat:ddaewur2hrayfcytrvh4rkuxuu

Testing a Saturation-Based Theorem Prover: Experiences and Challenges [chapter]

Giles Reger, Martin Suda, Andrei Voronkov
2017 Lecture Notes in Computer Science  
This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience with developing the theorem prover Vampire.  ...  We describe the techniques we currently employ to ensure that Vampire is correct and use this to motivate future challenges that need to be addressed to make this process more straightforward and to achieve  ...  -SAT and SMT solving. Vampire makes use of SAT and SMT solvers in various ways (see [18] ).  ... 
doi:10.1007/978-3-319-61467-0_10 fatcat:x7cutte3jrb6tijcmyozrkjysq

Subsumption Demodulation in First-Order Theorem Proving [article]

Bernhard Gleiss, Laura Kovacs, Jakob Rath
2020 arXiv   pre-print
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.  ...  We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component.  ...  In our experiments, we were interested to see whether subsumption demodulation in VAMPIRE can solve problems that cannot be solved by the portfolio mode of VAMPIRE.  ... 
arXiv:2001.10213v1 fatcat:mlqi3hptvnflfchhkhp55w25py

Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Extended Version) [article]

Giles Reger and Martin Suda and Andrei Voronkov
2017 arXiv   pre-print
This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience developing the theorem prover Vampire.  ...  We describe the techniques we currently employ to ensure that Vampire is correct and use this to motivate future challenges that need to be addressed to make this process more straightforward and to achieve  ...  This cannot (in principle) be checked by the described approach and requires a non-trivial extension. SAT and SMT solving. Vampire makes use of SAT and SMT solvers in various ways (see [11] ).  ... 
arXiv:1704.03391v1 fatcat:oq3ex3t2bvhilkvb55aoozwbxa

Subsumption Demodulation in First-Order Theorem Proving [chapter]

Bernhard Gleiss, Laura Kovács, Jakob Rath
2020 Lecture Notes in Computer Science  
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.  ...  We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component.  ...  In our experiments, we were interested to see whether subsumption demodulation in Vampire can solve problems that cannot be solved by the portfolio mode of Vampire.  ... 
doi:10.1007/978-3-030-51074-9_17 fatcat:l3bzolwqqvbb5n2w7vkg2ay7vm

The SMT Competition 2015–2018

Tjark Weber, Sylvain Conchon, David Déharbe, Matthias Heizmann, Aina Niemetz, Giles Reger, Luca Pulina, Martina Seidl
2019 Journal on Satisfiability, Boolean Modeling and Computation  
Internally, many SMT solvers employ SAT solving techniques to deal with the propositional structure of the formula, and combine these with (semi-)decision procedures for the background theories that the  ...  With its rich input language, SMT has applications in software engineering, optimization, and many other areas [23] .  ...  Numbers in parentheses indicate the (rounded) percentage of benchmarks with different statuses, which are (sat/unsat) in 2015 and 2016, and (sat/unsat/unknown) in 2017 and 2018.  ... 
doi:10.3233/sat190123 fatcat:k4tezwrthrcjdl3g25sampbooe

MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers [article]

Daniel Kühlwein, Josef Urban
2014 arXiv   pre-print
This paper describes the tool and the methods used in it, and evaluates its performance on three automated theorem provers: E, LEO-II and Satallax.  ...  An evaluation on a subset of the TPTP library problems shows that on average a MaLeS-tuned prover solves 8.67% more problems than the prover with its default settings.  ...  Table 3 describes the parameters in ATP.ini.  ... 
arXiv:1308.2116v3 fatcat:fi7cxsckafd7fnoq3biacbtple

Finding Finite Models in Multi-Sorted First Order Logic [article]

Giles Reger, Martin Suda, Andrei Voronkov
2016 arXiv   pre-print
Evaluation of an implementation of techniques in the Vampire theorem prover shows that they dramatically reduce the search space and that this is an effective approach to find finite models in multi-sorted  ...  The key approach adds additional information to the SAT encoding to suggest which domains should be grown.  ...  We show how the MACE-style approach (described in Sect. 3) can be extended to the multi-sorted setting via a novel extension of the SAT encoding (Sect. 5).  ... 
arXiv:1604.08040v1 fatcat:3mwe45k45fb5lefbu53sfouupi

Boldly Going Where No Prover Has Gone Before

Giles Reger
2019 Electronic Proceedings in Theoretical Computer Science  
I argue that the most interesting goal facing researchers in automated reasoning is being able to solve problems that cannot currently be solved by existing tools and methods.  ...  When reasoning in a decidable logic there can be a focus on optimising a decision procedure and measuring average solving times.  ...  in competitions (CASC and SMT-COMP) over the last few years (this experiment consists of significantly more than 10 million runs of Vampire).  ... 
doi:10.4204/eptcs.311.6 fatcat:e2mofcpky5birjcdbkpulkeiei

Interactive Visualization of Saturation Attempts in Vampire [chapter]

Bernhard Gleiss, Laura Kovács, Lena Schnedlitz
2019 Lecture Notes in Computer Science  
We build SATVIS on top of the world-leading theorem prover VAMPIRE, by interactively visualizing the saturation attempts of VAMPIRE in SATVIS.  ...  As a result, we are able to analyze and debug (failed) proof attempts of VAMPIRE.  ...  By leveraging the best practices in first-order theorem proving in combination with SMT solving, in our recent work [3] we showed that correctness of a software program can be reduced to a validity problem  ... 
doi:10.1007/978-3-030-34968-4_28 fatcat:oqysh5j5znd7jmcffil6u6zqxy

First-Order Theorem Proving and Vampire [chapter]

Laura Kovács, Andrei Voronkov
2013 Lecture Notes in Computer Science  
In this paper we give a short introduction in first-order theorem proving and the use of the theorem prover VAMPIRE.  ...  VAMPIRE.  ...  Finally, recent work on SAT solving and bound propagation is due to Ioan Dragan. We start with an overview of some distinctive features of VAMPIRE. -VAMPIRE is very fast.  ... 
doi:10.1007/978-3-642-39799-8_1 fatcat:bhabf63t35h3fdvmqb23d3w2jq

BoSy: An Experimentation Framework for Bounded Synthesis [article]

Peter Faymonville and Bernd Finkbeiner and Leander Tentrup
2018 arXiv   pre-print
For each bound, the existence of a solution is encoded as a logical constraint solving problem that is solved by an appropriate solver.  ...  BoSy constructs bounded synthesis encodings into SAT, QBF, DQBF, EPR, and SMT, and interfaces to solvers of the corresponding type.  ...  In our experiments, the QBF solvers nevertheless outperform the currently available DQBF solvers.  ... 
arXiv:1803.09566v1 fatcat:l5ul2pov4zeprjzqi7gpteglni
« Previous Showing results 1 — 15 out of 1,135 results