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

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

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

Benchmarks: 462
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
veriT 0 411 44856.387 44723.28651020 0
smtinterpol 0 392 127193.655 119049.62570073 0
cvc5-lfsc 0 358 164361.016 164319.1331040104 0
OpenSMT 0 344 16751.743 16726.59551135 0
cvc5 0 122 399948.695 399921.1963400325 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
veriT 0 41144862.24744704.53651019 0
smtinterpol 0 392127624.725118590.8470070 0
cvc5-lfsc 0 358164387.126164315.0631040104 0
OpenSMT 0 34416752.55316726.28551135 0
cvc5 0 122400020.795399904.2763400325 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.