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 2022-08-10 11:19:33 +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 | 35.048 | 11.819 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 12 | 123.55 | 90.479 | 0 | 0 | 0 |
cvc5 | 0 | 0 | 14397.98 | 14400.59 | 12 | 12 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
smtinterpol | 0 | 12 | 35.048 | 11.819 | 0 | 0 | 0 |
cvc5-lfsc | 0 | 12 | 123.55 | 90.479 | 0 | 0 | 0 |
cvc5 | 0 | 0 | 14400.0 | 14400.0 | 12 | 12 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.