SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2019

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

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 ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
Boolector (incremental) 0 11025502.86125501.21600 0
2018-MathSAT (incremental)n 0 10959895.54359899.04111 0
Yices 2.6.2 Incremental 0 102182741.58182747.1484 0
STP-incremental 0 9954913.16854913.122111 0
CVC4-inc-fixedn 0 9892348.0992352.21121 0
Z3n 0 97248932.47248936.83135 0
Minkeyrink Solver 0 865093.1075091.39240 0
Minkeyrink Solver MT 0 8013418.3894160.732300 0
STP-mt 0 3743203.9143204.606731 0
CVC4-inc 0 00.1441.0641100 0

n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.