The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ALIA division as of Tue Jul 18 22:06:21 GMT
Benchmarks in this division : 80
Time Limit: 2400s
Sequential Performance | Parallel Performance |
---|---|
SMTInterpol | SMTInterpol |
Solver | Error Score | Reduction Score | avg. CPU time |
---|---|---|---|
CVC4 | 0.000 | 2615.592 | 54.144 |
SMTInterpol | 0.000 | 3214.438 | 11.525 |
mathsat-5.4.1n | 0.000 | 3035.314 | 20.284 |
z3-4.5.0n | 0.000 | 3511.599 | 18.017 |
Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
---|---|---|---|---|
CVC4 | 0.000 | 2615.592 | 155.501 | 155.535 |
SMTInterpol | 0.000 | 3214.438 | 11.525 | 7.849 |
mathsat-5.4.1n | 0.000 | 3035.314 | 52.996 | 53.007 |
z3-4.5.0n | 0.000 | 3511.599 | 30.201 | 30.205 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.