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 benchmarkSAT
Best CPU time to get the best result obtained on this benchmark593.197
(Un)Satisfiability was proved
Number of variables40000
Number of clauses168000
Sum of the clauses size504000
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 3168000
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
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3219367SAT 593.197 593.191
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3209718? (exit code) 4999.11 4998.92
borg-sat 11.03.02-par-random (fixed) (complete)3385313? (MO) 9517.73 1203.53
borg-sat 11.03.02-random [DEPRECATED] (complete)3321800? (MO) 11581.3 1649.13
borg-sat 11.03.02-seq-random (fixed) (complete)3386513? (TO) 5000.02 4992.92
SAT09 reference solver: march_hi hi (complete)3209717? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3209716? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3209719? (TO) 5000.03 4999.91
MPhaseSAT_M 2011-02-16 (complete)3219368? (TO) 5000.04 4999.92
EagleUP 1.565.350 (incomplete)3219371? (TO) 5000.04 4999.81
Satisfiability Solver Selector 2011-03-18 (complete)3219366? (TO) 5000.06 5000.02
ppfolio seq (complete)3219370? (TO) 5000.08 5000.01
sattime2011 2011-03-02 (incomplete)3426606? (TO) 5000.09 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3445990? (TO) 5000.09 4999.92
march_rw 2011-03-02 (complete)3420326? (TO) 5000.1 4999.91
csls pnorm-8cores (incomplete)3417731? (TO) 38361.5 5100.03
ppfolio par (complete)3219369? (TO) 39969.6 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:
--too large--