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 (Unsat Core Track)

Competition results for the QF_ABVFP logic in the Unsat Core Track.

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

Benchmarks: 1971
Time Limit: 1200 seconds
Memory Limit: 60 GB

Winners

Sequential PerformanceParallel Performance
BitwuzlaBitwuzla

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
Bitwuzla 0 16561 2781.146 2780.9521 0
2021-Bitwuzlan 0 16441 3025.379 3023.6851 0
z3-4.8.17n 0 16046 75088.72 74976.51332 0
cvc5 0 14095 326024.992 326033.116231 0
MathSATn 0 624 200.989 199.4720 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Bitwuzla 0 165612781.2462780.8521 0
2021-Bitwuzlan 0 164413025.4793023.5851 0
z3-4.8.17n 0 1604675098.7574975.24332 0
cvc5 0 14095326056.852326024.666231 0
MathSATn 0 624200.989199.4720 0

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