Lash 1.0 (System Description)

Brown, Chad E.; Kaliszyk, Cezary

doi:10.1007/978-3-031-10769-6_21

Cited by 8 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Possibly the only actively maintained higher-order provers built from the bottom up as higher-order provers are Leo-III [35] and Satallax's [10] successor Lash [11]. A further overview of other traditional higher-order provers and the calculi they are based on can be found in the paper about Ehoh [42, Sect.…”

Section: Discussion and Related Workmentioning

confidence: 99%

Extending a High-Performance Prover to Higher-Order Logic

Vukmirović

Blanchette

Schulz

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Most users of proof assistants want more proof automation. Some proof assistants discharge goals by translating them to first-order logic and invoking an efficient prover on them, but much is lost in translation. Instead, we propose to extend first-order provers with native support for higher-order features. Building on our extension of E to $$\lambda $$ λ -free higher-order logic, we extend E to full higher-order logic. The result is the strongest prover on benchmarks exported from a proof assistant.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Extending a High-Performance Prover to Higher-Order Logic

Vukmirović

Blanchette

Schulz

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We propose several problems in DHOL that include choice and experiment with the performance of the erasure on these problems. For the experiments, a modified version of Lash [4,7] was run on the listed problems, once with each kind of erasure, for 90s.…”

Section: Experimental Problems and Resultsmentioning

confidence: 99%

“…Choice is therefore interesting to automated reasoning too, as illustrated by the successes of Satallax [1,3]. This suggests that DHOL-capable theorem provers like Lash [4,7] will eventually benefit greatly from the availability of choice. Contributions: We provide the necessary groundwork for such future work by extending DHOL with an indefinite choice operator ε and the corresponding additions to the translation.…”

Section: Introductionmentioning

confidence: 99%

Experiments with Choice in Dependently-Typed Higher-Order Logic

Ranalter,

Brown,

Kaliszyk

EPiC Series in Computing

View full text Add to dashboard Cite

Recently an extension to higher-order logic — called DHOL — was introduced, enrich- ing the language with dependent types, and creating a powerful extensional type theory. In this paper we propose two ways how choice can be added to DHOL. We extend the DHOL term structure by Hilbert’s indefinite choice operator ε, define a translation of the choice terms to HOL choice that extends the existing translation from DHOL to HOL and show that the extension of the translation is complete and give an argument for soundness. We finally evaluate the extended translation on a set of dependent HOL problems that require choice.

show abstract

“…By inputting a set of benchmark problems, Grackle autonomously invents a diverse set of solver strategies to tackle as many of these problems as possible. It currently integrates various solvers, such as ATP solvers E [15], Vampire [10], Lash [3], and SMT solvers Bitwuzla [14] and cvc5 [2]. Adding support for additional solvers is straightforward: users just need to specify solver strategy parameters and implement a basic wrapper for solver execution.…”

Section: Prover9 and Its Proof Search Optionsmentioning

confidence: 99%

“…The space covers approximately 10 47 different strategies, and further details can be investigated in the source code. 3 Given clause selection options control how the given clause is selected from the set of support. The default space already contains parameters for clause selection (age_part, .…”

Section: Grackle Strategy Space For Prover9mentioning

confidence: 99%

Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery

Aleksandrova,

Jakubuv,

Kaliszyk

EPiC Series in Computing

View full text Add to dashboard Cite

While many of the state-of-art Automated Theorem Provers (ATP) like E and Vampire, were subject to extensive tuning of strategy schedules in the last decade, the classical ATP prover Prover9 has never been optimized in this direction. Both E and Vampire provide the user with an automatic mode to select good proof search strategies based on the properties of the input problem, while Prover9 provides by default only a relatively weak auto mode. Interestingly, Prover9 provides more varied means for proof control than its competitors. These means, however, must be manually investigated and that is possible only by experienced Prover9 users with a good understanding of how Prover9 works.In this paper, we investigate the possibilities of automatic configuration of Prover9 for user-specified benchmark problems. We employ the automated strategy invention system Grackle to generate Prover9 strategies with both basic and advanced proof search options which require sophisticated strategy space features for Grackle. We test the strategy invention on AIM train/test problem collection and we show that Prover9 can outperform both E and Vampire on these problems. To test the generality of our approach we train and evaluate strategies also on TPTP problems, showing that Prover9 can achieve reasonable complementarity with other ATPs.

show abstract

Lash 1.0 (System Description)

Cited by 8 publications

References 13 publications

Extending a High-Performance Prover to Higher-Order Logic

Extending a High-Performance Prover to Higher-Order Logic

Experiments with Choice in Dependently-Typed Higher-Order Logic

Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery

Contact Info

Product

Resources

About