SAT 2009 Competition: main competition (phase2): solvers results per benchmarks

Result page for benchmark
industrial/palacios/hard/
sortnet-8-ipc5-h18-unsat.cnf

Jump to solvers results

General information on the benchmark

Nameindustrial/palacios/hard/
sortnet-8-ipc5-h18-unsat.cnf
MD5SUMb3381a58cbbd64d5d90a3b4fcd44bf6d
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark
Satisfiable
(Un)Satisfiability was proved
Number of variables338487
Number of clauses1187589
Sum of the clauses size2886289
Maximum clause length57
Minimum clause length1
Number of clauses of size 1256
Number of clauses of size 2849854
Number of clauses of size 3326098
Number of clauses of size 4798
Number of clauses of size 5544
Number of clauses of size over 510039

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
kw 2009-03-20 (complete)1772875? 3607.48 3608.99
SATzilla2009_I 2009-03-22 (complete)1772880? (exit code) 9997.88 10001.7
CircUs 2009-03-23 (complete)1772878? (exit code) 9999.65 10003.7
SAT07 reference solver: Rsat 2007-02-08 (complete)1824823? (TO) 10000 10003
SAT07 reference solver: picosat 535 (complete)1824824? (TO) 10000.1 10004.3
MiniSAT 09z 2009-03-22 (complete)1837093? (TO) 10000.1 10002.8
precosat 236 (complete)1772871? (TO) 10000.1 10003.1
minisat_cumr p-2009-03-18 (complete)1837092? (TO) 10000.1 10003.1
LySAT i/2009-03-20 (complete)1772873? (TO) 10000.1 10004.5
glucose 1.0 (complete)1772874? (TO) 10000.1 10004.3
SApperloT base (complete)1831472? (TO) 10000.1 10002.8
ManySAT 1.1 aimd 1/2009-03-20 (complete)1772876? (TO) 10000.1 5022.72
MXC 2009-03-10 (complete)1772877? (TO) 10000.1 10002.7
clasp 1.2.0-SAT09-32 (complete)1831471? (TO) 10000.1 10004.8
Rsat 2009-03-22 (complete)1772879? (TO) 10000.1 10003
MiniSat 2.1 (Sat-race'08 Edition) (complete)1772872? (TO) 10000.2 10003.9

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: