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_Equality+LinearArith (Model Validation Track)

Competition results for the QF_Equality+LinearArith division in the Model Validation Track.

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

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

Logics:

Winners

Sequential PerformanceParallel Performance
smtinterpolsmtinterpol

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
smtinterpol 0 880 26314.573 22993.20110 0
2021-SMTInterpoln 0 880 27162.66 23792.86810 0
cvc5 0 853 74790.819 74808.53738 0
z3-4.8.17n 0 852 52266.91 52116.12339 0
Yices2 0 825 95264.222 95281.66866 0
OpenSMT 0 681 6818.761 6792.5084 0
MathSATn 0 538 125071.898 125098.828103 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
smtinterpol 0 88026314.57322993.20110 0
2021-SMTInterpoln 0 88027162.6623792.86810 0
cvc5 0 85374799.91974806.60738 0
z3-4.8.17n 0 85252269.1152115.46339 0
Yices2 0 82595274.72295278.98866 0
OpenSMT 0 6816820.2516792.3084 0
MathSATn 0 538125093.478125093.868103 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.