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

Competition results for the QF_UF division in the Incremental Track.

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

Benchmarks: 383
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
Yices 2.6.2 Incremental 0 76695.39578.23500 0
Z3n 0 766255.207238.72900 0
CVC4-inc 0 766453.169422.81700 0
SMTInterpol 0 7661562.596599.67700 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.