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_FP (Model Validation Track)

Competition results for the QF_FP logic in the Model Validation Track.

Page generated on 2022-08-10 11:19:11 +0000

Benchmarks: 10106
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 10103 8359.22 8439.5593 0
cvc5 0 10101 12006.629 12014.4135 0
z3-4.8.17n 0 10076 32878.327 39293.81317 0
MathSATn 0 8673 21182.505 21172.52514 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Bitwuzla 0 101038361.08439.3693 0
cvc5 0 1010112008.32912014.0835 0
z3-4.8.17n 0 1007633478.95739292.98317 0
MathSATn 0 867321184.54521171.74514 0

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