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.559914
(Un)Satisfiability was proved
Number of variables300
Number of clauses1278
Sum of the clauses size3834
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31278
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)3420734UNSAT 0.559914 0.559987
SAT09 reference solver: march_hi hi (complete)3211349UNSAT 0.618905 0.622169
borg-sat 11.03.02-par-random (fixed) (complete)3385721UNSAT 4.17436 1.25721
ppfolio par (complete)3221817UNSAT 4.50731 0.569734
borg-sat 11.03.02-random [DEPRECATED] (complete)3322208UNSAT 4.5923 1.19043
Satisfiability Solver Selector 2011-03-18 (complete)3221814UNSAT 16.83 17.2088
ppfolio seq (complete)3221818UNSAT 17.1804 17.181
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211350UNSAT 36.7484 36.7521
MPhaseSAT_M 2011-02-16 (complete)3221816UNSAT 51.8701 51.8724
borg-sat 11.03.02-seq-random (fixed) (complete)3386921UNSAT 98.857 98.5635
csls pnorm-8cores (incomplete)3418139? (problem) 21020.7 2960.25
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211351? (TO) 5000.02 4999.91
EagleUP 1.565.350 (incomplete)3221819? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3427014? (TO) 5000.03 4999.92
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221815? (TO) 5000.04 4999.81
adaptg2wsat2011 2011-03-02 (incomplete)3446398? (TO) 5000.05 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211348? (TO) 5000.08 5000.01

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: