We are using a GA for Boolean satisfiability, with a fitness function equal to the number of satisfied clauses. The instance has 8 variables, A, B, C, D, E, F, G, and H. The bit strings in our population are thus of length 8, one bit per variable, with 1 indicating true, and 0 indicating false. The order of the bits correspond to alphabetical order of the variables. That is, the first bit is the value for A, the second bit the value for B, etc. The Boolean function we are trying to satisfy is