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.150977
(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)3420548UNSAT 0.150977 0.151487
SAT09 reference solver: march_hi hi (complete)3210605UNSAT 0.156976 0.157423
ppfolio par (complete)3220701UNSAT 0.312952 0.162334
borg-sat 11.03.02-par-random (fixed) (complete)3385535UNSAT 1.54177 0.970764
ppfolio seq (complete)3220702UNSAT 4.51331 4.51507
Satisfiability Solver Selector 2011-03-18 (complete)3220698UNSAT 8.35 8.47579
MPhaseSAT_M 2011-02-16 (complete)3220700UNSAT 24.1743 24.1747
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210606UNSAT 31.1093 31.1104
borg-sat 11.03.02-seq-random (fixed) (complete)3386735UNSAT 100.916 101.075
borg-sat 11.03.02-random [DEPRECATED] (complete)3322022? (exit code) 1.85572 1.10805
EagleUP 1.565.350 (incomplete)3220703? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446212? (TO) 5000.04 4999.92
sattime2011 2011-03-02 (incomplete)3426828? (TO) 5000.05 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220699? (TO) 5000.05 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210604? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210607? (TO) 5000.07 4999.91
csls pnorm-8cores (incomplete)3417953? (TO) 40000.9 5007.72

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: