Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 583ffa4ba069126c3ba0bc565dc0485a > files > 1420

cvc3-doc-2.4.1-1.fc15.noarch.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>CVC3: minisat_derivation.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">CVC3&#160;<span id="projectnumber">2.4.1</span></div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<div class="title">minisat_derivation.h</div>  </div>
</div>
<div class="contents">
<a href="minisat__derivation_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*****************************************************************************/</span><span class="comment"></span>
<a name="l00002"></a>00002 <span class="comment">/*!</span>
<a name="l00003"></a>00003 <span class="comment"> *\file minisat_derivation.h</span>
<a name="l00004"></a>00004 <span class="comment"> *\brief MiniSat proof logging</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Author: Alexander Fuchs</span>
<a name="l00007"></a>00007 <span class="comment"> *</span>
<a name="l00008"></a>00008 <span class="comment"> * Created: Sun Dec 07 11:09:00 2007</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * &lt;hr&gt;</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * License to use, copy, modify, sell and/or distribute this software</span>
<a name="l00013"></a>00013 <span class="comment"> * and its documentation for any purpose is hereby granted without</span>
<a name="l00014"></a>00014 <span class="comment"> * royalty, subject to the terms and conditions defined in the \ref</span>
<a name="l00015"></a>00015 <span class="comment"> * LICENSE file provided with this distribution.</span>
<a name="l00016"></a>00016 <span class="comment"> * </span>
<a name="l00017"></a>00017 <span class="comment"> * &lt;hr&gt;</span>
<a name="l00018"></a>00018 <span class="comment"> */</span>
<a name="l00019"></a>00019 <span class="comment">/*****************************************************************************/</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef _cvc3__sat__minisat_derivation_h_</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define _cvc3__sat__minisat_derivation_h_</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 
<a name="l00025"></a>00025 <span class="preprocessor">#include &quot;<a class="code" href="minisat__types_8h.html" title="MiniSat internal types.">minisat_types.h</a>&quot;</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include &lt;<a class="code" href="hash__map_8h.html" title="hash map implementation">hash_map.h</a>&gt;</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include &lt;<a class="code" href="hash__set_8h.html" title="hash map implementation">hash_set.h</a>&gt;</span>
<a name="l00028"></a>00028 <span class="preprocessor">#include &lt;set&gt;</span>
<a name="l00029"></a>00029 <span class="preprocessor">#include &lt;vector&gt;</span>
<a name="l00030"></a>00030 <span class="preprocessor">#include &lt;deque&gt;</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include &lt;algorithm&gt;</span>
<a name="l00032"></a>00032 <span class="preprocessor">#include &lt;string&gt;</span>
<a name="l00033"></a>00033 
<a name="l00034"></a>00034 <span class="keyword">namespace </span>SAT {
<a name="l00035"></a>00035   <span class="keyword">class </span>SatProof;
<a name="l00036"></a>00036 }
<a name="l00037"></a>00037 
<a name="l00038"></a>00038 <span class="keyword">namespace </span>MiniSat {
<a name="l00039"></a>00039   <span class="comment">// a resolution inference as a sequence of binary resolution steps</span>
<a name="l00040"></a><a class="code" href="classMiniSat_1_1Inference.html">00040</a>   <span class="keyword">class </span><a class="code" href="classMiniSat_1_1Inference.html">Inference</a> {
<a name="l00041"></a>00041   <span class="keyword">public</span>:
<a name="l00042"></a><a class="code" href="classMiniSat_1_1Inference.html#a0eef845f209a9bc406fe887c34f82553">00042</a>     <span class="keyword">typedef</span> std::vector&lt;std::pair&lt;Lit, int&gt; &gt; <a class="code" href="classMiniSat_1_1Inference.html#a0eef845f209a9bc406fe887c34f82553">TSteps</a>;
<a name="l00043"></a>00043 
<a name="l00044"></a>00044   <span class="keyword">private</span>:
<a name="l00045"></a>00045     <span class="comment">// id of first clause</span>
<a name="l00046"></a><a class="code" href="classMiniSat_1_1Inference.html#accb661eccfd99a099e87826cd4de1401">00046</a>     <span class="keywordtype">int</span> <a class="code" href="classMiniSat_1_1Inference.html#accb661eccfd99a099e87826cd4de1401">d_start</a>;
<a name="l00047"></a>00047 
<a name="l00048"></a>00048     <span class="comment">// binary resolution step:</span>
<a name="l00049"></a>00049     <span class="comment">// result of previous step (or d_start)</span>
<a name="l00050"></a>00050     <span class="comment">// on literal with next clause (given by id)</span>
<a name="l00051"></a><a class="code" href="classMiniSat_1_1Inference.html#abc3a42c6b8b055f9b5b021590a3f1a00">00051</a>     <a class="code" href="classMiniSat_1_1Inference.html#a0eef845f209a9bc406fe887c34f82553">TSteps</a> <a class="code" href="classMiniSat_1_1Inference.html#abc3a42c6b8b055f9b5b021590a3f1a00">d_steps</a>;
<a name="l00052"></a>00052 
<a name="l00053"></a>00053   <span class="keyword">public</span>:
<a name="l00054"></a><a class="code" href="classMiniSat_1_1Inference.html#aacd20460934eca56417f7add43e9150c">00054</a>     <a class="code" href="classMiniSat_1_1Inference.html#aacd20460934eca56417f7add43e9150c">Inference</a>(<span class="keywordtype">int</span> clauseID) : <a class="code" href="classMiniSat_1_1Inference.html#accb661eccfd99a099e87826cd4de1401">d_start</a>(clauseID) {
<a name="l00055"></a>00055       <span class="comment">//      std::cout &lt;&lt; &quot;Start inference: &quot; &lt;&lt; clauseID &lt;&lt; std::endl;</span>
<a name="l00056"></a>00056     };
<a name="l00057"></a>00057 
<a name="l00058"></a><a class="code" href="classMiniSat_1_1Inference.html#a61184032373fe3049198f8e3a71e436f">00058</a>     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Inference.html#a61184032373fe3049198f8e3a71e436f">add</a>(<a class="code" href="classMiniSat_1_1Lit.html">Lit</a> lit, <span class="keywordtype">int</span> clauseID) {
<a name="l00059"></a>00059       <a class="code" href="classMiniSat_1_1Inference.html#abc3a42c6b8b055f9b5b021590a3f1a00">d_steps</a>.push_back(std::make_pair(lit, clauseID));
<a name="l00060"></a>00060     };
<a name="l00061"></a>00061 
<a name="l00062"></a><a class="code" href="classMiniSat_1_1Inference.html#aa1ae6b861dd2a7dc80348d96e204bd8b">00062</a>     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Inference.html#aa1ae6b861dd2a7dc80348d96e204bd8b">add</a>(<a class="code" href="classMiniSat_1_1Lit.html">Lit</a> lit, <a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause) {
<a name="l00063"></a>00063       <a class="code" href="classMiniSat_1_1Inference.html#a61184032373fe3049198f8e3a71e436f">add</a>(lit, clause-&gt;<a class="code" href="classMiniSat_1_1Clause.html#aeb8881da1f982f5bc58bac190ab2f2a4">id</a>());
<a name="l00064"></a>00064     };
<a name="l00065"></a>00065 
<a name="l00066"></a><a class="code" href="classMiniSat_1_1Inference.html#a932d4071d9f794757ad9db27cb3fd1a3">00066</a>     <span class="keywordtype">int</span> <a class="code" href="classMiniSat_1_1Inference.html#a932d4071d9f794757ad9db27cb3fd1a3">getStart</a>()<span class="keyword"> const </span>{
<a name="l00067"></a>00067       <span class="keywordflow">return</span> <a class="code" href="classMiniSat_1_1Inference.html#accb661eccfd99a099e87826cd4de1401">d_start</a>;
<a name="l00068"></a>00068     }
<a name="l00069"></a>00069 
<a name="l00070"></a><a class="code" href="classMiniSat_1_1Inference.html#a4111b13d1401b38cbe749357793883fa">00070</a>     <span class="keyword">const</span> <a class="code" href="classMiniSat_1_1Inference.html#a0eef845f209a9bc406fe887c34f82553">TSteps</a>&amp; <a class="code" href="classMiniSat_1_1Inference.html#a4111b13d1401b38cbe749357793883fa">getSteps</a>()<span class="keyword"> const </span>{
<a name="l00071"></a>00071       <span class="keywordflow">return</span> <a class="code" href="classMiniSat_1_1Inference.html#abc3a42c6b8b055f9b5b021590a3f1a00">d_steps</a>;
<a name="l00072"></a>00072     }
<a name="l00073"></a>00073 
<a name="l00074"></a>00074     <span class="comment">// returns steps as a lits: clauseId0 literal0.toString clauseID1 ...</span>
<a name="l00075"></a>00075     std::string <a class="code" href="classMiniSat_1_1Inference.html#aacd9c375bc7b8b0d87a15bcd9b5d35ce">toString</a>() <span class="keyword">const</span>;
<a name="l00076"></a>00076   };
<a name="l00077"></a>00077 
<a name="l00078"></a>00078 
<a name="l00079"></a>00079   <span class="keyword">class </span>Solver;
<a name="l00080"></a>00080 
<a name="l00081"></a>00081   <span class="comment">// Heavily based on the proof logging version of MiniSat (1.14p)</span>
<a name="l00082"></a>00082   <span class="comment">//</span>
<a name="l00083"></a>00083   <span class="comment">// Note: this implementation keeps the whole derivation in memory -</span>
<a name="l00084"></a>00084   <span class="comment">// for many problems this is not feasible.</span>
<a name="l00085"></a>00085   <span class="comment">// should provide an alternative implementation that logs the derivation</span>
<a name="l00086"></a>00086   <span class="comment">// to a file and constructs the proof from it.</span>
<a name="l00087"></a><a class="code" href="classMiniSat_1_1Derivation.html">00087</a>   <span class="keyword">class </span><a class="code" href="classMiniSat_1_1Derivation.html">Derivation</a> {
<a name="l00088"></a>00088   <span class="keyword">public</span>:
<a name="l00089"></a><a class="code" href="classMiniSat_1_1Derivation.html#ae65f535354bdc282a534bbc545020939">00089</a>     <span class="keyword">typedef</span> <a class="code" href="classHash_1_1hash__map.html">Hash::hash_map&lt;int, Clause*&gt;</a> <a class="code" href="classMiniSat_1_1Derivation.html#ae65f535354bdc282a534bbc545020939">TClauses</a>;
<a name="l00090"></a><a class="code" href="classMiniSat_1_1Derivation.html#aeb7fb6543cb0d529aaa2bfc841e0aa47">00090</a>     <span class="keyword">typedef</span> <a class="code" href="classHash_1_1hash__set.html">Hash::hash_set&lt;int&gt;</a> <a class="code" href="classMiniSat_1_1Derivation.html#aeb7fb6543cb0d529aaa2bfc841e0aa47">TInputClauses</a>;
<a name="l00091"></a><a class="code" href="classMiniSat_1_1Derivation.html#a4f8e0c51560466d4a511c048dc6f046d">00091</a>     <span class="keyword">typedef</span> <a class="code" href="classHash_1_1hash__map.html">Hash::hash_map&lt;int, Inference*&gt;</a> <a class="code" href="classMiniSat_1_1Derivation.html#a4f8e0c51560466d4a511c048dc6f046d">TInferences</a>;
<a name="l00092"></a>00092 
<a name="l00093"></a>00093   <span class="keyword">private</span>:
<a name="l00094"></a>00094     <span class="comment">// mapping from id to clause</span>
<a name="l00095"></a><a class="code" href="classMiniSat_1_1Derivation.html#a2c42531abc26a1e8de7f81025e083214">00095</a>     <a class="code" href="classHash_1_1hash__map.html">TClauses</a> <a class="code" href="classMiniSat_1_1Derivation.html#a2c42531abc26a1e8de7f81025e083214">d_clauses</a>;
<a name="l00096"></a>00096 
<a name="l00097"></a>00097     <span class="comment">// as an additional check, explicitely mark which clauses are input clauses</span>
<a name="l00098"></a>00098     <span class="comment">// by adding their id to this set.</span>
<a name="l00099"></a>00099     <span class="comment">//</span>
<a name="l00100"></a>00100     <span class="comment">// as an invariant an id should be either in d_inferences or d_inputClauses,</span>
<a name="l00101"></a>00101     <span class="comment">// as a clause does exactly have no inference attached if it is an input clause.</span>
<a name="l00102"></a><a class="code" href="classMiniSat_1_1Derivation.html#abb29d2dd68d48989190d3356da2d0ae4">00102</a>     <a class="code" href="classHash_1_1hash__set.html">TInputClauses</a> <a class="code" href="classMiniSat_1_1Derivation.html#abb29d2dd68d48989190d3356da2d0ae4">d_inputClauses</a>;
<a name="l00103"></a>00103 
<a name="l00104"></a>00104     <span class="comment">// unit clauses derived with computeRootReason</span>
<a name="l00105"></a>00105     <span class="comment">// mapping from index of literal to clause</span>
<a name="l00106"></a><a class="code" href="classMiniSat_1_1Derivation.html#ae1fc34cb0a0c68bd82d2d1c80892f466">00106</a>     <a class="code" href="classHash_1_1hash__map.html">TClauses</a> <a class="code" href="classMiniSat_1_1Derivation.html#ae1fc34cb0a0c68bd82d2d1c80892f466">d_unitClauses</a>;
<a name="l00107"></a>00107 
<a name="l00108"></a>00108     <span class="comment">// mapping from clause id to the inference it was derived by</span>
<a name="l00109"></a><a class="code" href="classMiniSat_1_1Derivation.html#a5dc6e9795fc769f2c2665b3667dbdc7d">00109</a>     <a class="code" href="classHash_1_1hash__map.html">TInferences</a> <a class="code" href="classMiniSat_1_1Derivation.html#a5dc6e9795fc769f2c2665b3667dbdc7d">d_inferences</a>;
<a name="l00110"></a>00110 
<a name="l00111"></a>00111     <span class="comment">// clauses removed from the solver</span>
<a name="l00112"></a><a class="code" href="classMiniSat_1_1Derivation.html#a643c4cd61616c700b5e97c82aa55e062">00112</a>     std::deque&lt;Clause*&gt; <a class="code" href="classMiniSat_1_1Derivation.html#a643c4cd61616c700b5e97c82aa55e062">d_removedClauses</a>;
<a name="l00113"></a>00113 
<a name="l00114"></a>00114     <span class="comment">// empty clause of derivation, if derived</span>
<a name="l00115"></a><a class="code" href="classMiniSat_1_1Derivation.html#a7f00bbd5b002f55eea71e62b06209021">00115</a>     <a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* <a class="code" href="classMiniSat_1_1Derivation.html#a7f00bbd5b002f55eea71e62b06209021">d_emptyClause</a>;
<a name="l00116"></a>00116 
<a name="l00117"></a>00117   <span class="keyword">public</span>:
<a name="l00118"></a><a class="code" href="classMiniSat_1_1Derivation.html#af89db5799084d51dcb97bd24847d9633">00118</a>     <a class="code" href="classMiniSat_1_1Derivation.html#af89db5799084d51dcb97bd24847d9633">Derivation</a>() : <a class="code" href="classMiniSat_1_1Derivation.html#a7f00bbd5b002f55eea71e62b06209021">d_emptyClause</a>(NULL) {};
<a name="l00119"></a>00119     <a class="code" href="classMiniSat_1_1Derivation.html#a72d5632fb889b903e8f88891943e5562">~Derivation</a>();
<a name="l00120"></a>00120 
<a name="l00121"></a>00121     <span class="comment">// note: allow for duplicate insertion of clauses registerClause and registerInputClause,</span>
<a name="l00122"></a>00122     <span class="comment">// as this can happen in the current implementation</span>
<a name="l00123"></a>00123     <span class="comment">// for theory clauses which are inconsistent on insertion.</span>
<a name="l00124"></a>00124 
<a name="l00125"></a>00125     <span class="comment">// register a new clause</span>
<a name="l00126"></a><a class="code" href="classMiniSat_1_1Derivation.html#a86b49978f3ea0aa72cd4815e241ff7ad">00126</a>     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#a86b49978f3ea0aa72cd4815e241ff7ad">registerClause</a>(<a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause) {
<a name="l00127"></a>00127       <span class="comment">//      std::cout &lt;&lt; &quot;register clause  : &quot; &lt;&lt; clause-&gt;id() &lt;&lt; &quot; : &quot; &lt;&lt; clause-&gt;toString() &lt;&lt; std::endl;</span>
<a name="l00128"></a>00128 
<a name="l00129"></a>00129       <span class="comment">//IF_DEBUG (</span>
<a name="l00130"></a>00130         <span class="keywordflow">if</span> (<a class="code" href="classMiniSat_1_1Derivation.html#a2c42531abc26a1e8de7f81025e083214">d_clauses</a>.<a class="code" href="classHash_1_1hash__map.html#a48feee7c5690c9cd9ba1b0817ca3ae9f" title="status">contains</a>(clause-&gt;<a class="code" href="classMiniSat_1_1Clause.html#aeb8881da1f982f5bc58bac190ab2f2a4">id</a>())) {
<a name="l00131"></a>00131     <span class="comment">// if clause with id does already exist,</span>
<a name="l00132"></a>00132     <span class="comment">// then it must be a simplification of the original clause</span>
<a name="l00133"></a>00133     <a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* old = <a class="code" href="classMiniSat_1_1Derivation.html#a2c42531abc26a1e8de7f81025e083214">d_clauses</a>[clause-&gt;<a class="code" href="classMiniSat_1_1Clause.html#aeb8881da1f982f5bc58bac190ab2f2a4">id</a>()];
<a name="l00134"></a>00134     <a class="code" href="debug_8h.html#a2637b2fffa22e3c9fad40cda8fcc3bce" title="If something goes horribly wrong, print a message and abort immediately with exit(1).">FatalAssert</a>(old-&gt;<a class="code" href="classMiniSat_1_1Clause.html#adf5aa50a639b4b5bb71e5ea76d45b8e2">size</a>() == clause-&gt;<a class="code" href="classMiniSat_1_1Clause.html#adf5aa50a639b4b5bb71e5ea76d45b8e2">size</a>(),
<a name="l00135"></a>00135           <span class="stringliteral">&quot;MiniSat::Derivation::registerClause: new clause of different size than old clause of same id&quot;</span>);
<a name="l00136"></a>00136 
<a name="l00137"></a>00137     std::set&lt;Lit&gt; oldS;
<a name="l00138"></a>00138     <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; old-&gt;<a class="code" href="classMiniSat_1_1Clause.html#adf5aa50a639b4b5bb71e5ea76d45b8e2">size</a>(); ++i) {
<a name="l00139"></a>00139       oldS.insert((*old)[i]);
<a name="l00140"></a>00140     }
<a name="l00141"></a>00141 
<a name="l00142"></a>00142     <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; clause-&gt;<a class="code" href="classMiniSat_1_1Clause.html#adf5aa50a639b4b5bb71e5ea76d45b8e2">size</a>(); ++i) {
<a name="l00143"></a>00143       <a class="code" href="debug_8h.html#a2637b2fffa22e3c9fad40cda8fcc3bce" title="If something goes horribly wrong, print a message and abort immediately with exit(1).">FatalAssert</a>(oldS.find((*clause)[i]) != oldS.end(),
<a name="l00144"></a>00144       <span class="stringliteral">&quot;MiniSat::Derivation::registerClause: new clause not subset of old clause of same id&quot;</span>);
<a name="l00145"></a>00145       oldS.erase((*clause)[i]);
<a name="l00146"></a>00146     }
<a name="l00147"></a>00147     <a class="code" href="debug_8h.html#a2637b2fffa22e3c9fad40cda8fcc3bce" title="If something goes horribly wrong, print a message and abort immediately with exit(1).">FatalAssert</a>(oldS.empty(),
<a name="l00148"></a>00148           <span class="stringliteral">&quot;MiniSat::Derivation::registerClause: old clause not subset of new clause of same id&quot;</span>);
<a name="l00149"></a>00149   }
<a name="l00150"></a>00150   <span class="comment">//)</span>
<a name="l00151"></a>00151       <a class="code" href="classMiniSat_1_1Derivation.html#a2c42531abc26a1e8de7f81025e083214">d_clauses</a>[clause-&gt;<a class="code" href="classMiniSat_1_1Clause.html#aeb8881da1f982f5bc58bac190ab2f2a4">id</a>()] = clause;
<a name="l00152"></a>00152     };
<a name="l00153"></a>00153 
<a name="l00154"></a>00154     <span class="comment">// mark clause as input clause, i.e. true without premises</span>
<a name="l00155"></a><a class="code" href="classMiniSat_1_1Derivation.html#a8f1063fe441a90d388e56ca4002a87e1">00155</a>     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#a8f1063fe441a90d388e56ca4002a87e1">registerInputClause</a>(<span class="keywordtype">int</span> clauseID) {
<a name="l00156"></a>00156       <span class="comment">//      std::cout &lt;&lt; &quot;registerInputClause: &quot; &lt;&lt; clauseID &lt;&lt; std::endl;</span>
<a name="l00157"></a>00157       <a class="code" href="classMiniSat_1_1Derivation.html#abb29d2dd68d48989190d3356da2d0ae4">d_inputClauses</a>.<a class="code" href="classHash_1_1hash__set.html#a156c40ba629d5aba7f7cacf4eeab1e2d">insert</a>(clauseID);
<a name="l00158"></a>00158     };
<a name="l00159"></a>00159 
<a name="l00160"></a>00160     <span class="comment">// clause has been removed from the solver or created internally in Derivation,</span>
<a name="l00161"></a>00161     <span class="comment">// so store it here for later garbage collection.</span>
<a name="l00162"></a><a class="code" href="classMiniSat_1_1Derivation.html#a98bcad6982734612b1afd68e38dea7b8">00162</a>     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#a98bcad6982734612b1afd68e38dea7b8">removedClause</a>(<a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause) {
<a name="l00163"></a>00163       <a class="code" href="debug_8h.html#a2637b2fffa22e3c9fad40cda8fcc3bce" title="If something goes horribly wrong, print a message and abort immediately with exit(1).">FatalAssert</a>(clause != NULL, <span class="stringliteral">&quot;MiniSat::derivation:removedClause: NULL&quot;</span>);
<a name="l00164"></a>00164       <a class="code" href="classMiniSat_1_1Derivation.html#a643c4cd61616c700b5e97c82aa55e062">d_removedClauses</a>.push_back(clause);
<a name="l00165"></a>00165     };
<a name="l00166"></a>00166 
<a name="l00167"></a>00167     <span class="comment">// register the inference of a clause; takes ownership of inference</span>
<a name="l00168"></a><a class="code" href="classMiniSat_1_1Derivation.html#a7c0cfa1103212b370236814a4923dec5">00168</a>     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#a7c0cfa1103212b370236814a4923dec5">registerInference</a>(<span class="keywordtype">int</span> clauseID, <a class="code" href="classMiniSat_1_1Inference.html">Inference</a>* inference) {
<a name="l00169"></a>00169       <a class="code" href="debug_8h.html#a2637b2fffa22e3c9fad40cda8fcc3bce" title="If something goes horribly wrong, print a message and abort immediately with exit(1).">FatalAssert</a>(!<a class="code" href="classMiniSat_1_1Derivation.html#a5dc6e9795fc769f2c2665b3667dbdc7d">d_inferences</a>.<a class="code" href="classHash_1_1hash__map.html#a48feee7c5690c9cd9ba1b0817ca3ae9f" title="status">contains</a>(clauseID),
<a name="l00170"></a>00170       <span class="stringliteral">&quot;MiniSat::Derivation::registerInference: inference for clauseID already registered&quot;</span>);
<a name="l00171"></a>00171       <span class="comment">//      std::cout &lt;&lt; &quot;Register inference: &quot; &lt;&lt; clauseID &lt;&lt; &quot; : &quot; &lt;&lt; inference-&gt;toString() &lt;&lt; std::endl;</span>
<a name="l00172"></a>00172       <a class="code" href="classMiniSat_1_1Derivation.html#a5dc6e9795fc769f2c2665b3667dbdc7d">d_inferences</a>[clauseID] = inference;
<a name="l00173"></a>00173     };
<a name="l00174"></a>00174 
<a name="l00175"></a>00175     <span class="comment">// implied is a literal that is implied at the root level.</span>
<a name="l00176"></a>00176     <span class="comment">// return the id of the implying unit clause [literal], if it exists.</span>
<a name="l00177"></a>00177     <span class="comment">//</span>
<a name="l00178"></a>00178     <span class="comment">// otherwise derive it from its reasons and return the new clause id.</span>
<a name="l00179"></a>00179     <span class="comment">// derived unit clauses are stored internally, independently of the Solver</span>
<a name="l00180"></a>00180     <span class="comment">//</span>
<a name="l00181"></a>00181     <span class="comment">// may resolve theory implications with Solver::resolveTheoryImplication</span>
<a name="l00182"></a>00182     <span class="keywordtype">int</span> <a class="code" href="classMiniSat_1_1Derivation.html#ac5cf738303de9c9c2b15d7d9e0b44cce">computeRootReason</a>(<a class="code" href="classMiniSat_1_1Lit.html">Lit</a> implied, <a class="code" href="classMiniSat_1_1Solver.html">Solver</a>* solver);
<a name="l00183"></a>00183 
<a name="l00184"></a>00184 
<a name="l00185"></a>00185     <span class="comment">// register the empty clause (or a clause falsified in the root level)</span>
<a name="l00186"></a>00186     <span class="comment">// showing that the clause set is unsatisfiable.</span>
<a name="l00187"></a>00187     <span class="comment">//</span>
<a name="l00188"></a>00188     <span class="comment">// if clause is not the empty clause, the empty clause is derived from it,</span>
<a name="l00189"></a>00189     <span class="comment">// possible using computeRootReason</span>
<a name="l00190"></a>00190     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#ad17e91fe3a421ef68df9463710c5fdc9">finish</a>(<a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause, <a class="code" href="classMiniSat_1_1Solver.html">Solver</a>* solver);
<a name="l00191"></a>00191 
<a name="l00192"></a>00192 
<a name="l00193"></a>00193     <span class="comment">// print the derivation of the given clause</span>
<a name="l00194"></a>00194     <span class="comment">//</span>
<a name="l00195"></a>00195     <span class="comment">// output is of the form:</span>
<a name="l00196"></a>00196     <span class="comment">// ID D : L1 ... Ln : C1 K1 C2 K2 ... Cm</span>
<a name="l00197"></a>00197     <span class="comment">// where:</span>
<a name="l00198"></a>00198     <span class="comment">// ID - the id of a clause</span>
<a name="l00199"></a>00199     <span class="comment">// D - &#39;I&#39; for an input clause, &#39;D&#39; for a clause derived from other clauses</span>
<a name="l00200"></a>00200     <span class="comment">// Li - the clause literals</span>
<a name="l00201"></a>00201     <span class="comment">// Ci Ki - the clause is derived from these clauses by binary resolution on the given literals</span>
<a name="l00202"></a>00202     <span class="comment">//</span>
<a name="l00203"></a>00203     <span class="comment">// factoring is done after each resolution step, i.e. duplicate literals are removed from the clause.</span>
<a name="l00204"></a>00204     <span class="comment">//</span>
<a name="l00205"></a>00205     <span class="comment">// example:</span>
<a name="l00206"></a>00206     <span class="comment">// 3 D : +12 -2 -33 : 1 +10 2</span>
<a name="l00207"></a>00207     <span class="comment">// says that the clause with the id 3 consists of the literals +12, -2, -33,</span>
<a name="l00208"></a>00208     <span class="comment">// and was derived by resolution between the clauses with ids 1 and 2,</span>
<a name="l00209"></a>00209     <span class="comment">// where the literal +10 is in clause 1 and -10 is in clause 2.</span>
<a name="l00210"></a>00210     <span class="comment">//</span>
<a name="l00211"></a>00211     <span class="comment">// for example, 1 may be the clause +12 +10 -2, and 2 may be -10 -2 -33,</span>
<a name="l00212"></a>00212     <span class="comment">// which resolved on +10 yield the clause +12 -2 -2 -33,</span>
<a name="l00213"></a>00213     <span class="comment">// which after factoring simplified to +12 -2 -33.</span>
<a name="l00214"></a>00214     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#aec406575f21e97084cffa7c05b566833">printDerivation</a>(<a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause);
<a name="l00215"></a>00215 
<a name="l00216"></a>00216     <span class="comment">// print the derivation of the empty clause.</span>
<a name="l00217"></a>00217     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#aec406575f21e97084cffa7c05b566833">printDerivation</a>();
<a name="l00218"></a>00218 
<a name="l00219"></a>00219     <span class="comment">// for debugging only</span>
<a name="l00220"></a>00220     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#ac419e5de02d38bdc729487c82fa93de2">checkDerivation</a>(<a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause);
<a name="l00221"></a>00221 
<a name="l00222"></a>00222     <span class="comment">// creates a new proof; ownership transferred to caller</span>
<a name="l00223"></a>00223     <a class="code" href="classSAT_1_1SatProof.html">SAT::SatProof</a>* <a class="code" href="classMiniSat_1_1Derivation.html#a5436a42caaab1bf37d9355c5bd43d251">createProof</a>();
<a name="l00224"></a>00224     <a class="code" href="classSAT_1_1SatProof.html">SAT::SatProof</a>* <a class="code" href="classMiniSat_1_1Derivation.html#a5436a42caaab1bf37d9355c5bd43d251">createProof</a>(<a class="code" href="classMiniSat_1_1Clause.html">Clause</a>* clause);
<a name="l00225"></a>00225 
<a name="l00226"></a>00226     <span class="comment">// see Solver::push - clauseID is the highest currently used clause id</span>
<a name="l00227"></a>00227     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#a9b35e97fb7ff5de171eeb68bfe4dda6b">push</a>(<span class="keywordtype">int</span> clauseID);
<a name="l00228"></a>00228 
<a name="l00229"></a>00229     <span class="comment">// see Solver::pop - clauseID corresponds to a clause id used in a push</span>
<a name="l00230"></a>00230     <span class="keywordtype">void</span> <a class="code" href="classMiniSat_1_1Derivation.html#af3782033a2412734e9a018877f71ce5d">pop</a>(<span class="keywordtype">int</span> clauseID);
<a name="l00231"></a>00231   };
<a name="l00232"></a>00232 }
<a name="l00233"></a>00233 
<a name="l00234"></a>00234 
<a name="l00235"></a>00235 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed Sep 7 2011 for CVC3 by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>