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.804
(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
SAT09 reference solver: march_hi hi (complete)3211201UNSAT 32.804 32.803
march_rw 2011-03-02 (complete)3420697UNSAT 33.2689 33.2686
MPhaseSAT_M 2011-02-16 (complete)3221594UNSAT 165.832 165.833
Satisfiability Solver Selector 2011-03-18 (complete)3221592UNSAT 199.94 200.057
borg-sat 11.03.02-par-random (fixed) (complete)3385684UNSAT 257.182 37.7869
borg-sat 11.03.02-random [DEPRECATED] (complete)3322171UNSAT 260.549 35.7932
ppfolio par (complete)3221595UNSAT 266.683 33.3682
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211202UNSAT 317.01 317.003
borg-sat 11.03.02-seq-random (fixed) (complete)3386884UNSAT 634.577 632.471
ppfolio seq (complete)3221596UNSAT 1047.59 1047.56
EagleUP 1.565.350 (incomplete)3221597? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221593? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3426977? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211203? (TO) 5000.06 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446361? (TO) 5000.07 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211200? (TO) 5000.09 4999.91
csls pnorm-8cores (incomplete)3418102? (TO) 40000.9 5010.62

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: