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 benchmark344.772
(Un)Satisfiability was proved
Number of variables100
Number of clauses2130
Sum of the clauses size10650
Maximum clause length5
Minimum clause length5
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 52130
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)3420582UNSAT 344.772 344.768
SAT09 reference solver: march_hi hi (complete)3210741UNSAT 355.725 355.718
MPhaseSAT_M 2011-02-16 (complete)3220904UNSAT 369.957 369.957
borg-sat 11.03.02-seq-random (fixed) (complete)3386769UNSAT 454.178 458.047
Satisfiability Solver Selector 2011-03-18 (complete)3220902UNSAT 785.51 785.668
borg-sat 11.03.02-random [DEPRECATED] (complete)3322056UNSAT 2477.6 355.288
borg-sat 11.03.02-par-random (fixed) (complete)3385569UNSAT 2559.57 362.788
ppfolio par (complete)3220905UNSAT 2774.01 346.999
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210742? (exit code) 4998.54 4998.41
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210740? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210743? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220907? (TO) 5000.04 4999.81
sattime2011 2011-03-02 (incomplete)3426862? (TO) 5000.04 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446246? (TO) 5000.05 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220903? (TO) 5000.05 4999.91
ppfolio seq (complete)3220906? (TO) 5000.07 4999.91
csls pnorm-8cores (incomplete)3417987? (TO) 40000.2 5010.45

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: