The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the BVFPLRA logic in the Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 1 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| cvc5-uc | cvc5-uc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2020-CVC4-ucn | 0 | 21 | 1.799 | 1.799 | 0 | 0 |
| cvc5-uc | 0 | 21 | 5.658 | 5.658 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 4.65 | 2.878 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| 2020-CVC4-ucn | 0 | 21 | 1.799 | 1.799 | 0 | 0 |
| cvc5-uc | 0 | 21 | 5.658 | 5.658 | 0 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 4.65 | 2.878 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.