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 benchmark626.623
(Un)Satisfiability was proved
Number of variables500
Number of clauses2130
Sum of the clauses size6390
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32130
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)3420478UNSAT 626.623 626.613
SAT09 reference solver: march_hi hi (complete)3210325UNSAT 631.507 631.49
borg-sat 11.03.02-seq-random (fixed) (complete)3386665UNSAT 792.303 790.188
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210326UNSAT 944.995 944.975
MPhaseSAT_M 2011-02-16 (complete)3220280UNSAT 3358.64 3358.54
borg-sat 11.03.02-par-random (fixed) (complete)3385465UNSAT 4207.66 596.353
borg-sat 11.03.02-random [DEPRECATED] (complete)3321952UNSAT 4389.94 622.693
ppfolio par (complete)3220281UNSAT 4624.31 578.441
csls pnorm-8cores (incomplete)3417883? (problem) 21922.1 3264.82
Satisfiability Solver Selector 2011-03-18 (complete)3220278? (TO) 4999.81 5000.02
EagleUP 1.565.350 (incomplete)3220283? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210327? (TO) 5000.04 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220279? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3426758? (TO) 5000.06 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446142? (TO) 5000.06 4999.92
ppfolio seq (complete)3220282? (TO) 5000.08 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210324? (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: