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

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

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

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

Winners

Sequential PerformanceParallel Performance
Z3++Z3++

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
Z3++ 0 4079 69474.705 69269.424118 8
2022-Z3++n 0 4078 67971.653 67776.922118 8
OpenSMT 0 4006 210164.737 210197.138205 0
cvc5 0 3999 96508.925 96349.56213 0
Yices2 0 3913 61708.648 61623.772299 0
SMTInterpol 0 3822 150971.875 127443.04390 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Z3++ 0 407969474.70569269.424118 8
2022-Z3++n 0 407867971.65367776.922118 8
OpenSMT 0 4006210164.737210197.138205 0
cvc5 0 399996508.92596349.56213 0
Yices2 0 391361708.64861623.772299 0
SMTInterpol 0 3822150971.875127443.04390 0

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