The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the LIA division as of Fri Jul 21 10:18:02 GMT
Benchmarks in this division: 388
Time Limit: 1200s
| Sequential Performance | Parallel Performance |
|---|---|
| CVC4 | CVC4 |
| Solver | Error Score | Correct Score | CPU Time | Unsolved |
|---|---|---|---|---|
| CVC4 | 0.000 | 388.000 | 0.072 | 0 |
| vampire 4.2 | 0.000 | 252.537 | 420.243 | 159 |
| veriT | 0.000 | 174.048 | 32.166 | 218 |
| z3-4.5.0n | 0.000 | 388.000 | 0.042 | 0 |
| Solver | Error Score | Correct Score | CPU Score | WALL Score | Unsolved |
|---|---|---|---|---|---|
| CVC4 | 0.000 | 388.000 | 0.072 | 0.075 | 0 |
| vampire 4.2 | 0.000 | 252.537 | 1373.384 | 349.610 | 159 |
| veriT | 0.000 | 174.048 | 32.166 | 32.156 | 218 |
| z3-4.5.0n | 0.000 | 388.000 | 0.042 | 0.044 | 0 |
n. Non-competing.
1. Scores are computed according to Section 7 of the rules.