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 benchmark0.677896
(Un)Satisfiability was proved
Number of variables300
Number of clauses1278
Sum of the clauses size3834
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31278
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)3420515UNSAT 0.677896 0.678095
SAT09 reference solver: march_hi hi (complete)3210473UNSAT 0.747886 0.748288
borg-sat 11.03.02-par-random (fixed) (complete)3385502UNSAT 5.01324 1.51739
ppfolio par (complete)3220503UNSAT 5.49916 0.693709
borg-sat 11.03.02-random [DEPRECATED] (complete)3321989UNSAT 5.54016 1.65458
ppfolio seq (complete)3220504UNSAT 25.0392 25.0411
MPhaseSAT_M 2011-02-16 (complete)3220502UNSAT 27.6308 27.6317
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210474UNSAT 38.8321 38.8412
Satisfiability Solver Selector 2011-03-18 (complete)3220500UNSAT 46.24 46.3535
borg-sat 11.03.02-seq-random (fixed) (complete)3386702UNSAT 100.873 100.785
csls pnorm-8cores (incomplete)3417920? (problem) 20448.5 2844.05
EagleUP 1.565.350 (incomplete)3220505? (TO) 5000.02 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210472? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446179? (TO) 5000.04 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220501? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3426795? (TO) 5000.06 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210475? (TO) 5000.09 5000.01

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: