The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the LIA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 227 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| cvc5 | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2020-CVC4-ucn | 0 | 8 | 10.541 | 10.516 | 0 | 0 |
| z3-4.8.17n | 0 | 8 | 76.299 | 76.171 | 0 | 0 |
| cvc5 | 0 | 7 | 119.726 | 119.672 | 0 | 0 |
| Vampire | 0 | 2 | 12800.222 | 12223.645 | 10 | 0 |
| smtinterpol | 0 | 0 | 30097.043 | 29781.401 | 22 | 0 |
| UltimateEliminator+MathSAT | 1 | 6 | 12147.575 | 11344.113 | 8 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2020-CVC4-ucn | 0 | 8 | 10.541 | 10.516 | 0 | 0 |
| z3-4.8.17n | 0 | 8 | 76.299 | 76.171 | 0 | 0 |
| cvc5 | 0 | 7 | 119.726 | 119.672 | 0 | 0 |
| Vampire | 0 | 2 | 12800.222 | 12223.645 | 10 | 0 |
| smtinterpol | 0 | 0 | 30097.043 | 29781.401 | 22 | 0 |
| UltimateEliminator+MathSAT | 1 | 6 | 12147.575 | 11344.113 | 8 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.