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.443931
(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)3420581UNSAT 0.443931 0.445087
SAT09 reference solver: march_hi hi (complete)3210737UNSAT 0.469927 0.472385
ppfolio par (complete)3220899UNSAT 1.3078 0.442486
borg-sat 11.03.02-random [DEPRECATED] (complete)3322055UNSAT 4.41533 1.21905
borg-sat 11.03.02-par-random (fixed) (complete)3385568UNSAT 4.68029 1.23942
Satisfiability Solver Selector 2011-03-18 (complete)3220896UNSAT 12.65 12.7268
ppfolio seq (complete)3220900UNSAT 12.7221 12.7213
MPhaseSAT_M 2011-02-16 (complete)3220898UNSAT 26.307 26.3069
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210738UNSAT 33.8109 33.8098
borg-sat 11.03.02-seq-random (fixed) (complete)3386768UNSAT 100.665 100.407
csls pnorm-8cores (incomplete)3417986? (problem) 19898.4 2856.16
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220897? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220901? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210736? (TO) 5000.04 4999.91
sattime2011 2011-03-02 (incomplete)3426861? (TO) 5000.04 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446245? (TO) 5000.07 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210739? (TO) 5000.09 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: