The International Satisfiability Modulo Theories (SMT) Competition.
Competition results for the QF_UFNRA logic in the Incremental Track.
Results were generated on 2024-07-08
Benchmarks: 1
Time Limit: 1200 seconds
Memory Limit: 20480 GB
| winner_seq | winner_par | winner_sat | winner_unsat | winner_24s |
|---|---|---|---|---|
| cvc5 | cvc5 | - | - | cvc5 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 6 | 0.133178 | 0.231803 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| Yices2 | 0 | 6 | 0.169382 | 0.269645 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| SMTInterpol | 0 | 6 | 0.609349 | 0.500433 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 6 | 0.133178 | 0.231803 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| Yices2 | 0 | 6 | 0.169382 | 0.269645 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| SMTInterpol | 0 | 6 | 0.609349 | 0.500433 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Solved | Solved SAT | Solved UNSAT | Unsolved | Abstained | Timeout | Memout |
|---|---|---|---|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 6 | 0.133178 | 0.231803 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| Yices2 | 0 | 6 | 0.169382 | 0.269645 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| SMTInterpol | 0 | 6 | 0.609349 | 0.500433 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |