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

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

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

Benchmarks: 6
Time Limit: 43200 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
2018-Yices (incremental)n 0 8644966.92644969.74100 0
Yices 2.6.2 Incremental 0 8654136.9154137.8400 0
Z3n 0 77199789.4199791.094 0
CVC4-inc 0 45259186.2259200.0416 0
Boolector (incremental) 0 00.0810.285860 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.