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_FP (Unsat Core Track)

Competition results for the QF_FP logic in the Unsat Core Track.

Page generated on 2023-07-06 16:05:43 +0000

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

Winners

Sequential PerformanceParallel Performance
cvc5cvc5

Sequential Performance

Solver Error Score Correct Score CPU Time Score Wall Time ScoreTimeout Memout
Bitwuzla Fixedn 0 87 7890.666 7948.8314 0
cvc5 0 86 5904.478 5901.5617 0
2022-z3-4.8.17n 0 20 9448.778 9323.769733 0
Bitwuzla 17* 5 9060.007 9109.64113 0

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreTimeout Memout
Bitwuzla Fixedn 0 877890.6667948.8314 0
cvc5 0 865904.4785901.5617 0
2022-z3-4.8.17n 0 209448.7789323.769733 0
Bitwuzla 17* 59060.0079109.64113 0

n Non-competing.
N/A: Benchmarks not known to be SAT/UNSAT, respectively.
* The error score is caused by Bitwuzla using the wrong names in the unsat core output (syntactic problems). It does not indicate an unsoundness.