The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFNIA logic in the Proof Exhibition Track.
Page generated on 2023-07-06 16:06:18 +0000
Benchmarks: 2827 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 | 2309 | 46088.156 | 45775.872 | 518 | 518 | 0 |
cvc5 | 0 | 1244 | 36470.671 | 36019.916 | 1583 | 1360 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 2309 | 46088.156 | 45775.872 | 518 | 518 | 0 |
cvc5 | 0 | 1244 | 36470.671 | 36019.916 | 1583 | 1360 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.