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

FPArith (Proof Exhibition Track)

Competition results for the FPArith division in the Proof Exhibition Track.

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

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

Logics: 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 ScoreUnsolvedAbstainedTimeout Memout
cvc5-lfsc 0 907 34751.899 34325.6392700259 1
cvc5 0 395 1691.772 1680.1427820770 1

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedAbstainedTimeout Memout
cvc5-lfsc 0 90734751.89934325.6392700259 1
cvc5 0 3951691.7721680.1427820770 1

n Non-competing.
Abstained: Total of benchmarks in logics in this division that solver chose to abstain from. For SAT/UNSAT scores, this column also includes benchmarks not known to be SAT/UNSAT.