The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the QF_UFNIA logic in the Unsat Core Track.
Page generated on 2022-08-10 11:18:51 +0000
Benchmarks: 195 Time Limit: 1200 seconds Memory Limit: 60 GB
Sequential Performance | Parallel Performance |
---|---|
cvc5 | cvc5 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 1126 | 7.902 | 8.837 | 0 | 0 |
cvc5 | 0 | 1081 | 4898.89 | 4899.984 | 4 | 0 |
2021-cvc5-ucn | 0 | 1006 | 1219.032 | 1218.154 | 1 | 0 |
MathSATn | 0 | 926 | 10942.754 | 10944.026 | 9 | 0 |
smtinterpol | 0 | 506 | 123.457 | 92.847 | 0 | 0 |
Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Timeout | Memout |
---|---|---|---|---|---|---|
z3-4.8.17n | 0 | 1126 | 7.902 | 8.837 | 0 | 0 |
cvc5 | 0 | 1081 | 4899.79 | 4899.724 | 4 | 0 |
2021-cvc5-ucn | 0 | 1006 | 1219.252 | 1218.134 | 1 | 0 |
MathSATn | 0 | 926 | 10943.424 | 10943.496 | 9 | 0 |
smtinterpol | 0 | 506 | 123.457 | 92.847 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.