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 benchmark358.158
(Un)Satisfiability was proved
Number of variables100
Number of clauses2130
Sum of the clauses size10650
Maximum clause length5
Minimum clause length5
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 52130
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)3420649UNSAT 358.158 358.149
SAT09 reference solver: march_hi hi (complete)3211009UNSAT 402.659 402.654
MPhaseSAT_M 2011-02-16 (complete)3221306UNSAT 411.178 411.167
borg-sat 11.03.02-seq-random (fixed) (complete)3386836UNSAT 460.516 458.567
Satisfiability Solver Selector 2011-03-18 (complete)3221304UNSAT 800.05 800.2
borg-sat 11.03.02-par-random (fixed) (complete)3385636UNSAT 2401.98 396.567
ppfolio par (complete)3221307UNSAT 2887.91 361.341
borg-sat 11.03.02-random [DEPRECATED] (complete)3322123UNSAT 2891.06 362.715
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211010? (exit code) 4998.35 4998.19
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211008? (TO) 5000.04 4999.81
sattime2011 2011-03-02 (incomplete)3426929? (TO) 5000.05 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221305? (TO) 5000.06 4999.91
EagleUP 1.565.350 (incomplete)3221309? (TO) 5000.09 4999.91
ppfolio seq (complete)3221308? (TO) 5000.09 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211011? (TO) 5000.1 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446313? (TO) 5000.12 5000.02
csls pnorm-8cores (incomplete)3418054? (TO) 40000.3 5004.62

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: