import choco.Problem;
import choco.Constraint;
import choco.Solver;
import choco.Solution;
import choco.ContradictionException;
import choco.integer.IntVar;
//import choco.search.AssignVar;
import choco.search.AbstractGlobalSearchSolver;
import choco.search.AbstractGlobalSearchLimit;
import choco.integer.search.*;
import java.io.*;
import java.lang.*;
import java.util.*;

public class Build {	
   

    public static void main(String[] args) throws Exception,ContradictionException,FileNotFoundException,IOException {
	
	int noFiles = args.length;
	long ms1 = System.currentTimeMillis();
	Dict d = new Dict();
	Tree t1 = new Tree(args[0],d);
	Tree t2 = new Tree(args[1],d);

	Problem pb = new Problem();
	int m = d.size();

	UMatrix um = new UMatrix(m-1,pb,d,false);

	t1.breakUp(um);
	t2.breakUp(um);

	if (noFiles == 3){
	    MyIo fin = new MyIo(args[2]);
	    while (fin.hasMoreData()){
		String v = fin.getNextString();
		String w = fin.getNextString();
		String x = fin.getNextString();
		String y = fin.getNextString();
		um.predates(v,w,x,y);
	    }
	}

	long ms2 = System.currentTimeMillis();

	boolean solved = true;
	try {pb.propagate();}
	catch (Exception e) {solved = false;}

	//Solver sol = pb.getSolver();
	//boolean solved = pb.solve(false);

	long ms3 = System.currentTimeMillis();

	if (solved){
	    Tree t3 = um.toTree();
	    System.out.println(t3);
	}
	else
	    System.out.println("();");

	System.out.println("model: " + (ms2-ms1) + "ms   " + "solve: " + (ms3-ms2) + "ms" );
    }
}