Solving a traditional binary CSP in Eclipse

I'm new to Eclipse. I'd like to use the system to solve traditional finite
domain binary CSPs. I looked at the examples provided on the Eclipse site
and still can't figure out how to implement a problem of the form:

 

3 variables X,Y,Z

the domain of each variable is 1,2,3,4,5

the constraints are given as a subset of the Cartesian products of the
domain:

 

constraint between X and Y: {(1,1),(1,2),(3,1)}

                            Y and Z: {(1,3),(2,3),(3,3)}

                            Z and X: {(1,1),(2,2),(3,1),(4,4),(5,5)}

 

How do I program Eclipse to return a solution of the form X=1,Y=2,Z=3?

Any help would be appreciated.

Andre