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 benchmark299.271
(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)3420600UNSAT 299.271 299.281
SAT09 reference solver: march_hi hi (complete)3210813UNSAT 311.934 311.922
MPhaseSAT_M 2011-02-16 (complete)3221012UNSAT 350.417 350.409
borg-sat 11.03.02-seq-random (fixed) (complete)3386787UNSAT 404.316 402.834
Satisfiability Solver Selector 2011-03-18 (complete)3221010UNSAT 771.5 771.651
borg-sat 11.03.02-par-random (fixed) (complete)3385587UNSAT 2068.37 311.948
borg-sat 11.03.02-random [DEPRECATED] (complete)3322074UNSAT 2140.91 315.027
ppfolio par (complete)3221013UNSAT 2411.38 301.638
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210814? (exit code) 4998.37 4998.15
ppfolio seq (complete)3221014? (TO) 5000 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446264? (TO) 5000.03 4999.92
sattime2011 2011-03-02 (incomplete)3426880? (TO) 5000.04 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210815? (TO) 5000.05 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210812? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221011? (TO) 5000.06 4999.91
EagleUP 1.565.350 (incomplete)3221015? (TO) 5000.09 4999.91
csls pnorm-8cores (incomplete)3418005? (TO) 40000.5 5008.82

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: