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 benchmark368.302
(Un)Satisfiability was proved
Number of variables60
Number of clauses5340
Sum of the clauses size37380
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 55340

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
SAT09 reference solver: march_hi hi (complete)3211077UNSAT 368.302 368.29
march_rw 2011-03-02 (complete)3420666UNSAT 369.359 369.378
MPhaseSAT_M 2011-02-16 (complete)3221408UNSAT 455.061 455.052
Satisfiability Solver Selector 2011-03-18 (complete)3221406UNSAT 844.83 844.913
borg-sat 11.03.02-seq-random (fixed) (complete)3386853UNSAT 1171.2 1166.43
ppfolio par (complete)3221409UNSAT 3001.87 375.489
borg-sat 11.03.02-random [DEPRECATED] (complete)3322140UNSAT 3434.37 492.807
borg-sat 11.03.02-par-random (fixed) (complete)3385653UNSAT 3751.85 471.399
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211078? (exit code) 4998.52 4998.39
EagleUP 1.565.350 (incomplete)3221411? (TO) 5000.03 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446330? (TO) 5000.05 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211076? (TO) 5000.07 5000.01
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221407? (TO) 5000.08 5000.01
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211079? (TO) 5000.1 5000.01
sattime2011 2011-03-02 (incomplete)3426946? (TO) 5000.11 5000.12
ppfolio seq (complete)3221410? (TO) 5000.14 5000.01
csls pnorm-8cores (incomplete)3418071? (TO) 40000.7 5008.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: