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 (Incremental Track)

Competition results for the QF_BV division in the Incremental Track.

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

Benchmarks: 1291
Time Limit: 2400 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
Yices 2.6.2 Incremental

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
Yices 2.6.2 Incremental 0 2886436983.67436919.07453110 0
Minkeyrink Solver MT 0 2885748178.65931397.3445388 0
Minkeyrink Solver 0 2884831497.77831398.1485478 0
2018-MathSAT (incremental)n 0 2884754562.53754442.8954813 0
STP-incremental 0 2880334147.75934042.7465929 0
Boolector (incremental) 0 2878536369.62736303.0096109 0
CVC4-inc-fixedn 0 2850486002.8985913.52289110 0
Z3n 0 28403188172.007188127.98399235 0
STP-mt 0 25599137.2815245.373268360 0
Boolector-ReasonLSn 0 371115.734162.487290240 0
CVC4-inc 0 06.57363.471293950 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.