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

Competition results for the QF_LIA division in the Incremental Track.

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

Benchmarks: 69
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
Yices2-fixed incrementaln 0 2004034432239.05731776.04687020 0
2018-Yices (incremental)n 0 2004034232110.05331686.69687220 0
Yices2 incremental 0 2004033732150.68931694.20787720 0
SMTInterpol 0 1811607753008.01851411.234192513736 0
SMTInterpol-fixedn 0 1809289553028.05351425.701194831936 0
MathSAT5n 0 1653840041739.86541350.49350281427 0
CVC4-inc 0 726572256615.00556558.7491277549241 0
z3n 0 725315359661.23259606.4651278806142 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.