SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2022

Rules
Benchmarks
Tools
Specs
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_LIA (Incremental Track)

Competition results for the QF_LIA logic in the Incremental Track.

Page generated on 2022-08-10 11:18:21 +0000

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

Winners

Parallel Performance
Yices2

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2021-Yices2 incrementaln 0 2004033132529.77232010.02288320 0
Yices2 0 2004033132607.90532086.35588320 0
z3-4.8.17n 0 1963753652201.51851619.05640367832 0
MathSATn 0 1737328641517.38241028.937266792826 0
smtinterpol 0 1079883565748.62564494.406924237948 0
cvc5 0 373325565635.31965606.8881630795950 0
OpenSMT 0 83441656697.84656693.3661920679842 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.