SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_LIA (Unsat Core Track)

Competition results for the QF_LIA logic in the Unsat Core Track.

Page generated on 2021-07-18 17:31:25 +0000

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

Winners

Sequential PerformanceParallel Performance
Yices2Yices2

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
Yices2 0 945405 33114.227 33121.37224 0
2020-Yices2-fixedn 0 945405 33125.446 33121.7424 0
z3n 0 944017 70716.3 70724.83857 0
cvc5-uc 0 924885 107676.567 107664.41283 0
MathSAT5n 0 924346 106928.191 106947.38889 0
SMTInterpol 0 811034 35403.421 34340.35322 0
SMTInterpol-remus 0 199339 149349.515 143924.70835 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Yices2 0 94540533118.77733120.20224 0
2020-Yices2-fixedn 0 94540533133.37633120.7224 0
z3n 0 94401770722.8270723.08857 0
cvc5-uc 0 924885107686.147107661.33283 0
MathSAT5n 0 924346106943.181106943.22889 0
SMTInterpol 0 81103435403.42134340.35322 0
SMTInterpol-remus 0 277415149370.985143865.12833 0

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