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 (Unsat Core Track)

Competition results for the QF_LinearIntArith division in the Unsat Core Track.

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

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

Logics:

Winners

Sequential PerformanceParallel Performance
Yices2Yices2

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
MathSATn 0 5238494 169654.648 169643.154129 2
Yices2 0 5006882 136567.498 136583.072102 0
z3-4.8.17n 0 4950336 161760.401 161706.501122 0
2021-cvc5-ucn 0 4858335 206292.774 206899.307148 0
smtinterpol 0 4794493 175050.529 165898.425117 0
cvc5 0 4680564 229010.316 229022.923164 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
MathSATn 0 5238494169691.468169637.514129 2
Yices2 0 5006882136578.908136579.582102 0
z3-4.8.17n 0 4950336161777.061161701.731122 0
2021-cvc5-ucn 0 4858335206769.514206892.087148 0
smtinterpol 0 4794495175705.809165777.575115 0
cvc5 0 4680564229039.996229016.593164 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.