SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2022

Rules
Benchmarks
Tools
Specs
Proof Exhibition Track
Parallel & Cloud Tracks
Participants
Results
Statistics
Comparisons
Slides

QF_DT (Proof Exhibition Track)

Competition results for the QF_DT logic in the Proof Exhibition Track.

Page generated on 2022-08-10 11:19:33 +0000

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

This track is experimental. Solvers are only ranked by performance, but no winner is selected.

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreUnsolvedTimeout Memout
cvc5-lfsc 0 2214 59592.128 59611.2484747 0
smtinterpol 0 2210 61866.285 60195.7945148 0
cvc5 0 2209 62498.77 62518.0895252 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
cvc5-lfsc 0 221459609.84859608.6384747 0
smtinterpol 0 221062467.14559409.7175145 0
cvc5 0 220962517.462515.0195252 0

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