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 benchmark37.5873
(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)3420741UNSAT 37.5873 37.593
SAT09 reference solver: march_hi hi (complete)3211377UNSAT 40.2779 40.2774
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211378UNSAT 128.702 128.709
borg-sat 11.03.02-seq-random (fixed) (complete)3386928UNSAT 138.375 137.934
MPhaseSAT_M 2011-02-16 (complete)3221858UNSAT 165.9 165.895
Satisfiability Solver Selector 2011-03-18 (complete)3221856UNSAT 196.35 196.485
borg-sat 11.03.02-par-random (fixed) (complete)3385728UNSAT 227.616 38.5118
ppfolio par (complete)3221859UNSAT 295.02 36.9086
borg-sat 11.03.02-random [DEPRECATED] (complete)3322215UNSAT 296.71 37.7557
csls pnorm-8cores (incomplete)3418146? (problem) 21211.7 2999.05
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221857? (TO) 5000.04 4999.81
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211379? (TO) 5000.04 4999.91
EagleUP 1.565.350 (incomplete)3221861? (TO) 5000.05 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446405? (TO) 5000.05 5000.02
sattime2011 2011-03-02 (incomplete)3427021? (TO) 5000.06 4999.92
ppfolio seq (complete)3221860? (TO) 5000.07 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211376? (TO) 5000.11 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: