This artifact contains the binaries of the SMT solvers CVC4 and Z3, the benchmarks on which they were evaluated, and the running scripts for each configuration evaluated. An overview of the results obtained from this evaluation in the StarExec cluster is presented in Section 5 of the TACAS 2018 proceedings paper:
Revisiting Enumerative Instantiation
Andrew Reynolds, Haniel Barbosa, and Pascal Fontaine
24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018). Thessaloniki, Grécia.
The related paper presents a strengthened version of the Herbrand theorem, designed as an better-suited basis for the instantiation loop used in SMT solvers. The experimental evaluation code employs different strategies of effectively combining enumerative instantiation with other instantiation techniques.
The subdirectory benchmarks contains a bash shell script (.sh) to be used in conjunction with the TPTP benchmarks accessible via
http://www.cs.miami.edu/~tptp/TPTP/Distribution/TPTP-v7.0.0.tgz see readme.txt for more detailed instructions on how to use the artifact.
The subdirectory solvers contains archived CVC4 and Z3 solvers; corresponding to the experimental evaluation of different enumerative instantiation strategies. All results were produced on StarExec, a public execution service for running comparative evaluations of solvers, with a timeout of 300 seconds.
All files are in openly-accessible text format holding bash shell scripts or documentation such as READMEs.
This work was partially funded by the National Science Foundation under Award 1656926, by the H2020-FETOPEN-2016-2017-CSA project SC2 (712689), and by the European Research Council (ERC) starting grant Matryoshka (713999). We would like to thank the anonymous reviewers for their comments. We are grateful to Jasmin C. Blanchette for discussions, encouragements and financial support through his ERC grant.