The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFLRA division as of Tue Jul 18 22:06:21 GMT
Benchmarks in this division: 511
Time Limit: 2400s
Sequential Performance | Parallel Performance |
---|---|
SMTInterpol | SMTInterpol |
Solver | Error Score | Reduction Score | avg. CPU time |
---|---|---|---|
CVC4 | 0.000 | 174.015 | 0.664 |
SMTInterpol | 0.000 | 179.702 | 3.953 |
mathsat-5.4.1n | 0.000 | 186.762 | 0.267 |
z3-4.5.0n | 0.000 | 185.350 | 0.208 |
Solver | Error Score | Reduction Score | avg. CPU time | avg. WALL time |
---|---|---|---|---|
CVC4 | 0.000 | 174.015 | 0.664 | 0.665 |
SMTInterpol | 0.000 | 179.702 | 3.953 | 2.348 |
mathsat-5.4.1n | 0.000 | 186.762 | 0.267 | 0.268 |
z3-4.5.0n | 0.000 | 185.350 | 0.208 | 0.209 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.