gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/contribs/qecode/examples/network-pricing.cc

@@ -0,0 +1,146 @@
+#include "gecode/minimodel.hh"
+#include "gecode/search.hh"
+#include "Implicative.hh"
+#include "qsolver.hh"
+#include <iostream>
+
+using namespace std;
+using namespace Gecode;
+using namespace Gecode::Int;
+
+void printStr(Strategy s,int depth) {
+    StrategyNode plop = s.getTag();
+    for (int glou=0;glou<depth;glou++) cout<<" ";
+    if (s.isTrue()) cout<<"TRUE"<<endl;
+    else if (s.isFalse()) cout<<"FALSE"<<endl;
+    else cout<<"type "<<plop.type<<" qt "<<plop.quantifier<<" vmin "<<plop.Vmin<<" vmax "<<plop.Vmax<<" scope "<<plop.scope<<" - ";
+    for (int i=0;i<s.getTag().valeurs.size();i++) cout<<s.getTag().valeurs[i]<<" ";
+    cout<<endl;
+    for (int glou=0;glou<depth;glou++) cout<<" ";
+    cout<<s.degree()<<" child(ren)"<<endl;
+    for (int i=0;i<s.degree();i++) {
+        for (int glou=0;glou<depth;glou++) cout<<" ";
+        cout<<"Child "<<i<<" : "<<endl;
+        printStr(s.getChild(i),depth+1);
+    }
+}
+/////////////////////////////////////////////////////////////////////////////////////////
+// This is an instance of the Network Pricing Problem, taken from :                    //
+//                                                                                     //
+// Bouhtou, M., Grigoriev, A., van Hoesel, S., van der Kraaij, A.F., Spieksma, F.C.,   //
+// Uetz, M.: Pricing bridges to cross a river. Naval Research Logistics 54(4) (2007)   //
+// 411�420                                                                             //
+//                                                                                     //
+// The problem is to set a tariff on some network links in a way that maximizes the    //
+// profit of the owner of the links.                                                   //
+// Customer i wishes to transmit di amount of data from a source xi to a target yi.    //
+// Each path from a source to a target has to cross a tolled arc aj . On the way from  //
+// si to aj , the cost of the links owned by other providers is cij . It is assumed    //
+// that each customer i wishes to minimize the cost to route her data and that they can//
+// always choose an other provider at a cost ui. The purpose of the problem is to      //
+// determine the cost tj to cross a tolled arc aj in order to maximize the revenue of  //
+// the telecom operator.                                                               //
+// This instance has 5 links and 9 customers. The network operator may choose among 5  //
+// tarifs for each link.                                                               //
+/////////////////////////////////////////////////////////////////////////////////////////
+
+int main() {
+    int NCustomer = 9;
+    int NArc = 5;
+    int*c = new int[NCustomer*NArc]; // [NArc*i+j] : Initial cost for client i to reach way j 
+    int* d = new int[NCustomer]; // d[i] : amount of data client i wants to transmit
+    int* u = new int[NCustomer]; // u[i] : maximum cost client i will accept
+    int max = 19;
+
+    c[0*NArc+0]=5;    c[0*NArc+1]=1;    c[0*NArc+2]=8;    c[0*NArc+3]=6;    c[0*NArc+4]=6;
+    c[1*NArc+0]=2;    c[1*NArc+1]=8;    c[1*NArc+2]=6;    c[1*NArc+3]=3;    c[1*NArc+4]=1;
+    c[2*NArc+0]=0;    c[2*NArc+1]=8;    c[2*NArc+2]=0;    c[2*NArc+3]=8;    c[2*NArc+4]=6;
+    c[3*NArc+0]=2;    c[3*NArc+1]=4;    c[3*NArc+2]=7;    c[3*NArc+3]=5;    c[3*NArc+4]=8;
+    c[4*NArc+0]=8;    c[4*NArc+1]=2;    c[4*NArc+2]=4;    c[4*NArc+3]=3;    c[4*NArc+4]=4;
+    c[5*NArc+0]=5;    c[5*NArc+1]=4;    c[5*NArc+2]=6;    c[5*NArc+3]=4;    c[5*NArc+4]=1;
+    c[6*NArc+0]=5;    c[6*NArc+1]=6;    c[6*NArc+2]=7;    c[6*NArc+3]=4;    c[6*NArc+4]=8;
+    c[7*NArc+0]=5;    c[7*NArc+1]=8;    c[7*NArc+2]=1;    c[7*NArc+3]=3;    c[7*NArc+4]=6;
+    c[8*NArc+0]=7;    c[8*NArc+1]=8;    c[8*NArc+2]=8;    c[8*NArc+3]=3;    c[8*NArc+4]=5;
+
+    d[0]=7;    d[1]=16;    d[2]=16;    d[3]=19;    d[4]=18;    d[5]=13;    d[6]=8;    d[7]=11;    d[8]=18;
+    u[0]=122;    u[1]=190;    u[2]=113;    u[3]=285;    u[4]=247;    u[5]=255;    u[6]=143;    u[7]=121;    u[8]=139;
+    IntArgs carg(NCustomer*NArc,c); // Copy c in an IntArgs for further constraint posting 
+    IntArgs darg(NCustomer,d); // Copy d in an IntArgs for further constraint posting 
+    IntArgs uarg(NCustomer,u); // Copy u in an IntArgs for further constraint posting 
+
+    bool q[] = {false,true,false};
+    int* nv = new int[3];
+    nv[0]=NArc;
+    nv[1]=1;
+    nv[2]=9;
+
+    Implicative problem(3,q,nv);
+    int postarfs[] = {3,7,11,15,19};
+    IntSet thePossibleTariffs(postarfs,5);
+    for (int i=0;i<NArc;i++)
+        problem.QIntVar(i,thePossibleTariffs); // tariff for way i
+    IntVarArgs branch1(NArc);
+    for (int i=0;i<NArc;i++)
+        branch1[i] = problem.var(i);
+    branch(problem.space(),branch1,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    problem.nextScope();
+
+    problem.QIntVar(NArc,0,NCustomer-1); // k
+    IntVarArgs branch2(NArc+1);
+    for (int i=0;i<NArc+1;i++)
+        branch2[i] = problem.var(i);
+    branch(problem.space(),branch2,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    problem.nextScope();
+
+    problem.QIntVar(NArc+1,0,NArc-1); // a
+    problem.QIntVar(NArc+2,0,1000000); // cost
+    problem.QIntVar(NArc+3,0,1000000); // Income
+    IntVar a(problem.var(NArc+1));
+    IntVar cost(problem.var(NArc+2));
+    IntVar income(problem.var(NArc+3));
+    problem.QIntVar(NArc+4,0,1000000);
+    problem.QIntVar(NArc+5,0,1000000);
+    problem.QIntVar(NArc+6,0,1000000);
+    problem.QIntVar(NArc+7,0,1000000);
+    problem.QIntVar(NArc+8,0,1000000);
+    problem.QIntVar(NArc+9,0,1000000);
+    IntVar aux1(problem.var(NArc+4)); // k* NArc + a
+    IntVar aux2(problem.var(NArc+5)); // c[k*Narc+a]
+    IntVar aux3(problem.var(NArc+6)); // t[a]
+    IntVar aux4(problem.var(NArc+7)); // d[k]
+    IntVar aux5(problem.var(NArc+8)); // c[]+t[]
+    IntVar aux6(problem.var(NArc+9)); // u[k]
+    IntVar k(problem.var(NArc));
+    post(problem.space(), aux1 == ( NArc * k + a) );
+    element(problem.space(),carg,aux1,aux2);
+    IntVarArgs t(NArc);
+    for (int i=0;i<NArc;i++) t[i]=problem.var(i);
+    element(problem.space(),t,a,aux3);
+    element(problem.space(),darg,k,aux4);
+    post(problem.space(), aux5 == aux2 + aux3);
+    mult(problem.space(),aux5,aux4,cost); // cost = aux5 * aux4
+    mult(problem.space(),aux3,aux4,income);
+    element(problem.space(),uarg,k,aux6);
+    post(problem.space(),cost <= aux6);
+
+    IntVarArgs branch3(NArc+10);
+    for (int i=0;i<NArc+10;i++) 
+        branch3[i] = problem.var(i);
+    branch(problem.space(),branch3,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+
+    OptVar* costopt = problem.getExistential(NArc+2);
+    OptVar* incomeopt = problem.getExistential(NArc+3);
+    problem.optimize(2,1,costopt); // at scope 2, we minimize (1) the variable cost
+    AggregatorSum somme;
+    OptVar* sumvar = problem.getAggregate(1,incomeopt,&somme);
+    problem.optimize(0,2,sumvar);
+
+
+    QSolver sol(&problem);
+    unsigned long int nodes=0;
+
+    Strategy hihihi = sol.solve(nodes);
+    cout<<nodes<<" nodes encountered."<<endl;
+    printStr(hihihi,0);
+    return 0;
+}

data/ext/gecode-2.2.0/contribs/qecode/examples/optim2.cc

@@ -0,0 +1,149 @@
+/****   , [ optim2.cc ], 
+Copyright (c) 2008 Universite d'Orleans - Jeremie Vautard 
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+ *************************************************************************/
+
+#include "gecode/minimodel.hh"
+#include "gecode/search.hh"
+#include "Implicative.hh"
+#include "qsolver.hh"
+#include <iostream>
+
+using namespace std;
+using namespace Gecode;
+using namespace Gecode::Int;
+
+void printStr(Strategy s,int depth) {
+    StrategyNode plop = s.getTag();
+    for (int glou=0;glou<depth;glou++) cout<<" ";
+    if (s.isTrue()) cout<<"TRUE"<<endl;
+    else if (s.isFalse()) cout<<"FALSE"<<endl;
+    else cout<<"type "<<plop.type<<" qt "<<plop.quantifier<<" vmin "<<plop.Vmin<<" vmax "<<plop.Vmax<<" scope "<<plop.scope<<" - ";
+    for (int i=0;i<s.getTag().valeurs.size();i++) cout<<s.getTag().valeurs[i]<<" ";
+    cout<<endl;
+    for (int glou=0;glou<depth;glou++) cout<<" ";
+    cout<<s.degree()<<" child(ren)"<<endl;
+    for (int i=0;i<s.degree();i++) {
+        for (int glou=0;glou<depth;glou++) cout<<" ";
+        cout<<"Child "<<i<<" : "<<endl;
+        printStr(s.getChild(i),depth+1);
+    }
+}
+
+int main() {
+    int NCustomer = 2;
+    int NArc = 3;
+    int* c = new int[NCustomer*NArc]; // c[NArc*i + j] cost for ci to reach Aj
+    int* d = new int[NCustomer]; // demand for customer i   
+    int* u = new int[NCustomer]; // max price for customer i
+    int max;
+    
+    c[0*NArc+0] = 5;  c[1*NArc+0] = 3;  
+    c[0*NArc+1] = 4;  c[1*NArc+1] = 6;  
+    c[0*NArc+2] = 2;  c[1*NArc+2] = 5;  
+    
+    d[0] = 10;  d[1] = 7;
+    u[0] = 70;  u[1] = 90;
+    
+    max = 100;
+
+        
+    IntArgs carg(NCustomer*NArc,c);
+    IntArgs darg(NCustomer,d);
+    IntArgs uarg(NCustomer,u);
+
+    
+    bool q[] = {false,true,false};
+    int* nv = new int[3];
+    nv[0] = NArc;
+    nv[1] = 1;
+    nv[2] = 9;
+    
+    Implicative problem(3,q,nv);
+    for (int i=0;i<NArc;i++)
+        problem.QIntVar(i,0,10); // t[i]
+    IntVarArgs branch1(NArc);
+    for (int i=0;i<NArc;i++) 
+        branch1[i] = problem.var(i);
+    branch(problem.space(),branch1,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    problem.nextScope();
+    
+    problem.QIntVar(NArc,0,NCustomer-1); // k
+    IntVarArgs branch2(NArc+1);
+    for (int i=0;i<NArc+1;i++) 
+        branch2[i] = problem.var(i);
+    branch(problem.space(),branch2,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    problem.nextScope();
+    
+    problem.QIntVar(NArc+1,0,NArc-1); // a
+    problem.QIntVar(NArc+2,0,max); // cost
+    problem.QIntVar(NArc+3,0,max); // Income
+    IntVar a(problem.var(NArc+1));
+    IntVar cost(problem.var(NArc+2));
+    IntVar income(problem.var(NArc+3));
+    problem.QIntVar(NArc+4,0,max);
+    problem.QIntVar(NArc+5,0,max);
+    problem.QIntVar(NArc+6,0,max);
+    problem.QIntVar(NArc+7,0,max);
+    problem.QIntVar(NArc+8,0,max);
+    problem.QIntVar(NArc+9,0,max);
+    IntVar aux1(problem.var(NArc+4)); // k* NArc + a
+    IntVar aux2(problem.var(NArc+5)); // c[k*Narc+a]
+    IntVar aux3(problem.var(NArc+6)); // t[a]  
+    IntVar aux4(problem.var(NArc+7)); // d[k]
+    IntVar aux5(problem.var(NArc+8)); // c[]+t[]
+    IntVar aux6(problem.var(NArc+9)); // u[k]
+    IntVar k(problem.var(NArc));
+    post(problem.space(), aux1 == ( NArc * k + a) );
+    element(problem.space(),carg,aux1,aux2);
+    IntVarArgs t(NArc);
+    for (int i=0;i<NArc;i++) t[i]=problem.var(i);
+    element(problem.space(),t,a,aux3);
+    element(problem.space(),darg,k,aux4);
+    post(problem.space(), aux5 == aux2 + aux3);
+    mult(problem.space(),aux5,aux4,cost); // cost = aux5 * aux4
+    mult(problem.space(),aux3,aux4,income);
+    element(problem.space(),uarg,k,aux6);
+    post(problem.space(),cost <= aux6);
+
+    IntVarArgs branch3(NArc+10);
+    for (int i=0;i<NArc+10;i++) 
+        branch3[i] = problem.var(i);
+    branch(problem.space(),branch3,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    OptVar* costopt = problem.getExistential(NArc+2);
+    OptVar* incomeopt = problem.getExistential(NArc+3);
+    problem.optimize(2,1,costopt); // at scope 2, we minimize (1) the variable cost
+    AggregatorSum somme;
+    OptVar* sumvar = problem.getAggregate(1,incomeopt,&somme);
+    problem.optimize(0,2,sumvar);
+    
+    
+    QSolver sol(&problem);
+    unsigned long int nodes=0;
+    
+    Strategy outcome = sol.solve(nodes);
+    
+    cout<<"STRATEGY DESCRIPTION : "<<endl;
+    printStr(outcome,0);
+    return 0;
+}
+
+    

data/ext/gecode-2.2.0/contribs/qecode/examples/stress_test.cpp

@@ -0,0 +1,240 @@
+/****   , [ stress_test.cpp ], 
+Copyright (c) 2007 Universite d'Orleans - Jeremie Vautard 
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+*************************************************************************/
+
+#include "qsolver.hh"
+#include "implicative.hh"
+#include <iostream>
+
+using namespace std;
+// This is a set of tiny problems which are used to dtect errors in QeCode. 
+// This set is likely to progressively enlarge...
+
+int main() {
+    unsigned long int nodes;
+    unsigned long int steps;
+    
+    // Ax in 1..3 []  -> x=1
+    int sc1[] = {1};
+    bool q1[] = {QECODE_UNIVERSAL};
+    Implicative test1(1,q1,sc1);
+    test1.QIntVar(0,1,3);
+    IntVarArgs b1(1);
+    b1[0] = test1.var(0);
+    branch(test1.space(),b1,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    test1.nextScope();
+    post(test1.space(),test1.var(0) == 1);
+    test1.makeStructure();
+    QSolver s1(&test1);
+    nodes=0;
+    Strategy ret1=s1.solve(nodes);
+    cout<<"Problem 1 : result = "<<(ret1.isFalse()?"FALSE":"TRUE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+    
+    //Ex in 1..3 [] st x=1
+    int sc2[] = {1};
+    bool q2[] = {QECODE_EXISTENTIAL};
+    Implicative test2(1,q2,sc2);
+    test2.QIntVar(0,1,3);
+    
+    IntVarArgs b2(1);
+    b2[0] = test2.var(0);
+    branch(test2.space(),b2,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    test2.nextScope();
+    post(test2.space(),test2.var(0) == 1);
+    test2.makeStructure();
+    QSolver s2(&test2);
+    nodes=0;
+    Strategy ret2=s2.solve(nodes);
+    cout<<"Problem 2 : result = "<<(ret2.isFalse()?"FALSE":"TRUE")<<", sould be TRUE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+    
+    
+    //Ax in 1..3 [x=1] -> x=2
+    int sc3[] = {1};
+    bool q3[] = {QECODE_UNIVERSAL};
+    Implicative test3(1,q3,sc3);
+    test3.QIntVar(0,1,3);
+    post(test3.space(),test3.var(0) == 1);
+
+    IntVarArgs b3(1);
+    b3[0] = test3.var(0);
+    branch(test3.space(),b3,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+
+    test3.nextScope();
+    post(test3.space(),test3.var(0) == 2);
+    test3.makeStructure();;
+    QSolver s3(&test3);
+    nodes=0;
+    steps=0;
+    Strategy ret3=s3.solve(nodes);
+    cout<<"Problem 3 : result = "<<(ret3.isFalse()?"FALSE":"TRUE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+    
+    // Ex in 1..3 [x=1] st x=2
+    int sc4[] = {1};
+    bool q4[] = {QECODE_EXISTENTIAL};
+    Implicative test4(1,q4,sc4);
+    test4.QIntVar(0,1,3);
+    post(test4.space(),test4.var(0) == 1);
+
+    IntVarArgs b4(1);
+    b4[0] = test4.var(0);
+    branch(test4.space(),b4,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+
+    test4.nextScope();
+    post(test4.space(),test4.var(0) == 2);
+    test4.makeStructure();
+    QSolver s4(&test4);
+    nodes=0;
+    Strategy ret4=s4.solve(nodes);
+    cout<<"Problem 4 : result = "<<(ret4.isFalse()?"FALSE":"TRUE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+    
+    // Ax in 1..3 [x=1] -> Ey in 1..3 [x=2] -> y=1
+    int sc5[] = {1,1};
+    bool q5[] = {QECODE_UNIVERSAL,QECODE_EXISTENTIAL};
+    Implicative test5(2,q5,sc5);
+    test5.QIntVar(0,1,3);
+    test5.QIntVar(1,1,3);
+    post(test5.space(),test5.var(0) == 1);
+
+    IntVarArgs b5(1);
+    b5[0] = test5.var(0);
+    branch(test5.space(),b5,INT_VAR_SIZE_MIN,INT_VAL_MIN);        
+
+    test5.nextScope();
+    post(test5.space(),test5.var(0) == 2);
+
+    IntVarArgs b52(2);
+    b52[0] = test5.var(0);
+    b52[1] = test5.var(1);
+    branch(test5.space(),b52,INT_VAR_SIZE_MIN,INT_VAL_MIN);        
+
+    test5.nextScope();
+    post(test5.space(),test5.var(1) == 1);
+    test5.makeStructure();
+    QSolver s5(&test5);
+    nodes=0;
+    steps=0;
+    Strategy ret5=s5.solve(nodes);
+    cout<<"Problem 5 : result = "<<(ret5.isFalse()?"FALSE":"TRUE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+
+    // Ax in 1..3 [x=1] -> Ey in 1..3 [x=1] -> x=2    
+    int sc6[] = {1,1};
+    bool q6[] = {QECODE_UNIVERSAL,QECODE_EXISTENTIAL};
+    Implicative test6(2,q6,sc6);
+    test6.QIntVar(0,1,3);
+    test6.QIntVar(1,1,3);
+    post(test6.space(),test6.var(0) == 1);
+
+    IntVarArgs b6(1);
+    b6[0] = test6.var(0);
+    branch(test6.space(),b6,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+
+    test6.nextScope();
+    post(test6.space(),test6.var(0) == 1);
+
+    IntVarArgs b62(2);
+    b62[0] = test6.var(0);
+    b62[1] = test6.var(1);
+    branch(test6.space(),b62,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+
+    test6.nextScope();
+    post(test6.space(),test6.var(0) == 2);
+    test6.makeStructure();
+    QSolver s6(&test6);
+    nodes=0;
+    steps=0;
+    Strategy ret6=s6.solve(nodes);
+    cout<<"Problem 6 : result = "<<(ret6.isFalse()?"FALSE":"TRUE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+    
+    //Ex in 1..3 [] Ay in 0..3 [y<2] -> y=0
+    int sc7[] = {1,1};
+    bool q7[] = {QECODE_EXISTENTIAL,QECODE_UNIVERSAL};
+    Implicative test7(2,q7,sc7);
+    test7.QIntVar(0,1,3);
+    test7.QIntVar(1,0,3);
+    
+    IntVarArgs b7(1);
+    b7[0] = test7.var(0);
+    branch(test7.space(),b7,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    test7.nextScope();
+    post(test7.space(),test7.var(1) <= 2);
+    
+    IntVarArgs b72(2);
+    b72[0] = test7.var(0);
+    b72[1] = test7.var(1);
+    branch(test7.space(),b72,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    test7.nextScope();
+    post(test7.space(),test7.var(1) == 0);
+    test7.makeStructure();
+    QSolver s7(&test7);
+    nodes=0;
+    steps=0;
+    Strategy ret7=s7.solve(nodes);
+    cout<<"Problem 7 : result = "<<(ret7.isFalse()?"FALSE":"TRUE")<<", sould be FALSE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+    
+    //Ex in 1..3 [] Ay in 0..3 [y=0] -> y=0    
+    int sc8[] = {1,1};
+    bool q8[] = {QECODE_EXISTENTIAL,QECODE_UNIVERSAL};
+    Implicative test8(2,q8,sc8);
+    test8.QIntVar(0,1,3);
+    test8.QIntVar(1,0,3);
+    
+    IntVarArgs b8(1);
+    b8[0] = test8.var(0);
+    branch(test8.space(),b8,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    test8.nextScope();
+    post(test8.space(),test8.var(1) == 0);
+    
+    IntVarArgs b82(2);
+    b82[0] = test8.var(0);
+    b82[1] = test8.var(1);
+    branch(test8.space(),b82,INT_VAR_SIZE_MIN,INT_VAL_MIN);
+    
+    test8.nextScope();
+    post(test8.space(),test8.var(1) == 0);
+    test8.makeStructure();
+    QSolver s8(&test8);
+    nodes=0;
+    steps=0;
+    Strategy ret8=s8.solve(nodes);
+    cout<<"Problem 8 : result = "<<(ret8.isFalse()?"FALSE":"TRUE")<<", sould be TRUE."<<endl;
+    cout<<nodes<<" nodes."<<endl;
+    
+}
+    
+