I am sorry this is quite a lenghty problem, but I am absolutely confused and don't even understand what is asked of me! Two links are also rpvided. Here they are:

(1) http://people.sc.fsu.edu/~jburkardt/data/cnf/zebra.c

(2) http://people.sc.fsu.edu/~jburkardt/data/cnf/zebra_v155_c1135.cnf

The constraints and clues of the Zebra puzzle can be encoded in in a propositional formula Conjunctive Normal Form. If constructed correctly,J will have the following properties: in . is satisfiable if and only if there is a solution to the Zebra puzzle. Any satisfying truth assignment implies a solution to the puzzle . This is an example of a reduction" - the Zebra puzzle is being reduced to an instance of the CNF SAT problem. Now take a look at an encoding of the Zebra puzzle as a CNF-Satisfiability instance A human-friendly form of the formulation: http:/lpeople.sc.fsu.edul iburkardt/data/cnf/zebra.c This is not an actual C program as suggested by the.c extension. It is also not a format that can be fed directly into a SAT solver, However, it is a format that when fed through the C preprocessor to produce something that can be given to a sat solver In short: SAT solvers require that variables be identified by positive integers 1..N (where n is just the number of variables in a particular formulation). You can think of the variables as being x, x X Recall that a "literal" is a variable or its negation. In the SAT input format, literal x, is represented simply by the integer is represented by the integer - Now, remember that a CNF expression is an "AND-of-ORs". Each OR of literals is called a clause. With respect to the input format, an individual clause is just a sequence of literals followed by zero. For example, the clause xi V7% VX5 V would be expressed as 1 -2 5-6 0