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

Competition results for the QF_BVFP logic in the Incremental Track.

Page generated on 2021-07-18 17:30:28 +0000

Benchmarks: 274
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 195810563.05410563.372127 0
Bitwuzla - fixedn 0 195810585.57210585.965127 0
2020-Bitwuzla-fixedn 0 195810981.55910982.002127 0
cvc5-inc 0 195612962.46612959.252148 0
2020-CVC4-incn 0 195116283.74216283.1671911 0
z3n 0 184761749.45561740.32912341 0
MathSAT5n 1 195214865.36714859.921810 0

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