SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

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

QF_LIA (Unsat Core Track)

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

Page generated on 2023-07-06 16:05:43 +0000

Benchmarks: 982
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 4823265 5531.657 5466.20916 1
2022-MathSATn 0 4368369 8412.885 8371.08953 0
cvc5 0 3460115 16667.289 16620.2864 0
SMTInterpol 0 3438608 20337.73 15113.03437 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Yices2 0 48232655531.6575466.20916 1
2022-MathSATn 0 43683698412.8858371.08953 0
cvc5 0 346011510668.18910619.9764 0
SMTInterpol 0 343860820337.7315113.03437 0

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