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 benchmark30.4254
(Un)Satisfiability was proved
Number of variables400
Number of clauses1704
Sum of the clauses size5112
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31704
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)3420691UNSAT 30.4254 30.429
SAT09 reference solver: march_hi hi (complete)3211177UNSAT 33.9838 33.9843
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211178UNSAT 120.201 120.203
borg-sat 11.03.02-seq-random (fixed) (complete)3386878UNSAT 133.388 132.911
MPhaseSAT_M 2011-02-16 (complete)3221558UNSAT 176.667 176.667
Satisfiability Solver Selector 2011-03-18 (complete)3221556UNSAT 189.24 189.357
ppfolio par (complete)3221559UNSAT 246.444 30.8336
borg-sat 11.03.02-par-random (fixed) (complete)3385678UNSAT 253.956 32.4125
borg-sat 11.03.02-random [DEPRECATED] (complete)3322165UNSAT 262.618 33.4978
ppfolio seq (complete)3221560UNSAT 3476.6 3476.51
csls pnorm-8cores (incomplete)3418096? (problem) 21005.5 2927.53
EagleUP 1.565.350 (incomplete)3221561? (TO) 4999.98 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446355? (TO) 5000.04 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211179? (TO) 5000.05 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221557? (TO) 5000.06 4999.91
sattime2011 2011-03-02 (incomplete)3426971? (TO) 5000.1 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211176? (TO) 5000.1 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: