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 benchmark1.12883
(Un)Satisfiability was proved
Number of variables300
Number of clauses1278
Sum of the clauses size3834
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31278
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)3420579UNSAT 1.12883 1.1378
SAT09 reference solver: march_hi hi (complete)3210729UNSAT 1.24981 1.25271
borg-sat 11.03.02-par-random (fixed) (complete)3385566UNSAT 8.24175 1.75563
borg-sat 11.03.02-random [DEPRECATED] (complete)3322053UNSAT 8.40172 1.79725
ppfolio par (complete)3220887UNSAT 9.07062 1.14433
MPhaseSAT_M 2011-02-16 (complete)3220886UNSAT 28.7146 28.7145
ppfolio seq (complete)3220888UNSAT 46.23 46.2295
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210730UNSAT 53.4179 53.4161
Satisfiability Solver Selector 2011-03-18 (complete)3220884UNSAT 84.01 84.1165
borg-sat 11.03.02-seq-random (fixed) (complete)3386766UNSAT 101.265 101.043
csls pnorm-8cores (incomplete)3417984? (problem) 20066.2 2885.25
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220885? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210728? (TO) 5000.04 4999.91
EagleUP 1.565.350 (incomplete)3220889? (TO) 5000.04 4999.91
sattime2011 2011-03-02 (incomplete)3426859? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210731? (TO) 5000.09 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446243? (TO) 5000.1 5000.02

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: