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

LIA (Incremental Track)

Competition results for the LIA division in the Incremental Track.

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

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

Winners

Parallel Performance
UltimateEliminator+MathSAT

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
z3n 0 253937.276.4900 0
2018-Z3 (incremental)n 0 253938.8128.1200 0
UltimateEliminator+MathSAT 0 2539399.92545.56200 0
CVC4-inc 0 2539361.13959.86500 0
SMTInterpol 0 2539185.64821.1920 0
SMTInterpol-fixedn 0 2539164.76421.73920 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.