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 Unsat Core Track.
Page generated on 2021-07-18 17:31:25 +0000
Benchmarks: 243 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5-uc | cvc5-uc |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5-uc | 0 | 177623 | 29852.119 | 29781.949 | 16 | 0 |
MathSAT5n | 0 | 171426 | 62402.955 | 62414.699 | 41 | 0 |
z3n | 0 | 154028 | 91597.232 | 91615.128 | 50 | 0 |
Yices2 | 0 | 0 | 0.828 | 2.9 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
cvc5-uc | 0 | 177623 | 29853.499 | 29781.409 | 16 | 0 |
MathSAT5n | 0 | 171426 | 62409.575 | 62412.779 | 41 | 0 |
z3n | 0 | 154028 | 91604.642 | 91613.448 | 50 | 0 |
Yices2 | 0 | 0 | 0.828 | 2.9 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.