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.12598
(Un)Satisfiability was proved
Number of variables50
Number of clauses1065
Sum of the clauses size5325
Maximum clause length5
Minimum clause length5
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 30
Number of clauses of size 40
Number of clauses of size 51065
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)3420789UNSAT 0.12598 0.126556
SAT09 reference solver: march_hi hi (complete)3211569UNSAT 0.12998 0.133173
ppfolio par (complete)3222147UNSAT 1.20082 0.159461
borg-sat 11.03.02-random [DEPRECATED] (complete)3322263UNSAT 1.80272 0.861598
ppfolio seq (complete)3222148UNSAT 2.40263 2.40405
Satisfiability Solver Selector 2011-03-18 (complete)3222144UNSAT 8.16 8.29953
MPhaseSAT_M 2011-02-16 (complete)3222146UNSAT 19.432 19.4332
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211570UNSAT 30.7803 30.779
borg-sat 11.03.02-seq-random (fixed) (complete)3386976UNSAT 101.244 101.076
borg-sat 11.03.02-par-random (fixed) (complete)3385776? (exit code) 1.58376 0.827751
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211571? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222145? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211568? (TO) 5000.07 5000.01
EagleUP 1.565.350 (incomplete)3222149? (TO) 5000.09 5000.01
sattime2011 2011-03-02 (incomplete)3427069? (TO) 5000.09 5000.02
adaptg2wsat2011 2011-03-02 (incomplete)3446453? (TO) 5000.1 5000.02
csls pnorm-8cores (incomplete)3418194? (TO) 40000.9 5009.12

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: