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_BVFP (Parallel Track)

Competition results for the QF_BVFP logic in the Parallel Track.

Page generated on 2021-07-18 17:32:11 +0000

Benchmarks: 3
Time Limit: 1200 seconds
Memory Limit: N/A GB

This track is experimental. Solvers are only ranked by performance, but no winner is selected.

Parallel Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5-gg 0 12460.02610122 0
Par4n 1 20.02722010 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5-gg 0 02400.0000212 0
Par4n 1 20.027220010 0

UNSAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5-gg 0 160.026101022 0
Par4n 0 00.0000120 0

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5-gg 0 072.000033 0
Par4n 1 20.02722010 0

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