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 benchmark37.1314
(Un)Satisfiability was proved
Number of variables400
Number of clauses1704
Sum of the clauses size5112
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31704
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)3420680UNSAT 37.1314 37.1308
SAT09 reference solver: march_hi hi (complete)3211133UNSAT 40.7308 40.7306
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211134UNSAT 122.732 122.736
borg-sat 11.03.02-seq-random (fixed) (complete)3386867UNSAT 143.149 142.694
MPhaseSAT_M 2011-02-16 (complete)3221492UNSAT 176.528 176.525
Satisfiability Solver Selector 2011-03-18 (complete)3221490UNSAT 200.83 200.905
ppfolio par (complete)3221493UNSAT 297.864 37.2671
borg-sat 11.03.02-random [DEPRECATED] (complete)3322154UNSAT 298.238 37.9671
borg-sat 11.03.02-par-random (fixed) (complete)3385667UNSAT 304.226 38.7067
csls pnorm-8cores (incomplete)3418085? (problem) 21703.5 3236.12
EagleUP 1.565.350 (incomplete)3221495? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211135? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221491? (TO) 5000.03 4999.81
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211132? (TO) 5000.03 4999.81
ppfolio seq (complete)3221494? (TO) 5000.04 4999.91
sattime2011 2011-03-02 (incomplete)3426960? (TO) 5000.04 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446344? (TO) 5000.06 5000.22

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: