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

Result page for benchmark
APPLICATIONS/bitverif/
maxxororand/maxxororand128.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
maxxororand/maxxororand128.cnf
MD5SUM3022ff2a7ae31b29e9b784d8e848042f
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 variables365168
Number of clauses1093967
Sum of the clauses size2552587
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 2729310
Number of clauses of size 3364655
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
SATzilla2009_I 2009-03-22 (complete)1773790? (exit code) 9998.18 10003
CircUs 2009-03-23 (complete)1773788? (exit code) 9999.77 10003.2
kw 2009-03-20 (complete)1773785? (MO) 207.527 208.297
minisat_cumr p-2009-03-18 (complete)1837274? (MO) 6109.41 6111.52
glucose 1.0 (complete)1773784? (TO) 10000 10004.7
LySAT i/2009-03-20 (complete)1773783? (TO) 10000 10004.3
Rsat 2009-03-22 (complete)1773789? (TO) 10000 10004.1
SAT07 reference solver: picosat 535 (complete)1825128? (TO) 10000.1 10005.1
MiniSAT 09z 2009-03-22 (complete)1837275? (TO) 10000.1 10005.3
ManySAT 1.1 aimd 1/2009-03-20 (complete)1773786? (TO) 10000.1 5022.32
SAT07 reference solver: Rsat 2007-02-08 (complete)1825127? (TO) 10000.1 10004.9
SApperloT base (complete)1831654? (TO) 10000.1 10003
MXC 2009-03-10 (complete)1773787? (TO) 10000.2 10003.2
MiniSat 2.1 (Sat-race'08 Edition) (complete)1773782? (TO) 10000.2 10004.5
precosat 236 (complete)1773781? (TO) 10000.2 10002.8
clasp 1.2.0-SAT09-32 (complete)1831653? (TO) 10000.3 10004.3

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: