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 benchmark27.2119
(Un)Satisfiability was proved
Number of variables400
Number of clauses1704
Sum of the clauses size5112
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31704
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)3420658UNSAT 27.2119 27.2249
SAT09 reference solver: march_hi hi (complete)3211045UNSAT 29.9244 29.9234
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211046UNSAT 106.639 106.638
MPhaseSAT_M 2011-02-16 (complete)3221360UNSAT 111.675 111.675
borg-sat 11.03.02-seq-random (fixed) (complete)3386845UNSAT 127.76 127.587
Satisfiability Solver Selector 2011-03-18 (complete)3221358UNSAT 187.84 187.91
borg-sat 11.03.02-par-random (fixed) (complete)3385645UNSAT 197.805 29.1278
ppfolio par (complete)3221361UNSAT 218.2 27.4855
borg-sat 11.03.02-random [DEPRECATED] (complete)3322132UNSAT 229.156 29.3289
ppfolio seq (complete)3221362UNSAT 3435.34 3435.24
csls pnorm-8cores (incomplete)3418063? (problem) 20847.2 2914.4
EagleUP 1.565.350 (incomplete)3221363? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211047? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211044? (TO) 5000.07 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446322? (TO) 5000.07 5000.02
sattime2011 2011-03-02 (incomplete)3426938? (TO) 5000.08 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221359? (TO) 5000.09 4999.91

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: