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 benchmark
Best CPU time to get the best result obtained on this benchmark
(Un)Satisfiability was proved
Number of variables400
Number of clauses34000
Sum of the clauses size238000
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 534000

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3209922? (exit code) 4998.52 4998.4
borg-sat 11.03.02-seq-random (fixed) (complete)3386564? (MO) 3567.88 3555.34
borg-sat 11.03.02-random [DEPRECATED] (complete)3321851? (MO) 9421.83 1521.42
borg-sat 11.03.02-par-random (fixed) (complete)3385364? (MO) 9533.78 1200.23
ppfolio seq (complete)3219676? (TO) 4999.97 5000.01
Satisfiability Solver Selector 2011-03-18 (complete)3219672? (TO) 5000.01 5000.02
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3209920? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446041? (TO) 5000.03 4999.92
SAT09 reference solver: march_hi hi (complete)3209921? (TO) 5000.04 4999.93
march_rw 2011-03-02 (complete)3420377? (TO) 5000.05 4999.93
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3219673? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3426657? (TO) 5000.06 4999.91
EagleUP 1.565.350 (incomplete)3219677? (TO) 5000.09 4999.91
MPhaseSAT_M 2011-02-16 (complete)3219674? (TO) 5000.09 5000.01
SAT09 reference solver: TNM 2009-03-22 (incomplete)3209923? (TO) 5000.1 5000.01
ppfolio par (complete)3219675? (TO) 39971.9 5000.02
csls pnorm-8cores (incomplete)3417782? (TO) 40000.5 5008.73

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: