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 benchmark25.6701
(Un)Satisfiability was proved
Number of variables400
Number of clauses1704
Sum of the clauses size5112
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31704
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)3420543UNSAT 25.6701 25.6696
SAT09 reference solver: march_hi hi (complete)3210585UNSAT 28.0557 28.0568
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210586UNSAT 109.48 109.482
MPhaseSAT_M 2011-02-16 (complete)3220670UNSAT 121.946 121.944
borg-sat 11.03.02-seq-random (fixed) (complete)3386730UNSAT 126.262 126.097
borg-sat 11.03.02-random [DEPRECATED] (complete)3322017UNSAT 181.675 26.5985
Satisfiability Solver Selector 2011-03-18 (complete)3220668UNSAT 184.05 184.102
borg-sat 11.03.02-par-random (fixed) (complete)3385530UNSAT 184.129 27.2614
ppfolio par (complete)3220671UNSAT 207.739 25.9973
ppfolio seq (complete)3220672UNSAT 3981.01 3980.87
csls pnorm-8cores (incomplete)3417948? (problem) 20468 2807.16
EagleUP 1.565.350 (incomplete)3220673? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426823? (TO) 5000.05 5000.12
adaptg2wsat2011 2011-03-02 (incomplete)3446207? (TO) 5000.06 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210587? (TO) 5000.08 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210584? (TO) 5000.08 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220669? (TO) 5000.09 5000.01

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: