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

Competition results for the QF_ABVFP logic in the Incremental Track.

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

Benchmarks: 9214
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 27389166880.03966767.4096034 0
2021-Bitwuzla - fixedn 0 27389168594.30568332.1376034 0
MathSATn 0 273400171788.06171171.53755149 0
cvc5 0 2419091937456.141936886.023320421322 0

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