The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_AUFNIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 12 Time Limit: 1200 seconds Memory Limit: 60 GB
This track is experimental. Solvers are only ranked by performance, but no winner is selected.
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 12 | 79.968 | 26.044 | 0 | 0 | 0 |
| cvc5-lfsc | 0 | 12 | 214.753 | 180.39 | 0 | 0 | 0 |
| cvc5 | 0 | 0 | 0.0 | 0.0 | 12 | 12 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| SMTInterpol | 0 | 12 | 79.968 | 26.044 | 0 | 0 | 0 |
| cvc5-lfsc | 0 | 12 | 214.753 | 180.39 | 0 | 0 | 0 |
| cvc5 | 0 | 0 | 0.0 | 0.0 | 12 | 12 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.