484 lines
78 KiB
HTML
484 lines
78 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: drat_checker.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('drat__checker_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">drat_checker.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="drat__checker_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_DRAT_CHECKER_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_SAT_DRAT_CHECKER_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "absl/strings/string_view.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="strong__integers_8h.html">ortools/util/strong_integers.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment">// Index of a clause (>= 0).</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0e75372160364c7130866052ddade46b"> 34</a></span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0e75372160364c7130866052ddade46b">DEFINE_STRONG_INDEX_TYPE</a>(ClauseIndex);</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#affcb42181de5b23ba7b5df37fe1676a3"> 35</a></span><span class="keyword">const</span> ClauseIndex <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#affcb42181de5b23ba7b5df37fe1676a3">kNoClauseIndex</a>(-1);</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// DRAT is a SAT proof format that allows a simple program to check that a</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">// problem is really UNSAT. The description of the format and a checker are</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">// available at http://www.cs.utexas.edu/~marijn/drat-trim/. This class checks</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// that a DRAT proof is valid.</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// Note that DRAT proofs are often huge (can be GB), and can take about as much</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment">// time to check as it takes to find the proof in the first place!</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html"> 44</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_drat_checker.html">DratChecker</a> {</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a3f58879e6c01aae405b9dea727109645">DratChecker</a>();</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html#a631da432fd85a90a90475f85b43db9f8"> 47</a></span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a631da432fd85a90a90475f85b43db9f8">~DratChecker</a>() {}</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// Returns the number of Boolean variables used in the problem and infered</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// clauses.</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html#a663e6fd290b30b948686c43cea697140"> 51</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a663e6fd290b30b948686c43cea697140">num_variables</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_variables_; }</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// Adds a clause of the problem that must be checked. The problem clauses must</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// be added first, before any infered clause. The given clause must not</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// contain a literal and its negation. Must not be called after Check().</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a54bb4f51333a0efceaf20de7b506e4ab">AddProblemClause</a>(absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// Adds a clause which is infered from the problem clauses and the previously</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// infered clauses (that are have not been deleted). Infered clauses must be</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// added after the problem clauses. Clauses with the Reverse Asymetric</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// Tautology (RAT) property for literal l must start with this literal. The</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// given clause must not contain a literal and its negation. Must not be</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// called after Check().</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a10d374b75761a0418a217cdcf2e89ae4">AddInferedClause</a>(absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// Deletes a problem or infered clause. The order of the literals does not</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// matter. In particular, it can be different from the order that was used</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// when the clause was added. Must not be called after Check().</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>(absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// Checks that the infered clauses form a DRAT proof that the problem clauses</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// are UNSAT. For this the last added infered clause must be the empty clause</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// and each infered clause must have either the Reverse Unit Propagation (RUP)</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// or the Reverse Asymetric Tautology (RAT) property with respect to the</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// problem clauses and the previously infered clauses which are not deleted.</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Returns VALID if the proof is valid, INVALID if it is not, and UNKNOWN if</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// the check timed out.</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// WARNING: no new clause must be added or deleted after this method has been</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// called.</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70b"> 80</a></span> <span class="keyword">enum</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> {</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba6ce26a62afab55d7606ad4e92428b30c"> 81</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba6ce26a62afab55d7606ad4e92428b30c">UNKNOWN</a>,</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70bacf0713491d9b887eaccfd80c18abca47"> 82</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70bacf0713491d9b887eaccfd80c18abca47">VALID</a>,</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70baef2863a469df3ea6871d640e3669a2f2"> 83</a></span> <a class="code hl_enumvalue" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70baef2863a469df3ea6871d640e3669a2f2">INVALID</a>,</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> };</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a29037e50da43e6bda147d22c452fb91d">Check</a>(<span class="keywordtype">double</span> max_time_in_seconds);</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// Returns a subproblem of the original problem that is already UNSAT. The</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// result is undefined if Check() was not previously called, or did not return</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// true.</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> std::vector<std::vector<Literal>> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a3ad1c6b4aef6d5028b7748c2c9330912">GetUnsatSubProblem</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// Returns a DRAT proof that GetUnsatSubProblem() is UNSAT. The result is</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// undefined if Check() was not previously called, or did not return true.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::vector<std::vector<Literal>> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a8e3d09e79f9855a586254f5d74b11720">GetOptimizedProof</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// A problem or infered clause. The literals are specified as a subrange of</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// 'literals_' (namely the subrange from 'first_literal_index' to</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// 'first_literal_index' + 'num_literals' - 1), and are sorted in increasing</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// order *before Check() is called*.</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keyword">struct </span>Clause {</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// The index of the first literal of this clause in 'literals_'.</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordtype">int</span> first_literal_index;</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// The number of literals of this clause.</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordtype">int</span> num_literals;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> </div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// The clause literal to use to check the RAT property, or kNoLiteralIndex</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// for problem clauses and empty infered clauses.</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> LiteralIndex rat_literal_index = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> </div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// The *current* number of copies of this clause. This number is incremented</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// each time a copy of the clause is added, and decremented each time a copy</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// is deleted. When this number reaches 0, the clause is actually marked as</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// deleted (see 'deleted_index'). If other copies are added after this</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// number reached 0, a new clause is added (because a Clause lifetime is a</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// single interval of ClauseIndex values; therefore, in order to represent a</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// lifetime made of several intervals, several Clause are used).</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordtype">int</span> num_copies = 1;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// The index in 'clauses_' from which this clause is deleted (inclusive).</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// For instance, with AddProblemClause(c0), AddProblemClause(c1),</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// DeleteClause(c0), AddProblemClause(c2), ... if c0's index is 0, then its</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// deleted_index is 2. Meaning that when checking a clause whose index is</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// larger than or equal to 2 (e.g. c2), c0 can be ignored.</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> ClauseIndex deleted_index = ClauseIndex(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int>::max</a>());</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// The indices of the clauses (with at least two literals) which are deleted</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// just after this clause.</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> std::vector<ClauseIndex> deleted_clauses;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// Whether this clause is actually needed to check the DRAT proof.</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordtype">bool</span> is_needed_for_proof = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// Whether this clause is actually needed to check the current step (i.e. an</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// infered clause) of the DRAT proof. This bool is always false, except in</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// MarkAsNeededForProof() that uses it temporarily.</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordtype">bool</span> tmp_is_needed_for_proof_step = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> </div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> Clause(<span class="keywordtype">int</span> first_literal_index, <span class="keywordtype">int</span> num_literals);</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> </div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Returns true if this clause is deleted before the given clause.</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">bool</span> IsDeleted(ClauseIndex clause_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> };</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// A literal to assign to true during boolean constraint propagation. When a</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// literal is assigned, new literals can be found that also need to be</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// assigned to true (via unit clauses). In this case they are pushed on a</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// stack of LiteralToAssign values, to be processed later on (the use of this</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// stack avoids recursive calls to the boolean constraint propagation method</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// AssignAndPropagate()).</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keyword">struct </span>LiteralToAssign {</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// The literal that must be assigned to true.</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> Literal <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// The index of the clause from which this assignment was deduced. This is</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// kNoClauseIndex for the clause we are currently checking (whose literals</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// are all falsified to check if a conflict can be derived). Otherwise this</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// is the index of a unit clause with unit literal 'literal' that was found</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// during boolean constraint propagation.</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> ClauseIndex source_clause_index;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> };</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// Hash function for clauses.</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">struct </span>ClauseHash {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a3f58879e6c01aae405b9dea727109645">DratChecker</a>* checker;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keyword">explicit</span> ClauseHash(<a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a3f58879e6c01aae405b9dea727109645">DratChecker</a>* checker) : checker(checker) {}</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> std::size_t operator()(<span class="keyword">const</span> ClauseIndex clause_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> };</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> </div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// Equality function for clauses.</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keyword">struct </span>ClauseEquiv {</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a3f58879e6c01aae405b9dea727109645">DratChecker</a>* checker;</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">explicit</span> ClauseEquiv(<a class="code hl_function" href="classoperations__research_1_1sat_1_1_drat_checker.html#a3f58879e6c01aae405b9dea727109645">DratChecker</a>* checker) : checker(checker) {}</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> ClauseIndex clause_index1,</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">const</span> ClauseIndex clause_index2) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> };</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// Adds a clause and returns its index.</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> ClauseIndex AddClause(absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// Removes the last clause added to 'clauses_'.</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordtype">void</span> RemoveLastClause();</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// Returns the literals of the given clause in increasing order.</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> absl::Span<const Literal> Literals(<span class="keyword">const</span> Clause& clause) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> </div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// Initializes the data structures used to check the DRAT proof.</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordtype">void</span> Init();</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> </div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// Adds 2 watch literals for the given clause.</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordtype">void</span> WatchClause(ClauseIndex clause_index);</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> </div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// Returns true if, by assigning all the literals of 'clause' to false, a</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// conflict can be found with boolean constraint propagation, using the non</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// deleted clauses whose index is strictly less than 'num_clauses'. If so,</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// marks the clauses actually used in this process as needed to check to DRAT</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// proof.</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordtype">bool</span> HasRupProperty(ClauseIndex num_clauses,</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// Assigns 'literal' to true in 'assignment_' (and pushes it to 'assigned_'),</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// records its source clause 'source_clause_index' in 'assignment_source_',</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// and uses the watched literals to find all the clauses (whose index is less</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// than 'num_clauses') that become unit due to this assignment. For each unit</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// clause found, pushes its unit literal on top of</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="comment">// 'high_priority_literals_to_assign_' or 'low_priority_literals_to_assign_'.</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// Returns kNoClauseIndex if no falsified clause is found, or the index of the</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// first found falsified clause otherwise.</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> ClauseIndex AssignAndPropagate(ClauseIndex num_clauses, Literal <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>,</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> ClauseIndex source_clause_index);</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// Marks the given clause as needed to check the DRAT proof, as well as the</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// other clauses which were used to check this clause (these are found from</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// 'unit_stack_', containing the clauses that became unit in</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// AssignAndPropagate, and from 'assignment_source_', containing for each</span></div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// variable the clause that caused its assignment).</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordtype">void</span> MarkAsNeededForProof(Clause* clause);</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="comment">// Returns the clauses whose index is in [begin,end) which are needed for the</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// proof. The result is undefined if Check() was not previously called, or did</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// not return true.</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> std::vector<std::vector<Literal>> GetClausesNeededForProof(</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> ClauseIndex begin, ClauseIndex <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> </div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordtype">void</span> LogStatistics(int64_t duration_nanos) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// The index of the first infered clause in 'clauses_', or kNoClauseIndex if</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// there is no infered clause.</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> ClauseIndex first_infered_clause_index_;</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// The problem clauses, followed by the infered clauses.</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ClauseIndex, Clause></a> clauses_;</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// A content addressable set of the non-deleted clauses in clauses_. After</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// adding a clause to clauses_, this set can be used to find if the same</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// clause was previously added (i.e if a find using the new clause index</span></div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// returns a previous index) and not yet deleted.</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> absl::flat_hash_set<ClauseIndex, ClauseHash, ClauseEquiv> clause_set_;</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> </div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// All the literals used in 'clauses_'.</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> std::vector<Literal> literals_;</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> </div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// The number of Boolean variables used in the clauses.</span></div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordtype">int</span> num_variables_;</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="comment">// ---------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// Data initialized in Init() and used in Check() to check the DRAT proof.</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> </div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// The literals that have been assigned so far (this is used to unassign them</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// after a clause has been checked, before checking the next one).</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> std::vector<Literal> assigned_;</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> </div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// The current assignment values of literals_.</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> VariablesAssignment assignment_;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> </div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// For each variable, the index of the unit clause that caused its assignment,</span></div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// or kNoClauseIndex if the variable is not assigned, or was assigned to</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// falsify the clause that is currently being checked.</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, ClauseIndex></a> assignment_source_;</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> </div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// The stack of literals that remain to be assigned to true during boolean</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// constraint propagation, with high priority (unit clauses which are already</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// marked as needed for the proof are given higher priority than the others</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// during boolean constraint propagation. According to 'Trimming while</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="comment">// Checking Clausal Proofs', this heuristics reduces the final number of</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// clauses that are marked as needed for the proof, and therefore the</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// verification time, in a majority of cases -- but not all).</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> std::vector<LiteralToAssign> high_priority_literals_to_assign_;</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> </div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// The stack of literals that remain to be assigned to true during boolean</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="comment">// constraint propagation, with low priority (see above).</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> std::vector<LiteralToAssign> low_priority_literals_to_assign_;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// For each literal, the list of clauses in which this literal is watched.</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="comment">// Invariant 1: the literals with indices first_watched_literal_index and</span></div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">// second_watched_literal_index of each clause with at least two literals are</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// watched.</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// Invariant 2: watched literals are non-falsified if the clause is not</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// satisfied (in more details: if a clause c is contained in</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// 'watched_literals_[l]' for literal l, then either c is satisfied with</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// 'assignment_', or l is unassigned or assigned to true).</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, std::vector<ClauseIndex></a>> watched_literals_;</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// The list of clauses with only one literal. This is needed for boolean</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// constraint propagation, in addition to watched literals, because watched</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// literals can only be used with clauses having at least two literals.</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> std::vector<ClauseIndex> single_literal_clauses_;</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> </div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// The stack of clauses that have become unit during boolean constraint</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// propagation, in HasRupProperty().</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> std::vector<ClauseIndex> unit_stack_;</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// A temporary assignment, always fully unassigned except in Resolve().</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> VariablesAssignment tmp_assignment_;</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> </div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// ---------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// Statistics</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> </div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// The number of infered clauses having the RAT property (but not the RUP</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// property).</span></div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordtype">int</span> num_rat_checks_;</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span>};</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span><span class="comment">// Returns true if the given clause contains the given literal. This works in</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span><span class="comment">// O(clause.size()).</span></div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#add4d19635eabde70c0aa36e1a6847df7">ContainsLiteral</a>(absl::Span<const Literal> clause, Literal <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> </div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span><span class="comment">// Returns true if 'complementary_literal' is the unique complementary literal</span></div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span><span class="comment">// in the two given clauses. If so the resolvent of these clauses (i.e. their</span></div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span><span class="comment">// union with 'complementary_literal' and its negation removed) is set in</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span><span class="comment">// 'resolvent'. 'clause' must contain 'complementary_literal', while</span></div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span><span class="comment">// 'other_clause' must contain its negation. 'assignment' must have at least as</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span><span class="comment">// many variables as each clause, and they must all be unassigned. They are</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span><span class="comment">// still unassigned upon return.</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a5a48aae9891af96b29504592d319cba6">Resolve</a>(absl::Span<const Literal> clause,</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> absl::Span<const Literal> other_clause,</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> Literal complementary_literal, VariablesAssignment* assignment,</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> std::vector<Literal>* resolvent);</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> </div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span><span class="comment">// Adds to the given drat checker the problem clauses from the file at the given</span></div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span><span class="comment">// path, which must be in DIMACS format. Returns true iff the file was</span></div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span><span class="comment">// successfully parsed.</span></div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#afbf73f9bc417ac7511fdd2bc4ab27c22">AddProblemClauses</a>(<span class="keyword">const</span> std::string& file_path, DratChecker* drat_checker);</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> </div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span><span class="comment">// Adds to the given drat checker the infered and deleted clauses from the file</span></div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span><span class="comment">// at the given path, which must be in DRAT format. Returns true iff the file</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span><span class="comment">// was successfully parsed.</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a9736440eb95af5345f44a8bb823b7854">AddInferedAndDeletedClauses</a>(<span class="keyword">const</span> std::string& file_path,</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> DratChecker* drat_checker);</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> </div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span><span class="comment">// The file formats that can be used to save a list of clauses.</span></div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996"> 330</a></span><span class="keyword">enum</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996">SatFormat</a> {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996a7eeb40a554eda8374e34c3734740313d"> 331</a></span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996a7eeb40a554eda8374e34c3734740313d">DIMACS</a>,</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996a7c7c3b8fd8346053eee7168a07f77ec6"> 332</a></span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996a7c7c3b8fd8346053eee7168a07f77ec6">DRAT</a>,</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span>};</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> </div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span><span class="comment">// Prints the given clauses in the file at the given path, using the given file</span></div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span><span class="comment">// format. Returns true iff the file was successfully written.</span></div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a3acd0dba6c4cef0486ae0d2b9d8920a0">PrintClauses</a>(<span class="keyword">const</span> std::string& file_path, <a class="code hl_enumeration" href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996">SatFormat</a> format,</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="keyword">const</span> std::vector<std::vector<Literal>>& <a class="code hl_variable" href="cp__model__solver_8cc.html#a21696c8707868a3d522d1bee261f4185">clauses</a>,</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keywordtype">int</span> num_variables);</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> </div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> </div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_DRAT_CHECKER_H_</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector< ClauseIndex, Clause ></a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html">operations_research::sat::DratChecker</a></div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00044">drat_checker.h:44</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a10d374b75761a0418a217cdcf2e89ae4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a10d374b75761a0418a217cdcf2e89ae4">operations_research::sat::DratChecker::AddInferedClause</a></div><div class="ttdeci">void AddInferedClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00083">drat_checker.cc:83</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a18349231154d0f5eaee94fe213f347e6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a18349231154d0f5eaee94fe213f347e6">operations_research::sat::DratChecker::DeleteClause</a></div><div class="ttdeci">void DeleteClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00125">drat_checker.cc:125</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a29037e50da43e6bda147d22c452fb91d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a29037e50da43e6bda147d22c452fb91d">operations_research::sat::DratChecker::Check</a></div><div class="ttdeci">Status Check(double max_time_in_seconds)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00153">drat_checker.cc:153</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a3ad1c6b4aef6d5028b7748c2c9330912"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a3ad1c6b4aef6d5028b7748c2c9330912">operations_research::sat::DratChecker::GetUnsatSubProblem</a></div><div class="ttdeci">std::vector< std::vector< Literal > > GetUnsatSubProblem() const</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00222">drat_checker.cc:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a3f58879e6c01aae405b9dea727109645"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a3f58879e6c01aae405b9dea727109645">operations_research::sat::DratChecker::DratChecker</a></div><div class="ttdeci">DratChecker()</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00061">drat_checker.cc:61</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a54bb4f51333a0efceaf20de7b506e4ab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a54bb4f51333a0efceaf20de7b506e4ab">operations_research::sat::DratChecker::AddProblemClause</a></div><div class="ttdeci">void AddProblemClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00070">drat_checker.cc:70</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a631da432fd85a90a90475f85b43db9f8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a631da432fd85a90a90475f85b43db9f8">operations_research::sat::DratChecker::~DratChecker</a></div><div class="ttdeci">~DratChecker()</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00047">drat_checker.h:47</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a663e6fd290b30b948686c43cea697140"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a663e6fd290b30b948686c43cea697140">operations_research::sat::DratChecker::num_variables</a></div><div class="ttdeci">int num_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00051">drat_checker.h:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::sat::DratChecker::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00080">drat_checker.h:80</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba6ce26a62afab55d7606ad4e92428b30c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba6ce26a62afab55d7606ad4e92428b30c">operations_research::sat::DratChecker::UNKNOWN</a></div><div class="ttdeci">@ UNKNOWN</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00081">drat_checker.h:81</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a67a0db04d321a74b7e7fcfd3f1a3f70bacf0713491d9b887eaccfd80c18abca47"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70bacf0713491d9b887eaccfd80c18abca47">operations_research::sat::DratChecker::VALID</a></div><div class="ttdeci">@ VALID</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00082">drat_checker.h:82</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a67a0db04d321a74b7e7fcfd3f1a3f70baef2863a469df3ea6871d640e3669a2f2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a67a0db04d321a74b7e7fcfd3f1a3f70baef2863a469df3ea6871d640e3669a2f2">operations_research::sat::DratChecker::INVALID</a></div><div class="ttdeci">@ INVALID</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00083">drat_checker.h:83</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_checker_html_a8e3d09e79f9855a586254f5d74b11720"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_checker.html#a8e3d09e79f9855a586254f5d74b11720">operations_research::sat::DratChecker::GetOptimizedProof</a></div><div class="ttdeci">std::vector< std::vector< Literal > > GetOptimizedProof() const</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00226">drat_checker.cc:226</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_a21696c8707868a3d522d1bee261f4185"><div class="ttname"><a href="cp__model__solver_8cc.html#a21696c8707868a3d522d1bee261f4185">clauses</a></div><div class="ttdeci">SharedClausesManager * clauses</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02056">cp_model_solver.cc:2056</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0e75372160364c7130866052ddade46b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0e75372160364c7130866052ddade46b">operations_research::sat::DEFINE_STRONG_INDEX_TYPE</a></div><div class="ttdeci">DEFINE_STRONG_INDEX_TYPE(ClauseIndex)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2dbcb7017d468a17bdb30252af5c6c31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">operations_research::sat::kNoLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kNoLiteralIndex(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3acd0dba6c4cef0486ae0d2b9d8920a0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3acd0dba6c4cef0486ae0d2b9d8920a0">operations_research::sat::PrintClauses</a></div><div class="ttdeci">bool PrintClauses(const std::string &file_path, SatFormat format, const std::vector< std::vector< Literal > > &clauses, int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00606">drat_checker.cc:606</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3e51e1435c6412fc4f2a273b3fbee996"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996">operations_research::sat::SatFormat</a></div><div class="ttdeci">SatFormat</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00330">drat_checker.h:330</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3e51e1435c6412fc4f2a273b3fbee996a7c7c3b8fd8346053eee7168a07f77ec6"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996a7c7c3b8fd8346053eee7168a07f77ec6">operations_research::sat::DRAT</a></div><div class="ttdeci">@ DRAT</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00332">drat_checker.h:332</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3e51e1435c6412fc4f2a273b3fbee996a7eeb40a554eda8374e34c3734740313d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e51e1435c6412fc4f2a273b3fbee996a7eeb40a554eda8374e34c3734740313d">operations_research::sat::DIMACS</a></div><div class="ttdeci">@ DIMACS</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8h_source.html#l00331">drat_checker.h:331</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5a48aae9891af96b29504592d319cba6"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5a48aae9891af96b29504592d319cba6">operations_research::sat::Resolve</a></div><div class="ttdeci">bool Resolve(absl::Span< const Literal > clause, absl::Span< const Literal > other_clause, Literal complementary_literal, VariablesAssignment *assignment, std::vector< Literal > *resolvent)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00478">drat_checker.cc:478</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a9736440eb95af5345f44a8bb823b7854"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9736440eb95af5345f44a8bb823b7854">operations_research::sat::AddInferedAndDeletedClauses</a></div><div class="ttdeci">bool AddInferedAndDeletedClauses(const std::string &file_path, DratChecker *drat_checker)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00564">drat_checker.cc:564</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_add4d19635eabde70c0aa36e1a6847df7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#add4d19635eabde70c0aa36e1a6847df7">operations_research::sat::ContainsLiteral</a></div><div class="ttdeci">bool ContainsLiteral(absl::Span< const Literal > clause, Literal literal)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00474">drat_checker.cc:474</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_afbf73f9bc417ac7511fdd2bc4ab27c22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#afbf73f9bc417ac7511fdd2bc4ab27c22">operations_research::sat::AddProblemClauses</a></div><div class="ttdeci">bool AddProblemClauses(const std::string &file_path, DratChecker *drat_checker)</div><div class="ttdef"><b>Definition:</b> <a href="drat__checker_8cc_source.html#l00515">drat_checker.cc:515</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_affcb42181de5b23ba7b5df37fe1676a3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#affcb42181de5b23ba7b5df37fe1676a3">operations_research::sat::kNoClauseIndex</a></div><div class="ttdeci">const ClauseIndex kNoClauseIndex(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00089">optimization.cc:89</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a4d53eac2ef2732c28fa9fb663e0c19a7"><div class="ttname"><a href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a></div><div class="ttdeci">std::optional< int64_t > end</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00036">sparse_submatrix.cc:36</a></div></div>
|
|
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="drat__checker_8h.html">drat_checker.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|