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 benchmark33.05
(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)3211073UNSAT 33.05 33.0496
march_rw 2011-03-02 (complete)3420665UNSAT 33.5309 33.5313
MPhaseSAT_M 2011-02-16 (complete)3221402UNSAT 157.993 157.989
Satisfiability Solver Selector 2011-03-18 (complete)3221400UNSAT 200.15 200.213
borg-sat 11.03.02-par-random (fixed) (complete)3385652UNSAT 222.181 38.0078
ppfolio par (complete)3221403UNSAT 269.3 33.7112
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211074UNSAT 297.67 297.662
borg-sat 11.03.02-random [DEPRECATED] (complete)3322139UNSAT 311.861 39.5356
borg-sat 11.03.02-seq-random (fixed) (complete)3386852UNSAT 636.756 634.357
ppfolio seq (complete)3221404UNSAT 904.269 904.242
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211072? (TO) 5000.03 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221401? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3221405? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446329? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211075? (TO) 5000.08 4999.91
sattime2011 2011-03-02 (incomplete)3426945? (TO) 5000.11 5000.02
csls pnorm-8cores (incomplete)3418070? (TO) 40000.6 5011.33

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: