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 benchmark313.313
(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)3420820UNSAT 313.313 313.31
SAT09 reference solver: march_hi hi (complete)3211693UNSAT 324.476 324.467
MPhaseSAT_M 2011-02-16 (complete)3222332UNSAT 344.091 344.089
borg-sat 11.03.02-seq-random (fixed) (complete)3387007UNSAT 419.344 417.849
Satisfiability Solver Selector 2011-03-18 (complete)3222330UNSAT 754.03 754.174
borg-sat 11.03.02-random [DEPRECATED] (complete)3322294UNSAT 2300.23 320.631
ppfolio par (complete)3222333UNSAT 2524.16 315.743
borg-sat 11.03.02-par-random (fixed) (complete)3385807UNSAT 2546.85 319.891
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211694? (exit code) 4998.35 4998.2
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222331? (TO) 5000.03 4999.91
sattime2011 2011-03-02 (incomplete)3427100? (TO) 5000.04 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211692? (TO) 5000.05 4999.91
EagleUP 1.565.350 (incomplete)3222335? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211695? (TO) 5000.06 4999.91
ppfolio seq (complete)3222334? (TO) 5000.1 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446484? (TO) 5000.12 5000.22
csls pnorm-8cores (incomplete)3418225? (TO) 40000.3 5009.22

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: