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

Competition results for the QF_UFLIA logic in the Incremental Track.

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

Benchmarks: 386
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 48872881113.4481126.62643266 0
Yices2 Fixedn 0 48497570508.0570511.441018571 0
Yices2 0 48496570820.7870822.791019571 0
SMTInterpol 0 484796107170.7891615.931036489 0
cvc5 0 39501698760.098790.1110014482 0
OpenSMT 0 21488102314.78102352.4847367288 0

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