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 (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 Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
Yices 2.6.2 Incremental 0 28864 36983.674 36919.07453110 0
Minkeyrink Solver MT 0 28857 48178.659 31397.3445388 0
Minkeyrink Solver 0 28848 31497.778 31398.1485478 0
2018-MathSAT (incremental)n 0 28847 54562.537 54442.8954813 0
STP-incremental 0 28803 34147.759 34042.7465929 0
Boolector (incremental) 0 28785 36369.627 36303.0096109 0
CVC4-inc-fixedn 0 28504 86002.89 85913.52289110 0
Z3n 0 28403 188172.007 188127.98399235 0
STP-mt 0 2559 9137.281 5245.373268360 0
Boolector-ReasonLSn 0 371 115.734 162.487290240 0
CVC4-inc 0 0 6.573 63.471293950 0

n Non-competing.