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.443
(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)3211537UNSAT 368.443 368.439
march_rw 2011-03-02 (complete)3420781UNSAT 371.347 371.341
MPhaseSAT_M 2011-02-16 (complete)3222098UNSAT 456.024 456.014
Satisfiability Solver Selector 2011-03-18 (complete)3222096UNSAT 810.01 810.155
borg-sat 11.03.02-seq-random (fixed) (complete)3386968UNSAT 1172.71 1168.66
ppfolio par (complete)3222099UNSAT 3009.28 376.423
borg-sat 11.03.02-par-random (fixed) (complete)3385768UNSAT 3068.88 492.662
borg-sat 11.03.02-random [DEPRECATED] (complete)3322255UNSAT 3316.87 519.225
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211538? (exit code) 4998.53 4998.46
ppfolio seq (complete)3222100? (TO) 4999.97 5000.02
EagleUP 1.565.350 (incomplete)3222101? (TO) 5000.02 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211536? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3427061? (TO) 5000.02 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446445? (TO) 5000.04 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222097? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211539? (TO) 5000.48 5000.42
csls pnorm-8cores (incomplete)3418186? (TO) 40000.3 5009.34

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: