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 benchmark2349.78
(Un)Satisfiability was proved
Number of variables550
Number of clauses2343
Sum of the clauses size7029
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32343
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)3420803UNSAT 2349.78 2349.77
SAT09 reference solver: march_hi hi (complete)3211625UNSAT 2585.31 2585.21
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211626UNSAT 3219.97 3219.95
borg-sat 11.03.02-par-random (fixed) (complete)3385790UNSAT 18959 2379.14
ppfolio par (complete)3222231UNSAT 19057.6 2384.19
borg-sat 11.03.02-random [DEPRECATED] (complete)3322277UNSAT 19809.5 2972.55
csls pnorm-8cores (incomplete)3418208? (problem) 22176.3 3358.06
ppfolio seq (complete)3222232? (TO) 5000.01 4999.91
EagleUP 1.565.350 (incomplete)3222233? (TO) 5000.02 4999.91
Satisfiability Solver Selector 2011-03-18 (complete)3222228? (TO) 5000.05 5000.02
borg-sat 11.03.02-seq-random (fixed) (complete)3386990? (TO) 5000.06 4978.57
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211627? (TO) 5000.06 4999.91
MPhaseSAT_M 2011-02-16 (complete)3222230? (TO) 5000.06 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222229? (TO) 5000.07 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446467? (TO) 5000.08 5000.02
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211624? (TO) 5000.09 5000.01
sattime2011 2011-03-02 (incomplete)3427083? (TO) 5000.09 5000.02

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: