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.144977
(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)3420786UNSAT 0.144977 0.144687
SAT09 reference solver: march_hi hi (complete)3211557UNSAT 0.164974 0.171194
ppfolio par (complete)3222129UNSAT 0.444931 0.151785
ppfolio seq (complete)3222130UNSAT 3.9534 3.95348
Satisfiability Solver Selector 2011-03-18 (complete)3222126UNSAT 8.63 8.74072
MPhaseSAT_M 2011-02-16 (complete)3222128UNSAT 24.3633 24.3636
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211558UNSAT 31.3212 31.3203
borg-sat 11.03.02-seq-random (fixed) (complete)3386973UNSAT 101.255 101.102
borg-sat 11.03.02-par-random (fixed) (complete)3385773? (exit code) 1.68674 0.876713
borg-sat 11.03.02-random [DEPRECATED] (complete)3322260? (exit code) 2.08968 1.04271
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211556? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222127? (TO) 5000.04 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446450? (TO) 5000.05 4999.92
EagleUP 1.565.350 (incomplete)3222131? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211559? (TO) 5000.08 4999.91
sattime2011 2011-03-02 (incomplete)3427066? (TO) 5000.11 5000.02
csls pnorm-8cores (incomplete)3418191? (TO) 40000.6 5007.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: