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 benchmark0.135979
(Un)Satisfiability was proved
Number of variables250
Number of clauses1065
Sum of the clauses size3195
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31065
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)3420776UNSAT 0.135979 0.137121
SAT09 reference solver: march_hi hi (complete)3211517UNSAT 0.149976 0.150238
ppfolio par (complete)3222069UNSAT 0.44993 0.158862
ppfolio seq (complete)3222070UNSAT 2.83357 2.83359
Satisfiability Solver Selector 2011-03-18 (complete)3222066UNSAT 5.05 5.16788
MPhaseSAT_M 2011-02-16 (complete)3222068UNSAT 15.1787 15.1802
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211518UNSAT 30.9363 30.9354
borg-sat 11.03.02-seq-random (fixed) (complete)3386963UNSAT 101.377 101.251
csls pnorm-8cores (incomplete)3418181? (problem) 20427.6 2898.2
borg-sat 11.03.02-random [DEPRECATED] (complete)3322250? (TO) 101.94 5100.02
borg-sat 11.03.02-par-random (fixed) (complete)3385763? (TO) 201.95 5100.02
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222067? (TO) 5000.04 4999.91
sattime2011 2011-03-02 (incomplete)3427056? (TO) 5000.06 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211516? (TO) 5000.08 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446440? (TO) 5000.08 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211519? (TO) 5000.09 4999.91
EagleUP 1.565.350 (incomplete)3222071? (TO) 5000.1 5000.01

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: