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 2023-07-06 16:06:18 +0000
Benchmarks: 29 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 | 16 | 1146.234 | 861.776 | 13 | 10 | 0 |
cvc5-lfsc | 0 | 10 | 254.448 | 254.457 | 19 | 19 | 0 |
cvc5 | 0 | 2 | 56.639 | 56.605 | 27 | 27 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
SMTInterpol | 0 | 16 | 1146.234 | 861.776 | 13 | 10 | 0 |
cvc5-lfsc | 0 | 10 | 254.448 | 254.457 | 19 | 19 | 0 |
cvc5 | 0 | 2 | 56.639 | 56.605 | 27 | 27 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.