Abstract
This paper introduces a pseudo-concurrent architecture for first-order saturation-based theorem provers with the eventual aim of developing it into a truly concurrent architecture. The motivation behind this architecture is two-fold. Firstly, first-order theorem provers have many configuration parameters and commonly utilise multiple strategies to solve problems. It is also common that one of these strategies will solve the problem quickly but it may have to wait for many other strategies to be tried first. The architecture we propose interleaves the execution of these strategies, increasing the likeliness that these ‘quick’ proofs will be found. Secondly, previous work has established the existence of a synergistic effect when allowing proof attempts to communicate by sharing information about their inferences or clauses. The recently introduced AVATAR approach to splitting uses a SAT solver to explore the clause search space. The new architecture considers sharing this SAT solver between proof attempts, allowing them to share information about pruned areas of the search space, thus preventing them from making unnecessary inferences. 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 lead to new problems being solved by the combined strategies that were never solved individually by any existing theorem prover.
Andrei Voronkov — Partially supported by the EPSRC grant “Reasoning for Verification and Security".
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
A list of the selected problems, the executable of our prover, and the results of the experiments are available from http://vprover.org.
References
Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, Chap. 2, pp. 19–99. Elsevier Science, Amsterdam (2001)
Böhme, S., Nipkow, T.: Sledgehammer: judgement day. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 107–121. Springer, Heidelberg (2010)
Bonacina, M.: A taxonomy of parallel strategies for deduction. Ann. Math. Artif. Intell. 29(1–4), 223–257 (2000)
Denzinger, J., Kronenburg., M.: Planning for distributed theorem proving: the teamwork approach. In: Görz, G., Hölldobler, S. (eds.) KI 1996. LNCS, vol. 1137. Springer, Heidelberg (1996)
Denzinger, J., Kronenburg, M., Schulz, S.: DISCOUNT – a distributed and learning equational prover. J. Autom. Reasoning 18(2), 189–198 (1997)
Ganzinger, H., Korovin, K.: New directions in instantiation-based theorem proving. In: Proceedings of LICS 2003, pp. 55–64 (2003)
Hoder, K., Voronkov, A.: The 481 ways to split a clause and deal with propositional variables. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol. 7898, pp. 450–464. Springer, Heidelberg (2013)
Kovács, L., Voronkov, A.: First-order theorem proving and vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1–35. Springer, Heidelberg (2013)
Kühlwein, D., Schulz, S., Urban, J.: E-MaLeS 1.1. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol. 7898, pp. 407–413. Springer, Heidelberg (2013)
Lusk, E., McCune, W.: Experiments with ROO: a parallel automated deduction system. In: Fronhöfer, B., Wrightson, G. (eds.) Dagstuhl Seminar 1990. LNCS, vol. 590. Springer, Heidelberg (1992)
Reger, G., Suda, M., Voronkov, A.: Playing with AVATAR. In: Proceedings of CADE2015 (2015)
Riazanov, A., Voronkov, A.: Limited resource strategy in resolution theorem proving. J. Symb. Comp. 36(1–2), 101–115 (2003)
Schulz, S.: System description: E 1.8. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 735–743. Springer, Heidelberg (2013)
Schumann, J., Letz, R.: PARTHEO: a high-performance parallel theorem prover. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 40–56. Springer, Heidelberg (1990)
Slaney, J.K., Lusk, E.L.: Parallelizing the closure computation in automated deduction. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 28–39. Springer, Heidelberg (1990)
StarExec, https://www.starexec.org
Sutcliffe, G.: The design and implementation of a compositional competition-cooperation parallel ATP system. In: Proceedings IWIL-2, number MPI-I-2001-2-006 in MPI für Informatik, Research Report, pp. 92–102 (2001)
Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Autom. Reasoning 43(4), 337–362 (2009)
Sutcliffe, G., Suttner, C.: Evaluating general purpose automated theorem proving systems. Artif. Intell. 131(1–2), 39–54 (2001)
Suttner, C.B., Schumann, J.: Chapter 9 – Parallel automated theorem proving. In: Parallel Processing for Artificial Intelligence, vol. 14 of Machine Intelligence and Pattern Recognition, pp. 209–257. North-Holland (1994)
Tammet, T.: Gandalf. J. Autom. Reasoning 18(2), 199–204 (1997)
Voronkov, A.: AVATAR: The architecture for first-order theorem provers. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 696–710. Springer, Heidelberg (2014)
Wolf, A., Fuchs, M.: Cooperative parallel automated theorem proving. Technical report SFB Bereicht 342/21/97, Technische Universität München (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Reger, G., Tishkovsky, D., Voronkov, A. (2015). Cooperating Proof Attempts. In: Felty, A., Middeldorp, A. (eds) Automated Deduction - CADE-25. CADE 2015. Lecture Notes in Computer Science(), vol 9195. Springer, Cham. https://doi.org/10.1007/978-3-319-21401-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-21401-6_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21400-9
Online ISBN: 978-3-319-21401-6
eBook Packages: Computer ScienceComputer Science (R0)