The International Satisfiability Modulo Theories (SMT) Competition.
    Home
    Introduction
    Benchmark Submission
    Publications
    SMT-LIB
    Previous Editions
  
Competition results for the QF_NIRA logic in the Proof Exhibition Track.
Page generated on 2022-08-10 11:19:33 +0000
Benchmarks: 2 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 | 0 | 1 | 1199.84 | 1200.099 | 1 | 1 | 0 | 
| cvc5-lfsc | 0 | 1 | 1199.914 | 1200.153 | 1 | 1 | 0 | 
| Solver | Error Score | Correct Score | CPU Time Score | Wall Time Score | Unsolved | Timeout | Memout | 
|---|---|---|---|---|---|---|---|
| cvc5 | 0 | 1 | 1200.08 | 1200.079 | 1 | 1 | 0 | 
| cvc5-lfsc | 0 | 1 | 1200.104 | 1200.103 | 1 | 1 | 0 | 
  
    n Non-competing.
  
    N/A: Benchmarks not known to be SAT/UNSAT, respectively.