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

Competition results for the QF_LRA logic in the Incremental Track.

Page generated on 2023-07-06 16:05:24 +0000

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

Winners

Parallel Performance
OpenSMT

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2018-MathSAT-incrementaln 0 12567577.737579.42596 0
OpenSMT 0 9538467.248468.085626 0
Yices2 Fixedn 0 90911353.3111355.1160610 0
Yices2 0 90611329.0411330.6560910 0
cvc5 0 69511302.3911303.6382010 0
SMTInterpol 0 51312918.3411099.42100210 0

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