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 benchmark0.243962
(Un)Satisfiability was proved
Number of variables250
Number of clauses1065
Sum of the clauses size3195
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31065
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)3420760UNSAT 0.243962 0.244895
SAT09 reference solver: march_hi hi (complete)3211453UNSAT 0.266959 0.267572
ppfolio par (complete)3221973UNSAT 0.753884 0.257171
borg-sat 11.03.02-random [DEPRECATED] (complete)3322234UNSAT 1.89371 1.23448
borg-sat 11.03.02-par-random (fixed) (complete)3385747UNSAT 3.23251 1.04218
ppfolio seq (complete)3221974UNSAT 8.50771 8.50863
Satisfiability Solver Selector 2011-03-18 (complete)3221970UNSAT 10.35 10.4903
MPhaseSAT_M 2011-02-16 (complete)3221972UNSAT 26.425 26.4263
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211454UNSAT 33.5109 33.5124
borg-sat 11.03.02-seq-random (fixed) (complete)3386947UNSAT 99.5269 99.2448
csls pnorm-8cores (incomplete)3418165? (problem) 20229.1 2855.56
adaptg2wsat2011 2011-03-02 (incomplete)3446424? (TO) 5000.03 4999.92
sattime2011 2011-03-02 (incomplete)3427040? (TO) 5000.04 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211452? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221971? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211455? (TO) 5000.07 5000.01
EagleUP 1.565.350 (incomplete)3221975? (TO) 5000.1 5000.01

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: