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 benchmark111.609
(Un)Satisfiability was proved
Number of variables450
Number of clauses1917
Sum of the clauses size5751
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31917
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)3420644UNSAT 111.609 111.607
SAT09 reference solver: march_hi hi (complete)3210989UNSAT 122.735 122.737
borg-sat 11.03.02-seq-random (fixed) (complete)3386831UNSAT 227.189 226.372
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210990UNSAT 245.746 245.739
MPhaseSAT_M 2011-02-16 (complete)3221276UNSAT 399.015 399.002
Satisfiability Solver Selector 2011-03-18 (complete)3221274UNSAT 562.14 562.272
borg-sat 11.03.02-par-random (fixed) (complete)3385631UNSAT 685.34 117.465
borg-sat 11.03.02-random [DEPRECATED] (complete)3322118UNSAT 795.986 133.563
ppfolio par (complete)3221277UNSAT 902.182 112.871
csls pnorm-8cores (incomplete)3418049? (problem) 21468.4 3118.46
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210991? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210988? (TO) 5000.03 4999.91
EagleUP 1.565.350 (incomplete)3221279? (TO) 5000.03 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221275? (TO) 5000.04 4999.81
ppfolio seq (complete)3221278? (TO) 5000.05 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446308? (TO) 5000.08 4999.92
sattime2011 2011-03-02 (incomplete)3426924? (TO) 5000.09 4999.92

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: