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

Competition results for the QF_UFLRA logic in the Incremental Track.

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

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

Winners

Parallel Performance
Yices2

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2020-z3n 0 852515160.3414971.1610 0
Yices2 Fixedn 0 850915530.1315325.45174 0
Yices2 0 850915821.1915608.04174 0
cvc5 0 848936358.7936019.833717 0
OpenSMT 0 841051285.5951049.5911641 0
SMTInterpol 0 834472544.6152036.518230 0

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