View Javadoc

1   /*******************************************************************************
2    * SAT4J: a SATisfiability library for Java Copyright (C) 2004, 2012 Artois University and CNRS
3    *
4    * All rights reserved. This program and the accompanying materials
5    * are made available under the terms of the Eclipse Public License v1.0
6    * which accompanies this distribution, and is available at
7    *  http://www.eclipse.org/legal/epl-v10.html
8    *
9    * Alternatively, the contents of this file may be used under the terms of
10   * either the GNU Lesser General Public License Version 2.1 or later (the
11   * "LGPL"), in which case the provisions of the LGPL are applicable instead
12   * of those above. If you wish to allow use of your version of this file only
13   * under the terms of the LGPL, and not to allow others to use your version of
14   * this file under the terms of the EPL, indicate your decision by deleting
15   * the provisions above and replace them with the notice and other provisions
16   * required by the LGPL. If you do not delete the provisions above, a recipient
17   * may use your version of this file under the terms of the EPL or the LGPL.
18   *
19   * Based on the original MiniSat specification from:
20   *
21   * An extensible SAT solver. Niklas Een and Niklas Sorensson. Proceedings of the
22   * Sixth International Conference on Theory and Applications of Satisfiability
23   * Testing, LNCS 2919, pp 502-518, 2003.
24   *
25   * See www.minisat.se for the original solver in C++.
26   *
27   * Contributors:
28   *   CRIL - initial API and implementation
29   *******************************************************************************/
30  package org.sat4j.maxsat;
31  
32  import org.junit.Test;
33  import org.sat4j.core.VecInt;
34  import org.sat4j.pb.PseudoOptDecorator;
35  import org.sat4j.specs.ContradictionException;
36  import org.sat4j.specs.TimeoutException;
37  import org.sat4j.tools.ModelIterator;
38  import org.sat4j.tools.OptToSatAdapter;
39  
40  public class BugFatih2 {
41  
42      @Test
43      public void testBugReport() throws ContradictionException, TimeoutException {
44          // ModelIterator solver = new ModelIterator(new OptToSatAdapter(
45          // new MaxSatDecorator(SolverFactory.newDefault())));
46          WeightedMaxSatDecorator maxSatSolver = new WeightedMaxSatDecorator(
47                  org.sat4j.maxsat.SolverFactory.newDefault());
48          ModelIterator solver = new ModelIterator(new OptToSatAdapter(
49                  new PseudoOptDecorator(maxSatSolver)));
50          System.out.println("Taille de voc : " + solver.nVars());
51          solver.newVar(13);
52          solver.setExpectedNumberOfClauses(24);
53          maxSatSolver.addHardClause(new VecInt(new int[] { -1 }));
54          maxSatSolver.addHardClause(new VecInt(new int[] { -2 }));
55          maxSatSolver.addHardClause(new VecInt(new int[] { -3, 4 }));
56          maxSatSolver.addHardClause(new VecInt(new int[] { -3, 5 }));
57          maxSatSolver.addHardClause(new VecInt(new int[] { -3, 6 }));
58          maxSatSolver.addHardClause(new VecInt(new int[] { -1, 7 }));
59          maxSatSolver.addHardClause(new VecInt(new int[] { -2, 6 }));
60          maxSatSolver.addHardClause(new VecInt(new int[] { -4, 3 }));
61          maxSatSolver.addHardClause(new VecInt(new int[] { -5, 3 }));
62          maxSatSolver.addHardClause(new VecInt(new int[] { -6, 3, 2 }));
63          maxSatSolver.addHardClause(new VecInt(new int[] { -7, 1 }));
64          maxSatSolver.addHardClause(new VecInt(new int[] { 3, -1, 8 }));
65          maxSatSolver.addHardClause(new VecInt(new int[] { -3, 1, 8 }));
66          maxSatSolver.addHardClause(new VecInt(new int[] { -3, -1, 9 }));
67          maxSatSolver.addHardClause(new VecInt(new int[] { -9 }));
68          maxSatSolver.addHardClause(new VecInt(new int[] { 1, -2, 10 }));
69          maxSatSolver.addHardClause(new VecInt(new int[] { -1, 2, 10 }));
70          maxSatSolver.addHardClause(new VecInt(new int[] { -1, -2, 11 }));
71          maxSatSolver.addHardClause(new VecInt(new int[] { -10 }));
72          maxSatSolver.addHardClause(new VecInt(new int[] { -11 }));
73          maxSatSolver.addHardClause(new VecInt(new int[] { 3, -1, 12 }));
74          maxSatSolver.addHardClause(new VecInt(new int[] { -3, 1, 12 }));
75          maxSatSolver.addHardClause(new VecInt(new int[] { -3, -1, 13 }));
76          maxSatSolver.addHardClause(new VecInt(new int[] { -13 }));
77          System.out.println("Taille de voc : " + solver.nVars());
78          while (solver.isSatisfiable()) {
79              System.out.println("Taille du modèle : " + solver.model().length);
80              for (int i = 1; i <= solver.model().length; i++) {
81                  System.out.print(solver.model(i) + " ");
82              }
83              System.out.println();
84          }
85      }
86  }