The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the NRA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 1910 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 | 1892 | 21739.994 | 21743.207 | 18 | 18 | 0 |
cvc5 | 0 | 1892 | 21769.104 | 21768.7 | 18 | 18 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
---|---|---|---|---|---|---|---|
cvc5-lfsc | 0 | 1892 | 21743.444 | 21742.337 | 18 | 18 | 0 |
cvc5 | 0 | 1892 | 21771.504 | 21767.68 | 18 | 18 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.