The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NRA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 2959 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 | 2854 | 172391.984 | 172370.411 | 105 | 105 | 0 |
cvc5 | 0 | 1557 | 1667148.088 | 1667149.984 | 1402 | 1369 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 2854 | 172408.524 | 172365.721 | 105 | 105 | 0 |
cvc5 | 0 | 1557 | 1667334.688 | 1667086.604 | 1402 | 1368 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.