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

Competition results for the QF_LRA logic in the Parallel Track.

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

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

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 UNSATUnsolvedTimeout Memout
SMTS portfolio 2 156964.3931541140 0
SMTS cube-and-conquer 2 157582.5371541140 0
SMTS cube-and-conquer (fixed) 3 163952.8421631330 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
SMTS portfolio 2 43744.2254402120 0
SMTS cube-and-conquer 2 43955.9564402120 0
SMTS cube-and-conquer (fixed) 2 32969.693303120 0

UNSAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
SMTS portfolio 0 113220.16811011250 0
SMTS cube-and-conquer 0 113626.58111011250 0
SMTS cube-and-conquer (fixed) 1 13983.15213013050 0

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
SMTS portfolio 0 6391.5696241313 0
SMTS cube-and-conquer 0 4393.1054221515 0
SMTS cube-and-conquer (fixed) 1 7366.2337251211 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.