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

ABVFPLRA (Incremental Track)

Competition results for the ABVFPLRA logic in the Incremental Track.

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

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

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
Bitwuzla 0 2269228.67229.0300 0
cvc5 0 8189.389.9114511 0
2022-UltimateEliminator+MathSATn 0 818105.5580.5314510 0
UltimateEliminator+MathSAT 0 27932.4515.5519900 0

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