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 benchmark134.386
(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
SAT09 reference solver: march_hi hi (complete)3211253UNSAT 134.386 134.383
march_rw 2011-03-02 (complete)3420710UNSAT 136.041 136.175
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211254UNSAT 229.744 229.741
borg-sat 11.03.02-seq-random (fixed) (complete)3386897UNSAT 236.43 235.791
MPhaseSAT_M 2011-02-16 (complete)3221672UNSAT 385.619 385.608
borg-sat 11.03.02-par-random (fixed) (complete)3385697UNSAT 866.362 138.094
borg-sat 11.03.02-random [DEPRECATED] (complete)3322184UNSAT 884.894 125.698
ppfolio par (complete)3221673UNSAT 983.269 122.998
csls pnorm-8cores (incomplete)3418115? (problem) 20279.8 2891.2
Satisfiability Solver Selector 2011-03-18 (complete)3221670? (TO) 4999.88 5000.02
ppfolio seq (complete)3221674? (TO) 4999.96 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211252? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221671? (TO) 5000.02 4999.91
EagleUP 1.565.350 (incomplete)3221675? (TO) 5000.02 5000.01
sattime2011 2011-03-02 (incomplete)3426990? (TO) 5000.06 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211255? (TO) 5000.09 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446374? (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: