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

Competition results for the QF_IDL logic in the Parallel Track.

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

Benchmarks: 58
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 44 273212.373220610 0
SMTS cube-and-conquer 44 273212.898220610 0
SMTS cube-and-conquer (fixed) 44 273213.725220610 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
SMTS portfolio 23 227612.37322023330 0
SMTS cube-and-conquer 23 227612.89822023330 0
SMTS cube-and-conquer (fixed) 23 227613.72522023330 0

UNSAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
SMTS cube-and-conquer 21 025200.000021370 0
SMTS cube-and-conquer (fixed) 21 025200.000021370 0
SMTS portfolio 21 025200.000021370 0

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
SMTS portfolio 0 21476.3732206161 0
SMTS cube-and-conquer 0 21476.8982206161 0
SMTS cube-and-conquer (fixed) 0 21477.7252206161 0

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