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 benchmark367.009
(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
SAT09 reference solver: march_hi hi (complete)3210793UNSAT 367.009 367.002
march_rw 2011-03-02 (complete)3420595UNSAT 369.941 369.941
MPhaseSAT_M 2011-02-16 (complete)3220982UNSAT 455.77 455.757
Satisfiability Solver Selector 2011-03-18 (complete)3220980UNSAT 811.14 811.254
borg-sat 11.03.02-seq-random (fixed) (complete)3386782UNSAT 1211.47 1206.96
ppfolio par (complete)3220983UNSAT 3001.78 375.49
borg-sat 11.03.02-random [DEPRECATED] (complete)3322069UNSAT 3362.75 476.722
borg-sat 11.03.02-par-random (fixed) (complete)3385582UNSAT 3769.95 473.542
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210794? (exit code) 4998.56 4998.45
EagleUP 1.565.350 (incomplete)3220985? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210795? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220981? (TO) 5000.03 4999.91
ppfolio seq (complete)3220984? (TO) 5000.05 5000.02
sattime2011 2011-03-02 (incomplete)3426875? (TO) 5000.06 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210792? (TO) 5000.08 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446259? (TO) 5000.09 5000.12
csls pnorm-8cores (incomplete)3418000? (TO) 40000.7 5011.13

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: