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

Competition results for the QF_AUFLIA division in the Incremental Track.

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

Benchmarks: 72
Time Limit: 2400 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 46998643122.2432935.72500 0
Yices 2.6.2 Incremental 0 46998643213.4243029.45100 0
Z3n 0 469986410000.589796.6400 0
SMTInterpol 0 469986418585.17117119.4400 0
CVC4-inc 0 429146110556.1810343.2274084031 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.