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 benchmark38.9001
(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)3420504UNSAT 38.9001 38.9011
SAT09 reference solver: march_hi hi (complete)3210429UNSAT 42.7815 42.7807
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210430UNSAT 120.672 120.675
MPhaseSAT_M 2011-02-16 (complete)3220436UNSAT 140.045 140.043
borg-sat 11.03.02-seq-random (fixed) (complete)3386691UNSAT 141.096 140.76
Satisfiability Solver Selector 2011-03-18 (complete)3220434UNSAT 202.33 202.409
borg-sat 11.03.02-par-random (fixed) (complete)3385491UNSAT 279.446 41.5463
ppfolio par (complete)3220437UNSAT 313.157 39.1773
borg-sat 11.03.02-random [DEPRECATED] (complete)3321978UNSAT 319.47 40.6111
ppfolio seq (complete)3220438UNSAT 4068.62 4068.48
csls pnorm-8cores (incomplete)3417909? (problem) 20394.7 2847.02
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210431? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220435? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426784? (TO) 5000.03 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210428? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3220439? (TO) 5000.07 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446168? (TO) 5000.1 4999.92

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: