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 benchmark6.92894
(Un)Satisfiability was proved
Number of variables75
Number of clauses1597
Sum of the clauses size7985
Maximum clause length5
Minimum clause length5
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 30
Number of clauses of size 40
Number of clauses of size 51597
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)3420836UNSAT 6.92894 6.92866
SAT09 reference solver: march_hi hi (complete)3211757UNSAT 7.33488 7.33766
MPhaseSAT_M 2011-02-16 (complete)3222428UNSAT 50.4263 50.4273
borg-sat 11.03.02-random [DEPRECATED] (complete)3322310UNSAT 55.4086 7.61952
ppfolio par (complete)3222429UNSAT 55.4926 6.94905
borg-sat 11.03.02-par-random (fixed) (complete)3385823UNSAT 72.586 9.71878
borg-sat 11.03.02-seq-random (fixed) (complete)3387023UNSAT 108.152 107.911
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211758UNSAT 120.4 120.406
Satisfiability Solver Selector 2011-03-18 (complete)3222426UNSAT 168.43 168.575
ppfolio seq (complete)3222430UNSAT 262.571 262.567
EagleUP 1.565.350 (incomplete)3222431? (TO) 5000.04 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3222427? (TO) 5000.05 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211756? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3427116? (TO) 5000.05 5000.02
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211759? (TO) 5000.06 4999.91
adaptg2wsat2011 2011-03-02 (incomplete)3446500? (TO) 5000.11 4999.92
csls pnorm-8cores (incomplete)3418241? (TO) 40000.5 5009.33

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: