Playing with AVATAR

@inproceedings{Reger2015PlayingWA,
  title={Playing with AVATAR},
  author={Giles Reger and M. Suda and Andrei Voronkov},
  booktitle={CADE},
  year={2015}
}
Modern first-order resolution and superposition theorem provers use saturation algorithms to search for a refutation in clauses derivable from the input clauses. On hard problems, this search space often grows rapidly and performance degrades especially fast when long and heavy clauses are generated. 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. This reduces… 

The Uses of SAT Solvers in Vampire

TLDR
An overview of the different ways in which SAT solvers are utilised within Vampire is given and ways inWhich this usage could be extended are discussed.

Unifying Splitting

TLDR
A unifying framework is presented that extends a saturation calculus with splitting and that embeds the result in a prover guided by a SAT solver, and allows us to study locking, a subsumption-like mechanism based on the current propositional model.

Light-Weight Integration of SAT Solving into First-Order Reasoners – First Experiments

We describe a light-weight integration of the propositional SAT solver PicoSAT and the saturationbased superposition prover E. The proof search is driven by the saturation prover. Periodically, the

Selecting the Selection

TLDR
The notion of lookahead selection is introduced that estimates looks ahead the effect of selecting a particular literal on the number of immediate children of the given clause and selects to minimize this value.

A Unifying Splitting Framework

TLDR
A unifying framework is presented that extends a saturation calculus with splitting and embeds the result in a prover guided by a SAT solver, and allows us to study locking, a subsumption-like mechanism based on the current propositional model.

AVATAR Modulo Theories

TLDR
The AVATAR approach is extended to use an SMT solver in place of a SAT solver, with the effect that the first-order solver only needs to consider ground-theory-consistent sub-problems.

New Techniques for Higher-Order Superposition

TLDR
Techniques that address the need for new heuristics to curb the explosion of specific higher-order rules in the Zipperposition theorem prover are described.

Cooperating Proof Attempts

TLDR
Experimental results, using hard problems from the TPTP library, show that interleaving can lead to problems being solved more quickly, and that sharing the SAT solver can leadto new problems being solving by the combined strategies that were never solved individually by any existing theorem prover.

Making Higher-Order Superposition Work

TLDR
Techniques that address issues such as infinitely branching inference rules, new possibilities such as reasoning about formulas, and the need to curb the explosion of specific higher-order rules are described and extensively evaluated in the Zipperposition theorem prover.

Layered Clause Selection for Saturation-Based Theorem Proving

TLDR
This work investigates a recently developed layered clause selection framework in depth and introduces three new features for clause selection (tracking relatedness to the goal, the number of split dependencies in the Avatar architecture, and closeness to the Horn fragment), and presents an evaluation of these new clause-selection strategies and their combinations over the TPTP and SMTLIB libraries.

References

SHOWING 1-10 OF 10 REFERENCES

AVATAR: The Architecture for First-Order Theorem Provers

TLDR
AVATAR is an important step towards efficient reasoning with both quantifiers and theories, which is one of the key areas in modern applications of theorem provers in program analysis and verification.

Limited resource strategy in resolution theorem proving

The 481 Ways to Split a Clause and Deal with Propositional Variables

TLDR
This paper tried to identify essential issues contributing to efficiency in dealing with splitting in resolution theorem provers and enhanced the theorem prover Vampire with new options, algorithms and datastructures deals with splitting.

The design and implementation of VAMPIRE

TLDR
This article describes VAMPIRE: a high-performance theorem prover for first-order logic and focuses on the design of the system and some key implementation features.

Resolution Theorem Proving

Evaluating general purpose automated theorem proving systems

The TPTP Problem Library and Associated Infrastructure

  • G. Sutcliffe
  • Computer Science
    Journal of Automated Reasoning
  • 2009
This paper describes the First-Order Form (FOF) and Clause Normal Form (CNF) parts of the TPTP problem library, and the associated infrastructure. TPTP v3.5.0 was the last release containing only FOF

Combining Superposition, Sorts and Splitting

An Extensible SAT-solver

TLDR
This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints.

Splitting Without Backtracking