The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLIA division as of Tue Jul 18 22:06:21 GMT
Benchmarks in this division: 183
Time Limit: 2400s
Sequential Performance | Parallel Performance |
---|---|
SMTInterpol | SMTInterpol |
Solver | Error Score | Reduction Score | avg. CPU time |
---|---|---|---|
CVC4 | 0.000 | 32.007 | 2.631 |
SMTInterpol | 0.000 | 35.376 | 6.164 |
mathsat-5.4.1n | 0.000 | 35.376 | 15.393 |
z3-4.5.0n | 0.000 | 35.376 | 0.827 |
Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
---|---|---|---|---|
CVC4 | 0.000 | 32.007 | 2.631 | 2.633 |
SMTInterpol | 0.000 | 35.376 | 6.164 | 4.352 |
mathsat-5.4.1n | 0.000 | 35.376 | 32.376 | 32.380 |
z3-4.5.0n | 0.000 | 35.376 | 0.827 | 0.828 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.