SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

Rules
Benchmarks
Specs
Model Validation Track
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_Bitvec (Incremental Track)

Competition results for the QF_Bitvec division in the Incremental Track.

Page generated on 2023-07-06 16:05:24 +0000

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

Logics:

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
Bitwuzla 0 1642327556.427615.7453909 0
Yices2 Fixedn 0 1637419604.7719632.69588014 0
Yices2 0 1637119426.9219449.1591015 0
2022-Yices2n 0 1636819661.3819684.44594014 0
STP 0 1625915362.5915409.37703010 0
cvc5 0 1612270306.470354.79840017 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.