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 benchmark347.316
(Un)Satisfiability was proved
Number of variables100
Number of clauses2130
Sum of the clauses size10650
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 52130
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)3420517UNSAT 347.316 347.309
SAT09 reference solver: march_hi hi (complete)3210481UNSAT 390.8 390.785
MPhaseSAT_M 2011-02-16 (complete)3220514UNSAT 403.519 403.507
borg-sat 11.03.02-seq-random (fixed) (complete)3386704UNSAT 452.644 451.148
Satisfiability Solver Selector 2011-03-18 (complete)3220512UNSAT 789.95 790.042
borg-sat 11.03.02-random [DEPRECATED] (complete)3321991UNSAT 2309.89 356.542
borg-sat 11.03.02-par-random (fixed) (complete)3385504UNSAT 2474.04 355.174
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210482? (exit code) 4998.38 4998.27
ppfolio par (complete)3220515? (MO) 97.5532 12.2137
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210483? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426797? (TO) 5000.04 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210480? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220513? (TO) 5000.06 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446181? (TO) 5000.06 4999.91
ppfolio seq (complete)3220516? (TO) 5000.06 4999.91
EagleUP 1.565.350 (incomplete)3220517? (TO) 5000.06 4999.91
csls pnorm-8cores (incomplete)3417922? (TO) 40000.6 5009.93

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: