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_ABV (Challenge Track (incremental))

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

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

Benchmarks: 9
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 135 10299.752 10298.92700 0
2018-Boolector (incremental)n 0 133 55370.94 55373.6620 0
Yices 2.6.2 Incremental 0 130 147867.07 147872.7252 0
Z3n 0 119 332366.8 332380.4167 0
CVC4-inc 0 89 388787.5 388800.0469 0

n Non-competing.