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 benchmark1.27481
(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)3420542UNSAT 1.27481 1.27554
SAT09 reference solver: march_hi hi (complete)3210581UNSAT 1.40679 1.40651
ppfolio par (complete)3220665UNSAT 10.3024 1.2954
borg-sat 11.03.02-par-random (fixed) (complete)3385529UNSAT 15.0447 2.94761
borg-sat 11.03.02-random [DEPRECATED] (complete)3322016UNSAT 18.7961 3.48515
MPhaseSAT_M 2011-02-16 (complete)3220664UNSAT 28.6726 28.6737
ppfolio seq (complete)3220666UNSAT 52.0621 52.0621
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210582UNSAT 55.2756 55.2812
Satisfiability Solver Selector 2011-03-18 (complete)3220662UNSAT 91.3728 92.3064
borg-sat 11.03.02-seq-random (fixed) (complete)3386729UNSAT 102.736 102.487
csls pnorm-8cores (incomplete)3417947? (problem) 20149.3 2819.15
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210580? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220667? (TO) 5000.03 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220663? (TO) 5000.04 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446206? (TO) 5000.05 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210583? (TO) 5000.08 5000.01
sattime2011 2011-03-02 (incomplete)3426822? (TO) 5000.08 4999.92

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: