The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFDTLIA logic in the Unsat Core Track.
Page generated on 2023-07-06 16:05:43 +0000
Benchmarks: 11 Time Limit: 1200 seconds Memory Limit: 60 GB
| Sequential Performance | Parallel Performance |
|---|---|
| SMTInterpol | SMTInterpol |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 15442 | 2396.007 | 2032.445 | 1 | 0 |
| cvc5 | 0 | 8964 | 300.27 | 300.416 | 5 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 15442 | 2396.007 | 2032.445 | 1 | 0 |
| cvc5 | 0 | 8964 | 300.27 | 300.416 | 5 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.