//
// Kyle Simpson's problem (how dumb is ac?)
//
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.variables.*;
import org.chocosolver.solver.constraints.*;
import org.chocosolver.solver.search.strategy.*;
import org.chocosolver.solver.trace.Chatterbox;
import org.chocosolver.solver.exception.ContradictionException;


public class Kyle {

    public static void main(String args[]) throws ContradictionException {
      Solver solver = new Solver("Kyle's problem");
      IntVar v1 = VF.enumerated("v1",0,999,solver); 
      IntVar v2 = VF.enumerated("v2",0,999,solver); 

      solver.post(ICF.arithm(v1,"!=",v2)); // v1 != v2
      solver.post(ICF.arithm(v1,"=",v2));  // v1 = v2

      System.out.println(solver.findSolution() +
                         "   nodes: " + solver.getMeasures().getNodeCount() + 
                         "   cpu: " + solver.getMeasures().getTimeCount());
    }
}