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

Competition results for the QF_BVFP logic in the Incremental Track.

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

Benchmarks: 300
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 200111367.41911348.658106 0
2021-Bitwuzla - fixedn 0 200011624.67511625.344117 0
cvc5 0 199516860.25416859.4831611 0
MathSATn 0 199219102.31519096.8811914 0
z3-4.8.17n 0 195954143.71954145.5555232 0

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