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 benchmark32.4181
(Un)Satisfiability was proved
Number of variables50
Number of clauses4450
Sum of the clauses size31150
Maximum clause length7
Minimum clause length7
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 50
Number of clauses of size over 54450

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
SAT09 reference solver: march_hi hi (complete)3210801UNSAT 32.4181 32.4182
march_rw 2011-03-02 (complete)3420597UNSAT 32.615 32.6197
MPhaseSAT_M 2011-02-16 (complete)3220994UNSAT 157.633 157.63
Satisfiability Solver Selector 2011-03-18 (complete)3220992UNSAT 202.35 202.48
borg-sat 11.03.02-par-random (fixed) (complete)3385584UNSAT 258.924 49.8817
ppfolio par (complete)3220995UNSAT 262.566 32.8558
borg-sat 11.03.02-random [DEPRECATED] (complete)3322071UNSAT 270.135 34.6033
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210802UNSAT 300.867 300.866
borg-sat 11.03.02-seq-random (fixed) (complete)3386784UNSAT 636.312 633.685
ppfolio seq (complete)3220996UNSAT 888.938 888.92
EagleUP 1.565.350 (incomplete)3220997? (TO) 4999.98 5000.01
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210803? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220993? (TO) 5000.02 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446261? (TO) 5000.06 4999.92
sattime2011 2011-03-02 (incomplete)3426877? (TO) 5000.06 4999.96
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210800? (TO) 5000.09 4999.91
csls pnorm-8cores (incomplete)3418002? (TO) 40000.4 5009.83

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: