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 benchmark370.187
(Un)Satisfiability was proved
Number of variables60
Number of clauses5340
Sum of the clauses size37380
Maximum clause length7
Minimum clause length7
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 30
Number of clauses of size 40
Number of clauses of size 50
Number of clauses of size over 55340

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
SAT09 reference solver: march_hi hi (complete)3210969UNSAT 370.187 370.188
march_rw 2011-03-02 (complete)3420639UNSAT 371.017 371.027
MPhaseSAT_M 2011-02-16 (complete)3221246UNSAT 458.816 458.805
Satisfiability Solver Selector 2011-03-18 (complete)3221244UNSAT 812.63 812.714
borg-sat 11.03.02-seq-random (fixed) (complete)3386826UNSAT 1173.75 1169.03
ppfolio par (complete)3221247UNSAT 2991.46 374.296
borg-sat 11.03.02-random [DEPRECATED] (complete)3322113UNSAT 3423.21 475.189
borg-sat 11.03.02-par-random (fixed) (complete)3385626UNSAT 3440.96 510.741
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210970? (exit code) 4998.55 4998.52
ppfolio seq (complete)3221248? (TO) 4999.79 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210968? (TO) 5000.04 4999.81
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221245? (TO) 5000.04 4999.81
adaptg2wsat2011 2011-03-02 (incomplete)3446303? (TO) 5000.06 4999.92
sattime2011 2011-03-02 (incomplete)3426919? (TO) 5000.07 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210971? (TO) 5000.07 4999.91
EagleUP 1.565.350 (incomplete)3221249? (TO) 5000.1 5000.01
csls pnorm-8cores (incomplete)3418044? (TO) 40001 5010.54

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: