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 benchmark1227.32
(Un)Satisfiability was proved
Number of variables500
Number of clauses2130
Sum of the clauses size6390
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32130
Number of clauses of size 40
Number of clauses of size 50
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)3420648UNSAT 1227.32 1227.58
SAT09 reference solver: march_hi hi (complete)3211005UNSAT 1344.22 1344.18
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211006UNSAT 1770.54 1770.5
borg-sat 11.03.02-seq-random (fixed) (complete)3386835UNSAT 4082.58 4065.01
borg-sat 11.03.02-par-random (fixed) (complete)3385635UNSAT 9028.75 1280.37
ppfolio par (complete)3221301UNSAT 9921.13 1241.09
borg-sat 11.03.02-random [DEPRECATED] (complete)3322122UNSAT 10742.9 1531.69
csls pnorm-8cores (incomplete)3418053? (problem) 21573.3 3158.97
ppfolio seq (complete)3221302? (TO) 4999.98 5000.01
Satisfiability Solver Selector 2011-03-18 (complete)3221298? (TO) 5000 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446312? (TO) 5000.03 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221299? (TO) 5000.03 4999.81
sattime2011 2011-03-02 (incomplete)3426928? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211007? (TO) 5000.05 4999.91
MPhaseSAT_M 2011-02-16 (complete)3221300? (TO) 5000.05 4999.93
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211004? (TO) 5000.09 4999.91
EagleUP 1.565.350 (incomplete)3221303? (TO) 5000.09 4999.91

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: