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

Competition results for the QF_UFLIA division in the Incremental Track.

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

Benchmarks: 309
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-Z3 (incremental)n 0 1296270666.41670695.49391351 0
z3n 0 1183173564.67273564.426504456 0
MathSAT5n 0 1007295643.14895643.503680376 0
Yices2-fixed incrementaln 0 931676487.65176487.299755960 0
Yices2 incremental 0 931076453.39576452.566756560 0
SMTInterpol 0 872492067.62691452.296815173 0
SMTInterpol-fixedn 0 872492061.73691456.843815173 0
CVC4-inc 0 694992766.1692766.114992671 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.