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

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

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

Benchmarks: 150
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
SMTInterpol 0 98 5722.864 3671.0275252 0
cvc5-lfsc 0 80 13499.935 13495.1647070 0
cvc5 0 6 374.557 371.463144144 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
SMTInterpol 0 985722.8643671.0275252 0
cvc5-lfsc 0 8013499.93513495.1647070 0
cvc5 0 6374.557371.463144144 0

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