The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFPLRA division in the Unsat Core Track.
Page generated on 2020-07-04 11:49:32 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| CVC4-uc | CVC4-uc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| CVC4-uc | 0 | 21 | 1.851 | 1.852 | 0 | 0 | |
| UltimateEliminator+MathSAT | 0 | 0 | 3.232 | 2.212 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| CVC4-uc | 0 | 21 | 1.851 | 1.852 | 0 | 0 | |
| UltimateEliminator+MathSAT | 0 | 0 | 3.232 | 2.212 | 0 | 0 |
n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.