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 benchmark32.607
(Un)Satisfiability was proved
Number of variables50
Number of clauses4450
Sum of the clauses size31150
Maximum clause length7
Minimum clause length7
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 50
Number of clauses of size over 54450

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
march_rw 2011-03-02 (complete)3420615UNSAT 32.607 32.6071
SAT09 reference solver: march_hi hi (complete)3210873UNSAT 35.3876 35.3876
MPhaseSAT_M 2011-02-16 (complete)3221102UNSAT 169.628 169.633
Satisfiability Solver Selector 2011-03-18 (complete)3221100UNSAT 204.42 204.525
ppfolio par (complete)3221103UNSAT 264.857 33.1383
borg-sat 11.03.02-random [DEPRECATED] (complete)3322089UNSAT 270.142 34.6047
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210874UNSAT 297.538 297.536
borg-sat 11.03.02-par-random (fixed) (complete)3385602UNSAT 378.271 66.8368
borg-sat 11.03.02-seq-random (fixed) (complete)3386802UNSAT 636.7 634.451
ppfolio seq (complete)3221104UNSAT 978.622 978.608
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210872? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446279? (TO) 5000.04 4999.92
sattime2011 2011-03-02 (incomplete)3426895? (TO) 5000.1 4999.92
EagleUP 1.565.350 (incomplete)3221105? (TO) 5000.1 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210875? (TO) 5000.1 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221101? (TO) 5000.1 4999.91
csls pnorm-8cores (incomplete)3418020? (TO) 40000.5 5008.82

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: