The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 176 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 |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 167 | 241.4 | 240.273 | 9 | 9 | 0 |
cvc5 | 0 | 149 | 548.387 | 542.953 | 27 | 22 | 0 |
SMTInterpol | 0 | 58 | 109.322 | 57.033 | 118 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 167 | 241.4 | 240.273 | 9 | 9 | 0 |
cvc5 | 0 | 149 | 548.387 | 542.953 | 27 | 22 | 0 |
SMTInterpol | 0 | 58 | 109.322 | 57.033 | 118 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.