The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_NIA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 3408 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 | 2287 | 1469197.444 | 1469268.997 | 1121 | 1113 | 2 |
| cvc5 | 0 | 573 | 3303609.957 | 3302669.771 | 2835 | 2666 | 2 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| cvc5-lfsc | 0 | 2287 | 1469591.384 | 1469206.847 | 1121 | 1113 | 2 |
| cvc5 | 0 | 573 | 3304253.217 | 3302522.481 | 2835 | 2665 | 2 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.