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

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

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

Benchmarks: 72
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 72 1929.836 1291.67100 0
cvc5-lfsc 0 71 3228.435 3228.50811 0
cvc5 0 16 482.779 478.7085655 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
SMTInterpol 0 721929.8361291.67100 0
cvc5-lfsc 0 713228.4353228.50811 0
cvc5 0 16482.779478.7085655 0

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