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 benchmark364.595
(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)3211613UNSAT 364.595 364.588
march_rw 2011-03-02 (complete)3420800UNSAT 364.948 364.939
MPhaseSAT_M 2011-02-16 (complete)3222212UNSAT 452.807 452.79
Satisfiability Solver Selector 2011-03-18 (complete)3222210UNSAT 805.22 805.366
borg-sat 11.03.02-seq-random (fixed) (complete)3386987UNSAT 867.994 864.214
borg-sat 11.03.02-par-random (fixed) (complete)3385787UNSAT 2542.31 457.856
ppfolio par (complete)3222213UNSAT 2941.53 368.059
borg-sat 11.03.02-random [DEPRECATED] (complete)3322274UNSAT 3148.95 493.495
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211614? (exit code) 4998.56 4998.43
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211615? (TO) 5000.02 4999.91
ppfolio seq (complete)3222214? (TO) 5000.02 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211612? (TO) 5000.06 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446464? (TO) 5000.06 4999.92
EagleUP 1.565.350 (incomplete)3222215? (TO) 5000.08 5000.01
sattime2011 2011-03-02 (incomplete)3427080? (TO) 5000.08 5001.12
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222211? (TO) 5000.1 4999.91
csls pnorm-8cores (incomplete)3418205? (TO) 40000.7 5011.13

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: