The International Satisfiability Modulo Theories (SMT) Competition.
Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions
Competition results for the UFNIA logic in the Incremental Track.
Page generated on 2021-07-18 17:30:28 +0000
Benchmarks: 2031 Time Limit: 1200 seconds Memory Limit: 60 GB
| Parallel Performance |
|---|
| cvc5-inc |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout |
|---|---|---|---|---|---|---|---|
| 2020-z3n | 0 | 88723 | 1371089.124 | 1371476.243 | 257988 | 1011 | 1 |
| z3n | 0 | 88660 | 1369251.934 | 1369623.311 | 258051 | 1005 | 2 |
| cvc5-inc | 0 | 33181 | 1006156.016 | 1006033.357 | 313530 | 821 | 0 |
| 2020-CVC4-incn | 0 | 29859 | 971655.327 | 971548.538 | 316852 | 797 | 0 |
| SMTInterpol | 0 | 15485 | 1362244.697 | 1346276.684 | 331226 | 1088 | 0 |
| UltimateEliminator+MathSAT | 0 | 0 | 8901.884 | 3929.855 | 346711 | 0 | 0 |
n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.