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 benchmark303.975
(Un)Satisfiability was proved
Number of variables25000
Number of clauses105000
Sum of the clauses size315000
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 3105000
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
EagleUP 1.565.350 (incomplete)3219467SAT 303.975 303.969
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3219463SAT 435.148 435.138
sattime2011 2011-03-02 (incomplete)3426622SAT 1155.47 1155.47
Satisfiability Solver Selector 2011-03-18 (complete)3219462SAT 1550.64 1550.77
borg-sat 11.03.02-seq-random (fixed) (complete)3386529SAT 2378.5 2369.4
borg-sat 11.03.02-random [DEPRECATED] (complete)3321816SAT 2983.34 378.25
SAT09 reference solver: TNM 2009-03-22 (incomplete)3209783SAT 3010.18 3010.13
adaptg2wsat2011 2011-03-02 (incomplete)3446006SAT 4064.88 4064.79
borg-sat 11.03.02-par-random (fixed) (complete)3385329SAT 4492.26 569.4
csls pnorm-8cores (incomplete)3417747SAT 9576.56 1199.2
ppfolio par (complete)3219465SAT 17359.9 2171.66
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3209782? (exit code) 4998.79 4998.88
ppfolio seq (complete)3219466? (TO) 5000.03 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3209780? (TO) 5000.05 4999.91
march_rw 2011-03-02 (complete)3420342? (TO) 5000.06 4999.91
MPhaseSAT_M 2011-02-16 (complete)3219464? (TO) 5000.07 4999.92
SAT09 reference solver: march_hi hi (complete)3209781? (TO) 5000.07 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:
--too large--