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_LinearRealArith (Model Validation Track)

Competition results for the QF_LinearRealArith division in the Model Validation Track.

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

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

Logics:

Winners

Sequential PerformanceParallel Performance
OpenSMTOpenSMT

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreAbstainedTimeout Memout
OpenSMT 0 606 45953.261 45966.55419 0
2021-Yices2 model-validationn 0 601 39164.898 39129.66324 0
Yices2 0 601 39260.871 39269.26624 0
cvc5 0 596 61835.316 61841.42129 0
z3-4.8.17n 0 595 58503.93 58412.5830 0
MathSATn 0 579 76601.709 76604.39345 0
smtinterpol 0 579 95678.469 90490.19746 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreAbstainedTimeout Memout
OpenSMT 0 60645957.64145965.78419 0
2021-Yices2 model-validationn 0 60139166.53839128.92324 0
Yices2 0 60139263.47139268.20624 0
cvc5 0 59661842.83661840.13129 0
z3-4.8.17n 0 59558508.5758411.5130 0
smtinterpol 0 58195706.19990441.61744 0
MathSATn 0 57976609.18976602.35345 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.