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_SNIA (Single Query Track)

Competition results for the QF_SNIA logic in the Single Query Track.

Page generated on 2022-08-10 11:17:45 +0000

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

Winners

Sequential PerformanceParallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24s Performance (parallel)
cvc5cvc5cvc5 cvc5

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 70 2.058 2.0257070000 0
z3-4.8.17n 0 70 2.676 2.5457070000 0
OSTRICH 0 70 191.42 109.5077070000 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 702.0582.0257070000 0
z3-4.8.17n 0 702.6762.5457070000 0
OSTRICH 0 70191.42109.5077070000 0

SAT Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5 0 702.0582.02570700000 0
z3-4.8.17n 0 702.6762.54570700000 0
OSTRICH 0 70191.42109.50770700000 0

UNSAT Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5 0 00.00.00000700 0
OSTRICH 0 00.00.00000700 0
z3-4.8.17n 0 00.00.00000700 0

24 seconds Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 702.0582.0257070000 0
z3-4.8.17n 0 702.6762.5457070000 0
OSTRICH 0 70191.42109.5077070000 0

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