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 benchmark444.867
(Un)Satisfiability was proved
Number of variables500
Number of clauses2130
Sum of the clauses size6390
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 32130
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)3420749UNSAT 444.867 444.853
SAT09 reference solver: march_hi hi (complete)3211409UNSAT 492.912 492.897
borg-sat 11.03.02-seq-random (fixed) (complete)3386936UNSAT 654.375 651.791
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211410UNSAT 756.655 756.645
MPhaseSAT_M 2011-02-16 (complete)3221906UNSAT 2176.21 2176.16
borg-sat 11.03.02-par-random (fixed) (complete)3385736UNSAT 2775.9 485.584
borg-sat 11.03.02-random [DEPRECATED] (complete)3322223UNSAT 3597.57 451.272
ppfolio par (complete)3221907UNSAT 3609.4 451.488
csls pnorm-8cores (incomplete)3418154? (problem) 21348.3 2921.42
EagleUP 1.565.350 (incomplete)3221909? (TO) 5000.02 4999.91
ppfolio seq (complete)3221908? (TO) 5000.02 4999.91
Satisfiability Solver Selector 2011-03-18 (complete)3221904? (TO) 5000.02 5000.02
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221905? (TO) 5000.03 4999.91
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211411? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3427029? (TO) 5000.07 4999.92
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211408? (TO) 5000.08 5000.01
adaptg2wsat2011 2011-03-02 (incomplete)3446413? (TO) 5000.09 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: