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 benchmark1709.82
(Un)Satisfiability was proved
Number of variables500
Number of clauses2130
Sum of the clauses size6390
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32130
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)3420538UNSAT 1709.82 1709.77
SAT09 reference solver: march_hi hi (complete)3210565UNSAT 1889.91 1889.85
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210566UNSAT 3021.92 3021.83
borg-sat 11.03.02-seq-random (fixed) (complete)3386725UNSAT 4757.86 4737.2
borg-sat 11.03.02-random [DEPRECATED] (complete)3322012UNSAT 13103.2 2131.48
borg-sat 11.03.02-par-random (fixed) (complete)3385525UNSAT 13316 2401.71
ppfolio par (complete)3220641UNSAT 13876.2 1735.66
csls pnorm-8cores (incomplete)3417943? (problem) 21317.6 3023.09
Satisfiability Solver Selector 2011-03-18 (complete)3220638? (TO) 5000.01 4999.92
sattime2011 2011-03-02 (incomplete)3426818? (TO) 5000.03 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446202? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210567? (TO) 5000.03 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220639? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220643? (TO) 5000.04 4999.81
ppfolio seq (complete)3220642? (TO) 5000.05 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210564? (TO) 5000.06 4999.91
MPhaseSAT_M 2011-02-16 (complete)3220640? (TO) 5000.1 4999.93

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: