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 benchmark4321.31
(Un)Satisfiability was proved
Number of variables70
Number of clauses6230
Sum of the clauses size43610
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 56230

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
SAT09 reference solver: march_hi hi (complete)3210673UNSAT 4321.31 4321.18
march_rw 2011-03-02 (complete)3420565UNSAT 4823.67 4823.52
ppfolio par (complete)3220803UNSAT 35261 4410.77
borg-sat 11.03.02-random [DEPRECATED] (complete)3322039UNSAT 35910 4508.97
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210674? (exit code) 4998.61 4998.47
borg-sat 11.03.02-par-random (fixed) (complete)3385552? (MO) 27660.4 4293.44
Satisfiability Solver Selector 2011-03-18 (complete)3220800? (TO) 5000.01 5000.02
borg-sat 11.03.02-seq-random (fixed) (complete)3386752? (TO) 5000.02 4982.2
adaptg2wsat2011 2011-03-02 (incomplete)3446229? (TO) 5000.03 4999.93
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210672? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220805? (TO) 5000.04 4999.81
MPhaseSAT_M 2011-02-16 (complete)3220802? (TO) 5000.04 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210675? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220801? (TO) 5000.06 4999.91
ppfolio seq (complete)3220804? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3426845? (TO) 5000.08 4999.92
csls pnorm-8cores (incomplete)3417970? (TO) 40000.8 5007.12

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: