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

Competition results for the QF_UFBV logic in the Incremental Track.

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

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

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
Bitwuzla 0 27662056.3592028.7900 0
2020-Yices2 incrementaln 0 27602900.0892871.19962 0
Yices2 0 27602911.0042881.362 0
z3-4.8.17n 0 27427147.5757108.866244 0
MathSATn 0 26977167.7397119.904695 0
cvc5 0 265215804.19615689.7621149 0

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