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 benchmark1.54776
(Un)Satisfiability was proved
Number of variables300
Number of clauses1278
Sum of the clauses size3834
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31278
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)3420646UNSAT 1.54776 1.54856
SAT09 reference solver: march_hi hi (complete)3210997UNSAT 1.57976 1.58065
borg-sat 11.03.02-par-random (fixed) (complete)3385633UNSAT 10.4784 2.08014
ppfolio par (complete)3221289UNSAT 11.1 1.45326
borg-sat 11.03.02-random [DEPRECATED] (complete)3322120UNSAT 21.6977 3.91282
MPhaseSAT_M 2011-02-16 (complete)3221288UNSAT 29.7255 29.7265
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210998UNSAT 51.0052 51.0034
ppfolio seq (complete)3221290UNSAT 53.4179 53.4186
Satisfiability Solver Selector 2011-03-18 (complete)3221286UNSAT 85.87 86.0969
borg-sat 11.03.02-seq-random (fixed) (complete)3386833UNSAT 102.832 102.697
csls pnorm-8cores (incomplete)3418051? (problem) 20528.7 2890.88
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221287? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210999? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3426926? (TO) 5000.07 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210996? (TO) 5000.09 4999.91
EagleUP 1.565.350 (incomplete)3221291? (TO) 5000.1 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446310? (TO) 5000.11 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: