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 benchmark46.9699
(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)3420772UNSAT 46.9699 46.9692
SAT09 reference solver: march_hi hi (complete)3211501UNSAT 50.9363 50.9347
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211502UNSAT 139.372 139.381
borg-sat 11.03.02-seq-random (fixed) (complete)3386959UNSAT 145.358 145.001
Satisfiability Solver Selector 2011-03-18 (complete)3222042UNSAT 206.75 206.817
MPhaseSAT_M 2011-02-16 (complete)3222044UNSAT 284.629 284.625
borg-sat 11.03.02-par-random (fixed) (complete)3385759UNSAT 343.079 57.8937
ppfolio par (complete)3222045UNSAT 373.338 46.7084
borg-sat 11.03.02-random [DEPRECATED] (complete)3322246UNSAT 390.391 49.7135
csls pnorm-8cores (incomplete)3418177? (problem) 20986.6 2916.34
EagleUP 1.565.350 (incomplete)3222047? (TO) 5000.02 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446436? (TO) 5000.03 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222043? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211503? (TO) 5000.04 4999.91
ppfolio seq (complete)3222046? (TO) 5000.04 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211500? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3427052? (TO) 5000.12 5000.02

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: