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

UFBVDT (Single Query Track)

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

Page generated on 2023-07-06 16:04:54 +0000

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

Winners

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

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 0 0.0 0.000010 0
UltimateIntBlastingWrapper+SMTInterpol 0 0 0.0 0.000010 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 00.00.000010 0
UltimateIntBlastingWrapper+SMTInterpol 0 00.00.000010 0

SAT Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5 0 00.00.0000010 0
UltimateIntBlastingWrapper+SMTInterpol 0 00.00.0000010 0

UNSAT Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5 0 00.00.0000010 0
UltimateIntBlastingWrapper+SMTInterpol 0 00.00.0000010 0

24 seconds Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5 0 00.00.000010 0
UltimateIntBlastingWrapper+SMTInterpol 0 00.00.000010 0

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