View Javadoc

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 pseudo boolean algorithms described in:
20   * A fast pseudo-Boolean constraint solver Chai, D.; Kuehlmann, A.
21   * Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
22   * Volume 24, Issue 3, March 2005 Page(s): 305 - 317
23   * 
24   * and 
25   * Heidi E. Dixon, 2004. Automating Pseudo-Boolean Inference within a DPLL 
26   * Framework. Ph.D. Dissertation, University of Oregon.
27   *******************************************************************************/
28  package org.sat4j.pb.core;
29  
30  import java.io.PrintWriter;
31  
32  import org.sat4j.minisat.core.SolverStats;
33  
34  public class PBSolverStats extends SolverStats {
35  
36  	/**
37  	 * 
38  	 */
39  	private static final long serialVersionUID = 1L;
40  
41  	public long numberOfReductions;
42  
43  	public long numberOfLearnedConstraintsReduced;
44  
45  	public long numberOfResolution;
46  
47  	public long numberOfCP;
48  
49  	@Override
50  	public void reset() {
51  		super.reset();
52  		numberOfReductions = 0;
53  		numberOfLearnedConstraintsReduced = 0;
54  		numberOfResolution = 0;
55  		numberOfCP = 0;
56  	}
57  
58  	@Override
59  	public void printStat(PrintWriter out, String prefix) {
60  		super.printStat(out, prefix);
61  		out.println(prefix
62  				+ "number of reductions to clauses (during analyze)\t: "
63  				+ numberOfReductions);
64  		out.println(prefix
65  				+ "number of learned constraints concerned by reduction\t: "
66  				+ numberOfLearnedConstraintsReduced);
67  		out.println(prefix + "number of learning phase by resolution\t: "
68  				+ numberOfResolution);
69  		out.println(prefix + "number of learning phase by cutting planes\t: "
70  				+ numberOfCP);
71  	}
72  
73  }