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

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

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

Benchmarks: 2459
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 2384 130378.289 112060.51575077 0
cvc5-lfsc 0 2380 328493.058 328317.26579077 0
OpenSMT 0 2170 23006.43 22851.4951027910 0
veriT 0 2133 64635.541 64309.1134727938 5
cvc5 0 236 2595591.093 2595418.445222302114 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
smtinterpol 0 2384132687.489111585.43675075 0
cvc5-lfsc 0 2380328508.118328315.09579077 0
OpenSMT 0 217023006.8622851.2651027910 0
veriT 0 213364642.66164306.8334727938 5
cvc5 0 2362595939.5432595313.045222302114 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.