Structure learning software. Copyright (c) 2009-2010 C. P. de Campos. All rights reserved. Academic/non-commercial use is permitted. inputfile: [test3.txt] verbose: [1] rundyn: [0] (branch-and-bound) initial solution: [-1e+100] max number of iterations: [no-limit] max time (sec): [no-limit] max memory (MB): [no-limit] min desired gap: [0] max number of samples: [no-limit] ignore constraints: [0] max number of parents per node: [no-limit] write cache to: [test3.out] STRUCTURAL CONSTRAINTS [1] initial allowance matrix has [1] nonzeros. Processing variable [0]... cache [0] has [1] elements. [1] score calls to build it. Lemma1 [0]. Theorem1 used:[0] total discarded:[1] alpha>0.83494:[0] Processing variable [1]... cache [1] has [1] elements. [1] score calls to build it. Lemma1 [0]. Theorem1 used:[0] total discarded:[1] alpha>0.83494:[0][1] elements pruned by constraints. cache [0] has [1] elements with at most [0] parents... cache [1] has [0] elements with at most [-1] parents... buildmap took [0] local score calls and [9.91821e-05] MB used ./matrix: Problem infeasible because of initial constraints