SMT-COMP

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

Home
Introduction
Benchmark Submission
Publications
SMT-LIB
Previous Editions

SMT-COMP 2021

Rules
Benchmarks
Tools
Specs
Parallel & Cloud Tracks
Participants
Results
Slides

QF_UFFP (Incremental Track)

Competition results for the QF_UFFP logic in the Incremental Track.

Page generated on 2021-07-18 17:30:28 +0000

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

Winners

Parallel Performance
Bitwuzla

Parallel Performance

Solver Error Score Correct ScoreCPU Time ScoreWall Time ScoreUnsolvedTimeout Memout
2020-Bitwuzla-fixedn 0 20.1460.14600 0
Bitwuzla 0 20.1510.15100 0
Bitwuzla - fixedn 0 20.1520.15100 0
cvc5-inc 0 20.4650.46400 0
2020-CVC4-incn 0 20.5760.57500 0
MathSAT5n 0 21.2221.22200 0

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