{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:52:59Z","timestamp":1776297179661,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227515","type":"print"},{"value":"9783032227522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22752-2_13","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:51:52Z","timestamp":1776289912000},"page":"255-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hint-Based SMT Proof Reconstruction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4047-6196","authenticated-orcid":false,"given":"Joshua","family":"Clune","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0188-2300","authenticated-orcid":false,"given":"Haniel","family":"Barbosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1275-315X","authenticated-orcid":false,"given":"Jeremy","family":"Avigad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Armand, M., Faure, G., Gr\u00e9goire, B., Keller, C., Th\u00e9ry, L., Werner, B.: A Modular Integration of SAT\/SMT Solvers to Coq through Proof Witnesses, p. 135\u2013150. Springer Berlin Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25379-9_12","DOI":"10.1007\/978-3-642-25379-9_12"},{"key":"13_CR2","unstructured":"Avigad, J., de\u00a0Moura, L., Kong, S., Ullrich, S.: Theorem proving in Lean 4, https:\/\/leanprover.github.io\/theorem_proving_in_lean4\/"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Barbosa, H., Barrett, C.W., Brain, M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M., Niemetz, A., N\u00f6tzli, A., Ozdemir, A., Preiner, M., Reynolds, A., Sheng, Y., Tinelli, C., Zohar, Y.: cvc5: A versatile and industrial-strength SMT solver. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for Construction and Analysis of Systems (TACAS), Part I. Lecture Notes in Computer Science, vol. 13243, pp. 415\u2013442. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24, https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Barbosa, H., Reynolds, A., Kremer, G., Lachnitt, H., Niemetz, A., N\u00f6tzli, A., Ozdemir, A., Preiner, M., Viswanathan, A., Viteri, S., Zohar, Y., Tinelli, C., Barrett, C.W.: Flexible proof production in an industrial-strength SMT solver. In: Blanchette, J., Kov\u00e1cs, L., Pattinson, D. (eds.) International Joint Conference on Automated Reasoning (IJCAR). Lecture Notes in Computer Science, vol. 13385, pp. 15\u201335. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-10769-6_3, https:\/\/doi.org\/10.1007\/978-3-031-10769-6_3","DOI":"10.1007\/978-3-031-10769-6_3"},{"key":"13_CR5","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Tech. rep., Department of Computer Science, The University of Iowa (2017), available at www.SMT-LIB.org"},{"key":"13_CR6","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.7. Tech. rep., Department of Computer Science, The University of Iowa (2025), available at www.SMT-LIB.org"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability - Second Edition, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 1267\u20131329. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA201017, https:\/\/doi.org\/10.3233\/FAIA201017","DOI":"10.3233\/FAIA201017"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Bartl, L., Blanchette, J., Nipkow, T.: Exploiting instantiations from paramodulation proofs in isabelle\/hol. In: Barrett, C.W., Waldmann, U. (eds.) Proc. Conference on Automated Deduction (CADE). Lecture Notes in Computer Science, vol. 15943, pp. 573\u2013593. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-99984-0_30, https:\/\/doi.org\/10.1007\/978-3-031-99984-0_30","DOI":"10.1007\/978-3-031-99984-0_30"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Blanchette, J.C., B\u00f6hme, S., Paulson, L.C.: Extending sledgehammer with SMT solvers. In: Bj\u00f8rner, N.S., Sofronie-Stokkermans, V. (eds.) Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings. Lecture Notes in Computer Science, vol.\u00a06803, pp. 116\u2013130. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_11, https:\/\/doi.org\/10.1007\/978-3-642-22438-6_11","DOI":"10.1007\/978-3-642-22438-6_11"},{"key":"13_CR10","unstructured":"Blanchette, J.C., Kaliszyk, C., Paulson, L.C., Urban, J.: Hammering towards QED. J. Formalized Reasoning 9(1), 101\u2013148 (2016)"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Blot, V., Cousineau, D., Crance, E., de\u00a0Prisque, L.D., Keller, C., Mahboubi, A., Vial, P.: Compositional pre-processing for automated reasoning in dependent type theory. In: Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs. p. 63\u201377. CPP \u201923, ACM (Jan 2023). https:\/\/doi.org\/10.1145\/3573105.3575676","DOI":"10.1145\/3573105.3575676"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Bouton, T., de\u00a0Oliveira, D.C.B., D\u00e9harbe, D., Fontaine, P.: veriT: An Open, Trustable and Efficient SMT-Solver. In: Schmidt, R.A. (ed.) Proc. Conference on Automated Deduction (CADE). Lecture Notes in Computer Science, vol.\u00a05663, pp. 151\u2013156. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_12, http:\/\/dx.doi.org\/10.1007\/978-3-642-02959-2_12","DOI":"10.1007\/978-3-642-02959-2_12"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"B\u00f6ving, H., Bhat, S., Cicolini, L., Keizer, A., Frenot, L., Mohamed, A., Stefanesco, L., Khan, H., Clune, J., Barrett, C., Grosser, T.: Interactive bitvector reasoning using verified bit-blasting. Proceedings of the ACM on Programming Languages 9(OOPSLA2), 3259\u20133285 (Oct 2025). https:\/\/doi.org\/10.1145\/3763167, http:\/\/dx.doi.org\/10.1145\/3763167","DOI":"10.1145\/3763167"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Clune, J., Barbosa, H., Avigad, J.: Hint-based smt proof reconstruction (2026). https:\/\/doi.org\/10.48550\/ARXIV.2601.14495, https:\/\/arxiv.org\/abs\/2601.14495","DOI":"10.48550\/ARXIV.2601.14495"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Clune, J., Qian, Y., Bentkamp, A., Avigad, J.: Duper: A Proof-Producing Superposition Theorem Prover for Dependent Type Theory. In: Bertot, Y., Kutsia, T., Norrish, M. (eds.) Interactive Theorem Proving (ITP). vol.\u00a0309, pp. 10:1\u201310:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2024.10","DOI":"10.4230\/LIPIcs.ITP.2024.10"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"mathlib Community, T.: The Lean mathematical library. In: Blanchette, J., Hritcu, C. (eds.) Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2020, New Orleans, LA, USA, January 20-21, 2020. pp. 367\u2013381. ACM (2020). https:\/\/doi.org\/10.1145\/3372885.3373824","DOI":"10.1145\/3372885.3373824"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Czajka, L., Kaliszyk, C.: Hammer for coq: Automation for dependent type theory. Journal of Automated Reasoning 61(1\u20134), 423\u2013453 (Feb 2018). https:\/\/doi.org\/10.1007\/s10817-018-9458-4","DOI":"10.1007\/s10817-018-9458-4"},{"key":"13_CR18","unstructured":"Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Design and Application of Strategies\/Tactics in Higher Order Logics (STRATA 2003). pp. 56\u201368 (2003), http:\/\/www.gilith.com\/papers"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order theorem proving and vampire. In: Sharygina, N., Veith, H. (eds.) Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a08044, pp. 1\u201335. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_1","DOI":"10.1007\/978-3-642-39799-8_1"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Lachnitt, H., Fleury, M., Barbosa, H., Jakpor, J., Andreotti, B., Reynolds, A., Schurr, H., Barrett, C.W., Tinelli, C.: Improving the SMT proof reconstruction pipeline in isabelle\/hol. In: Forster, Y., Keller, C. (eds.) Interactive Theorem Proving (ITP). LIPIcs, vol.\u00a0352, pp. 26:1\u201326:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.ITP.2025.26, https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2025.26","DOI":"10.4230\/LIPICS.ITP.2025.26"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Limperg, J., From, A.H.: Aesop: White-box best-first proof search for lean. In: Krebbers, R., Traytel, D., Pientka, B., Zdancewic, S. (eds.) Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2023, Boston, MA, USA, January 16-17, 2023. pp. 253\u2013266. ACM (2023). https:\/\/doi.org\/10.1145\/3573105.3575671","DOI":"10.1145\/3573105.3575671"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. J. Autom. Reason. 40(1), 35\u201360 (2008). https:\/\/doi.org\/10.1007\/S10817-007-9085-Y","DOI":"10.1007\/S10817-007-9085-Y"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. J. Appl. Log. 7(1), 41\u201357 (2009). https:\/\/doi.org\/10.1016\/J.JAL.2007.07.004","DOI":"10.1016\/J.JAL.2007.07.004"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Mohamed, A., Mascarenhas, T., Khan, H., Barbosa, H., Reynolds, A., Qian, Y., Tinelli, C., Barrett, C.: lean-smt: An SMT Tactic for Discharging Proof Goals in Lean, p. 197\u2013212. Springer Nature Switzerland (2025). https:\/\/doi.org\/10.1007\/978-3-031-98682-6_11, http:\/\/dx.doi.org\/10.1007\/978-3-031-98682-6_11","DOI":"10.1007\/978-3-031-98682-6_11"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"de\u00a0Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) Tools and Algorithms for Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol.\u00a04963, pp. 337\u2013340. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24, https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Norman, C., Avigad, J.: Canonical for automated theorem proving in lean. In: Forster, Y., Keller, C. (eds.) 16th International Conference on Interactive Theorem Proving, ITP 2025, September 28 to October 1, 2025, Reykjavik, Iceland. LIPIcs, vol.\u00a0352, pp. 14:1\u201314:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.ITP.2025.14, https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2025.14","DOI":"10.4230\/LIPICS.ITP.2025.14"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Paulson, L.C., Blanchette, J.C.: Three years of experience with sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Schulz, S., Ternovska, E. (eds.) The 8th International Workshop on the Implementation of Logics, IWIL 2010, Yogyakarta, Indonesia, October 9, 2011. EPiC Series in Computing, vol.\u00a02, pp. 1\u201311. EasyChair (2010). https:\/\/doi.org\/10.29007\/36DT","DOI":"10.29007\/36DT"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Paulson, L.C., Susanto, K.W.: Source-level proof reconstruction for interactive theorem proving. In: Schneider, K., Brandt, J. (eds.) Theorem Proving in Higher Order Logics, 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings. Lecture Notes in Computer Science, vol.\u00a04732, pp. 232\u2013245. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74591-4_18","DOI":"10.1007\/978-3-540-74591-4_18"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Qian, Y., Clune, J., Barrett, C., Avigad, J.: Lean-Auto: An Interface Between Lean 4 and Automated Theorem Provers, p. 175\u2013196. Springer Nature Switzerland (2025). https:\/\/doi.org\/10.1007\/978-3-031-98682-6_10","DOI":"10.1007\/978-3-031-98682-6_10"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Reger, G., Suda, M.: Set of support for theory reasoning. In: Eiter, T., Sands, D., Sutcliffe, G., Voronkov, A. (eds.) IWIL Workshop and LPAR Short Presentations. Kalpa Publications in Computing, vol.\u00a01, pp. 124\u2013134. EasyChair (2017). https:\/\/doi.org\/10.29007\/ndjg, \/publications\/paper\/4Sd","DOI":"10.29007\/ndjg"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Reynolds, A., Kuncak, V.: Induction for smt solvers. In: D\u2019Souza, D., Lal, A., Larsen, K. (eds.) Verification, Model Checking, and Abstract Interpretation, Lecture Notes in Computer Science, vol.\u00a08931, pp. 80\u201398. Springer Berlin Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46081-8_5, http:\/\/dx.doi.org\/10.1007\/978-3-662-46081-8_5","DOI":"10.1007\/978-3-662-46081-8_5"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Schurr, H., Fleury, M., Desharnais, M.: Reliable reconstruction of fine-grained proofs in a proof assistant. In: Platzer, A., Sutcliffe, G. (eds.) Proc. Conference on Automated Deduction (CADE). Lecture Notes in Computer Science, vol. 12699, pp. 450\u2013467. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_26, https:\/\/doi.org\/10.1007\/978-3-030-79876-5_26","DOI":"10.1007\/978-3-030-79876-5_26"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Vukmirovi\u0107, P., Bentkamp, A., Blanchette, J., Cruanes, S., Nummelin, V., Tourret, S.: Making Higher-Order Superposition Work, p. 415\u2013432. Springer International Publishing (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_24","DOI":"10.1007\/978-3-030-79876-5_24"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Vukmirovi\u0107, P., Blanchette, J., Schulz, S.: Extending a High-Performance Prover to Higher-Order Logic, p. 111\u2013129. Springer Nature Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_10, http:\/\/dx.doi.org\/10.1007\/978-3-031-30820-8_10","DOI":"10.1007\/978-3-031-30820-8_10"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Zhou, Y., Bosamiya, J., Takashima, Y., Li, J., Heule, M., Parno, B.: Mariposa: Measuring SMT instability in automated program verification. In: Nadel, A., Rozier, K.Y. (eds.) Formal Methods In Computer-Aided Design (FMCAD). pp. 178\u2013188. IEEE (2023). https:\/\/doi.org\/10.34727\/2023\/ISBN.978-3-85448-060-0_26, https:\/\/doi.org\/10.34727\/2023\/isbn.978-3-85448-060-0_26","DOI":"10.34727\/2023\/ISBN.978-3-85448-060-0_26"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22752-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:12:54Z","timestamp":1776294774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22752-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227515","9783032227522"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22752-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}