The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ANIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 5 Time Limit: 1200 seconds Memory Limit: 60 GB
Parallel Performance |
---|
SMTInterpol |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
z3n | 0 | 51724 | 56.442 | 52.71 | 0 | 0 | 0 |
SMTInterpol | 0 | 51724 | 272.454 | 94.909 | 0 | 0 | 0 |
cvc5-inc | 0 | 43429 | 2017.732 | 2014.141 | 8295 | 1 | 0 |
2020-MathSAT5n | 0 | 12101 | 12.883 | 12.717 | 39623 | 0 | 0 |
MathSAT5n | 0 | 12101 | 15.138 | 14.956 | 39623 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.