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

Competition results for the QF_FP logic in the Parallel Track.

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

Benchmarks: 15
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 614319.93360699 0
Par4n 8 70.13877080 0

SAT Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedN/ATimeout Memout
cvc5-gg 0 08400.0000789 0
Par4n 8 70.138770080 0

UNSAT Performance

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

24 seconds Performance

Solver Error Score Correct ScoreWall Time ScoreSolvedSolved SATSolved UNSATUnsolvedTimeout Memout
cvc5-gg 0 0360.00001515 0
Par4n 8 70.13877080 0

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