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 benchmark0.264959
(Un)Satisfiability was proved
Number of variables250
Number of clauses1065
Sum of the clauses size3195
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31065
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)3420753UNSAT 0.264959 0.265426
SAT09 reference solver: march_hi hi (complete)3211425UNSAT 0.290955 0.291993
ppfolio par (complete)3221931UNSAT 0.814875 0.277839
borg-sat 11.03.02-par-random (fixed) (complete)3385740UNSAT 2.79557 1.20331
borg-sat 11.03.02-random [DEPRECATED] (complete)3322227UNSAT 2.98554 1.20144
ppfolio seq (complete)3221932UNSAT 6.74397 6.74425
Satisfiability Solver Selector 2011-03-18 (complete)3221928UNSAT 7.94 8.07357
MPhaseSAT_M 2011-02-16 (complete)3221930UNSAT 27.0549 27.0587
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211426UNSAT 33.4249 33.4265
borg-sat 11.03.02-seq-random (fixed) (complete)3386940UNSAT 101.668 101.473
csls pnorm-8cores (incomplete)3418158? (problem) 19923 2782.42
adaptg2wsat2011 2011-03-02 (incomplete)3446417? (TO) 5000.02 4999.92
EagleUP 1.565.350 (incomplete)3221933? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3427033? (TO) 5000.04 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221929? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211427? (TO) 5000.06 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211424? (TO) 5000.1 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: