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

Competition results for the QF_UFLIA division in the Incremental Track.

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

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

Winners

Parallel Performance
SMTInterpol

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
2018-Z3 (incremental)n 0 762722175266.991175209.006387258 0
Z3n 0 759715198487.166198467.982687979 0
SMTInterpol 0 757451242787.652241991.895914395 0
CVC4-inc 0 756992210123.105210094.716960278 0
Yices 2.6.2 Incremental 0 756304192201.894192186.0351029077 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.