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_Equality+LinearArith (Proof Exhibition Track)

Competition results for the QF_Equality+LinearArith division in the Proof Exhibition Track.

Page generated on 2022-08-10 11:19:33 +0000

Benchmarks: 1301
Time Limit: 1200 seconds
Memory Limit: 60 GB

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

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedAbstainedTimeout Memout
smtinterpol 0 1213 123812.858 116123.78788089 0
cvc5-lfsc 0 1029 355020.373 355027.7282720271 0
veriT 0 610 133882.861 133734.5196256693 6
cvc5 0 423 1041022.744 1040986.5588780860 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
smtinterpol 0 1213127133.528115536.36188086 0
cvc5-lfsc 0 1029355067.953355017.7882720271 0
veriT 0 610133911.351133723.4396256692 6
cvc5 0 4231041155.4841040946.0288780860 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.