SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2020

Rules
Benchmarks
Tools
Specs
Participants
Results
Slides

QF_LRA (Incremental Track)

Competition results for the QF_LRA division in the Incremental Track.

Page generated on 2020-07-04 11:47:56 +0000

Benchmarks: 10
Time Limit: 1200 seconds
Memory Limit: 60 GB

Winners

Parallel Performance
Yices2 incremental

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
2018-MathSAT (incremental)n 0 12378473.3218472.9092785 0
MathSAT5n 0 97811011.88711011.7325379 0
Yices2-fixed incrementaln 0 91312000.012000.060210 0
Yices2 incremental 0 91112000.012000.060410 0
OpenSMT 0 88410184.18510184.4666317 0
SMTInterpol 0 65710263.43110202.7648588 0
SMTInterpol-fixedn 0 65610264.96310201.6078598 0
CVC4-inc 0 62812000.012000.088710 0
z3n 0 61412000.012000.090110 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.