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 benchmark34.3998
(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)3210789UNSAT 34.3998 34.3988
march_rw 2011-03-02 (complete)3420594UNSAT 34.9477 34.9512
MPhaseSAT_M 2011-02-16 (complete)3220976UNSAT 159.658 159.655
Satisfiability Solver Selector 2011-03-18 (complete)3220974UNSAT 205.73 205.853
borg-sat 11.03.02-par-random (fixed) (complete)3385581UNSAT 220.266 37.464
ppfolio par (complete)3220977UNSAT 279.265 34.94
borg-sat 11.03.02-random [DEPRECATED] (complete)3322068UNSAT 299.264 38.2535
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210790UNSAT 314.796 314.793
borg-sat 11.03.02-seq-random (fixed) (complete)3386781UNSAT 633.692 637.412
ppfolio seq (complete)3220978UNSAT 1068.48 1068.46
EagleUP 1.565.350 (incomplete)3220979? (TO) 5000.02 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210788? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446258? (TO) 5000.04 4999.92
sattime2011 2011-03-02 (incomplete)3426874? (TO) 5000.05 4999.82
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220975? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210791? (TO) 5000.07 4999.91
csls pnorm-8cores (incomplete)3417999? (TO) 40000.3 5011.03

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: