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

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

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

Benchmarks: 51
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 51 1888.496 1883.6360 0
cvc5 0 45 8314.467 8315.6086 0
z3-4.8.17n 0 42 14816.72 14819.9317 2
MathSATn 0 27 7673.186 7674.5786 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Bitwuzla 0 511888.4961883.6360 0
cvc5 0 458315.2378315.3986 0
z3-4.8.17n 0 4214818.6114819.5817 2
MathSATn 0 277674.2167674.3986 0

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