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 benchmark129.859
(Un)Satisfiability was proved
Number of variables450
Number of clauses1917
Sum of the clauses size5751
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31917
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)3420591UNSAT 129.859 129.857
SAT09 reference solver: march_hi hi (complete)3210777UNSAT 143.047 143.047
borg-sat 11.03.02-seq-random (fixed) (complete)3386778UNSAT 236.576 237.265
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210778UNSAT 254.639 254.638
MPhaseSAT_M 2011-02-16 (complete)3220958UNSAT 441.905 441.895
Satisfiability Solver Selector 2011-03-18 (complete)3220956UNSAT 569.33 569.455
borg-sat 11.03.02-random [DEPRECATED] (complete)3322065UNSAT 934.396 134.266
borg-sat 11.03.02-par-random (fixed) (complete)3385578UNSAT 946.156 152.143
ppfolio par (complete)3220959UNSAT 1048.15 131.117
csls pnorm-8cores (incomplete)3417996? (problem) 20723.8 2856.1
ppfolio seq (complete)3220960? (TO) 5000.01 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220957? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210776? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3426871? (TO) 5000.06 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446255? (TO) 5000.07 4999.92
EagleUP 1.565.350 (incomplete)3220961? (TO) 5000.09 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210779? (TO) 5000.09 5000.01

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: