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_AUFBVNIA (Incremental Track)

Competition results for the QF_AUFBVNIA division in the Incremental Track.

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

Benchmarks: 44
Time Limit: 2400 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
MathSAT-na-ext

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
MathSAT-na-ext 0 763445.1393441.19800 0
MathSAT-default 0 753667.7023664.17411 0
CVC4-inc 0 6531841.88831839.2771111 0
Z3n 0 00.1280.478760 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.