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 benchmark
Best CPU time to get the best result obtained on this benchmark
(Un)Satisfiability was proved
Number of variables125
Number of clauses2662
Sum of the clauses size13310
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 52662
Number of clauses of size over 50

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
borg-sat 11.03.02-par-random (fixed) (complete)3385513? 39076.6 4904.37
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210518? (exit code) 4998.45 4998.33
Satisfiability Solver Selector 2011-03-18 (complete)3220566? (TO) 4999.38 5000.02
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220567? (TO) 5000.02 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210516? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426806? (TO) 5000.03 4999.92
EagleUP 1.565.350 (incomplete)3220571? (TO) 5000.03 4999.91
borg-sat 11.03.02-seq-random (fixed) (complete)3386713? (TO) 5000.04 4981.07
SAT09 reference solver: march_hi hi (complete)3210517? (TO) 5000.06 4999.94
adaptg2wsat2011 2011-03-02 (incomplete)3446190? (TO) 5000.07 5000.02
ppfolio seq (complete)3220570? (TO) 5000.08 4999.91
march_rw 2011-03-02 (complete)3420526? (TO) 5000.09 5000.05
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210519? (TO) 5000.09 4999.91
MPhaseSAT_M 2011-02-16 (complete)3220568? (TO) 5000.09 4999.94
ppfolio par (complete)3220569? (TO) 34969.7 5000.02
csls pnorm-8cores (incomplete)3417931? (TO) 40000.2 5010.55
borg-sat 11.03.02-random [DEPRECATED] (complete)3322000? (TO) 40000.8 5017.26

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: