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 benchmark0.493924
(Un)Satisfiability was proved
Number of variables250
Number of clauses1065
Sum of the clauses size3195
Maximum clause length3
Minimum clause length3
Number of clauses of size 10
Number of clauses of size 20
Number of clauses of size 31065
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)3420702UNSAT 0.493924 0.493627
SAT09 reference solver: march_hi hi (complete)3211221UNSAT 0.540916 0.541398
ppfolio par (complete)3221625UNSAT 1.51477 0.510792
borg-sat 11.03.02-par-random (fixed) (complete)3385689UNSAT 4.76627 1.18988
borg-sat 11.03.02-random [DEPRECATED] (complete)3322176UNSAT 4.97924 1.34848
ppfolio seq (complete)3221626UNSAT 15.2437 15.2454
Satisfiability Solver Selector 2011-03-18 (complete)3221622UNSAT 18.33 18.4449
MPhaseSAT_M 2011-02-16 (complete)3221624UNSAT 25.6561 25.6572
SAT09 reference solver: SATzilla2009_R 2009-03-22 (complete)3211222UNSAT 36.5214 36.5226
borg-sat 11.03.02-seq-random (fixed) (complete)3386889UNSAT 100.707 100.439
csls pnorm-8cores (incomplete)3418107? (problem) 19723.5 2789.86
EagleUP 1.565.350 (incomplete)3221627? (TO) 5000.02 4999.91
sparrow2011 sparrow2011_ubcsat1.2_2011-03-02 (incomplete)3221623? (TO) 5000.05 4999.91
sattime2011 2011-03-02 (incomplete)3426982? (TO) 5000.05 4999.92
adaptg2wsat2011 2011-03-02 (incomplete)3446366? (TO) 5000.05 4999.92
SAT09 reference solver: TNM 2009-03-22 (incomplete)3211223? (TO) 5000.06 4999.91
SAT09 reference solver: gnovelty+2 2009-03-22 (incomplete)3211220? (TO) 5000.09 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: