#define N 5 
#define MAN 0
#define PRO 1
#define DRI 2
#define PET 3
#define COL 4

/* MEN */ 
#define ENG 0
#define SPA 1
#define JAP 2
#define ITA 3
#define NOR 4

/* PET */
#define FOX 3
#define HOR 1
#define SNA 4
#define DOG 2
#define ZEB 0

/* HOUSE  */
#define YEL 4
#define BLU 2
#define RED 3
#define WHI 1
#define GRE 0

/*  DRINK  */
#define WAT 0
#define TEA 3
#define MIL 2
#define FRU 4
#define COF 1

/*  PROFESSION  */
#define PAI 0
#define SCU 1
#define DIP 2
#define VIO 3
#define DOC 4

continuous House[N][N];

permutation(continuous X[])
{
	and(int i=0;i<N;i++)				// Each individual
		or(int h=0;h<N;h++){			// each possible value
			and(int k=0;k<i;k++)
			      nint(X[k]) != h;				// if it’s unused
			X[i] == h;						// try to fix the
		}								// variable at that value
}

puzzle()
{
	bounds(); 		// It’s good practice to state known bounds
           				// on continuous variables
	House[MAN][ENG] == House[COL][RED];											// 1
	House[MAN][SPA] == House[PET][DOG];											// 2 
	House[MAN][JAP] == House[PRO][PAI];											// 3 
	House[MAN][ITA] == House[DRI][TEA];											// 4 
	House[MAN][NOR] == 0;											// 5 
	House[COL][GRE] == House[DRI][COF];											// 6 
	House[COL][GRE] == House[COL][WHI] + 1;											// 7 
	House[PRO][SCU] == House[PET][SNA];											// 8 
	House[PRO][DIP] == House[COL][YEL];											// 9 
	House[DRI][MIL] == 2;											// 10 

	either  House[COL][BLU] == House[MAN][NOR] + 1;
	or House[COL][BLU] == House[MAN][NOR] - 1; // 11

	House[PRO][VIO] == House[DRI][FRU];											// 12

	either House[PET][FOX] == House[PRO][DOC] + 1;													// 13
	or House[PET][FOX] == House[PRO][DOC] - 1;  

	either House[PET][HOR] == House[PRO][DIP] + 1;													// 14
	or House[PET][HOR] == House[PRO][DIP] - 1;
} 

bounds() 
{
	and(int i=0;i<N;i++)
		and(int j=0;j<N;j++)
			House[i][j] <= N-1;
}

2lp_main()
{
	puzzle();
	and(int i=0;i<N;i++)		// Fuzzy logic
		sigma(int j=0;j<N;j++) House[i][j] == 
			sigma(int h=0;h<N;h++) h;
	and(int i=0;i<N;i++)
		permutation(House[i]);
	output();
}

output() 
{
	and(int i=0;i<N;i++) 
		if House[MAN][i] == House[PET][ZEB];
		then printf("Man Number %d has the zebra\n",i); 
	and(int i=0;i<N;i++) 
		if House[MAN][i] == House[DRI][WAT];
		then printf("Man Number %d drinks water\n",i);
} 
 