SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_UFBV (Incremental Track)

Competition results for the QF_UFBV logic in the Incremental Track.

Page generated on 2021-07-18 17:30:28 +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
2020-Bitwuzla-fixedn 0 28392141.4982111.63200 0
Bitwuzla 0 28392219.4682186.60600 0
2020-Yices2 incrementaln 0 28353107.6953075.27642 0
Yices2 incremental 0 28353107.0823076.94542 0
MathSAT5n 0 27077995.7157958.651325 0
cvc5-inc 0 258615109.56915025.0122537 0
z3n 0 230622480.07422437.34953312 0

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