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.135979
(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)3420799UNSAT 0.135979 0.136021
SAT09 reference solver: march_hi hi (complete)3211609UNSAT 0.139978 0.139428
ppfolio par (complete)3222207UNSAT 0.45393 0.162129
ppfolio seq (complete)3222208UNSAT 2.24066 2.2412
borg-sat 11.03.02-par-random (fixed) (complete)3385786UNSAT 2.25066 1.07021
Satisfiability Solver Selector 2011-03-18 (complete)3222204UNSAT 7.94 8.06714
MPhaseSAT_M 2011-02-16 (complete)3222206UNSAT 18.7681 18.7689
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211610UNSAT 30.7553 30.758
borg-sat 11.03.02-seq-random (fixed) (complete)3386986UNSAT 100.369 100.266
borg-sat 11.03.02-random [DEPRECATED] (complete)3322273? (exit code) 1.71174 1.03558
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211608? (TO) 5000.04 4999.81
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222205? (TO) 5000.05 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211611? (TO) 5000.08 5000.01
EagleUP 1.565.350 (incomplete)3222209? (TO) 5000.09 5000.01
sattime2011 2011-03-02 (incomplete)3427079? (TO) 5000.09 5000.02
adaptg2wsat2011 2011-03-02 (incomplete)3446463? (TO) 5000.1 4999.92
csls pnorm-8cores (incomplete)3418204? (TO) 40000.7 5010.44

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: