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 (Parallel Track)

Competition results for the QF_LinearRealArith division in the Parallel Track.

Page generated on 2022-08-10 14:49:55 +0000

Benchmarks: 21
Time Limit: 1200 seconds
Memory Limit: N/A GB

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

Parallel Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeout Memout
SMTS portfolio 4 1511764.393154118-20 0
SMTS cube-and-conquer 4 1512382.537154118-20 0
SMTS cube-and-conquer (fixed) 5 168752.842163137-20 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeout Memout
SMTS portfolio 2 43744.2254402150 0
SMTS cube-and-conquer 2 43955.9564402150 0
SMTS cube-and-conquer (fixed) 2 32969.693303150 0

UNSAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeout Memout
SMTS portfolio 2 115620.16811011460 0
SMTS cube-and-conquer 2 116026.58111011460 0
SMTS cube-and-conquer (fixed) 3 133383.15213013260 0

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedAbstainedTimeout Memout
SMTS portfolio 0 6487.56962417-217 0
SMTS cube-and-conquer 0 4489.10542219-219 0
SMTS cube-and-conquer (fixed) 1 7462.23372516-215 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.