SAT 2011 Competition: main competition (phase 2): solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryRANDOM (random instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1906.91
(Un)Satisfiability was proved
Number of variables550
Number of clauses2343
Sum of the clauses size7029
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32343
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 50

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
SAT09 reference solver: march_hi hi (complete)3210661UNSAT 1906.91 1906.85
march_rw 2011-03-02 (complete)3420562UNSAT 1917.7 1917.64
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210662UNSAT 2777.62 2777.53
borg-sat 11.03.02-seq-random (fixed) (complete)3386749UNSAT 4584.03 4569.39
borg-sat 11.03.02-par-random (fixed) (complete)3385549UNSAT 11102.2 1954.62
borg-sat 11.03.02-random [DEPRECATED] (complete)3322036UNSAT 13895.3 1741.74
ppfolio par (complete)3220785UNSAT 13975.8 1748.15
csls pnorm-8cores (incomplete)3417967? (problem) 21660.4 3073.69
Satisfiability Solver Selector 2011-03-18 (complete)3220782? (TO) 5000.02 5000.02
ppfolio seq (complete)3220786? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210663? (TO) 5000.06 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210660? (TO) 5000.06 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220783? (TO) 5000.06 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446226? (TO) 5000.08 4999.92
EagleUP 1.565.350 (incomplete)3220787? (TO) 5000.09 4999.91
MPhaseSAT_M 2011-02-16 (complete)3220784? (TO) 5000.09 4999.93
sattime2011 2011-03-02 (incomplete)3426842? (TO) 5000.09 5000.02

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found: