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 benchmark23.9014
(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)3420775UNSAT 23.9014 23.9009
SAT09 reference solver: march_hi hi (complete)3211513UNSAT 26.333 26.333
MPhaseSAT_M 2011-02-16 (complete)3222062UNSAT 91.1391 91.1403
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211514UNSAT 103.337 103.337
borg-sat 11.03.02-seq-random (fixed) (complete)3386962UNSAT 125.306 125.104
borg-sat 11.03.02-par-random (fixed) (complete)3385762UNSAT 150.729 25.241
borg-sat 11.03.02-random [DEPRECATED] (complete)3322249UNSAT 157.588 24.8925
Satisfiability Solver Selector 2011-03-18 (complete)3222060UNSAT 182.34 182.417
ppfolio par (complete)3222063UNSAT 191.898 24.2583
ppfolio seq (complete)3222064UNSAT 2060.25 2060.19
csls pnorm-8cores (incomplete)3418180? (problem) 21513.5 3097.11
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211512? (TO) 4999.88 5000.01
EagleUP 1.565.350 (incomplete)3222065? (TO) 5000.01 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211515? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446439? (TO) 5000.04 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222061? (TO) 5000.08 5000.01
sattime2011 2011-03-02 (incomplete)3427055? (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: