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

Competition results for the QF_Equality+LinearArith division in the Incremental Track.

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

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

Logics:

Winners

Parallel Performance
SMTInterpol

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
2020-z3n 0 5688167101871.58101388.1645781067 0
SMTInterpol 0 4883289200740.25161523.598506590122 0
cvc5 0 4611536157732.25157085.8811224120108 0
Yices2 Fixedn 0 407446289049.7688598.071659486077 0
Yices2 0 407445289670.4889212.441659496077 0
OpenSMT 0 358984212709.23212496.1453749640178 0

n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.