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 benchmark352.104
(Un)Satisfiability was proved
Number of variables60
Number of clauses5340
Sum of the clauses size37380
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 55340

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
march_rw 2011-03-02 (complete)3420838UNSAT 352.104 352.098
SAT09 reference solver: march_hi hi (complete)3211765UNSAT 379.459 379.452
MPhaseSAT_M 2011-02-16 (complete)3222440UNSAT 441.368 441.36
Satisfiability Solver Selector 2011-03-18 (complete)3222438UNSAT 826.25 826.358
borg-sat 11.03.02-seq-random (fixed) (complete)3387025UNSAT 1157.94 1153.77
ppfolio par (complete)3222441UNSAT 2853.66 356.961
borg-sat 11.03.02-par-random (fixed) (complete)3385825UNSAT 2926.64 558.017
borg-sat 11.03.02-random [DEPRECATED] (complete)3322312UNSAT 3621.49 454.499
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211766? (exit code) 4998.54 4998.42
ppfolio seq (complete)3222442? (TO) 5000.01 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211767? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211764? (TO) 5000.04 4999.81
EagleUP 1.565.350 (incomplete)3222443? (TO) 5000.06 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222439? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3427118? (TO) 5000.06 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446502? (TO) 5000.1 4999.92
csls pnorm-8cores (incomplete)3418243? (TO) 40000.2 5009.54

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: