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.142977
(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)3420810UNSAT 0.142977 0.142704
SAT09 reference solver: march_hi hi (complete)3211653UNSAT 0.150976 0.151018
ppfolio par (complete)3222273UNSAT 1.22781 0.161448
ppfolio seq (complete)3222274UNSAT 2.6366 2.63833
Satisfiability Solver Selector 2011-03-18 (complete)3222270UNSAT 8.04 8.14309
MPhaseSAT_M 2011-02-16 (complete)3222272UNSAT 18.8501 18.8544
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211654UNSAT 30.9203 30.9207
borg-sat 11.03.02-seq-random (fixed) (complete)3386997UNSAT 100.382 100.333
borg-sat 11.03.02-par-random (fixed) (complete)3385797? (exit code) 1.52177 0.959441
borg-sat 11.03.02-random [DEPRECATED] (complete)3322284? (exit code) 2.02669 1.03347
EagleUP 1.565.350 (incomplete)3222275? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222271? (TO) 5000.06 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211655? (TO) 5000.08 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211652? (TO) 5000.09 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446474? (TO) 5000.1 5000.02
sattime2011 2011-03-02 (incomplete)3427090? (TO) 5000.1 5000.02
csls pnorm-8cores (incomplete)3418215? (TO) 40000.7 5008.72

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: