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_BV (Incremental Track)

Competition results for the QF_BV logic in the Incremental Track.

Page generated on 2022-08-10 11:18:21 +0000

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

Winners

Parallel Performance
Yices2

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
Yices2 0 2527229810.44329742.6261616 0
2021-STPn 0 2525130772.87620772.30263713 0
MathSATn 0 2518642462.75942262.38970220 0
Bitwuzla 0 2514822149.44621982.98874010 0
STP 0 2513119588.17619499.08875711 0
cvc5 0 2496778835.87578697.95892115 0
z3-4.8.17n 0 2485252005.32451858.058103622 0

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