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_UF (Proof Exhibition Track)

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

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

Benchmarks: 1090
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 1051 61439.469 61314.7113939 0
SMTInterpol 0 1045 30587.075 18799.474548 0
cvc5 0 60 382.129 378.19910301005 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
cvc5-lfsc 0 105161439.46961314.7113939 0
SMTInterpol 0 104531121.81517940.1224545 0
cvc5 0 60382.129378.19910301005 0

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