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 benchmark5.19921
(Un)Satisfiability was proved
Number of variables350
Number of clauses1491
Sum of the clauses size4473
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31491
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)3420821UNSAT 5.19921 5.20041
SAT09 reference solver: march_hi hi (complete)3211697UNSAT 5.73113 5.73183
borg-sat 11.03.02-par-random (fixed) (complete)3385808UNSAT 40.6058 8.69469
ppfolio par (complete)3222339UNSAT 42.0026 5.2614
borg-sat 11.03.02-random [DEPRECATED] (complete)3322295UNSAT 42.5545 6.16511
MPhaseSAT_M 2011-02-16 (complete)3222338UNSAT 43.7334 43.7323
borg-sat 11.03.02-seq-random (fixed) (complete)3387008UNSAT 107.025 106.723
Satisfiability Solver Selector 2011-03-18 (complete)3222336UNSAT 161.42 161.529
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211698UNSAT 214.33 214.332
ppfolio seq (complete)3222340UNSAT 313.002 312.995
csls pnorm-8cores (incomplete)3418226? (problem) 20620.2 2893.16
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222337? (TO) 5000.02 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446485? (TO) 5000.04 4999.92
sattime2011 2011-03-02 (incomplete)3427101? (TO) 5000.05 5000.02
EagleUP 1.565.350 (incomplete)3222341? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211699? (TO) 5000.06 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211696? (TO) 5000.09 4999.91

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: