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 benchmark6.42702
(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
SAT09 reference solver: march_hi hi (complete)3211233UNSAT 6.42702 6.42713
march_rw 2011-03-02 (complete)3420705UNSAT 6.548 6.55305
MPhaseSAT_M 2011-02-16 (complete)3221642UNSAT 41.2247 41.2257
ppfolio par (complete)3221643UNSAT 47.1598 5.90976
borg-sat 11.03.02-par-random (fixed) (complete)3385692UNSAT 53.1039 8.99573
borg-sat 11.03.02-random [DEPRECATED] (complete)3322179UNSAT 61.4447 9.02838
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211234UNSAT 74.6846 74.6832
borg-sat 11.03.02-seq-random (fixed) (complete)3386892UNSAT 107.173 106.859
Satisfiability Solver Selector 2011-03-18 (complete)3221640UNSAT 162.13 162.246
ppfolio seq (complete)3221644UNSAT 614.865 614.843
csls pnorm-8cores (incomplete)3418110? (problem) 20642.2 2866.67
EagleUP 1.565.350 (incomplete)3221645? (TO) 5000.02 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211235? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211232? (TO) 5000.04 4999.81
sattime2011 2011-03-02 (incomplete)3426985? (TO) 5000.04 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221641? (TO) 5000.09 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446369? (TO) 5000.12 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: