1 /******************************************************************************* 2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004-2008 Daniel Le Berre 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 *******************************************************************************/ 28 package org.sat4j.minisat.core; 29 30 /** 31 * Debugging Search Listener allowing to follow the search in a textual way. 32 * 33 * @author daniel 34 * 35 */ 36 public class TextOutputListener implements SearchListener { 37 38 private static final long serialVersionUID = 1L; 39 40 public void assuming(int p) { 41 System.out.println("assuming " + p); 42 } 43 44 public void propagating(int p) { 45 System.out.println("implies " + p); 46 } 47 48 public void backtracking(int p) { 49 System.out.println("backtracking " + p); 50 } 51 52 public void adding(int p) { 53 System.out.println("adding " + p); 54 } 55 56 public void learn(Constr clause) { 57 58 } 59 60 public void delete(int[] clause) { 61 62 } 63 64 public void conflictFound() { 65 System.out.println("conflict "); 66 } 67 68 public void solutionFound() { 69 System.out.println("solution found "); 70 } 71 72 public void beginLoop() { 73 } 74 75 public void start() { 76 } 77 78 public void end(Lbool result) { 79 } 80 81 }