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

Competition results for the QF_UFLRA logic in the Parallel Track.

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

Benchmarks: 1
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 1 0174.31700010 0
SMTS cube-and-conquer (fixed) 1 0223.49500010 0
SMTS cube-and-conquer 1 0241.01700010 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
SMTS portfolio 1 0174.317000100 0
SMTS cube-and-conquer (fixed) 1 0223.495000100 0
SMTS cube-and-conquer 1 0241.017000100 0

UNSAT Performance

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

24 seconds Performance

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

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