{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:07:24Z","timestamp":1767928044608,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031634970","type":"print"},{"value":"9783031634987","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":182,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The support for higher-order reasoning in the Vampire theorem prover has recently been completely reworked. This rework consists of new theoretical ideas, a new implementation, and a dedicated strategy schedule. The theoretical ideas are still under development, so we discuss them at a high level in this paper. We also describe the implementation of the calculus in the Vampire theorem prover, the strategy schedule construction and several empirical performance statistics.\n<\/jats:p>","DOI":"10.1007\/978-3-031-63498-7_5","type":"book-chapter","created":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T19:01:44Z","timestamp":1719774104000},"page":"75-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Higher-Order Vampire (Short Paper)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1343-5084","authenticated-orcid":false,"given":"Ahmed","family":"Bhayat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0989-5800","authenticated-orcid":false,"given":"Martin","family":"Suda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,1]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-55602-8_185","volume-title":"Automated Deduction\u2014CADE-11","author":"L Bachmair","year":"1992","unstructured":"Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation and superposition. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 462\u2013476. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55602-8_185"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s10817-022-09649-9","volume":"67","author":"A Bentkamp","year":"2023","unstructured":"Bentkamp, A., Blanchette, J., Tourret, S., Vukmirovi\u0107, P.: Superposition for higher-order logic. J. Autom. Reason. 67(1), 10 (2023)","journal-title":"J. Autom. Reason."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-29436-6_4","volume-title":"Automated Deduction \u2013 CADE 27","author":"A Bentkamp","year":"2019","unstructured":"Bentkamp, A., Blanchette, J., Tourret, S., Vukmirovi\u0107, P., Waldmann, U.: Superposition with lambdas. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 55\u201373. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_4"},{"key":"5_CR4","unstructured":"Bhayat, A.: Automated theorem proving in higher-order logic. Ph.D. thesis (2015)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bhayat, A., Korovin, K., Kov\u00e1cs, L., Schoisswohl, J.: Refining unification with abstraction. In: LPAR, pp. 36\u201347 (2023)","DOI":"10.29007\/h65j"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-51074-9_16","volume-title":"Automated Reasoning","author":"A Bhayat","year":"2020","unstructured":"Bhayat, A., Reger, G.: A combinator-based superposition calculus for higher-order logic. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 278\u2013296. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_16"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bhayat, A., Suda, M.: A higher-order vampire (short paper). EasyChair Preprint no. 13125 (EasyChair, 2024)","DOI":"10.1007\/978-3-031-63498-7_5"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"B\u00e1rtek, F., Chvalovsk\u00fd, K., Suda, M.: Regularization in spider-style strategy discovery and schedule construction. In: IJCAR (2024, accepted)","DOI":"10.1007\/978-3-031-63498-7_12"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"5_CR10","unstructured":"Desharnais, M., Vukmirovi\u0107, P., Blanchette, J., Wenzel, M.: Seventeen provers under the hammer. In: ITP. LIPIcs, vol.\u00a0237, pp. 8:1\u20138:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-40229-1_22","volume-title":"Automated Reasoning","author":"K Hoder","year":"2016","unstructured":"Hoder, K., Reger, G., Suda, M., Voronkov, A.: Selecting the selection. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 313\u2013329. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_22"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-81097-9_8","volume-title":"Intelligent Computer Mathematics","author":"EK Holden","year":"2021","unstructured":"Holden, E.K., Korovin, K.: Heterogeneous heuristic optimisation and scheduling for first-order theorem proving. In: Kamareddine, F., Sacerdoti Coen, C. (eds.) CICM 2021. LNCS (LNAI), vol. 12833, pp. 107\u2013123. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81097-9_8"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"GP Huet","year":"1975","unstructured":"Huet, G.P.: A unification algorithm for typed $$\\lambda $$-calculus. Theoret. Comput. Sci. 1(1), 27\u201357 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-031-30823-9_33","volume-title":"TACAS","author":"K Korovin","year":"2023","unstructured":"Korovin, K., Kov\u00e1cs, L., Reger, G., Schoisswohl, J., Voronkov, A.: ALASCA: Reasoning in quantified linear arithmetic. In: Sankaranarayanan, S., Sharygina, N. (eds.) TACAS. LNCS, vol. 13993, pp. 647\u2013665. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30823-9_33"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39799-8_1","volume-title":"Computer Aided Verification","author":"L Kov\u00e1cs","year":"2013","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1\u201335. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_1"},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant For Higher-order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: A Proof Assistant For Higher-order Logic, vol. 2283. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Reger, G., Suda, M., Voronkov, A.: New techniques in clausal form generation. In: GCAI. EPiC Series in Computing, vol.\u00a041, pp. 11\u201323. EasyChair (2016)","DOI":"10.29007\/dzfz"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-89960-2_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Reger","year":"2018","unstructured":"Reger, G., Suda, M., Voronkov, A.: Unification with abstraction and theory instantiation in saturation-based reasoning. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 3\u201322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_1"},{"key":"5_CR19","unstructured":"Schurr, H.: Optimal strategy schedules for everyone. In: PAAR. CEUR Workshop Proceedings, vol.\u00a03201. CEUR-WS.org (2022)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Steen, A.: Extensional paramodulation for higher-order logic and its effective implementation Leo-III. Ph.D. thesis (2018)","DOI":"10.1007\/s13218-019-00628-8"},{"issue":"6","key":"5_CR21","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s10817-021-09588-x","volume":"65","author":"A Steen","year":"2021","unstructured":"Steen, A., Benzm\u00fcller, C.: Extensional higher-order paramodulation in Leo-III. J. Autom. Reason. 65(6), 775\u2013807 (2021)","journal-title":"J. Autom. Reason."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-08587-6_28","volume-title":"Automated Reasoning","author":"A Stump","year":"2014","unstructured":"Stump, A., Sutcliffe, G., Tinelli, C.: StarExec: a cross-community infrastructure for logic solving. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 367\u2013373. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_28"},{"key":"5_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-031-10769-6_38","volume-title":"IJCAR 2022","author":"M Suda","year":"2022","unstructured":"Suda, M.: Vampire getting noisy: will random bits help conquer chaos? (system description). In: Blanchette, J., Kov\u00e1cs, L., Pattinson, D. (eds.) IJCAR 2022. LNCS, vol. 13385, pp. 659\u2013667. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10769-6_38"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0. J. Autom. Reason. 59(4), 483\u2013502 (2017)","DOI":"10.1007\/s10817-017-9407-7"},{"key":"5_CR25","first-page":"35","volume":"19","author":"G Sutcliffe","year":"2006","unstructured":"Sutcliffe, G., Suttner, C.: The state of CASC. AI Commun. 19, 35\u201348 (2006)","journal-title":"AI Commun."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BFb0054276","volume-title":"Automated Deduction \u2014 CADE-15","author":"T Tammet","year":"1998","unstructured":"Tammet, T.: Towards efficient subsumption. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS, vol. 1421, pp. 427\u2013441. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054276"},{"key":"5_CR27","unstructured":"Voronkov, A.: Spider: learning in the sea of options. In: Vampire23: The 7th Vampire Workshop (2023, to appear). https:\/\/easychair.org\/smart-program\/Vampire23\/2023-07-05.html#talk:223833"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-79876-5_24","volume-title":"Automated Deduction \u2013 CADE 28","author":"P Vukmirovi\u0107","year":"2021","unstructured":"Vukmirovi\u0107, P., Bentkamp, A., Blanchette, J., Cruanes, S., Nummelin, V., Tourret, S.: Making higher-order superposition work. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 415\u2013432. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_24"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Vukmirovi\u0107, P., Bentkamp, A., Nummelin, V.: Efficient full higher-order unification. Logical Methods in Computer Science 17 (2021)","DOI":"10.46298\/lmcs-17(4:18)2021"},{"key":"5_CR30","unstructured":"Vukmirovi\u0107, P., Nummelin, V.: Boolean reasoning in a higher-order superposition prover. In: PAAR, pp. 148\u2013166 (2020)"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Wolf, A., Letz, R.: Strategy parallelism in automated theorem proving. In: Cook, D.J. (ed.) FLAIRS, pp. 142\u2013146. AAAI Press (1998)","DOI":"10.1007\/3-540-69778-0_32"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63498-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T18:17:34Z","timestamp":1747592254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63498-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031634970","9783031634987"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63498-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/merz.gitlabpages.inria.fr\/2024-ijcar\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}