<div class="csl-bib-body">
<div class="csl-entry">Hajdu, M., Hozzova, P., Kovacs, L., Schoisswohl, J., & Voronkov, A. (2021). Inductive Benchmarks for Automated Reasoning. In <i>Intelligent Computer Mathematics. 14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021. Proceedings</i> (pp. 124–129). Springer. https://doi.org/10.34726/1563</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/18558
-
dc.identifier.uri
https://doi.org/10.34726/1563
-
dc.description.abstract
We present a large set of benchmarks for automated theorem provers that require inductive reasoning. Motivated by the need to compare first-order theorem provers, SMT solvers and inductive theorem provers, the setting of our examples follows the SMT-LIB standard. Our benchmark set contains problems with inductive data types as well as integers. In addition to SMT-LIB encodings, we provide translations to some other less common input formats.