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

Result page for benchmark
APPLICATIONS/bitverif/
minandmaxor/minandmaxor128.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minandmaxor/minandmaxor128.cnf
MD5SUM5b2e2178738883a628728bb1ec39f4a9
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark5143.44
Satisfiable
(Un)Satisfiability was proved
Number of variables249327
Number of clauses746444
Sum of the clauses size1741700
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 2497628
Number of clauses of size 3248814
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
CircUs 2009-03-23 (complete)1773658UNSAT 5143.44 5144.65
precosat 236 (complete)1773651UNSAT 7256.32 7259.69
kw 2009-03-20 (complete)1773655? 3603.91 3606.82
SATzilla2009_I 2009-03-22 (complete)1773660? (exit code) 9997.74 10001.8
LySAT i/2009-03-20 (complete)1773653? (TO) 10000 10004.6
SAT07 reference solver: Rsat 2007-02-08 (complete)1825101? (TO) 10000 10004.7
minisat_cumr p-2009-03-18 (complete)1837248? (TO) 10000 10004.6
glucose 1.0 (complete)1773654? (TO) 10000 10000.1
Rsat 2009-03-22 (complete)1773659? (TO) 10000 10004.9
MiniSAT 09z 2009-03-22 (complete)1837249? (TO) 10000.1 10003.9
SAT07 reference solver: picosat 535 (complete)1825102? (TO) 10000.1 10003.3
ManySAT 1.1 aimd 1/2009-03-20 (complete)1773656? (TO) 10000.1 5018.52
SApperloT base (complete)1831628? (TO) 10000.2 10002.9
clasp 1.2.0-SAT09-32 (complete)1831627? (TO) 10000.2 10003.1
MXC 2009-03-10 (complete)1773657? (TO) 10000.3 10003.2
MiniSat 2.1 (Sat-race'08 Edition) (complete)1773652? (TO) 10000.3 10003.7

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: