Abstract
AbstractTo achieve the best performance, automatic theorem provers often rely on schedules of diverse proving strategies to be tried out (either sequentially or in parallel) on a given problem. In this paper, we report on a large-scale experiment with discovering strategies for the Vampire prover, targeting the FOF fragment of the TPTP library and constructing a schedule for it, based on the ideas of Andrei Voronkov’s system Spider. We examine the process from various angles, discuss the difficulty (or ease) of obtaining a strong Vampire schedule for the CASC competition, and establish how well a schedule can be expected to generalize to unseen problems and what factors influence this property.
Publisher
Springer Nature Switzerland
Reference36 articles.
1. Bártek, F., Chvalovský, K., Suda, M.: Regularization in spider-style strategy discovery and schedule construction (2024). https://doi.org/10.48550/arXiv.2403.12869
2. Bártek, F., Suda, M.: Vampire strategy performance measurements (2024). https://doi.org/10.5281/zenodo.10814478
3. Chvátal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233–235 (1979). https://doi.org/10.1287/moor.4.3.233
4. Gottlob, G., Sutcliffe, G., Voronkov, A. (eds.): Global Conference on Artificial Intelligence, GCAI 2015, Tbilis, 16–19 October 2015, EPiC Series in Computing, vol. 36. EasyChair (2015). https://easychair.org/publications/volume/GCAI_2015
5. Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2023). https://www.gurobi.com