SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2023

Rules
Benchmarks
Specs
Model Validation Track
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_LRA (Model Validation Track)

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

Page generated on 2023-07-06 16:06:00 +0000

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

Winners

Sequential PerformanceParallel Performance
OpenSMTOpenSMT

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
2022-OpenSMTn 0 507 15071.79 15090.31714 0
OpenSMT 0 506 15697.115 15681.81315 0
Yices2 0 498 11205.356 11207.4423 0
cvc5 0 494 24405.546 24389.96527 0
SMTInterpol 0 478 36117.604 32085.38643 0
Yaga 0 409 10502.71 10505.51184 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
2022-OpenSMTn 0 50715071.7915090.31714 0
OpenSMT 0 50615697.11515681.81315 0
Yices2 0 49811205.35611207.4423 0
cvc5 0 49424405.54624389.96527 0
SMTInterpol 0 47836117.60432085.38643 0
Yaga 0 40910502.7110505.51184 0

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