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 benchmark1657.58
(Un)Satisfiability was proved
Number of variables500
Number of clauses2130
Sum of the clauses size6390
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32130
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
march_rw 2011-03-02 (complete)3420458UNSAT 1657.58 1657.54
SAT09 reference solver: march_hi hi (complete)3210245UNSAT 1986.55 1986.52
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210246UNSAT 2549.49 2549.42
borg-sat 11.03.02-seq-random (fixed) (complete)3386645UNSAT 4637.41 4620.67
borg-sat 11.03.02-par-random (fixed) (complete)3385445UNSAT 13331.4 1672.16
borg-sat 11.03.02-random [DEPRECATED] (complete)3321932UNSAT 13371.1 1676.79
ppfolio par (complete)3220161UNSAT 13376 1673.24
csls pnorm-8cores (incomplete)3417863? (problem) 21656.6 3103.77
ppfolio seq (complete)3220162? (TO) 4999.95 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446122? (TO) 5000.02 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210247? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426738? (TO) 5000.04 4999.92
MPhaseSAT_M 2011-02-16 (complete)3220160? (TO) 5000.05 4999.93
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210244? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220159? (TO) 5000.06 4999.91
Satisfiability Solver Selector 2011-03-18 (complete)3220158? (TO) 5000.07 5000.02
EagleUP 1.565.350 (incomplete)3220163? (TO) 5000.07 4999.91

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: