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 benchmark320.093
(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)3420541UNSAT 320.093 320.084
SAT09 reference solver: march_hi hi (complete)3210577UNSAT 331.28 331.271
MPhaseSAT_M 2011-02-16 (complete)3220658UNSAT 372.137 372.132
borg-sat 11.03.02-seq-random (fixed) (complete)3386728UNSAT 430.669 434.487
Satisfiability Solver Selector 2011-03-18 (complete)3220656UNSAT 760.03 760.123
borg-sat 11.03.02-par-random (fixed) (complete)3385528UNSAT 2044.76 328.18
ppfolio par (complete)3220659UNSAT 2255.93 321.599
borg-sat 11.03.02-random [DEPRECATED] (complete)3322015UNSAT 2578.67 323.599
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210578? (exit code) 4998.53 4998.38
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210576? (TO) 5000.02 4999.91
ppfolio seq (complete)3220660? (TO) 5000.02 5000.01
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220657? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220661? (TO) 5000.03 5000.01
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210579? (TO) 5000.1 5000.01
sattime2011 2011-03-02 (incomplete)3426821? (TO) 5000.1 5000.12
adaptg2wsat2011 2011-03-02 (incomplete)3446205? (TO) 5000.11 5000.12
csls pnorm-8cores (incomplete)3417946? (TO) 40000.6 5009.92

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: