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 benchmark3292.86
(Un)Satisfiability was proved
Number of variables550
Number of clauses2343
Sum of the clauses size7029
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32343
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)3420539UNSAT 3292.86 3292.78
SAT09 reference solver: march_hi hi (complete)3210569UNSAT 3605.51 3605.36
borg-sat 11.03.02-random [DEPRECATED] (complete)3322013UNSAT 24489.7 3485.17
ppfolio par (complete)3220647UNSAT 26678.5 3337.15
borg-sat 11.03.02-par-random (fixed) (complete)3385526UNSAT 27371 3435.51
csls pnorm-8cores (incomplete)3417944? (problem) 22444.7 3458.57
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210570? (exit code) 4998.85 4998.7
ppfolio seq (complete)3220648? (TO) 5000.01 4999.91
borg-sat 11.03.02-seq-random (fixed) (complete)3386726? (TO) 5000.01 4982.57
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220645? (TO) 5000.02 4999.91
Satisfiability Solver Selector 2011-03-18 (complete)3220644? (TO) 5000.03 5000.02
EagleUP 1.565.350 (incomplete)3220649? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210571? (TO) 5000.03 4999.91
sattime2011 2011-03-02 (incomplete)3426819? (TO) 5000.04 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210568? (TO) 5000.06 4999.91
MPhaseSAT_M 2011-02-16 (complete)3220646? (TO) 5000.09 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446203? (TO) 5000.12 5000.12

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: