SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Previous Competitions
SMT-LIB

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 Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
2018-Yices (incremental)n 0 86 44966.926 44969.74100 0
Yices 2.6.2 Incremental 0 86 54136.91 54137.8400 0
Z3n 0 77 199789.4 199791.094 0
CVC4-inc 0 45 259186.2 259200.0416 0
Boolector (incremental) 0 0 0.081 0.285860 0

n Non-competing.