SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2020

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

QF_UFBV (Incremental Track)

Competition results for the QF_UFBV division in the Incremental Track.

Page generated on 2020-07-04 11:47:56 +0000

Benchmarks: 932
Time Limit: 1200 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
Bitwuzla-fixedn 0 22391848.8761831.50800 0
Bitwuzla 0 22391926.5241905.50700 0
2018-Boolector (incremental)n 0 22383716.9243699.41811 0
Yices2 incremental 0 22352934.6412913.27142 0
Yices2-fixed incrementaln 0 22352941.8092915.25242 0
z3n 0 219711567.04811510.634424 0
MathSAT5n 0 21745524.595446.175654 0
CVC4-inc 0 21409738.0599677.991995 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.