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 benchmark348.401
(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)3420804UNSAT 348.401 348.396
SAT09 reference solver: march_hi hi (complete)3211629UNSAT 393.463 393.458
MPhaseSAT_M 2011-02-16 (complete)3222236UNSAT 432.959 432.953
borg-sat 11.03.02-seq-random (fixed) (complete)3386991UNSAT 488.633 486.7
Satisfiability Solver Selector 2011-03-18 (complete)3222234UNSAT 790.43 790.579
borg-sat 11.03.02-par-random (fixed) (complete)3385791UNSAT 2264.57 409.334
borg-sat 11.03.02-random [DEPRECATED] (complete)3322278UNSAT 2312.57 357.247
ppfolio par (complete)3222237UNSAT 2804.35 350.794
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211630? (exit code) 4998.37 4998.2
EagleUP 1.565.350 (incomplete)3222239? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3427084? (TO) 5000.03 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211628? (TO) 5000.03 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222235? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211631? (TO) 5000.05 4999.91
ppfolio seq (complete)3222238? (TO) 5000.06 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446468? (TO) 5000.08 5000.12
csls pnorm-8cores (incomplete)3418209? (TO) 40000.7 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: