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 benchmark7.26989
(Un)Satisfiability was proved
Number of variables350
Number of clauses1491
Sum of the clauses size4473
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31491
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)3420689UNSAT 7.26989 7.26998
SAT09 reference solver: march_hi hi (complete)3211169UNSAT 8.03478 8.03483
MPhaseSAT_M 2011-02-16 (complete)3221546UNSAT 49.7304 49.7309
ppfolio par (complete)3221547UNSAT 58.26 7.36058
borg-sat 11.03.02-random [DEPRECATED] (complete)3322163UNSAT 58.905 8.21476
borg-sat 11.03.02-par-random (fixed) (complete)3385676UNSAT 67.3608 9.24017
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211170UNSAT 77.0023 77.0043
borg-sat 11.03.02-seq-random (fixed) (complete)3386876UNSAT 108.24 111.784
Satisfiability Solver Selector 2011-03-18 (complete)3221544UNSAT 164.51 164.665
ppfolio seq (complete)3221548UNSAT 529.218 529.201
csls pnorm-8cores (incomplete)3418094? (problem) 20986.1 2936.62
EagleUP 1.565.350 (incomplete)3221549? (TO) 5000.02 4999.91
sattime2011 2011-03-02 (incomplete)3426969? (TO) 5000.03 5000.02
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221545? (TO) 5000.04 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446353? (TO) 5000.04 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211171? (TO) 5000.06 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211168? (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: