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.813876
(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)3420619UNSAT 0.813876 0.814107
SAT09 reference solver: march_hi hi (complete)3210889UNSAT 0.894863 0.895481
ppfolio par (complete)3221127UNSAT 2.47162 0.827074
borg-sat 11.03.02-random [DEPRECATED] (complete)3322093UNSAT 6.28804 1.69271
borg-sat 11.03.02-par-random (fixed) (complete)3385606UNSAT 13.8569 2.90371
MPhaseSAT_M 2011-02-16 (complete)3221126UNSAT 28.4027 28.4032
ppfolio seq (complete)3221128UNSAT 30.0744 31.9175
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210890UNSAT 40.6358 40.6358
Satisfiability Solver Selector 2011-03-18 (complete)3221124UNSAT 50.23 50.3872
borg-sat 11.03.02-seq-random (fixed) (complete)3386806UNSAT 100.208 100.063
csls pnorm-8cores (incomplete)3418024? (problem) 20415.6 2871.31
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210888? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210891? (TO) 5000.03 4999.91
sattime2011 2011-03-02 (incomplete)3426899? (TO) 5000.03 4999.92
EagleUP 1.565.350 (incomplete)3221129? (TO) 5000.03 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221125? (TO) 5000.09 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446283? (TO) 5000.12 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: