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.161974
(Un)Satisfiability was proved
Number of variables50
Number of clauses1065
Sum of the clauses size5325
Maximum clause length5
Minimum clause length5
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 51065
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)3420614UNSAT 0.161974 0.162402
SAT09 reference solver: march_hi hi (complete)3210869UNSAT 0.168974 0.17055
ppfolio par (complete)3221097UNSAT 0.539917 0.191394
borg-sat 11.03.02-par-random (fixed) (complete)3385601UNSAT 1.42578 0.793618
ppfolio seq (complete)3221098UNSAT 2.94855 2.96156
Satisfiability Solver Selector 2011-03-18 (complete)3221094UNSAT 9.48 18.6271
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210870UNSAT 31.1103 31.1152
MPhaseSAT_M 2011-02-16 (complete)3221096UNSAT 42.0296 42.0336
borg-sat 11.03.02-seq-random (fixed) (complete)3386801UNSAT 101.362 101.139
borg-sat 11.03.02-random [DEPRECATED] (complete)3322088? (exit code) 1.81972 0.909929
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210868? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3221099? (TO) 5000.07 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446278? (TO) 5000.08 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210871? (TO) 5000.08 5000.01
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221095? (TO) 5000.1 4999.91
sattime2011 2011-03-02 (incomplete)3426894? (TO) 5000.1 4999.92
csls pnorm-8cores (incomplete)3418019? (TO) 40000.5 5008.82

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: