SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_LIA (Cloud Track)

Competition results for the QF_LIA logic in the Cloud Track.

Page generated on 2021-07-18 17:32:03 +0000

Benchmarks: 15
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 0 98747.42299066 0
SMTS cube-and-conquer 0 99194.45499066 0
Par4n 0 514214.5165231010 0
cvc5-gg 0 013200.00001511 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
SMTS portfolio 0 91547.422990066 0
SMTS cube-and-conquer 0 91994.454990066 0
Par4n 0 28955.5232207610 0
cvc5-gg 0 010800.00009611 0

UNSAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
Par4n 0 35258.9933033910 0
cvc5-gg 0 02400.00006911 0
SMTS cube-and-conquer 0 07200.0000696 0
SMTS portfolio 0 07200.0000696 0

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
SMTS cube-and-conquer 0 2343.4572201313 0
SMTS portfolio 0 1344.541101414 0
cvc5-gg 0 0264.00001511 0
Par4n 0 0360.00001515 0

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