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_LinearIntArith (Proof Exhibition Track)

Competition results for the QF_LinearIntArith division in the Proof Exhibition Track.

Page generated on 2022-08-10 11:19:33 +0000

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

Logics: This track is experimental. Solvers are only ranked by performance, but no winner is selected.

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedAbstainedTimeout Memout
smtinterpol 0 2534 634348.529 564671.4683060317 0
OpenSMT 0 2023 229537.564 229128.36235446368 0
veriT 0 1786 1188627.8 1188370.69310540923 1
cvc5-lfsc 0 1542 1618509.902 1618912.915129801290 0
cvc5 0 899 2302105.063 2302394.657194101898 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
smtinterpol 0 2534656059.149560314.0773060293 0
OpenSMT 0 2023229554.504229126.08235446368 0
veriT 0 17861188722.091188334.61310540923 1
cvc5-lfsc 0 15421618958.0921618843.995129801290 0
cvc5 0 8992302658.5132302289.887194101897 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.