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 benchmark145.128
(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)3420808UNSAT 145.128 145.125
SAT09 reference solver: march_hi hi (complete)3211645UNSAT 158.957 158.951
borg-sat 11.03.02-seq-random (fixed) (complete)3386995UNSAT 259.673 258.652
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211646UNSAT 280.768 280.77
MPhaseSAT_M 2011-02-16 (complete)3222260UNSAT 483.779 483.769
Satisfiability Solver Selector 2011-03-18 (complete)3222258UNSAT 586.24 586.492
borg-sat 11.03.02-random [DEPRECATED] (complete)3322282UNSAT 1171.03 147.256
ppfolio par (complete)3222261UNSAT 1176.22 147.138
borg-sat 11.03.02-par-random (fixed) (complete)3385795UNSAT 1182.43 148.769
csls pnorm-8cores (incomplete)3418213? (problem) 21446.5 3098.34
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211644? (TO) 5000.02 4999.91
EagleUP 1.565.350 (incomplete)3222263? (TO) 5000.03 4999.91
ppfolio seq (complete)3222262? (TO) 5000.04 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211647? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222259? (TO) 5000.05 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446472? (TO) 5000.08 5000.02
sattime2011 2011-03-02 (incomplete)3427088? (TO) 5000.08 5000.12

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: