The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_ANIA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 27 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 | 17 | 12544.087 | 12373.415 | 10 | 10 | 0 |
cvc5-lfsc | 0 | 11 | 20200.055 | 20204.858 | 16 | 16 | 0 |
cvc5 | 0 | 2 | 30046.882 | 30054.164 | 25 | 25 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
smtinterpol | 0 | 17 | 12575.847 | 12163.772 | 10 | 9 | 0 |
cvc5-lfsc | 0 | 11 | 20203.625 | 20203.638 | 16 | 16 | 0 |
cvc5 | 0 | 2 | 30052.762 | 30052.664 | 25 | 25 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.