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 benchmark362.918
(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)3210961UNSAT 362.918 362.909
march_rw 2011-03-02 (complete)3420637UNSAT 368.614 368.605
MPhaseSAT_M 2011-02-16 (complete)3221234UNSAT 452.999 452.987
Satisfiability Solver Selector 2011-03-18 (complete)3221232UNSAT 805.64 805.72
borg-sat 11.03.02-seq-random (fixed) (complete)3386824UNSAT 869.862 867.057
borg-sat 11.03.02-random [DEPRECATED] (complete)3322111UNSAT 2792.89 388.878
borg-sat 11.03.02-par-random (fixed) (complete)3385624UNSAT 2979.89 374.345
ppfolio par (complete)3221235UNSAT 2987.7 373.732
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210962? (exit code) 4998.56 4998.34
ppfolio seq (complete)3221236? (TO) 4999.94 5000.01
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221233? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3221237? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3426917? (TO) 5000.05 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210963? (TO) 5000.08 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210960? (TO) 5000.09 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446301? (TO) 5000.1 5000.02
csls pnorm-8cores (incomplete)3418042? (TO) 40000.2 5009.53

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: