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 import org.sat4j.specs.IConstr;
31 import org.sat4j.specs.Lbool;
32 import org.sat4j.specs.SearchListener;
33
34 final class VoidTracing implements SearchListener {
35 private static final long serialVersionUID = 1L;
36
37 public void assuming(int p) {
38 }
39
40 public void propagating(int p, IConstr reason) {
41 }
42
43 public void backtracking(int p) {
44 }
45
46 public void adding(int p) {
47 }
48
49 public void learn(IConstr clause) {
50 }
51
52 public void delete(int[] clause) {
53 }
54
55 public void conflictFound(IConstr confl, int dlevel, int trailLevel) {
56 }
57
58 public void conflictFound(int p) {
59 }
60
61 public void solutionFound() {
62 }
63
64 public void beginLoop() {
65 }
66
67 public void start() {
68 }
69
70 public void end(Lbool result) {
71 }
72
73 public void restarting() {
74 }
75
76 public void backjump(int backjumpLevel) {
77 }
78 }