SMT-COMP 2019

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Papers
Benchmark Submission
Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

Previous Competitions

SMT-LIB

QF_BV (Challenge Track (incremental))

Competition results for the QF_BV division in the Challenge Track (incremental).

Page generated on 2019-07-23 17:57:31 +0000

Benchmarks: 7
Time Limit: 43200 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
Boolector (incremental)

Parallel Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
Boolector (incremental) 0 110 25502.861 25501.21600 0
2018-MathSAT (incremental)n 0 109 59895.543 59899.04111 0
Yices 2.6.2 Incremental 0 102 182741.58 182747.1484 0
STP-incremental 0 99 54913.168 54913.122111 0
CVC4-inc-fixedn 0 98 92348.09 92352.21121 0
Z3n 0 97 248932.47 248936.83135 0
Minkeyrink Solver 0 86 5093.107 5091.39240 0
Minkeyrink Solver MT 0 80 13418.389 4160.732300 0
STP-mt 0 37 43203.91 43204.606731 0
CVC4-inc 0 0 0.144 1.0641100 0

n Non-competing.