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

Competition results for the QF_AUFBV logic in the Incremental Track.

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

Benchmarks: 31
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 9665058.25061.8211 0
Yices2 Fixedn 0 9474651.274654.51207 0
2022-Yices2n 0 9474649.594655.59207 0
Yices2 0 9474704.084707.05207 0
cvc5 0 7259622.769627.4224216 0

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