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

Competition results for the QF_LIA logic in the Incremental Track.

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

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

Winners

Parallel Performance
Yices2

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2021-Yices2 incrementaln 0 2004034231047.3130531.1187220 0
Yices2 Fixedn 0 2004034130722.1730201.3287320 0
Yices2 0 2004033730932.6130397.4987720 0
SMTInterpol 0 1687952067434.751865.91316169439 0
cvc5 0 389492563389.3163201.491614628950 0
OpenSMT 0 86029454665.8654631.41918092042 0

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