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 benchmark390.66
(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)3420662UNSAT 390.66 390.652
SAT09 reference solver: march_hi hi (complete)3211061UNSAT 405.797 405.786
MPhaseSAT_M 2011-02-16 (complete)3221384UNSAT 446.463 446.452
borg-sat 11.03.02-seq-random (fixed) (complete)3386849UNSAT 534.99 533.084
Satisfiability Solver Selector 2011-03-18 (complete)3221382UNSAT 833.38 833.403
borg-sat 11.03.02-par-random (fixed) (complete)3385649UNSAT 2620.21 463.056
borg-sat 11.03.02-random [DEPRECATED] (complete)3322136UNSAT 2769.71 397.066
ppfolio par (complete)3221385UNSAT 3157.3 394.938
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211062? (exit code) 4998.37 4998.26
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221383? (TO) 4999.68 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211060? (TO) 5000.03 4999.91
sattime2011 2011-03-02 (incomplete)3426942? (TO) 5000.03 4999.92
ppfolio seq (complete)3221386? (TO) 5000.06 4999.91
EagleUP 1.565.350 (incomplete)3221387? (TO) 5000.09 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446326? (TO) 5000.09 5000.02
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211063? (TO) 5000.1 4999.91
csls pnorm-8cores (incomplete)3418067? (TO) 40000.6 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: