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 benchmarkSAT
Best CPU time to get the best result obtained on this benchmark801.476
(Un)Satisfiability was proved
Number of variables50000
Number of clauses210000
Sum of the clauses size630000
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 3210000
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
adaptg2wsat2011 2011-03-02 (incomplete)3446113SAT 801.476 801.465
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210211SAT 2061.8 2061.75
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220105SAT 2210.07 2210.02
csls pnorm-8cores (incomplete)3417854SAT 7500.51 939.388
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210210? (exit code) 4998.96 4998.85
borg-sat 11.03.02-random [DEPRECATED] (complete)3321923? (MO) 7924.96 1004.41
borg-sat 11.03.02-par-random (fixed) (complete)3385436? (MO) 12528.2 1584.13
SAT09 reference solver: march_hi hi (complete)3210209? (TO) 5000.02 4999.91
ppfolio seq (complete)3220108? (TO) 5000.03 4999.91
MPhaseSAT_M 2011-02-16 (complete)3220106? (TO) 5000.04 4999.92
EagleUP 1.565.350 (incomplete)3220109? (TO) 5000.04 4999.81
Satisfiability Solver Selector 2011-03-18 (complete)3220104? (TO) 5000.05 5000.02
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210208? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3426729? (TO) 5000.1 5000.03
borg-sat 11.03.02-seq-random (fixed) (complete)3386636? (TO) 5000.1 5012.62
march_rw 2011-03-02 (complete)3420449? (TO) 5000.12 4999.93
ppfolio par (complete)3220107? (TO) 39970.3 5000.02

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:
--too large--