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.58585
(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)3420695UNSAT 7.58585 7.58548
SAT09 reference solver: march_hi hi (complete)3211193UNSAT 9.12661 9.13129
MPhaseSAT_M 2011-02-16 (complete)3221582UNSAT 49.7014 49.6997
borg-sat 11.03.02-random [DEPRECATED] (complete)3322169UNSAT 58.924 9.84464
ppfolio par (complete)3221583UNSAT 61.5006 7.70213
borg-sat 11.03.02-par-random (fixed) (complete)3385682UNSAT 72.372 9.66663
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211194UNSAT 75.8405 75.8472
borg-sat 11.03.02-seq-random (fixed) (complete)3386882UNSAT 108.631 108.483
Satisfiability Solver Selector 2011-03-18 (complete)3221580UNSAT 164.05 164.12
ppfolio seq (complete)3221584UNSAT 553.393 553.375
csls pnorm-8cores (incomplete)3418100? (problem) 20074.8 2841.11
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221581? (TO) 5000.04 4999.81
adaptg2wsat2011 2011-03-02 (incomplete)3446359? (TO) 5000.05 5000.02
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211192? (TO) 5000.06 4999.91
EagleUP 1.565.350 (incomplete)3221585? (TO) 5000.09 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211195? (TO) 5000.09 5000.01
sattime2011 2011-03-02 (incomplete)3426975? (TO) 5000.11 5000.02

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: