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 benchmark373.874
(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)3211761UNSAT 373.874 373.867
march_rw 2011-03-02 (complete)3420837UNSAT 374.987 374.986
MPhaseSAT_M 2011-02-16 (complete)3222434UNSAT 460.576 460.567
Satisfiability Solver Selector 2011-03-18 (complete)3222432UNSAT 813.73 813.861
borg-sat 11.03.02-seq-random (fixed) (complete)3387024UNSAT 1180.53 1176.52
ppfolio par (complete)3222435UNSAT 3036.24 379.803
borg-sat 11.03.02-random [DEPRECATED] (complete)3322311UNSAT 3219.9 508.219
borg-sat 11.03.02-par-random (fixed) (complete)3385824UNSAT 3801.88 477.492
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211762? (exit code) 4998.56 4998.44
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211763? (TO) 5000.02 4999.91
EagleUP 1.565.350 (incomplete)3222437? (TO) 5000.04 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211760? (TO) 5000.04 4999.81
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222433? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3427117? (TO) 5000.06 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446501? (TO) 5000.07 4999.92
ppfolio seq (complete)3222436? (TO) 5000.08 5000.01
csls pnorm-8cores (incomplete)3418242? (TO) 40000.6 5010.03

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: