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

Result page for benchmark
APPLICATIONS/bitverif/
minxorminand/minxorminand064.cnf

Jump to solvers results

General information on the benchmark

NameAPPLICATIONS/bitverif/
minxorminand/minxorminand064.cnf
MD5SUM1394bf507e3ed448c81b5502d6550d78
Bench CategoryAPPLICATION (applications instances)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark88.2906
Satisfiable
(Un)Satisfiability was proved
Number of variables40042
Number of clauses119357
Sum of the clauses size278497
Maximum clause length3
Minimum clause length1
Number of clauses of size 12
Number of clauses of size 279570
Number of clauses of size 339785
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
Rsat 2009-03-22 (complete)1773609UNSAT 88.2906 88.3518
clasp 1.2.0-SAT09-32 (complete)1831617UNSAT 148.213 148.272
ManySAT 1.1 aimd 1/2009-03-20 (complete)1773606UNSAT 161.483 82.0301
MiniSat 2.1 (Sat-race'08 Edition) (complete)1773602UNSAT 209.314 209.366
CircUs 2009-03-23 (complete)1773608UNSAT 214.765 214.826
LySAT i/2009-03-20 (complete)1773603UNSAT 279.114 279.286
precosat 236 (complete)1773601UNSAT 299.394 299.505
SAT07 reference solver: Rsat 2007-02-08 (complete)1825091UNSAT 339.124 339.301
MiniSAT 09z 2009-03-22 (complete)1837239UNSAT 386.64 386.754
SATzilla2009_I 2009-03-22 (complete)1773610UNSAT 460.108 460.262
minisat_cumr p-2009-03-18 (complete)1837238UNSAT 470.191 470.439
MXC 2009-03-10 (complete)1773607UNSAT 663.296 663.463
kw 2009-03-20 (complete)1773605UNSAT 759.486 759.88
SAT07 reference solver: picosat 535 (complete)1825092UNSAT 1063.69 1063.98
glucose 1.0 (complete)1773604UNSAT 1081.62 1082.06
SApperloT base (complete)1831618UNSAT 1958.37 1958.94

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: