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.806876
(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)3420468UNSAT 0.806876 0.806933
SAT09 reference solver: march_hi hi (complete)3210285UNSAT 0.886865 0.887203
ppfolio par (complete)3220221UNSAT 6.47002 0.817928
borg-sat 11.03.02-random [DEPRECATED] (complete)3321942UNSAT 7.11092 1.80322
borg-sat 11.03.02-par-random (fixed) (complete)3385455UNSAT 7.61884 1.86738
MPhaseSAT_M 2011-02-16 (complete)3220220UNSAT 28.1687 28.1697
ppfolio seq (complete)3220222UNSAT 34.8227 34.8267
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3210286UNSAT 42.0906 42.0916
Satisfiability Solver Selector 2011-03-18 (complete)3220218UNSAT 61.16 61.7873
borg-sat 11.03.02-seq-random (fixed) (complete)3386655UNSAT 99.2049 99.0463
csls pnorm-8cores (incomplete)3417873? (problem) 20754.9 2935.31
SAT09 reference solver: TNM 2009-03-22 (incomplete)3210287? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426748? (TO) 5000.07 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446132? (TO) 5000.07 4999.92
EagleUP 1.565.350 (incomplete)3220223? (TO) 5000.07 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3220219? (TO) 5000.08 5000.01
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3210284? (TO) 5000.09 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: