2926 lines
570 KiB
HTML
2926 lines
570 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.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: sat_solver.cc 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">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('sat__solver_8cc_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">sat_solver.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sat__solver_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a 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 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 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 name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a 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 name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a 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 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 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 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 name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <cstddef></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <random></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <type_traits></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="port_2proto__utils_8h.html">ortools/port/proto_utils.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="port_2sysinfo_8h.html">ortools/port/sysinfo.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  </div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f"> 37</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f">SatSolver::SatSolver</a>() : <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>(new <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>()) {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  owned_model_.reset(model_);</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  model_-><a class="code" href="classoperations__research_1_1sat_1_1_model.html#a7fac5de5604ea8668bc414536e8aa7ee">Register</a><<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> }</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac656c2164745b2dd47374ec5522ef6a7"> 42</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f">SatSolver::SatSolver</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  : model_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  binary_implication_graph_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">BinaryImplicationGraph</a>>()),</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  clauses_propagator_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html">LiteralWatchers</a>>()),</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  pb_constraints_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html">PbConstraints</a>>()),</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  track_binary_clauses_(false),</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  time_limit_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  parameters_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatParameters>()),</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  restart_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html">RestartPolicy</a>>()),</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  decision_policy_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">SatDecisionPolicy</a>>()),</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  clause_activity_increment_(1.0),</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  same_reason_identifier_(*trail_),</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  is_relevant_for_core_computation_(true),</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  problem_is_pure_sat_(true),</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  drat_proof_handler_(nullptr),</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  stats_(<span class="stringliteral">"SatSolver"</span>) {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a8c6812e05685c0b43d4dd8efaf68aa23"> 62</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a8c6812e05685c0b43d4dd8efaf68aa23">SatSolver::~SatSolver</a>() { <a class="code" href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a>(<a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << stats_.<a class="code" href="classoperations__research_1_1_stats_group.html#af9bc435481ae9e6e60d66a65d5394a7f">StatString</a>()); }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb"> 64</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">SatSolver::SetNumVariables</a>(<span class="keywordtype">int</span> num_variables) {</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(num_variables, num_variables_);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  num_variables_ = num_variables;</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(num_variables);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(num_variables);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(num_variables);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a19614231a107b165113595bf8edf60bf">IncreaseNumVariables</a>(num_variables);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(num_variables);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  same_reason_identifier_.<a class="code" href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(num_variables);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// The +1 is a bit tricky, it is because in</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// EnqueueDecisionAndBacktrackOnConflict() we artificially enqueue the</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// decision before checking if it is not already assigned.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  decisions_.resize(num_variables + 1);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> }</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4fbc93ff66f372e1b604609fe5b45557"> 82</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4fbc93ff66f372e1b604609fe5b45557">SatSolver::num_branches</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> counters_.num_branches; }</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f"> 84</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">SatSolver::num_failures</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> counters_.num_failures; }</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a7b5f3592cdf12c0df22b6583b3e9ed61"> 86</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a7b5f3592cdf12c0df22b6583b3e9ed61">SatSolver::num_propagations</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#aac9a59f50e707a0e0dcff1a2a16f3bf5">NumberOfEnqueues</a>() - counters_.num_branches;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a943e1a6b169c75c35c1f596b11fe4fc4"> 90</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a943e1a6b169c75c35c1f596b11fe4fc4">SatSolver::num_restarts</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> counters_.num_restarts; }</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125"> 92</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">SatSolver::deterministic_time</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Each of these counters mesure really basic operations. The weight are just</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// an estimate of the operation complexity. Note that these counters are never</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// reset to zero once a SatSolver is created.</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// TODO(user): Find a better procedure to fix the weight than just educated</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// guess.</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> 1e-8 * (8.0 * trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#aac9a59f50e707a0e0dcff1a2a16f3bf5">NumberOfEnqueues</a>() +</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  1.0 * binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a226de3db7ac8ac7a33cd682911672830">num_inspections</a>() +</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  4.0 * clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a88608365af082d6228a4e75955e6dc31">num_inspected_clauses</a>() +</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  1.0 * clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aa21bc79521e779410da749e892e004db">num_inspected_clause_literals</a>() +</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  </div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// Here there is a factor 2 because of the untrail.</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  20.0 * pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a991506896584b01b214102ac3ed2ddb5">num_constraint_lookups</a>() +</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  2.0 * pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a31db3a3e839ea89186d44f0f3025f506">num_threshold_updates</a>() +</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  1.0 * pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a9699443a7a311c163aa4ef9990f493a4">num_inspected_constraint_literals</a>());</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> }</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9"> 110</a></span> <span class="keyword">const</span> SatParameters& <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">SatSolver::parameters</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> *parameters_;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172"> 115</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172">SatSolver::SetParameters</a>(<span class="keyword">const</span> SatParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  *parameters_ = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">parameters</a>;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#a372de693ad40b3f42839c8ec6ac845f4">Reset</a>();</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a312550ebabce586fb77c49e813c610f8">ResetLimitFromParameters</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">parameters</a>);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="keywordtype">bool</span> SatSolver::IsMemoryLimitReached()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> memory_usage =</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="namespaceoperations__research_1_1sysinfo.html#a018ed7fb4eeab0488fafba0261dc6917">::operations_research::sysinfo::MemoryUsageProcess</a>();</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> kMegaByte = 1024 * 1024;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">return</span> memory_usage > kMegaByte * parameters_->max_memory_in_mb();</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> }</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  </div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="keywordtype">bool</span> SatSolver::SetModelUnsat() {</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  model_is_unsat_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> }</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a25eb4ef5875f4884226251b66eb61bc0"> 134</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a25eb4ef5875f4884226251b66eb61bc0">SatSolver::AddClauseDuringSearch</a>(absl::Span<const Literal> literals) {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">if</span> (literals.empty()) <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (literals.size() == 1) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">AddUnitClause</a>(literals[0]);</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> (literals.size() == 2) {</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> init = binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6dcddbd6c9e8a05ca2170a13c9ff8cbb">num_implications</a>() == 0;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (!binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497">AddBinaryClauseDuringSearch</a>(literals[0],</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  literals[1])) {</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (init) {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// This is needed because we just added the first binary clause.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (!clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">AddClause</a>(literals)) {</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  </div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// Tricky: Even if nothing new is propagated, calling Propagate() might, via</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// the LP, deduce new things. This is problematic because some code assumes</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// that when we create newly associated literals, nothing else changes.</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>();</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> }</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9"> 164</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">SatSolver::AddUnitClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal) {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(true_literal)) <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(true_literal)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// Note that we will output problem unit clauses twice, but that is a small</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// price to pay for having a single variable fixing API.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>({true_literal});</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">EnqueueWithUnitReason</a>(true_literal);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>()) <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span> }</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  </div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094"> 180</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">SatSolver::AddBinaryClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  tmp_pb_constraint_.clear();</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  tmp_pb_constraint_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, 1));</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  tmp_pb_constraint_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, 1));</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">/*use_lower_bound=*/</span><span class="keyword">true</span>, <span class="comment">/*lower_bound=*/</span>Coefficient(1),</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">/*use_upper_bound=*/</span><span class="keyword">false</span>, <span class="comment">/*upper_bound=*/</span>Coefficient(0),</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  &tmp_pb_constraint_);</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> }</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78"> 191</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">SatSolver::AddTernaryClause</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> c) {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  tmp_pb_constraint_.clear();</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  tmp_pb_constraint_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, 1));</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  tmp_pb_constraint_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, 1));</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  tmp_pb_constraint_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(c, 1));</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">/*use_lower_bound=*/</span><span class="keyword">true</span>, <span class="comment">/*lower_bound=*/</span>Coefficient(1),</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">/*use_upper_bound=*/</span><span class="keyword">false</span>, <span class="comment">/*upper_bound=*/</span>Coefficient(0),</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  &tmp_pb_constraint_);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d"> 203</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d">SatSolver::AddProblemClause</a>(absl::Span<const Literal> literals) {</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  </div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// TODO(user): To avoid duplication, we currently just call</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// AddLinearConstraint(). Make a faster specific version if that becomes a</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// performance issue.</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  tmp_pb_constraint_.clear();</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit : literals) {</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  tmp_pb_constraint_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(lit, 1));</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">/*use_lower_bound=*/</span><span class="keyword">true</span>, <span class="comment">/*lower_bound=*/</span>Coefficient(1),</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">/*use_upper_bound=*/</span><span class="keyword">false</span>, <span class="comment">/*upper_bound=*/</span>Coefficient(0),</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  &tmp_pb_constraint_);</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> }</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="keywordtype">bool</span> SatSolver::AddProblemClauseInternal(absl::Span<const Literal> literals) {</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// Deals with clause of size 0 (always false) and 1 (set a literal) right away</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// so we guarantee that a SatClause is always of size greater than one. This</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// simplifies the code.</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(literals.size(), 0);</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">if</span> (literals.size() == 1) {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(literals[0])) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(literals[0])) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">EnqueueWithUnitReason</a>(literals[0]); <span class="comment">// Not assigned.</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">if</span> (parameters_->treat_binary_clauses_separately() && literals.size() == 2) {</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  AddBinaryClauseInternal(literals[0], literals[1]);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (!clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">AddClause</a>(literals, trail_)) {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> }</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="keywordtype">bool</span> SatSolver::AddLinearConstraintInternal(</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst, Coefficient rhs,</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  Coefficient max_value) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#acf18431db5241d6ae15e5db2470d9079">BooleanLinearExpressionIsCanonical</a>(cst));</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">if</span> (rhs < 0) <span class="keywordflow">return</span> SetModelUnsat(); <span class="comment">// Unsatisfiable constraint.</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (rhs >= max_value) <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// Always satisfied constraint.</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// The case "rhs = 0" will just fix variables, so there is no need to</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">// updates the weighted sign.</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (rhs > 0) decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf5ac4ce7b95b26c0eadcd6b8cbffe74">UpdateWeightedSign</a>(cst, rhs);</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  </div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// Since the constraint is in canonical form, the coefficients are sorted.</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">const</span> Coefficient min_coeff = cst.front().coefficient;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> Coefficient max_coeff = cst.back().coefficient;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  </div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="comment">// A linear upper bounded constraint is a clause if the only problematic</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// assignment is the one where all the literals are true.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (max_value - min_coeff <= rhs) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// This constraint is actually a clause. It is faster to treat it as one.</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  literals_scratchpad_.clear();</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralWithCoeff& term : cst) {</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  literals_scratchpad_.push_back(term.literal.Negated());</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">return</span> AddProblemClauseInternal(literals_scratchpad_);</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  </div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// Detect at most one constraints. Note that this use the fact that the</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// coefficient are sorted.</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">if</span> (parameters_->treat_binary_clauses_separately() &&</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  !parameters_->use_pb_resolution() && max_coeff <= rhs &&</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  2 * min_coeff > rhs) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  literals_scratchpad_.clear();</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralWithCoeff& term : cst) {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  literals_scratchpad_.push_back(term.literal);</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  }</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (!binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aec717d6bc59b3b48bb21276a081c62c1">AddAtMostOne</a>(literals_scratchpad_)) {</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// In case this is the first constraint in the binary_implication_graph_.</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// TODO(user): refactor so this is not needed!</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  </div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  problem_is_pure_sat_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// TODO(user): If this constraint forces all its literal to false (when rhs is</span></div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// zero for instance), we still add it. Optimize this?</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> result = pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a668f93c96cd8a83dd4bf3da35ba8b7b0">AddConstraint</a>(cst, rhs, trail_);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  </div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653"> 299</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">SatSolver::AddLinearConstraint</a>(<span class="keywordtype">bool</span> use_lower_bound,</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  Coefficient lower_bound,</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordtype">bool</span> use_upper_bound,</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  Coefficient upper_bound,</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  std::vector<LiteralWithCoeff>* cst) {</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  </div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// This block removes assigned literals from the constraint.</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  Coefficient fixed_variable_shift(0);</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>& term : *cst) {</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(term.literal)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(term.literal)) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(-term.coefficient, &fixed_variable_shift));</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  (*cst)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = term;</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  cst->resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  </div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// Canonicalize the constraint.</span></div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// TODO(user): fix variables that must be true/false and remove them.</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  Coefficient bound_shift;</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  Coefficient max_value;</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">ComputeBooleanLinearExpressionCanonicalForm</a>(cst, &bound_shift,</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  &max_value));</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(fixed_variable_shift, &bound_shift));</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  </div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (use_upper_bound) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">const</span> Coefficient rhs =</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a01c76d0c46e2975d10e45ab04877f4ac">ComputeCanonicalRhs</a>(upper_bound, bound_shift, max_value);</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">if</span> (!AddLinearConstraintInternal(*cst, rhs, max_value)) {</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (use_lower_bound) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// We transform the constraint into an upper-bounded one.</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cst->size(); ++i) {</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  (*cst)[i].literal = (*cst)[i].literal.Negated();</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">const</span> Coefficient rhs =</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a5c5399274f079c718ec46bf4b3032d27">ComputeNegatedCanonicalRhs</a>(lower_bound, bound_shift, max_value);</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (!AddLinearConstraintInternal(*cst, rhs, max_value)) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// Tricky: The PropagationIsDone() condition shouldn't change anything for a</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">// pure SAT problem, however in the CP-SAT context, calling Propagate() can</span></div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// tigger computation (like the LP) even if no domain changed since the last</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// call. We do not want to do that.</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (!PropagationIsDone() && !<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>()) {</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span> }</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  </div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="keywordtype">int</span> SatSolver::AddLearnedClauseAndEnqueueUnitPropagation(</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">const</span> std::vector<Literal>& literals, <span class="keywordtype">bool</span> is_redundant) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (literals.size() == 1) {</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// A length 1 clause fix a literal for all the search.</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// ComputeBacktrackLevel() should have returned 0.</span></div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">EnqueueWithUnitReason</a>(literals[0]);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">return</span> <span class="comment">/*lbd=*/</span>1;</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  </div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (literals.size() == 2 && parameters_->treat_binary_clauses_separately()) {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span> (track_binary_clauses_) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(binary_clauses_.<a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a4690b2e5ad68f70322cca80950f5bf7d">Add</a>(BinaryClause(literals[0], literals[1])));</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497">AddBinaryClauseDuringSearch</a>(literals[0],</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  literals[1]));</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">// In case this is the first binary clauses.</span></div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> <span class="comment">/*lbd=*/</span>2;</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  CleanClauseDatabaseIfNeeded();</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  </div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// Important: Even though the only literal at the last decision level has</span></div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// been unassigned, its level was not modified, so ComputeLbd() works.</span></div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> lbd = ComputeLbd(literals);</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (is_redundant && lbd > parameters_->clause_cleanup_lbd_bound()) {</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  --num_learned_clause_before_cleanup_;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  SatClause* clause =</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a6af58ea401f90fe1a40be4558dba478a">AddRemovableClause</a>(literals, trail_);</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  </div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// BumpClauseActivity() must be called after clauses_info_[clause] has</span></div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// been created or it will have no effect.</span></div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  (*clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>())[clause].lbd = lbd;</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  BumpClauseActivity(clause);</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">AddClause</a>(literals, trail_));</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span> lbd;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span> }</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  </div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2d1cea64152ca53ac5df160b48059800"> 405</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2d1cea64152ca53ac5df160b48059800">SatSolver::AddPropagator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>* propagator) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  problem_is_pure_sat_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a120ef5f82f667fe8a6a38db137bfd2a7">RegisterPropagator</a>(propagator);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  external_propagators_.push_back(propagator);</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a17c09186d8dd4922296e97185f685c97"> 413</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a17c09186d8dd4922296e97185f685c97">SatSolver::AddLastPropagator</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>* propagator) {</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(last_propagator_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  problem_is_pure_sat_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a120ef5f82f667fe8a6a38db137bfd2a7">RegisterPropagator</a>(propagator);</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  last_propagator_ = propagator;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span> }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  </div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">UpperBoundedLinearConstraint</a>* SatSolver::ReasonPbConstraintOrNull(</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// It is important to deal properly with "SameReasonAs" variables here.</span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a89ab9ae41ab13f8847ac18e8beac37ed">ReferenceVarWithSameReason</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html">AssignmentInfo</a>& info = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a5ed9d5f5c759afe4a008adaabd80c6f8">AssignmentType</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) == pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a5298758773353d79435345e19a7b3a38">PropagatorId</a>()) {</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ab00d5c5d5edf37a9568363ba39e02c11">ReasonPbConstraint</a>(info.<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>);</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> }</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> SatClause* SatSolver::ReasonClauseOrNull(BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>));</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">const</span> AssignmentInfo& info = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a5ed9d5f5c759afe4a008adaabd80c6f8">AssignmentType</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) == clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a5298758773353d79435345e19a7b3a38">PropagatorId</a>()) {</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">return</span> clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaf9f3bc83c843a94dd2240e2a81a5e3b">ReasonClause</a>(info.trail_index);</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  }</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> }</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  </div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a68050818df324a24e6309055e857b955"> 442</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a68050818df324a24e6309055e857b955">SatSolver::SaveDebugAssignment</a>() {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  debug_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#af7fbbd00f0e631ce361b5ce6636b2017">Resize</a>(num_variables_.value());</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">for</span> (BooleanVariable i(0); i < num_variables_; ++i) {</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  debug_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a945bb6c1e83f281fdde5778473a12b37">AssignFromTrueLiteral</a>(</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#ac821b9b8b54da703731ce70864668a89">GetTrueLiteralForAssignedVariable</a>(i));</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  </div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keywordtype">void</span> SatSolver::AddBinaryClauseInternal(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (!track_binary_clauses_ || binary_clauses_.<a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a4690b2e5ad68f70322cca80950f5bf7d">Add</a>(<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html">BinaryClause</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>))) {</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">AddBinaryClause</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>);</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  </div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// In case this is the first binary clauses.</span></div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  InitializePropagators();</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  </div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="keywordtype">bool</span> SatSolver::ClauseIsValidUnderDebugAssignement(</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">const</span> std::vector<Literal>& clause)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">for</span> (Literal l : clause) {</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">if</span> (l.Variable() >= debug_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#ae19413c447377161d432f18d1323a037">NumberOfVariables</a>() ||</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  debug_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(l)) {</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  }</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> }</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  </div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="keywordtype">bool</span> SatSolver::PBConstraintIsValidUnderDebugAssignment(</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst, <span class="keyword">const</span> Coefficient rhs)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  Coefficient sum(0.0);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">for</span> (LiteralWithCoeff term : cst) {</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">if</span> (term.literal.Variable() >= debug_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#ae19413c447377161d432f18d1323a037">NumberOfVariables</a>()) {</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">if</span> (debug_assignment_.<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(term.literal)) {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  sum += term.coefficient;</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  }</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> sum <= rhs;</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span> }</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  </div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  </div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// Returns true iff 'b' is subsumed by 'a' (i.e 'a' is included in 'b').</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// This is slow and only meant to be used in DCHECKs.</span></div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span> <span class="keywordtype">bool</span> ClauseSubsumption(<span class="keyword">const</span> std::vector<Literal>& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, SatClause* <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  std::vector<Literal> superset(<a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>->begin(), <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>->end());</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  std::vector<Literal> subset(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.begin(), <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.end());</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  std::sort(superset.begin(), superset.end());</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  std::sort(subset.begin(), subset.end());</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">return</span> std::includes(superset.begin(), superset.end(), subset.begin(),</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  subset.end());</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> }</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  </div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  </div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c"> 499</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">SatSolver::EnqueueDecisionAndBackjumpOnConflict</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2">kUnsatTrailIndex</a>;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(PropagationIsDone());</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  EnqueueNewDecision(true_literal);</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordflow">while</span> (!PropagateAndStopAfterOneConflictResolution()) {</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2">kUnsatTrailIndex</a>;</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(PropagationIsDone());</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">return</span> last_decision_or_backtrack_trail_index_;</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> }</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  </div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7"> 511</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">SatSolver::RestoreSolverToAssumptionLevel</a>() {</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > assumption_level_) {</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(assumption_level_);</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">ReapplyAssumptionsIfNeeded</a>();</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> }</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  </div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d"> 521</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">SatSolver::FinishPropagation</a>() {</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">while</span> (!PropagateAndStopAfterOneConflictResolution()) {</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span> }</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  </div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029"> 529</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">SatSolver::ResetToLevelZero</a>() {</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  assumption_level_ = 0;</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>();</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span> }</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  </div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9"> 536</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9">SatSolver::ResetWithGivenAssumptions</a>(</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keyword">const</span> std::vector<Literal>& assumptions) {</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  </div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Assuming there is no duplicate in assumptions, but they can be a literal</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// and its negation (weird corner case), there will always be a conflict if we</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// enqueue stricly more assumptions than the number of variables, so there is</span></div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// no point considering the end of the list. Note that there is no overflow</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// since decisions_.size() == num_variables_ + 1;</span></div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  assumption_level_ =</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  std::min<int>(assumptions.size(), num_variables_.value() + 1);</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < assumption_level_; ++i) {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  decisions_[i].literal = assumptions[i];</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">ReapplyAssumptionsIfNeeded</a>();</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> }</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  </div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment">// Note that we do not count these as "branches" for a reporting purpose.</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e"> 554</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">SatSolver::ReapplyAssumptionsIfNeeded</a>() {</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() >= assumption_level_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  </div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordtype">int</span> unused = 0;</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> old_num_branches = counters_.num_branches;</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> status =</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  ReapplyDecisionsUpTo(assumption_level_ - 1, &unused);</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  counters_.num_branches = old_num_branches;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  assumption_level_ = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">return</span> (status == <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>);</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span> }</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  </div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="keywordtype">bool</span> SatSolver::PropagateAndStopAfterOneConflictResolution() {</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  </div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  ++counters_.num_failures;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> conflict_trail_index = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> conflict_decision_level = current_decision_level_;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  </div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// A conflict occurred, compute a nice reason for this failure.</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  same_reason_identifier_.<a class="code" href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_trail_index = ComputeMaxTrailIndex(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a02b397f0cd58ae0d26dfeb6182401ece">FailingClause</a>());</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  ComputeFirstUIPConflict(max_trail_index, &learned_conflict_,</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  &reason_used_to_infer_the_conflict_,</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  &subsumed_clauses_);</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  </div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// An empty conflict means that the problem is UNSAT.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (learned_conflict_.empty()) <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsConflictValid(learned_conflict_));</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(ClauseIsValidUnderDebugAssignement(learned_conflict_));</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  </div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// Update the activity of all the variables in the first UIP clause.</span></div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// Also update the activity of the last level variables expanded (and</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="comment">// thus discarded) during the first UIP computation. Note that both</span></div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">// sets are disjoint.</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">BumpVariableActivities</a>(learned_conflict_);</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">BumpVariableActivities</a>(reason_used_to_infer_the_conflict_);</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">if</span> (parameters_->also_bump_variables_in_conflict_reasons()) {</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  ComputeUnionOfReasons(learned_conflict_, &extra_reason_literals_);</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">BumpVariableActivities</a>(extra_reason_literals_);</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  }</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  </div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// Bump the clause activities.</span></div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// Note that the activity of the learned clause will be bumped too</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// by AddLearnedClauseAndEnqueueUnitPropagation().</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a3d1e83250927b8d13cb65626fdc49b29">FailingSatClause</a>() != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  BumpClauseActivity(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a3d1e83250927b8d13cb65626fdc49b29">FailingSatClause</a>());</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  }</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  BumpReasonActivities(reason_used_to_infer_the_conflict_);</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  </div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="comment">// Decay the activities.</span></div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">UpdateVariableActivityIncrement</a>();</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  UpdateClauseActivityIncrement();</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ad064f7982ad8af720e437b82380b629f">UpdateActivityIncrement</a>();</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  </div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// Hack from Glucose that seems to perform well.</span></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> period = parameters_->glucose_decay_increment_period();</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> max_decay = parameters_->glucose_max_decay();</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">if</span> (counters_.num_failures % period == 0 &&</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  parameters_->variable_activity_decay() < max_decay) {</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  parameters_->set_variable_activity_decay(</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  parameters_->variable_activity_decay() +</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  parameters_->glucose_decay_increment());</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  </div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// PB resolution.</span></div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// There is no point using this if the conflict and all the reasons involved</span></div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// in its resolution were clauses.</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordtype">bool</span> compute_pb_conflict = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">if</span> (parameters_->use_pb_resolution()) {</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  compute_pb_conflict = (pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#aa3bdbedb1d2e7db11727770605cee8cc">ConflictingConstraint</a>() != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">if</span> (!compute_pb_conflict) {</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">for</span> (Literal lit : reason_used_to_infer_the_conflict_) {</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">if</span> (ReasonPbConstraintOrNull(lit.Variable()) != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  compute_pb_conflict = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  }</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  </div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// TODO(user): Note that we use the clause above to update the variable</span></div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// activities and not the pb conflict. Experiment.</span></div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">if</span> (compute_pb_conflict) {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac85244c6eaf57970b2057657ae70ee17">ClearAndResize</a>(num_variables_.value());</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  Coefficient initial_slack(-1);</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">if</span> (pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#aa3bdbedb1d2e7db11727770605cee8cc">ConflictingConstraint</a>() == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">// Generic clause case.</span></div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  Coefficient num_literals(0);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a02b397f0cd58ae0d26dfeb6182401ece">FailingClause</a>()) {</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aaff50cb53673c51920c6bcb567ca8806">AddTerm</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated(), Coefficient(1.0));</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  ++num_literals;</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  }</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac4fb16d0641ccef0502adb8bbe3909af">AddToRhs</a>(num_literals - 1);</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// We have a pseudo-Boolean conflict, so we start from there.</span></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#aa3bdbedb1d2e7db11727770605cee8cc">ConflictingConstraint</a>()-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">AddToConflict</a>(&pb_conflict_);</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a5116e268e9144cf6ee197450e0eda486">ClearConflictingConstraint</a>();</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  initial_slack =</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">ComputeSlackForTrailPrefix</a>(*trail_, max_trail_index + 1);</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  </div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordtype">int</span> pb_backjump_level;</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  ComputePBConflict(max_trail_index, initial_slack, &pb_conflict_,</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  &pb_backjump_level);</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (pb_backjump_level == -1) <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  </div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">// Convert the conflict into the vector<LiteralWithCoeff> form.</span></div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  std::vector<LiteralWithCoeff> cst;</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad49fd13bba7789f08d81d6c71d856082">CopyIntoVector</a>(&cst);</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(PBConstraintIsValidUnderDebugAssignment(cst, pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a4556e82417879ecf2bf14a4ee7bfce9e">Rhs</a>()));</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  </div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="comment">// Check if the learned PB conflict is just a clause:</span></div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">// all its coefficient must be 1, and the rhs must be its size minus 1.</span></div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordtype">bool</span> conflict_is_a_clause = (pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a4556e82417879ecf2bf14a4ee7bfce9e">Rhs</a>() == cst.size() - 1);</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">if</span> (conflict_is_a_clause) {</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">for</span> (LiteralWithCoeff term : cst) {</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (term.coefficient != Coefficient(1)) {</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  conflict_is_a_clause = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  }</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  }</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  </div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (!conflict_is_a_clause) {</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// Use the PB conflict.</span></div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="comment">// Note that we don't need to call InitializePropagators() since when we</span></div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// are here, we are sure we have at least one pb constraint.</span></div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a18ab319435ed80315e0c35ca40a7c2a0">NumberOfConstraints</a>(), 0);</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(pb_backjump_level, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(pb_backjump_level);</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#afea0121eba5886052ba91716acf7f29f">AddLearnedConstraint</a>(cst, pb_conflict_.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a4556e82417879ecf2bf14a4ee7bfce9e">Rhs</a>(),</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  trail_));</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>(), last_decision_or_backtrack_trail_index_);</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  counters_.num_learned_pb_literals += cst.size();</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  }</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  </div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// Continue with the normal clause flow, but use the PB conflict clause</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// if it has a lower backjump level.</span></div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">if</span> (pb_backjump_level < ComputeBacktrackLevel(learned_conflict_)) {</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  subsumed_clauses_.clear(); <span class="comment">// Because the conflict changes.</span></div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  learned_conflict_.clear();</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(num_variables_);</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keywordtype">int</span> max_level = 0;</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordtype">int</span> max_index = 0;</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">for</span> (LiteralWithCoeff term : cst) {</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().LiteralIsTrue(term.literal));</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(term.coefficient, 1);</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(term.literal.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a>;</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">if</span> (level == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordflow">if</span> (level > max_level) {</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  max_level = level;</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  max_index = learned_conflict_.size();</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  }</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  learned_conflict_.push_back(term.literal.Negated());</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  </div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// The minimization functions below expect the conflict to be marked!</span></div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">// TODO(user): This is error prone, find a better way?</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(term.literal.Variable());</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  }</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!learned_conflict_.empty());</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  std::swap(learned_conflict_.front(), learned_conflict_[max_index]);</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsConflictValid(learned_conflict_));</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  }</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  </div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="comment">// Minimizing the conflict with binary clauses first has two advantages.</span></div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// First, there is no need to compute a reason for the variables eliminated</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// this way. Second, more variables may be marked (in is_marked_) and</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">// MinimizeConflict() can take advantage of that. Because of this, the</span></div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// LBD of the learned conflict can change.</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(ClauseIsValidUnderDebugAssignement(learned_conflict_));</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">if</span> (!binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordflow">if</span> (parameters_->binary_minimization_algorithm() ==</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  SatParameters::BINARY_MINIMIZATION_FIRST) {</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a95cb5284ae22d2cbca6cd69a275d8a98">MinimizeConflictFirst</a>(</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  *trail_, &learned_conflict_, &is_marked_);</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (parameters_->binary_minimization_algorithm() ==</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  SatParameters::</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION) {</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6cbb84e00be8d376ad8bf7d0e333a46a">MinimizeConflictFirstWithTransitiveReduction</a>(</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  *trail_, &learned_conflict_, &is_marked_,</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  *model_-><a class="code" href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">GetOrCreate</a><ModelRandomGenerator>());</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsConflictValid(learned_conflict_));</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  </div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="comment">// Minimize the learned conflict.</span></div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  MinimizeConflict(&learned_conflict_, &reason_used_to_infer_the_conflict_);</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  </div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="comment">// Minimize it further with binary clauses?</span></div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordflow">if</span> (!binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// Note that on the contrary to the MinimizeConflict() above that</span></div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// just uses the reason graph, this minimization can change the</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="comment">// clause LBD and even the backtracking level.</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">switch</span> (parameters_->binary_minimization_algorithm()) {</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordflow">case</span> SatParameters::NO_BINARY_MINIMIZATION:</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordflow">case</span> SatParameters::BINARY_MINIMIZATION_FIRST:</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">case</span> SatParameters::BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION:</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">case</span> SatParameters::BINARY_MINIMIZATION_WITH_REACHABILITY:</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a311c7dc55d8a10542d54dfeabca48450">MinimizeConflictWithReachability</a>(</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  &learned_conflict_);</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">case</span> SatParameters::EXPERIMENTAL_BINARY_MINIMIZATION:</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af30fd0373e896f83bb84d2295a310492">MinimizeConflictExperimental</a>(</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  *trail_, &learned_conflict_);</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  }</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsConflictValid(learned_conflict_));</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  }</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  </div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// We notify the decision before backtracking so that we can save the phase.</span></div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="comment">// The current heuristic is to try to take a trail prefix for which there is</span></div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// currently no conflict (hence just before the last decision was taken).</span></div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// TODO(user): It is unclear what the best heuristic is here. Both the current</span></div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="comment">// trail index or the trail before the current decision perform well, but</span></div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="comment">// using the full trail seems slightly better even though it will contain the</span></div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="comment">// current conflicting literal.</span></div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#abe906f3b347e87b5e91e7ab5609b0f36">BeforeConflict</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>());</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  </div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="comment">// Backtrack and add the reason to the set of learned clause.</span></div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  counters_.num_literals_learned += learned_conflict_.size();</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(ComputeBacktrackLevel(learned_conflict_));</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(ClauseIsValidUnderDebugAssignement(learned_conflict_));</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  </div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// Note that we need to output the learned clause before cleaning the clause</span></div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// database. This is because we already backtracked and some of the clauses</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="comment">// that were needed to infer the conflict may not be "reasons" anymore and</span></div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">// may be deleted.</span></div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>(learned_conflict_);</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  }</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  </div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// Detach any subsumed clause. They will actually be deleted on the next</span></div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="comment">// clause cleanup phase.</span></div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordtype">bool</span> is_redundant = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">if</span> (!subsumed_clauses_.empty() &&</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  parameters_->subsumption_during_conflict_analysis()) {</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keywordflow">for</span> (SatClause* clause : subsumed_clauses_) {</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(ClauseSubsumption(learned_conflict_, clause));</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keywordflow">if</span> (!clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45">IsRemovable</a>(clause)) {</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  is_redundant = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">LazyDetach</a>(clause);</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  }</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3">CleanUpWatchers</a>();</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  counters_.num_subsumed_clauses += subsumed_clauses_.size();</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  </div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="comment">// Create and attach the new learned clause.</span></div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> conflict_lbd = AddLearnedClauseAndEnqueueUnitPropagation(</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  learned_conflict_, is_redundant);</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#a6656a848070cf8e91a9af92feee0477c">OnConflict</a>(conflict_trail_index, conflict_decision_level,</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  conflict_lbd);</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> }</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  </div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> SatSolver::ReapplyDecisionsUpTo(</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordtype">int</span> max_level, <span class="keywordtype">int</span>* first_propagation_index) {</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordtype">int</span> decision_index = current_decision_level_;</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="keywordflow">while</span> (decision_index <= max_level) {</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(decision_index, current_decision_level_);</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keyword">const</span> Literal previous_decision = decisions_[decision_index].literal;</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  ++decision_index;</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().LiteralIsTrue(previous_decision)) {</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="comment">// Note that this particular position in decisions_ will be overridden,</span></div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="comment">// but that is fine since this is a consequence of the previous decision,</span></div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// so we will never need to take it into account again.</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().LiteralIsFalse(previous_decision)) {</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// Update decision so that GetLastIncompatibleDecisions() works.</span></div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  decisions_[current_decision_level_].literal = previous_decision;</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">ASSUMPTIONS_UNSAT</a>;</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  }</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  </div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="comment">// Not assigned, we try to take it.</span></div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_level = current_decision_level_;</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">EnqueueDecisionAndBackjumpOnConflict</a>(previous_decision);</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  *first_propagation_index = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(*first_propagation_index, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2">kUnsatTrailIndex</a>) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">if</span> (current_decision_level_ <= old_level) {</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="comment">// A conflict occurred which backjumped to an earlier decision level.</span></div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="comment">// We potentially backjumped over some valid decisions, so we need to</span></div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="comment">// continue the loop and try to re-enqueue them.</span></div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// Note that there is no need to update max_level, because when we will</span></div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">// try to reapply the current "previous_decision" it will result in a</span></div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="comment">// conflict. IMPORTANT: we can't actually optimize this and abort the loop</span></div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="comment">// earlier though, because we need to check that it is conflicting because</span></div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="comment">// it is already propagated to false. There is no guarantee of this</span></div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="comment">// because we learn the first-UIP conflict. If it is not the case, we will</span></div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="comment">// then learn a new conflict, backjump, and continue the loop.</span></div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  decision_index = current_decision_level_;</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  }</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  }</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">FEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span> }</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  </div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859"> 861</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859">SatSolver::EnqueueDecisionAndBacktrackOnConflict</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal) {</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(PropagationIsDone());</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  </div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2">kUnsatTrailIndex</a>;</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), decisions_.size());</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  decisions_[<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>()].literal = true_literal;</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="keywordtype">int</span> first_propagation_index = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  ReapplyDecisionsUpTo(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), &first_propagation_index);</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">return</span> first_propagation_index;</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span> }</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  </div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a093c00c2bd81c8ec7a5f86a4466fa7d5"> 873</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a093c00c2bd81c8ec7a5f86a4466fa7d5">SatSolver::EnqueueDecisionIfNotConflicting</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal) {</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(PropagationIsDone());</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  </div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2">kUnsatTrailIndex</a>;</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_level = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  EnqueueNewDecision(true_literal);</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>()) {</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(current_level);</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span> }</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  </div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8"> 888</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">SatSolver::Backtrack</a>(<span class="keywordtype">int</span> target_level) {</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="comment">// TODO(user): The backtrack method should not be called when the model is</span></div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// unsat. Add a DCHECK to prevent that, but before fix the</span></div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">// bop::BopOptimizerBase architecture.</span></div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  </div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">// Do nothing if the CurrentDecisionLevel() is already correct.</span></div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="comment">// This is needed, otherwise target_trail_index below will remain at zero and</span></div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="comment">// that will cause some problems. Note that we could forbid a user to call</span></div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="comment">// Backtrack() with the current level, but that is annoying when you just</span></div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="comment">// want to reset the solver with Backtrack(0).</span></div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == target_level) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(target_level, 0);</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(target_level, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  </div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// Any backtrack to the root from a positive one is counted as a restart.</span></div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">if</span> (target_level == 0) counters_.num_restarts++;</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  </div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// Per the SatPropagator interface, this is needed before calling Untrail.</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#adeeeb993a93b815c1c343f9c46ec3564">SetDecisionLevel</a>(target_level);</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  </div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordtype">int</span> target_trail_index = 0;</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordflow">while</span> (current_decision_level_ > target_level) {</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  --current_decision_level_;</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  target_trail_index = decisions_[current_decision_level_].trail_index;</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  }</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  Untrail(target_trail_index);</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  last_decision_or_backtrack_trail_index_ = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span> }</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  </div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5a9a59c0a2f7fcec81cc44b1aa159186"> 918</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5a9a59c0a2f7fcec81cc44b1aa159186">SatSolver::AddBinaryClauses</a>(<span class="keyword">const</span> std::vector<BinaryClause>& clauses) {</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_binary_clause.html">BinaryClause</a> c : clauses) {</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(c.a) &&</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(c.b)) {</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  }</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  AddBinaryClauseInternal(c.a, c.b);</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  }</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">Propagate</a>()) <span class="keywordflow">return</span> SetModelUnsat();</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span> }</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  </div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4e9c1f685afe26db1566eaa65724b40b"> 932</a></span> <span class="keyword">const</span> std::vector<BinaryClause>& <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a4e9c1f685afe26db1566eaa65724b40b">SatSolver::NewlyAddedBinaryClauses</a>() {</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keywordflow">return</span> binary_clauses_.<a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a04c08271d60e84b5610ec8ed9bd7b9dc">newly_added</a>();</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span> }</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  </div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#afdb0cc1ac877cd981dcd3f0b0763e644"> 936</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#afdb0cc1ac877cd981dcd3f0b0763e644">SatSolver::ClearNewlyAddedBinaryClauses</a>() {</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  binary_clauses_.<a class="code" href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a47e143bc6df345d913315f79e0c3d290">ClearNewlyAdded</a>();</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span> }</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  </div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="comment">// Return the next value that is a multiple of interval.</span></div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> NextMultipleOf(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>) {</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> * (1 + <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> / <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span> }</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  </div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057"> 947</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">SatSolver::ResetAndSolveWithGivenAssumptions</a>(</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keyword">const</span> std::vector<Literal>& assumptions) {</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9">ResetWithGivenAssumptions</a>(assumptions)) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>();</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keywordflow">return</span> SolveInternal(time_limit_);</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span> }</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  </div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> SatSolver::StatusWithLog(Status status) {</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordflow">if</span> (parameters_->log_search_progress()) {</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << RunningStatisticsString();</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << StatusString(status);</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  }</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span> }</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  </div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440"> 962</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SatSolver::SetAssumptionLevel</a>(<span class="keywordtype">int</span> assumption_level) {</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(assumption_level, 0);</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(assumption_level, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  assumption_level_ = assumption_level;</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span> }</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  </div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a27e14216f4d9330375fc0089a1919f20"> 968</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a27e14216f4d9330375fc0089a1919f20">SatSolver::SolveWithTimeLimit</a>(<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>) {</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">return</span> SolveInternal(<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> == <span class="keyword">nullptr</span> ? time_limit_ : <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>);</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span> }</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  </div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404"> 972</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404">SatSolver::Solve</a>() { <span class="keywordflow">return</span> SolveInternal(time_limit_); }</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  </div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="keywordtype">void</span> SatSolver::KeepAllClauseUsedToInfer(BooleanVariable variable) {</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().VariableIsAssigned(variable));</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(variable).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a> == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keywordtype">int</span> trail_index = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(variable).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>;</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  std::vector<bool> is_marked(trail_index + 1, <span class="keyword">false</span>); <span class="comment">// move to local member.</span></div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  is_marked[trail_index] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordtype">int</span> num = 1;</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">for</span> (; num > 0 && trail_index >= 0; --trail_index) {</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keywordflow">if</span> (!is_marked[trail_index]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  is_marked[trail_index] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  --num;</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  </div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = (*trail_)[trail_index].Variable();</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause = ReasonClauseOrNull(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keywordflow">if</span> (clause != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>()->erase(clause);</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  }</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)) {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keyword">const</span> AssignmentInfo& info = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(l.Variable());</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">if</span> (info.level == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordflow">if</span> (!is_marked[info.trail_index]) {</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  is_marked[info.trail_index] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  ++num;</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  }</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  }</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  }</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> }</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  </div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> <span class="comment">// TODO(user): this is really an in-processing stuff and should be moved out</span></div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> <span class="comment">// of here. I think the name for that (or similar) technique is called vivify.</span></div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> <span class="comment">// Ideally this should be scheduled after other faster in-processing technique.</span></div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="keywordtype">void</span> SatSolver::TryToMinimizeClause(SatClause* clause) {</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  ++counters_.minimization_num_clauses;</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  </div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  std::set<LiteralIndex> moved_last;</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  std::vector<Literal> candidate(clause->begin(), clause->end());</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordflow">while</span> (!model_is_unsat_) {</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="comment">// We want each literal in candidate to appear last once in our propagation</span></div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="comment">// order. We want to do that while maximizing the reutilization of the</span></div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="comment">// current assignment prefix, that is minimizing the number of</span></div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="comment">// decision/progagation we need to perform.</span></div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_level = <a class="code" href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc">MoveOneUnprocessedLiteralLast</a>(</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  moved_last, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), &candidate);</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keywordflow">if</span> (target_level == -1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(target_level);</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() < candidate.size()) {</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = candidate[level];</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().LiteralIsFalse(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  candidate.erase(candidate.begin() + level);</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().LiteralIsTrue(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable_level =</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">LiteralTrail</a>().<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a>;</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">if</span> (variable_level == 0) {</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  ProcessNewlyFixedVariablesForDratProof();</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  counters_.minimization_num_true++;</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  counters_.minimization_num_removed_literals += clause->size();</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">Detach</a>(clause);</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  }</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  </div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="comment">// If literal (at true) wasn't propagated by this clause, then we</span></div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="comment">// know that this clause is subsumed by other clauses in the database,</span></div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="comment">// so we can remove it. Note however that we need to make sure we will</span></div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="comment">// never remove the clauses that subsumes it later.</span></div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">if</span> (ReasonClauseOrNull(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()) != clause) {</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  counters_.minimization_num_subsumed++;</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  counters_.minimization_num_removed_literals += clause->size();</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  </div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// TODO(user): do not do that if it make us keep too many clauses?</span></div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  KeepAllClauseUsedToInfer(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable());</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">Detach</a>(clause);</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="comment">// Simplify. Note(user): we could only keep in clause the literals</span></div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="comment">// responsible for the propagation, but because of the subsumption</span></div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="comment">// above, this is not needed.</span></div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">if</span> (variable_level + 1 < candidate.size()) {</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  candidate.resize(variable_level);</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  candidate.push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  ++counters_.minimization_num_decisions;</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">EnqueueDecisionAndBackjumpOnConflict</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">if</span> (!clause->IsAttached()) {</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  }</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  }</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  }</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">if</span> (candidate.empty()) {</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  model_is_unsat_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  moved_last.insert(candidate.back().Index());</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  }</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  </div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="comment">// Returns if we don't have any minimization.</span></div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordflow">if</span> (candidate.size() == clause->size()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  </div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">if</span> (candidate.size() == 1) {</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>(candidate);</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().VariableIsAssigned(candidate[0].Variable())) {</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  counters_.minimization_num_removed_literals += clause->size();</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">EnqueueWithUnitReason</a>(candidate[0]);</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>();</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  }</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  </div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordflow">if</span> (parameters_->treat_binary_clauses_separately() && candidate.size() == 2) {</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  counters_.minimization_num_removed_literals += clause->size() - 2;</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  </div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="comment">// The order is important for the drat proof.</span></div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  AddBinaryClauseInternal(candidate[0], candidate[1]);</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">Detach</a>(clause);</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  </div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="comment">// This is needed in the corner case where this was the first binary clause</span></div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="comment">// of the problem so that PropagationIsDone() returns true on the newly</span></div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="comment">// created BinaryImplicationGraph.</span></div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>();</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  }</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  </div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  counters_.minimization_num_removed_literals +=</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  clause->size() - candidate.size();</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  </div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="comment">// TODO(user): If the watched literal didn't change, we could just rewrite</span></div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="comment">// the clause while keeping the two watched literals at the beginning.</span></div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordflow">if</span> (!clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab17b31190c5ab58a1334139848335283">InprocessingRewriteClause</a>(clause, candidate)) {</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  model_is_unsat_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  }</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> }</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  </div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> SatSolver::SolveInternal(TimeLimit* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>) {</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  </div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="comment">// TODO(user): Because the counter are not reset to zero, this cause the</span></div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="comment">// metrics / sec to be completely broken except when the solver is used</span></div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="comment">// for exactly one Solve().</span></div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  timer_.<a class="code" href="class_wall_timer.html#a6bdbb9a2345c126ae0d72b1e2a9a21d5">Restart</a>();</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  </div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="comment">// Display initial statistics.</span></div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">if</span> (parameters_->log_search_progress()) {</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Initial memory usage: "</span> << <a class="code" href="namespaceoperations__research.html#acb92bdbce12d475f965f6db3c5f5b7b5">MemoryUsage</a>();</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Number of variables: "</span> << num_variables_;</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Number of clauses (size > 2): "</span></div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  << clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a818f775987a7cd9a94b6616bd2e5e1cc">num_clauses</a>();</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Number of binary clauses: "</span></div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  << binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6dcddbd6c9e8a05ca2170a13c9ff8cbb">num_implications</a>();</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Number of linear constraints: "</span></div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  << pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a18ab319435ed80315e0c35ca40a7c2a0">NumberOfConstraints</a>();</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Number of fixed variables: "</span> << trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Number of watched clauses: "</span></div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  << clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a90d7f1e5714fb18a623b54a9148d636d">num_watched_clauses</a>();</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Parameters: "</span> << <a class="code" href="namespaceoperations__research.html#a87d7aa58897e0042898d1c2207deda18">ProtobufShortDebugString</a>(*parameters_);</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  }</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  </div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="comment">// Used to trigger clause minimization via propagation.</span></div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_minimization_num_restart =</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#aea2ab8041aa76772ba75a3ca8c2cfd81">NumRestarts</a>() +</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  parameters_->minimize_with_propagation_restart_period();</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  </div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="comment">// Variables used to show the search progress.</span></div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> kDisplayFrequency = 10000;</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_display = parameters_->log_search_progress()</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  ? NextMultipleOf(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">num_failures</a>(), kDisplayFrequency)</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  : std::numeric_limits<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>>::<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a>();</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  </div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="comment">// Variables used to check the memory limit every kMemoryCheckFrequency.</span></div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> kMemoryCheckFrequency = 10000;</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_memory_check =</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  NextMultipleOf(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">num_failures</a>(), kMemoryCheckFrequency);</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  </div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="comment">// The max_number_of_conflicts is per solve but the counter is for the whole</span></div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="comment">// solver.</span></div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> kFailureLimit =</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  parameters_->max_number_of_conflicts() ==</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<int64>::max</a>()</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  ? <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<int64>::max</a>()</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  : counters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">num_failures</a> + parameters_->max_number_of_conflicts();</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  </div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="comment">// Starts search.</span></div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keywordflow">for</span> (;;) {</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="comment">// Test if a limit is reached.</span></div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a705eddd5baee23097daf34b73e66eae3">AdvanceDeterministicTime</a>(<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>);</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->LimitReached()) {</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordflow">if</span> (parameters_->log_search_progress()) {</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"The time limit has been reached. Aborting."</span>;</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  }</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">LIMIT_REACHED</a>);</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  }</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">num_failures</a>() >= kFailureLimit) {</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keywordflow">if</span> (parameters_->log_search_progress()) {</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"The conflict limit has been reached. Aborting."</span>;</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  }</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">LIMIT_REACHED</a>);</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  }</div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  </div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="comment">// The current memory checking takes time, so we only execute it every</span></div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="comment">// kMemoryCheckFrequency conflict. We use >= because counters_.num_failures</span></div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="comment">// may augment by more than one at each iteration.</span></div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="comment">// TODO(user): Find a better way.</span></div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keywordflow">if</span> (counters_.num_failures >= next_memory_check) {</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  next_memory_check = NextMultipleOf(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">num_failures</a>(), kMemoryCheckFrequency);</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">if</span> (IsMemoryLimitReached()) {</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordflow">if</span> (parameters_->log_search_progress()) {</div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"The memory limit has been reached. Aborting."</span>;</div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  }</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">LIMIT_REACHED</a>);</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  }</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  }</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  </div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="comment">// Display search progression. We use >= because counters_.num_failures may</span></div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="comment">// augment by more than one at each iteration.</span></div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordflow">if</span> (counters_.num_failures >= next_display) {</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << RunningStatisticsString();</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  next_display = NextMultipleOf(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">num_failures</a>(), kDisplayFrequency);</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  }</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  </div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">if</span> (!PropagateAndStopAfterOneConflictResolution()) {</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="comment">// A conflict occurred, continue the loop.</span></div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>);</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <span class="comment">// We need to reapply any assumptions that are not currently applied.</span></div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">ReapplyAssumptionsIfNeeded</a>()) <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">UnsatStatus</a>());</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  </div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  <span class="comment">// At a leaf?</span></div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() == num_variables_.value()) {</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">FEASIBLE</a>);</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  }</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  </div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keywordflow">if</span> (restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#a9a4dbc2c6849f437d4f08288eeffbfed">ShouldRestart</a>()) {</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(assumption_level_);</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  }</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  </div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="comment">// Clause minimization using propagation.</span></div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0 &&</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#aea2ab8041aa76772ba75a3ca8c2cfd81">NumRestarts</a>() >= next_minimization_num_restart) {</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  next_minimization_num_restart =</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#aea2ab8041aa76772ba75a3ca8c2cfd81">NumRestarts</a>() +</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  parameters_->minimize_with_propagation_restart_period();</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a8f1f9030283b2fa93b2353ab260ebe1e">MinimizeSomeClauses</a>(</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  parameters_->minimize_with_propagation_num_decisions());</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  </div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="comment">// Corner case: the minimization above being based on propagation may</span></div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="comment">// fix the remaining variables or prove UNSAT.</span></div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>);</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() == num_variables_.value()) {</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="keywordflow">return</span> StatusWithLog(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">FEASIBLE</a>);</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  }</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  }</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  </div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), assumption_level_);</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  EnqueueNewDecision(decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf014a334d9412c245c083ce69aa8716">NextBranch</a>());</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  }</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  }</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> }</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  </div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a8f1f9030283b2fa93b2353ab260ebe1e"> 1247</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a8f1f9030283b2fa93b2353ab260ebe1e">SatSolver::MinimizeSomeClauses</a>(<span class="keywordtype">int</span> decisions_budget) {</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="comment">// Tricky: we don't want TryToMinimizeClause() to delete to_minimize</span></div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="comment">// while we are processing it.</span></div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  block_clause_deletion_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  </div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> target_num_branches = counters_.num_branches + decisions_budget;</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordflow">while</span> (counters_.num_branches < target_num_branches &&</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  (time_limit_ == <span class="keyword">nullptr</span> || !time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>())) {</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* to_minimize = clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab21bb15f39af99c400610195b7c682d">NextClauseToMinimize</a>();</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">if</span> (to_minimize != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  TryToMinimizeClause(to_minimize);</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="keywordflow">if</span> (to_minimize == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Minimized all clauses, restarting from first one."</span>;</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ada4c57ad822069c6c61a93973dc39c4d">ResetToMinimizeIndex</a>();</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  }</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  }</div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  }</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  </div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  block_clause_deletion_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad">DeleteRemovedClauses</a>();</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> }</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  </div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580"> 1272</a></span> std::vector<Literal> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">SatSolver::GetLastIncompatibleDecisions</a>() {</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> false_assumption = decisions_[<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>()].literal;</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  std::vector<Literal> unsat_assumptions;</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <span class="keywordflow">if</span> (!trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(false_assumption)) {</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="comment">// This can only happen in some corner cases where: we enqueued</span></div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="comment">// false_assumption, it leads to a conflict, but after re-enqueing the</span></div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="comment">// decisions that were backjumped over, there is no conflict anymore. This</span></div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="comment">// can only happen in the presence of propagators that are non-monotonic</span></div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="comment">// and do not propagate the same thing when there is more literal on the</span></div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="comment">// trail.</span></div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="comment">// In this case, we simply return all the decisions since we know that is</span></div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="comment">// a valid conflict. Since this should be rare, it is okay to not "minimize"</span></div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  <span class="comment">// what we return like we do below.</span></div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="comment">// TODO(user): unit-test this case with a mock propagator.</span></div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  unsat_assumptions.reserve(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(); ++i) {</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  unsat_assumptions.push_back(decisions_[i].<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  }</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="keywordflow">return</span> unsat_assumptions;</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  }</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  </div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  unsat_assumptions.push_back(false_assumption);</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  </div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="comment">// This will be used to mark all the literals inspected while we process the</span></div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="comment">// false_assumption and the reasons behind each of its variable assignments.</span></div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(num_variables_);</div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(false_assumption.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>());</div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  </div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordtype">int</span> trail_index = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(false_assumption.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>()).trail_index;</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> limit =</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() > 0 ? decisions_[0].trail_index : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(trail_index, trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>());</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="comment">// Find next marked literal to expand from the trail.</span></div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">while</span> (trail_index >= 0 && !is_marked_[(*trail_)[trail_index].Variable()]) {</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  --trail_index;</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  }</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <span class="keywordflow">if</span> (trail_index < limit) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> marked_literal = (*trail_)[trail_index];</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  --trail_index;</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  </div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a5ed9d5f5c759afe4a008adaabd80c6f8">AssignmentType</a>(marked_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>()) ==</div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <a class="code" href="structoperations__research_1_1sat_1_1_assignment_type.html#a916a0609367bae97bd6788542d4925eb">AssignmentType::kSearchDecision</a>) {</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  unsat_assumptions.push_back(marked_literal);</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="comment">// Marks all the literals of its reason.</span></div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(marked_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>())) {</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordflow">if</span> (level > 0 && !is_marked_[<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>]) is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  }</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  }</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  }</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  </div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="comment">// We reverse the assumptions so they are in the same order as the one in</span></div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="comment">// which the decision were made.</span></div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  std::reverse(unsat_assumptions.begin(), unsat_assumptions.end());</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">return</span> unsat_assumptions;</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> }</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  </div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span> <span class="keywordtype">void</span> SatSolver::BumpReasonActivities(<span class="keyword">const</span> std::vector<Literal>& literals) {</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals) {</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">if</span> (DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) > 0) {</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause = ReasonClauseOrNull(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">if</span> (clause != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  BumpClauseActivity(clause);</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  UpperBoundedLinearConstraint* pb_constraint =</div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  ReasonPbConstraintOrNull(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keywordflow">if</span> (pb_constraint != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="comment">// TODO(user): Because one pb constraint may propagate many literals,</span></div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="comment">// this may bias the constraint activity... investigate other policy.</span></div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae087fb0f8731e64e65fb00e517fe8966">BumpActivity</a>(pb_constraint);</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  }</div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  }</div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  }</div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  }</div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> }</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  </div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> <span class="keywordtype">void</span> SatSolver::BumpClauseActivity(SatClause* clause) {</div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="comment">// We only bump the activity of the clauses that have some info. So if we know</span></div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="comment">// that we will keep a clause forever, we don't need to create its Info. More</span></div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="comment">// than the speed, this allows to limit as much as possible the activity</span></div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="comment">// rescaling.</span></div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="keyword">auto</span> it = clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>()->find(clause);</div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="keywordflow">if</span> (it == clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>()->end()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  </div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="comment">// Check if the new clause LBD is below our threshold to keep this clause</span></div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <span class="comment">// indefinitely. Note that we use a +1 here because the LBD of a newly learned</span></div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="comment">// clause decrease by 1 just after the backjump.</span></div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_lbd = ComputeLbd(*clause);</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keywordflow">if</span> (new_lbd + 1 <= parameters_->clause_cleanup_lbd_bound()) {</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>()->erase(clause);</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  }</div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  </div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="comment">// Eventually protect this clause for the next cleanup phase.</span></div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <span class="keywordflow">switch</span> (parameters_->clause_cleanup_protection()) {</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keywordflow">case</span> SatParameters::PROTECTION_NONE:</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  <span class="keywordflow">case</span> SatParameters::PROTECTION_ALWAYS:</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  it->second.protected_during_next_cleanup = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keywordflow">case</span> SatParameters::PROTECTION_LBD:</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="comment">// This one is similar to the one used by the Glucose SAT solver.</span></div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="comment">// TODO(user): why the +1? one reason may be that the LBD of a conflict</span></div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  <span class="comment">// decrease by 1 just afer the backjump...</span></div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <span class="keywordflow">if</span> (new_lbd + 1 < it->second.lbd) {</div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  it->second.protected_during_next_cleanup = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  it->second.lbd = new_lbd;</div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  }</div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  }</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  </div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="comment">// Increase the activity.</span></div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> activity = it->second.activity += clause_activity_increment_;</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keywordflow">if</span> (activity > parameters_->max_clause_activity_value()) {</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  RescaleClauseActivities(1.0 / parameters_->max_clause_activity_value());</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  }</div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> }</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  </div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> <span class="keywordtype">void</span> SatSolver::RescaleClauseActivities(<span class="keywordtype">double</span> scaling_factor) {</div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  clause_activity_increment_ *= scaling_factor;</div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& entry : *clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>()) {</div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  entry.second.activity *= scaling_factor;</div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  }</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> }</div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  </div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> <span class="keywordtype">void</span> SatSolver::UpdateClauseActivityIncrement() {</div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  clause_activity_increment_ *= 1.0 / parameters_->clause_activity_decay();</div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> }</div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  </div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <span class="keywordtype">bool</span> SatSolver::IsConflictValid(<span class="keyword">const</span> std::vector<Literal>& literals) {</div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keywordflow">if</span> (literals.empty()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> highest_level = DecisionLevel(literals[0].Variable());</div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < literals.size(); ++i) {</div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(literals[i].Variable());</div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <span class="keywordflow">if</span> (level <= 0 || level >= highest_level) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  }</div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> }</div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  </div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span> <span class="keywordtype">int</span> SatSolver::ComputeBacktrackLevel(<span class="keyword">const</span> std::vector<Literal>& literals) {</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  </div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="comment">// We want the highest decision level among literals other than the first one.</span></div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="comment">// Note that this level will always be smaller than that of the first literal.</span></div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <span class="comment">// Note(user): if the learned clause is of size 1, we backtrack all the way to</span></div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="comment">// the beginning. It may be possible to follow another behavior, but then the</span></div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="comment">// code require some special cases in</span></div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  <span class="comment">// AddLearnedClauseAndEnqueueUnitPropagation() to fix the literal and not</span></div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <span class="comment">// backtrack over it. Also, subsequent propagated variables may not have a</span></div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="comment">// correct level in this case.</span></div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordtype">int</span> backtrack_level = 0;</div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < literals.size(); ++i) {</div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(literals[i].Variable());</div>
|
|
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  backtrack_level = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(backtrack_level, level);</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  }</div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(backtrack_level, DecisionLevel(literals[0].Variable()));</div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(DecisionLevel(literals[0].Variable()), <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>());</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <span class="keywordflow">return</span> backtrack_level;</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> }</div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  </div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span> <span class="keyword">template</span> <<span class="keyword">typename</span> LiteralList></div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> <span class="keywordtype">int</span> SatSolver::ComputeLbd(<span class="keyword">const</span> LiteralList& literals) {</div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> limit =</div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  parameters_->count_assumption_levels_in_lbd() ? 0 : assumption_level_;</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  </div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="comment">// We know that the first literal is always of the highest level.</span></div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  is_level_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(</div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  SatDecisionLevel(DecisionLevel(literals.begin()->Variable()) + 1));</div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals) {</div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keyword">const</span> SatDecisionLevel level(DecisionLevel(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()));</div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(level, 0);</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordflow">if</span> (level > limit && !is_level_marked_[level]) {</div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  is_level_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(level);</div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  }</div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  }</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordflow">return</span> is_level_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a838e4744903ec12e6ebcf2999f4a90df">NumberOfSetCallsWithDifferentArguments</a>();</div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span> }</div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  </div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span> std::string SatSolver::StatusString(Status status)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> time_in_s = timer_.<a class="code" href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">Get</a>();</div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"\n status: %s\n"</span>, <a class="code" href="namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc">SatStatusString</a>(status)) +</div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  absl::StrFormat(<span class="stringliteral">" time: %fs\n"</span>, time_in_s) +</div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  absl::StrFormat(<span class="stringliteral">" memory: %s\n"</span>, <a class="code" href="namespaceoperations__research.html#acb92bdbce12d475f965f6db3c5f5b7b5">MemoryUsage</a>()) +</div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  <span class="stringliteral">" num failures: %d (%.0f /sec)\n"</span>, counters_.num_failures,</div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(counters_.num_failures) / time_in_s) +</div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  <span class="stringliteral">" num branches: %d (%.0f /sec)\n"</span>, counters_.num_branches,</div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(counters_.num_branches) / time_in_s) +</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  absl::StrFormat(<span class="stringliteral">" num propagations: %d (%.0f /sec)\n"</span>,</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a7b5f3592cdf12c0df22b6583b3e9ed61">num_propagations</a>(),</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a7b5f3592cdf12c0df22b6583b3e9ed61">num_propagations</a>()) / time_in_s) +</div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  absl::StrFormat(<span class="stringliteral">" num binary propagations: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7b5f3592cdf12c0df22b6583b3e9ed61">num_propagations</a>()) +</div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  absl::StrFormat(<span class="stringliteral">" num binary inspections: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a226de3db7ac8ac7a33cd682911672830">num_inspections</a>()) +</div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="stringliteral">" num binary redundant implications: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ac40b290f8a1345fdf85dd5ca6e185f4f">num_redundant_implications</a>()) +</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="stringliteral">" num classic minimizations: %d"</span></div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <span class="stringliteral">" (literals removed: %d)\n"</span>,</div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  counters_.num_minimizations, counters_.num_literals_removed) +</div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="stringliteral">" num binary minimizations: %d"</span></div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <span class="stringliteral">" (literals removed: %d)\n"</span>,</div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a3f25e4bf6f5972768cb431e51ac01b82">num_minimization</a>(),</div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a29701fe3514ad84a5e8ad3e925cf3804">num_literals_removed</a>()) +</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  absl::StrFormat(<span class="stringliteral">" num inspected clauses: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a88608365af082d6228a4e75955e6dc31">num_inspected_clauses</a>()) +</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  absl::StrFormat(<span class="stringliteral">" num inspected clause_literals: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#aa21bc79521e779410da749e892e004db">num_inspected_clause_literals</a>()) +</div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <span class="stringliteral">" num learned literals: %d (avg: %.1f /clause)\n"</span>,</div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  counters_.num_literals_learned,</div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  1.0 * counters_.num_literals_learned / counters_.num_failures) +</div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  absl::StrFormat(</div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="stringliteral">" num learned PB literals: %d (avg: %.1f /clause)\n"</span>,</div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  counters_.num_learned_pb_literals,</div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  1.0 * counters_.num_learned_pb_literals / counters_.num_failures) +</div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  absl::StrFormat(<span class="stringliteral">" num subsumed clauses: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  counters_.num_subsumed_clauses) +</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  absl::StrFormat(<span class="stringliteral">" minimization_num_clauses: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  counters_.minimization_num_clauses) +</div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  absl::StrFormat(<span class="stringliteral">" minimization_num_decisions: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  counters_.minimization_num_decisions) +</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  absl::StrFormat(<span class="stringliteral">" minimization_num_true: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  counters_.minimization_num_true) +</div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  absl::StrFormat(<span class="stringliteral">" minimization_num_subsumed: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  counters_.minimization_num_subsumed) +</div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  absl::StrFormat(<span class="stringliteral">" minimization_num_removed_literals: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  counters_.minimization_num_removed_literals) +</div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  absl::StrFormat(<span class="stringliteral">" pb num threshold updates: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a31db3a3e839ea89186d44f0f3025f506">num_threshold_updates</a>()) +</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  absl::StrFormat(<span class="stringliteral">" pb num constraint lookups: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a991506896584b01b214102ac3ed2ddb5">num_constraint_lookups</a>()) +</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  absl::StrFormat(<span class="stringliteral">" pb num inspected constraint literals: %d\n"</span>,</div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a9699443a7a311c163aa4ef9990f493a4">num_inspected_constraint_literals</a>()) +</div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#a3b30aa3a72ace837ddc29fd371c6e46e">InfoString</a>() +</div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  absl::StrFormat(<span class="stringliteral">" deterministic time: %f\n"</span>, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>());</div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span> }</div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  </div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span> std::string SatSolver::RunningStatisticsString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> time_in_s = timer_.<a class="code" href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">Get</a>();</div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="stringliteral">"%6.2fs, mem:%s, fails:%d, depth:%d, clauses:%d, tmp:%d, bin:%u, "</span></div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="stringliteral">"restarts:%d, vars:%d"</span>,</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  time_in_s, <a class="code" href="namespaceoperations__research.html#acb92bdbce12d475f965f6db3c5f5b7b5">MemoryUsage</a>(), counters_.num_failures, <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(),</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a818f775987a7cd9a94b6616bd2e5e1cc">num_clauses</a>() -</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a75eea7bb53aaf332edafd3a6c1dffdeb">num_removable_clauses</a>(),</div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a75eea7bb53aaf332edafd3a6c1dffdeb">num_removable_clauses</a>(),</div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6dcddbd6c9e8a05ca2170a13c9ff8cbb">num_implications</a>(), restart_-><a class="code" href="classoperations__research_1_1sat_1_1_restart_policy.html#aea2ab8041aa76772ba75a3ca8c2cfd81">NumRestarts</a>(),</div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  num_variables_.value() - num_processed_fixed_variables_);</div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span> }</div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  </div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span> <span class="keywordtype">void</span> SatSolver::ProcessNewlyFixedVariablesForDratProof() {</div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="keywordflow">if</span> (drat_proof_handler_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() != 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  </div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="comment">// We need to output the literals that are fixed so we can remove all</span></div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  <span class="comment">// clauses that contains them. Note that this doesn't seems to be needed</span></div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="comment">// for drat-trim.</span></div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  <span class="comment">// TODO(user): Ideally we could output such literal as soon as they are fixed,</span></div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="comment">// but this is not that easy to do. Spend some time to find a cleaner</span></div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="comment">// alternative? Currently this works, but:</span></div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  <span class="comment">// - We will output some fixed literals twice since we already output learnt</span></div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  <span class="comment">// clauses of size one.</span></div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <span class="comment">// - We need to call this function when needed.</span></div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  Literal temp;</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <span class="keywordflow">for</span> (; drat_num_processed_fixed_variables_ < trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  ++drat_num_processed_fixed_variables_) {</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  temp = (*trail_)[drat_num_processed_fixed_variables_];</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>({&temp, 1});</div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  }</div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span> }</div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  </div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2aafb0d6bd7d95f183e87866d0ade374"> 1563</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2aafb0d6bd7d95f183e87866d0ade374">SatSolver::ProcessNewlyFixedVariables</a>() {</div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  <span class="keywordtype">int</span> num_detached_clauses = 0;</div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keywordtype">int</span> num_binary = 0;</div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  </div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  ProcessNewlyFixedVariablesForDratProof();</div>
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  </div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="comment">// We remove the clauses that are always true and the fixed literals from the</span></div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <span class="comment">// others. Note that none of the clause should be all false because we should</span></div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  <span class="comment">// have detected a conflict before this is called.</span></div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_clause.html">SatClause</a>* clause : clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0569d77056e622964bd02dd901950ede">AllClausesInCreationOrder</a>()) {</div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keywordflow">if</span> (!clause->IsAttached()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  </div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> old_size = clause->size();</div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keywordflow">if</span> (clause->RemoveFixedLiteralsAndTestIfTrue(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>())) {</div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="comment">// The clause is always true, detach it.</span></div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">LazyDetach</a>(clause);</div>
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  ++num_detached_clauses;</div>
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  }</div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  </div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> new_size = clause->size();</div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  <span class="keywordflow">if</span> (new_size == old_size) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  </div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="keywordflow">if</span> (drat_proof_handler_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(new_size, 0);</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>({clause->begin(), new_size});</div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  drat_proof_handler_-><a class="code" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">DeleteClause</a>({clause->begin(), old_size});</div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  }</div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  </div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">if</span> (new_size == 2 && parameters_->treat_binary_clauses_separately()) {</div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="comment">// This clause is now a binary clause, treat it separately. Note that</span></div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="comment">// it is safe to do that because this clause can't be used as a reason</span></div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <span class="comment">// since we are at level zero and the clause is not satisfied.</span></div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  AddBinaryClauseInternal(clause->FirstLiteral(), clause->SecondLiteral());</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">LazyDetach</a>(clause);</div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  ++num_binary;</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  }</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  }</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  </div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="comment">// Note that we will only delete the clauses during the next database cleanup.</span></div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3">CleanUpWatchers</a>();</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  <span class="keywordflow">if</span> (num_detached_clauses > 0 || num_binary > 0) {</div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() << <span class="stringliteral">" fixed variables at level 0. "</span></div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  << <span class="stringliteral">"Detached "</span> << num_detached_clauses << <span class="stringliteral">" clauses. "</span> << num_binary</div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  << <span class="stringliteral">" converted to binary."</span>;</div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  }</div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  </div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="comment">// We also clean the binary implication graph.</span></div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">RemoveFixedVariables</a>();</div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  num_processed_fixed_variables_ = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  deterministic_time_of_last_fixed_variables_cleanup_ = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>();</div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span> }</div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  </div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span> <span class="comment">// TODO(user): Support propagating only the "first" propagators. That can</span></div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span> <span class="comment">// be useful for probing/in-processing, so we can control if we do only the SAT</span></div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span> <span class="comment">// part or the full integer part...</span></div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39"> 1622</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">SatSolver::Propagate</a>() {</div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="comment">// The idea here is to abort the inspection as soon as at least one</span></div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="comment">// propagation occurs so we can loop over and test again the highest</span></div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  <span class="comment">// priority constraint types using the new information.</span></div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  <span class="comment">// Note that the first propagators_ should be the binary_implication_graph_</span></div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  <span class="comment">// and that its Propagate() functions will not abort on the first</span></div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  <span class="comment">// propagation to be slightly more efficient.</span></div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_index = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html">SatPropagator</a>* propagator : propagators_) {</div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(propagator->PropagatePreconditionsAreSatisfied(*trail_));</div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keywordflow">if</span> (!propagator->Propagate(trail_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() > old_index) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  }</div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() == old_index) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  }</div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span> }</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  </div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> <span class="keywordtype">void</span> SatSolver::InitializePropagators() {</div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  propagators_.clear();</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  </div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  <span class="comment">// To make Propagate() as fast as possible, we only add the</span></div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  <span class="comment">// binary_implication_graph_/pb_constraints_ propagators if there is anything</span></div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  <span class="comment">// to propagate. Because of this, it is important to call</span></div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="comment">// InitializePropagators() after the first constraint of this kind is added.</span></div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <span class="comment">// TODO(user): uses the Model classes here to only call</span></div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  <span class="comment">// model.GetOrCreate<BinaryImplicationGraph>() when the first binary</span></div>
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="comment">// constraint is needed, and have a mecanism to always make this propagator</span></div>
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="comment">// first. Same for the linear constraints.</span></div>
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  <span class="keywordflow">if</span> (!binary_implication_graph_-><a class="code" href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  propagators_.push_back(binary_implication_graph_);</div>
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  }</div>
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  propagators_.push_back(clauses_propagator_);</div>
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  <span class="keywordflow">if</span> (pb_constraints_-><a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a18ab319435ed80315e0c35ca40a7c2a0">NumberOfConstraints</a>() > 0) {</div>
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  propagators_.push_back(pb_constraints_);</div>
|
|
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  }</div>
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < external_propagators_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  propagators_.push_back(external_propagators_[i]);</div>
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  }</div>
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keywordflow">if</span> (last_propagator_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  propagators_.push_back(last_propagator_);</div>
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  }</div>
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span> }</div>
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  </div>
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> <span class="keywordtype">bool</span> SatSolver::PropagationIsDone()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="keywordflow">for</span> (SatPropagator* propagator : propagators_) {</div>
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <span class="keywordflow">if</span> (!propagator->PropagationIsDone(*trail_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  }</div>
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> }</div>
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  </div>
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> <span class="keywordtype">bool</span> SatSolver::ResolvePBConflict(BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>,</div>
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  MutableUpperBoundedLinearConstraint* conflict,</div>
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  Coefficient* slack) {</div>
|
|
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> trail_index = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>;</div>
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  </div>
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  <span class="comment">// This is the slack of the conflict < trail_index</span></div>
|
|
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(*slack, conflict->ComputeSlackForTrailPrefix(*trail_, trail_index));</div>
|
|
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  </div>
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="comment">// Pseudo-Boolean case.</span></div>
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  UpperBoundedLinearConstraint* pb_reason = ReasonPbConstraintOrNull(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  <span class="keywordflow">if</span> (pb_reason != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  pb_reason->ResolvePBConflict(*trail_, <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>, conflict, slack);</div>
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  }</div>
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  </div>
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <span class="comment">// Generic clause case.</span></div>
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  Coefficient multiplier(1);</div>
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  </div>
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  <span class="comment">// TODO(user): experiment and choose the "best" algo.</span></div>
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> algorithm = 1;</div>
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="keywordflow">switch</span> (algorithm) {</div>
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="comment">// We reduce the conflict slack to 0 before adding the clause.</span></div>
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  <span class="comment">// The advantage of this method is that the coefficients stay small.</span></div>
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  conflict->ReduceSlackTo(*trail_, trail_index, *slack, Coefficient(0));</div>
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  <span class="keywordflow">case</span> 2:</div>
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="comment">// No reduction, we add the lower possible multiple.</span></div>
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  multiplier = *slack + 1;</div>
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  <span class="comment">// No reduction, the multiple is chosen to cancel var.</span></div>
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  multiplier = conflict->GetCoefficient(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  }</div>
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  </div>
|
|
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  Coefficient num_literals(1);</div>
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  conflict->AddTerm(</div>
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#ac821b9b8b54da703731ce70864668a89">GetTrueLiteralForAssignedVariable</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>(),</div>
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  multiplier);</div>
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)) {</div>
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable(), <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().LiteralIsFalse(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>));</div>
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  conflict->AddTerm(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated(), multiplier);</div>
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  ++num_literals;</div>
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  }</div>
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  conflict->AddToRhs((num_literals - 1) * multiplier);</div>
|
|
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  </div>
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="comment">// All the algorithms above result in a new slack of -1.</span></div>
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  *slack = -1;</div>
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(*slack, conflict->ComputeSlackForTrailPrefix(*trail_, trail_index));</div>
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span> }</div>
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  </div>
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span> <span class="keywordtype">void</span> SatSolver::EnqueueNewDecision(Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) {</div>
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().VariableIsAssigned(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()));</div>
|
|
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  </div>
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  <span class="comment">// We are back at level 0. This can happen because of a restart, or because</span></div>
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  <span class="comment">// we proved that some variables must take a given value in any satisfiable</span></div>
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="comment">// assignment. Trigger a simplification of the clauses if there is new fixed</span></div>
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="comment">// variables. Note that for efficiency reason, we don't do that too often.</span></div>
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  <span class="comment">// TODO(user): Do more advanced preprocessing?</span></div>
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() == 0) {</div>
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kMinDeterministicTimeBetweenCleanups = 1.0;</div>
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  <span class="keywordflow">if</span> (num_processed_fixed_variables_ < trail_-><a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>() &&</div>
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">deterministic_time</a>() ></div>
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  deterministic_time_of_last_fixed_variables_cleanup_ +</div>
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  kMinDeterministicTimeBetweenCleanups) {</div>
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2aafb0d6bd7d95f183e87866d0ade374">ProcessNewlyFixedVariables</a>();</div>
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  }</div>
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  }</div>
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  </div>
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  counters_.num_branches++;</div>
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  last_decision_or_backtrack_trail_index_ = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  decisions_[current_decision_level_] = Decision(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>(), <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  ++current_decision_level_;</div>
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#adeeeb993a93b815c1c343f9c46ec3564">SetDecisionLevel</a>(current_decision_level_);</div>
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#afc2d489cf3ae30c4b27ff1e4359e1be9">EnqueueSearchDecision</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span> }</div>
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  </div>
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span> <span class="keywordtype">void</span> SatSolver::Untrail(<span class="keywordtype">int</span> target_trail_index) {</div>
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(target_trail_index, trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>());</div>
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  <span class="keywordflow">for</span> (SatPropagator* propagator : propagators_) {</div>
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  propagator->Untrail(*trail_, target_trail_index);</div>
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  }</div>
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  decision_policy_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aa62b9215667a0b7dc6af8251dbaba486">Untrail</a>(target_trail_index);</div>
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#aa62b9215667a0b7dc6af8251dbaba486">Untrail</a>(target_trail_index);</div>
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span> }</div>
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  </div>
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span> std::string SatSolver::DebugString(<span class="keyword">const</span> SatClause& clause)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  std::string result;</div>
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : clause) {</div>
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="keywordflow">if</span> (!result.empty()) {</div>
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  result.append(<span class="stringliteral">" || "</span>);</div>
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  }</div>
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="keyword">const</span> std::string <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> =</div>
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)</div>
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  ? <span class="stringliteral">"true"</span></div>
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  : (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) ? <span class="stringliteral">"false"</span></div>
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  : <span class="stringliteral">"undef"</span>);</div>
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  result.append(absl::StrFormat(<span class="stringliteral">"%s(%s)"</span>, <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.DebugString(), <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>));</div>
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  }</div>
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span> }</div>
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  </div>
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span> <span class="keywordtype">int</span> SatSolver::ComputeMaxTrailIndex(absl::Span<const Literal> clause)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="keywordtype">int</span> trail_index = -1;</div>
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : clause) {</div>
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  trail_index =</div>
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(trail_index, trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>);</div>
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  }</div>
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  <span class="keywordflow">return</span> trail_index;</div>
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span> }</div>
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  </div>
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span> <span class="comment">// This method will compute a first UIP conflict</span></div>
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span> <span class="comment">// http://www.cs.tau.ac.il/~msagiv/courses/ATP/iccad2001_final.pdf</span></div>
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span> <span class="comment">// http://gauss.ececs.uc.edu/SAT/articles/FAIA185-0131.pdf</span></div>
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span> <span class="keywordtype">void</span> SatSolver::ComputeFirstUIPConflict(</div>
|
|
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  <span class="keywordtype">int</span> max_trail_index, std::vector<Literal>* conflict,</div>
|
|
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  std::vector<Literal>* reason_used_to_infer_the_conflict,</div>
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  std::vector<SatClause*>* subsumed_clauses) {</div>
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  </div>
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="comment">// This will be used to mark all the literals inspected while we process the</span></div>
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  <span class="comment">// conflict and the reasons behind each of its variable assignments.</span></div>
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(num_variables_);</div>
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  </div>
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  conflict->clear();</div>
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  reason_used_to_infer_the_conflict->clear();</div>
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  subsumed_clauses->clear();</div>
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  <span class="keywordflow">if</span> (max_trail_index == -1) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  </div>
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="comment">// max_trail_index is the maximum trail index appearing in the failing_clause</span></div>
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="comment">// and its level (Which is almost always equals to the CurrentDecisionLevel(),</span></div>
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="comment">// except for symmetry propagation).</span></div>
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(max_trail_index, ComputeMaxTrailIndex(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a02b397f0cd58ae0d26dfeb6182401ece">FailingClause</a>()));</div>
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <span class="keywordtype">int</span> trail_index = max_trail_index;</div>
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> highest_level = DecisionLevel((*trail_)[trail_index].Variable());</div>
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="keywordflow">if</span> (highest_level == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  </div>
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="comment">// To find the 1-UIP conflict clause, we start by the failing_clause, and</span></div>
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <span class="comment">// expand each of its literal using the reason for this literal assignement to</span></div>
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <span class="comment">// false. The is_marked_ set allow us to never expand the same literal twice.</span></div>
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="comment">// The expansion is not done (i.e. stop) for literals that were assigned at a</span></div>
|
|
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <span class="comment">// decision level below the current one. If the level of such literal is not</span></div>
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="comment">// zero, it is added to the conflict clause.</span></div>
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="comment">// Now, the trick is that we use the trail to expand the literal of the</span></div>
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="comment">// current level in a very specific order. Namely the reverse order of the one</span></div>
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="comment">// in which they were inferred. We stop as soon as</span></div>
|
|
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="comment">// num_literal_at_highest_level_that_needs_to_be_processed is exactly one.</span></div>
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <span class="comment">// This last literal will be the first UIP because by definition all the</span></div>
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <span class="comment">// propagation done at the current level will pass though it at some point.</span></div>
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  absl::Span<const Literal> clause_to_expand = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a02b397f0cd58ae0d26dfeb6182401ece">FailingClause</a>();</div>
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  SatClause* sat_clause = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a3d1e83250927b8d13cb65626fdc49b29">FailingSatClause</a>();</div>
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!clause_to_expand.empty());</div>
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="keywordtype">int</span> num_literal_at_highest_level_that_needs_to_be_processed = 0;</div>
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <span class="keywordtype">int</span> num_new_vars_at_positive_level = 0;</div>
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  <span class="keywordtype">int</span> num_vars_at_positive_level_in_clause_to_expand = 0;</div>
|
|
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : clause_to_expand) {</div>
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <span class="keywordflow">if</span> (level > 0) ++num_vars_at_positive_level_in_clause_to_expand;</div>
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  <span class="keywordflow">if</span> (!is_marked_[<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>]) {</div>
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="keywordflow">if</span> (level == highest_level) {</div>
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  ++num_new_vars_at_positive_level;</div>
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  ++num_literal_at_highest_level_that_needs_to_be_processed;</div>
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (level > 0) {</div>
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  ++num_new_vars_at_positive_level;</div>
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  <span class="comment">// Note that all these literals are currently false since the clause</span></div>
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="comment">// to expand was used to infer the value of a literal at this level.</span></div>
|
|
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>));</div>
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  conflict->push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  reason_used_to_infer_the_conflict->push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  }</div>
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  }</div>
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  }</div>
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  </div>
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  <span class="comment">// If there is new variables, then all the previously subsumed clauses are</span></div>
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <span class="comment">// not subsumed anymore.</span></div>
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <span class="keywordflow">if</span> (num_new_vars_at_positive_level > 0) {</div>
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  <span class="comment">// TODO(user): We could still replace all these clauses with the current</span></div>
|
|
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  <span class="comment">// conflict.</span></div>
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  subsumed_clauses->clear();</div>
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  }</div>
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  </div>
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  <span class="comment">// This check if the new conflict is exactly equal to clause_to_expand.</span></div>
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  <span class="comment">// Since we just performed an union, comparing the size is enough. When this</span></div>
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  <span class="comment">// is true, then the current conflict subsumes the reason whose underlying</span></div>
|
|
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <span class="comment">// clause is given by sat_clause.</span></div>
|
|
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  <span class="keywordflow">if</span> (sat_clause != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  num_vars_at_positive_level_in_clause_to_expand ==</div>
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  conflict->size() +</div>
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  num_literal_at_highest_level_that_needs_to_be_processed) {</div>
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  subsumed_clauses->push_back(sat_clause);</div>
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  }</div>
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  </div>
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  <span class="comment">// Find next marked literal to expand from the trail.</span></div>
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(num_literal_at_highest_level_that_needs_to_be_processed, 0);</div>
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  <span class="keywordflow">while</span> (!is_marked_[(*trail_)[trail_index].Variable()]) {</div>
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  --trail_index;</div>
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(trail_index, 0);</div>
|
|
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(DecisionLevel((*trail_)[trail_index].Variable()),</div>
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  highest_level);</div>
|
|
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  }</div>
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  </div>
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  <span class="keywordflow">if</span> (num_literal_at_highest_level_that_needs_to_be_processed == 1) {</div>
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <span class="comment">// We have the first UIP. Add its negation to the conflict clause.</span></div>
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <span class="comment">// This way, after backtracking to the proper level, the conflict clause</span></div>
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  <span class="comment">// will be unit, and infer the negation of the UIP that caused the fail.</span></div>
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  conflict->push_back((*trail_)[trail_index].Negated());</div>
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  </div>
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  <span class="comment">// To respect the function API move the first UIP in the first position.</span></div>
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  std::swap(conflict->back(), conflict->front());</div>
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  }</div>
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  </div>
|
|
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  <span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = (*trail_)[trail_index];</div>
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  reason_used_to_infer_the_conflict->push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>);</div>
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  </div>
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  <span class="comment">// If we already encountered the same reason, we can just skip this literal</span></div>
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  <span class="comment">// which is what setting clause_to_expand to the empty clause do.</span></div>
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  <span class="keywordflow">if</span> (same_reason_identifier_.<a class="code" href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#a85a00c2877e3b249951022638dda5642">FirstVariableWithSameReason</a>(</div>
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()) != <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()) {</div>
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  clause_to_expand = {};</div>
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  clause_to_expand = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable());</div>
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  }</div>
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  sat_clause = ReasonClauseOrNull(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable());</div>
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  </div>
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  --num_literal_at_highest_level_that_needs_to_be_processed;</div>
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  --trail_index;</div>
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  }</div>
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span> }</div>
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  </div>
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span> <span class="keywordtype">void</span> SatSolver::ComputeUnionOfReasons(<span class="keyword">const</span> std::vector<Literal>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div>
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  std::vector<Literal>* literals) {</div>
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  tmp_mark_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(num_variables_);</div>
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  literals->clear();</div>
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) tmp_mark_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(l.Variable());</div>
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) {</div>
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal r : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(l.Variable())) {</div>
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  <span class="keywordflow">if</span> (!tmp_mark_[r.Variable()]) {</div>
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  tmp_mark_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(r.Variable());</div>
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  literals->push_back(r);</div>
|
|
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  }</div>
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  }</div>
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  }</div>
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) tmp_mark_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.Variable());</div>
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : *literals) tmp_mark_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(l.Variable());</div>
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span> }</div>
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  </div>
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span> <span class="comment">// TODO(user): Remove the literals assigned at level 0.</span></div>
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span> <span class="keywordtype">void</span> SatSolver::ComputePBConflict(<span class="keywordtype">int</span> max_trail_index,</div>
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  Coefficient initial_slack,</div>
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  MutableUpperBoundedLinearConstraint* conflict,</div>
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  <span class="keywordtype">int</span>* pb_backjump_level) {</div>
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  <span class="keywordtype">int</span> trail_index = max_trail_index;</div>
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  </div>
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  <span class="comment">// First compute the slack of the current conflict for the assignment up to</span></div>
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  <span class="comment">// trail_index. It must be negative since this is a conflict.</span></div>
|
|
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  Coefficient slack = initial_slack;</div>
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(slack,</div>
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  conflict->ComputeSlackForTrailPrefix(*trail_, trail_index + 1));</div>
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(slack, 0) << <span class="stringliteral">"We don't have a conflict!"</span>;</div>
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  </div>
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="comment">// Iterate backward over the trail.</span></div>
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="keywordtype">int</span> backjump_level = 0;</div>
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = (*trail_)[trail_index].Variable();</div>
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  --trail_index;</div>
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  </div>
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="keywordflow">if</span> (conflict->GetCoefficient(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) > 0 &&</div>
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(conflict->GetLiteral(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>))) {</div>
|
|
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  <span class="keywordflow">if</span> (parameters_->minimize_reduction_during_pb_resolution()) {</div>
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="comment">// When this parameter is true, we don't call ReduceCoefficients() at</span></div>
|
|
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  <span class="comment">// every loop. However, it is still important to reduce the "current"</span></div>
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  <span class="comment">// variable coefficient, because this can impact the value of the new</span></div>
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="comment">// slack below.</span></div>
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  conflict->ReduceGivenCoefficient(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  }</div>
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  </div>
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="comment">// This is the slack one level before (< Info(var).trail_index).</span></div>
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  slack += conflict->GetCoefficient(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  </div>
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <span class="comment">// This can't happen at the beginning, but may happen later.</span></div>
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  <span class="comment">// It means that even without var assigned, we still have a conflict.</span></div>
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  <span class="keywordflow">if</span> (slack < 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  </div>
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  <span class="comment">// At this point, just removing the last assignment lift the conflict.</span></div>
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  <span class="comment">// So we can abort if the true assignment before that is at a lower level</span></div>
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  <span class="comment">// TODO(user): Somewhat inefficient.</span></div>
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  <span class="comment">// TODO(user): We could abort earlier...</span></div>
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  <span class="keywordtype">int</span> i = trail_index;</div>
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <span class="keywordflow">while</span> (i >= 0) {</div>
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <span class="keyword">const</span> BooleanVariable previous_var = (*trail_)[i].Variable();</div>
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="keywordflow">if</span> (conflict->GetCoefficient(previous_var) > 0 &&</div>
|
|
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(</div>
|
|
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  conflict->GetLiteral(previous_var))) {</div>
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  }</div>
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  --i;</div>
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  }</div>
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  <span class="keywordflow">if</span> (i < 0 || DecisionLevel((*trail_)[i].Variable()) < current_level) {</div>
|
|
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  backjump_level = i < 0 ? 0 : DecisionLevel((*trail_)[i].Variable());</div>
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  }</div>
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  </div>
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <span class="comment">// We can't abort, So resolve the current variable.</span></div>
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a5ed9d5f5c759afe4a008adaabd80c6f8">AssignmentType</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>), <a class="code" href="structoperations__research_1_1sat_1_1_assignment_type.html#a916a0609367bae97bd6788542d4925eb">AssignmentType::kSearchDecision</a>);</div>
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> clause_used = ResolvePBConflict(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>, conflict, &slack);</div>
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  </div>
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  <span class="comment">// At this point, we have a negative slack. Note that ReduceCoefficients()</span></div>
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  <span class="comment">// will not change it. However it may change the slack value of the next</span></div>
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  <span class="comment">// iteration (when we will no longer take into account the true literal</span></div>
|
|
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <span class="comment">// with highest trail index).</span></div>
|
|
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="comment">// Note that the trail_index has already been decremented, it is why</span></div>
|
|
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  <span class="comment">// we need the +1 in the slack computation.</span></div>
|
|
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="keyword">const</span> Coefficient slack_only_for_debug =</div>
|
|
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div>
|
|
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  ? conflict->ComputeSlackForTrailPrefix(*trail_, trail_index + 1)</div>
|
|
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  : Coefficient(0);</div>
|
|
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  </div>
|
|
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  <span class="keywordflow">if</span> (clause_used) {</div>
|
|
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  <span class="comment">// If a clause was used, we know that slack has the correct value.</span></div>
|
|
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  <span class="keywordflow">if</span> (!parameters_->minimize_reduction_during_pb_resolution()) {</div>
|
|
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  conflict->ReduceCoefficients();</div>
|
|
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  }</div>
|
|
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  <span class="comment">// TODO(user): The function below can take most of the running time on</span></div>
|
|
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  <span class="comment">// some instances. The goal is to have slack updated to its new value</span></div>
|
|
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="comment">// incrementally, but we are not here yet.</span></div>
|
|
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="keywordflow">if</span> (parameters_->minimize_reduction_during_pb_resolution()) {</div>
|
|
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  slack =</div>
|
|
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  conflict->ComputeSlackForTrailPrefix(*trail_, trail_index + 1);</div>
|
|
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  slack = conflict->ReduceCoefficientsAndComputeSlackForTrailPrefix(</div>
|
|
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  *trail_, trail_index + 1);</div>
|
|
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  }</div>
|
|
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  }</div>
|
|
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(slack, slack_only_for_debug);</div>
|
|
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(slack, 0);</div>
|
|
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  <span class="keywordflow">if</span> (conflict->Rhs() < 0) {</div>
|
|
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  *pb_backjump_level = -1;</div>
|
|
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  }</div>
|
|
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  }</div>
|
|
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  }</div>
|
|
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  </div>
|
|
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="comment">// Reduce the conflit coefficients if it is not already done.</span></div>
|
|
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="comment">// This is important to avoid integer overflow.</span></div>
|
|
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  <span class="keywordflow">if</span> (!parameters_->minimize_reduction_during_pb_resolution()) {</div>
|
|
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  conflict->ReduceCoefficients();</div>
|
|
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  }</div>
|
|
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  </div>
|
|
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  <span class="comment">// Double check.</span></div>
|
|
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  <span class="comment">// The sum of the literal with level <= backjump_level must propagate.</span></div>
|
|
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  std::vector<Coefficient> sum_for_le_level(backjump_level + 2, Coefficient(0));</div>
|
|
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  std::vector<Coefficient> max_coeff_for_ge_level(backjump_level + 2,</div>
|
|
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  Coefficient(0));</div>
|
|
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="keywordtype">int</span> size = 0;</div>
|
|
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  Coefficient max_sum(0);</div>
|
|
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> : conflict->PossibleNonZeros()) {</div>
|
|
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  <span class="keyword">const</span> Coefficient coeff = conflict->GetCoefficient(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  <span class="keywordflow">if</span> (coeff == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  max_sum += coeff;</div>
|
|
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  ++size;</div>
|
|
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  <span class="keywordflow">if</span> (!trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) ||</div>
|
|
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) > backjump_level) {</div>
|
|
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  max_coeff_for_ge_level[backjump_level + 1] =</div>
|
|
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_coeff_for_ge_level[backjump_level + 1], coeff);</div>
|
|
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(conflict->GetLiteral(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>))) {</div>
|
|
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  sum_for_le_level[level] += coeff;</div>
|
|
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  }</div>
|
|
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  max_coeff_for_ge_level[level] =</div>
|
|
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_coeff_for_ge_level[level], coeff);</div>
|
|
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  }</div>
|
|
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  }</div>
|
|
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  </div>
|
|
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  <span class="comment">// Compute the cummulative version.</span></div>
|
|
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < sum_for_le_level.size(); ++i) {</div>
|
|
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  sum_for_le_level[i] += sum_for_le_level[i - 1];</div>
|
|
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  }</div>
|
|
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = max_coeff_for_ge_level.size() - 2; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  max_coeff_for_ge_level[i] =</div>
|
|
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_coeff_for_ge_level[i], max_coeff_for_ge_level[i + 1]);</div>
|
|
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  }</div>
|
|
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  </div>
|
|
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  <span class="comment">// Compute first propagation level. -1 means that the problem is UNSAT.</span></div>
|
|
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  <span class="comment">// Note that the first propagation level may be < backjump_level!</span></div>
|
|
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  <span class="keywordflow">if</span> (sum_for_le_level[0] > conflict->Rhs()) {</div>
|
|
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  *pb_backjump_level = -1;</div>
|
|
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  }</div>
|
|
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= backjump_level; ++i) {</div>
|
|
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="keyword">const</span> Coefficient level_sum = sum_for_le_level[i];</div>
|
|
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(level_sum, conflict->Rhs());</div>
|
|
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  <span class="keywordflow">if</span> (conflict->Rhs() - level_sum < max_coeff_for_ge_level[i + 1]) {</div>
|
|
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  *pb_backjump_level = i;</div>
|
|
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  }</div>
|
|
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  }</div>
|
|
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"The code should never reach here."</span>;</div>
|
|
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span> }</div>
|
|
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  </div>
|
|
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span> <span class="keywordtype">void</span> SatSolver::MinimizeConflict(</div>
|
|
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  std::vector<Literal>* conflict,</div>
|
|
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  std::vector<Literal>* reason_used_to_infer_the_conflict) {</div>
|
|
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  </div>
|
|
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_size = conflict->size();</div>
|
|
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  <span class="keywordflow">switch</span> (parameters_->minimization_algorithm()) {</div>
|
|
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  <span class="keywordflow">case</span> SatParameters::NONE:</div>
|
|
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  <span class="keywordflow">case</span> SatParameters::SIMPLE: {</div>
|
|
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  MinimizeConflictSimple(conflict);</div>
|
|
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  }</div>
|
|
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  <span class="keywordflow">case</span> SatParameters::RECURSIVE: {</div>
|
|
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  MinimizeConflictRecursively(conflict);</div>
|
|
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  }</div>
|
|
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  <span class="keywordflow">case</span> SatParameters::EXPERIMENTAL: {</div>
|
|
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  MinimizeConflictExperimental(conflict);</div>
|
|
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  }</div>
|
|
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  }</div>
|
|
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  <span class="keywordflow">if</span> (conflict->size() < old_size) {</div>
|
|
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  ++counters_.num_minimizations;</div>
|
|
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  counters_.num_literals_removed += old_size - conflict->size();</div>
|
|
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  }</div>
|
|
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span> }</div>
|
|
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  </div>
|
|
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span> <span class="comment">// This simple version just looks for any literal that is directly infered by</span></div>
|
|
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span> <span class="comment">// other literals of the conflict. It is directly infered if the literals of its</span></div>
|
|
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span> <span class="comment">// reason clause are either from level 0 or from the conflict itself.</span></div>
|
|
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span> <span class="comment">// Note that because of the assignement structure, there is no need to process</span></div>
|
|
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span> <span class="comment">// the literals of the conflict in order. While exploring the reason for a</span></div>
|
|
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span> <span class="comment">// literal assignement, there will be no cycles.</span></div>
|
|
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span> <span class="keywordtype">void</span> SatSolver::MinimizeConflictSimple(std::vector<Literal>* conflict) {</div>
|
|
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_level = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  </div>
|
|
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  <span class="comment">// Note that is_marked_ is already initialized and that we can start at 1</span></div>
|
|
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  <span class="comment">// since the first literal of the conflict is the 1-UIP literal.</span></div>
|
|
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 1;</div>
|
|
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < conflict->size(); ++i) {</div>
|
|
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = (*conflict)[i].Variable();</div>
|
|
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  <span class="keywordtype">bool</span> can_be_removed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  <span class="keywordflow">if</span> (DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>) != current_level) {</div>
|
|
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  <span class="comment">// It is important not to call Reason(var) when it can be avoided.</span></div>
|
|
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="keyword">const</span> absl::Span<const Literal> reason = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <span class="keywordflow">if</span> (!reason.empty()) {</div>
|
|
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  can_be_removed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : reason) {</div>
|
|
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <span class="keywordflow">if</span> (DecisionLevel(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  <span class="keywordflow">if</span> (!is_marked_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()]) {</div>
|
|
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  can_be_removed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  }</div>
|
|
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  }</div>
|
|
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  }</div>
|
|
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  }</div>
|
|
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  <span class="keywordflow">if</span> (!can_be_removed) {</div>
|
|
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  (*conflict)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = (*conflict)[i];</div>
|
|
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  }</div>
|
|
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  }</div>
|
|
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  conflict->erase(conflict->begin() + <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, conflict->end());</div>
|
|
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span> }</div>
|
|
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  </div>
|
|
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span> <span class="comment">// This is similar to MinimizeConflictSimple() except that for each literal of</span></div>
|
|
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span> <span class="comment">// the conflict, the literals of its reason are recursively expanded using their</span></div>
|
|
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span> <span class="comment">// reason and so on. The recusion stop until we show that the initial literal</span></div>
|
|
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span> <span class="comment">// can be infered from the conflict variables alone, or if we show that this is</span></div>
|
|
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span> <span class="comment">// not the case. The result of any variable expension will be cached in order</span></div>
|
|
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span> <span class="comment">// not to be expended again.</span></div>
|
|
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span> <span class="keywordtype">void</span> SatSolver::MinimizeConflictRecursively(std::vector<Literal>* conflict) {</div>
|
|
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  </div>
|
|
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  <span class="comment">// is_marked_ will contains all the conflict literals plus the literals that</span></div>
|
|
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  <span class="comment">// have been shown to depends only on the conflict literals. is_independent_</span></div>
|
|
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  <span class="comment">// will contains the literals that have been shown NOT to depends only on the</span></div>
|
|
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  <span class="comment">// conflict literals. The too set are exclusive for non-conflict literals, but</span></div>
|
|
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  <span class="comment">// a conflict literal (which is always marked) can be independent if we showed</span></div>
|
|
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  <span class="comment">// that it can't be removed from the clause.</span></div>
|
|
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  <span class="comment">// Optimization: There is no need to call is_marked_.ClearAndResize() or to</span></div>
|
|
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  <span class="comment">// mark the conflict literals since this was already done by</span></div>
|
|
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  <span class="comment">// ComputeFirstUIPConflict().</span></div>
|
|
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  is_independent_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(num_variables_);</div>
|
|
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  </div>
|
|
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  <span class="comment">// min_trail_index_per_level_ will always be reset to all</span></div>
|
|
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  <span class="comment">// std::numeric_limits<int>::max() at the end. This is used to prune the</span></div>
|
|
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  <span class="comment">// search because any literal at a given level with an index smaller or equal</span></div>
|
|
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  <span class="comment">// to min_trail_index_per_level_[level] can't be redundant.</span></div>
|
|
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() >= min_trail_index_per_level_.size()) {</div>
|
|
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>  min_trail_index_per_level_.resize(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() + 1,</div>
|
|
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<int>::max</a>());</div>
|
|
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  }</div>
|
|
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  </div>
|
|
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  <span class="comment">// Compute the number of variable at each decision levels. This will be used</span></div>
|
|
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  <span class="comment">// to pruned the DFS because we know that the minimized conflict will have at</span></div>
|
|
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  <span class="comment">// least one variable of each decision levels. Because such variable can't be</span></div>
|
|
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  <span class="comment">// eliminated using lower decision levels variable otherwise it will have been</span></div>
|
|
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  <span class="comment">// propagated.</span></div>
|
|
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  <span class="comment">// Note(user): Because is_marked_ may actually contains literals that are</span></div>
|
|
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  <span class="comment">// implied if the 1-UIP literal is false, we can't just iterate on the</span></div>
|
|
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  <span class="comment">// variables of the conflict here.</span></div>
|
|
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> : is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  min_trail_index_per_level_[level] = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(</div>
|
|
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  min_trail_index_per_level_[level], trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>);</div>
|
|
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  }</div>
|
|
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  </div>
|
|
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  <span class="comment">// Remove the redundant variable from the conflict. That is the ones that can</span></div>
|
|
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  <span class="comment">// be infered by some other variables in the conflict.</span></div>
|
|
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  <span class="comment">// Note that we can skip the first position since this is the 1-UIP.</span></div>
|
|
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 1;</div>
|
|
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < conflict->size(); ++i) {</div>
|
|
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = (*conflict)[i].Variable();</div>
|
|
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>() ||</div>
|
|
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> <=</div>
|
|
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  min_trail_index_per_level_[DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)] ||</div>
|
|
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  !CanBeInferedFromConflictVariables(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)) {</div>
|
|
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  <span class="comment">// Mark the conflict variable as independent. Note that is_marked_[var]</span></div>
|
|
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  <span class="comment">// will still be true.</span></div>
|
|
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  is_independent_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  (*conflict)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = (*conflict)[i];</div>
|
|
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  }</div>
|
|
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  }</div>
|
|
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  conflict->resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  </div>
|
|
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  <span class="comment">// Reset min_trail_index_per_level_. We use the sparse version only if it</span></div>
|
|
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  <span class="comment">// involves less than half the size of min_trail_index_per_level_.</span></div>
|
|
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> threshold = min_trail_index_per_level_.size() / 2;</div>
|
|
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  <span class="keywordflow">if</span> (is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>().size() < threshold) {</div>
|
|
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> : is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  min_trail_index_per_level_[DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>)] =</div>
|
|
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<int>::max</a>();</div>
|
|
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  }</div>
|
|
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  min_trail_index_per_level_.clear();</div>
|
|
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  }</div>
|
|
<div class="line"><a name="l02237"></a><span class="lineno"> 2237</span> }</div>
|
|
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  </div>
|
|
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span> <span class="keywordtype">bool</span> SatSolver::CanBeInferedFromConflictVariables(BooleanVariable variable) {</div>
|
|
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  <span class="comment">// Test for an already processed variable with the same reason.</span></div>
|
|
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  {</div>
|
|
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_marked_[variable]);</div>
|
|
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  <span class="keyword">const</span> BooleanVariable v =</div>
|
|
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  same_reason_identifier_.<a class="code" href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#a85a00c2877e3b249951022638dda5642">FirstVariableWithSameReason</a>(variable);</div>
|
|
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  <span class="keywordflow">if</span> (v != variable) <span class="keywordflow">return</span> !is_independent_[v];</div>
|
|
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  }</div>
|
|
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  </div>
|
|
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  <span class="comment">// This function implement an iterative DFS from the given variable. It uses</span></div>
|
|
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  <span class="comment">// the reason clause as adjacency lists. dfs_stack_ can be seens as the</span></div>
|
|
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  <span class="comment">// recursive call stack of the variable we are currently processing. All its</span></div>
|
|
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  <span class="comment">// adjacent variable will be pushed into variable_to_process_, and we will</span></div>
|
|
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  <span class="comment">// then dequeue them one by one and process them.</span></div>
|
|
<div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  <span class="comment">// Note(user): As of 03/2014, --cpu_profile seems to indicate that using</span></div>
|
|
<div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  <span class="comment">// dfs_stack_.assign(1, variable) is slower. My explanation is that the</span></div>
|
|
<div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  <span class="comment">// function call is not inlined.</span></div>
|
|
<div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  dfs_stack_.clear();</div>
|
|
<div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  dfs_stack_.push_back(variable);</div>
|
|
<div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  variable_to_process_.clear();</div>
|
|
<div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  variable_to_process_.push_back(variable);</div>
|
|
<div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  </div>
|
|
<div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  <span class="comment">// First we expand the reason for the given variable.</span></div>
|
|
<div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(variable)) {</div>
|
|
<div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>, variable);</div>
|
|
<div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>  <span class="keywordflow">if</span> (is_marked_[<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02267"></a><span class="lineno"> 2267</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>  <span class="keywordflow">if</span> (level == 0) {</div>
|
|
<div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>  <span class="comment">// Note that this is not needed if the solver is not configured to produce</span></div>
|
|
<div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>  <span class="comment">// an unsat proof. However, the (level == 0) test shoud always be false in</span></div>
|
|
<div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  <span class="comment">// this case because there will never be literals of level zero in any</span></div>
|
|
<div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  <span class="comment">// reason when we don't want a proof.</span></div>
|
|
<div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  }</div>
|
|
<div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> <= min_trail_index_per_level_[level] ||</div>
|
|
<div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  is_independent_[<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>]) {</div>
|
|
<div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  }</div>
|
|
<div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  variable_to_process_.push_back(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  }</div>
|
|
<div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>  </div>
|
|
<div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  <span class="comment">// Then we start the DFS.</span></div>
|
|
<div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>  <span class="keywordflow">while</span> (!variable_to_process_.empty()) {</div>
|
|
<div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  <span class="keyword">const</span> BooleanVariable current_var = variable_to_process_.back();</div>
|
|
<div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  <span class="keywordflow">if</span> (current_var == dfs_stack_.back()) {</div>
|
|
<div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  <span class="comment">// We finished the DFS of the variable dfs_stack_.back(), this can be seen</span></div>
|
|
<div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  <span class="comment">// as a recursive call terminating.</span></div>
|
|
<div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>  <span class="keywordflow">if</span> (dfs_stack_.size() > 1) {</div>
|
|
<div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!is_marked_[current_var]);</div>
|
|
<div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(current_var);</div>
|
|
<div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  }</div>
|
|
<div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  variable_to_process_.pop_back();</div>
|
|
<div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  dfs_stack_.pop_back();</div>
|
|
<div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  }</div>
|
|
<div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  </div>
|
|
<div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  <span class="comment">// If this variable became marked since the we pushed it, we can skip it.</span></div>
|
|
<div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  <span class="keywordflow">if</span> (is_marked_[current_var]) {</div>
|
|
<div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  variable_to_process_.pop_back();</div>
|
|
<div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  }</div>
|
|
<div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  </div>
|
|
<div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  <span class="comment">// This case will never be encountered since we abort right away as soon</span></div>
|
|
<div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  <span class="comment">// as an independent variable is found.</span></div>
|
|
<div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!is_independent_[current_var]);</div>
|
|
<div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  </div>
|
|
<div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  <span class="comment">// Test for an already processed variable with the same reason.</span></div>
|
|
<div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  {</div>
|
|
<div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  <span class="keyword">const</span> BooleanVariable v =</div>
|
|
<div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  same_reason_identifier_.<a class="code" href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#a85a00c2877e3b249951022638dda5642">FirstVariableWithSameReason</a>(current_var);</div>
|
|
<div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  <span class="keywordflow">if</span> (v != current_var) {</div>
|
|
<div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  <span class="keywordflow">if</span> (is_independent_[v]) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_marked_[v]);</div>
|
|
<div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  variable_to_process_.pop_back();</div>
|
|
<div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  }</div>
|
|
<div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  }</div>
|
|
<div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  </div>
|
|
<div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  <span class="comment">// Expand the variable. This can be seen as making a recursive call.</span></div>
|
|
<div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  dfs_stack_.push_back(current_var);</div>
|
|
<div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  <span class="keywordtype">bool</span> abort_early = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(current_var)) {</div>
|
|
<div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>, current_var);</div>
|
|
<div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  <span class="keywordflow">if</span> (level == 0 || is_marked_[<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> <= min_trail_index_per_level_[level] ||</div>
|
|
<div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  is_independent_[<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>]) {</div>
|
|
<div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  abort_early = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  }</div>
|
|
<div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  variable_to_process_.push_back(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  }</div>
|
|
<div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  <span class="keywordflow">if</span> (abort_early) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  }</div>
|
|
<div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  </div>
|
|
<div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  <span class="comment">// All the variable left on the dfs_stack_ are independent.</span></div>
|
|
<div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> : dfs_stack_) {</div>
|
|
<div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  is_independent_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  }</div>
|
|
<div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  <span class="keywordflow">return</span> dfs_stack_.empty();</div>
|
|
<div class="line"><a name="l02343"></a><span class="lineno"> 2343</span> }</div>
|
|
<div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  </div>
|
|
<div class="line"><a name="l02345"></a><span class="lineno"> 2345</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  </div>
|
|
<div class="line"><a name="l02347"></a><span class="lineno"> 2347</span> <span class="keyword">struct </span>WeightedVariable {</div>
|
|
<div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>  WeightedVariable(BooleanVariable v, <span class="keywordtype">int</span> w) : <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>(v), <a class="code" href="sat__solver_8cc.html#aa01147b1f07072d246c76dc85d69df7c">weight</a>(w) {}</div>
|
|
<div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  </div>
|
|
<div class="line"><a name="l02350"></a><span class="lineno"><a class="line" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f"> 2350</a></span>  BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>;</div>
|
|
<div class="line"><a name="l02351"></a><span class="lineno"><a class="line" href="sat__solver_8cc.html#aa01147b1f07072d246c76dc85d69df7c"> 2351</a></span>  <span class="keywordtype">int</span> <a class="code" href="sat__solver_8cc.html#aa01147b1f07072d246c76dc85d69df7c">weight</a>;</div>
|
|
<div class="line"><a name="l02352"></a><span class="lineno"> 2352</span> };</div>
|
|
<div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  </div>
|
|
<div class="line"><a name="l02354"></a><span class="lineno"> 2354</span> <span class="comment">// Lexical order, by larger weight, then by smaller variable number</span></div>
|
|
<div class="line"><a name="l02355"></a><span class="lineno"> 2355</span> <span class="comment">// to break ties</span></div>
|
|
<div class="line"><a name="l02356"></a><span class="lineno"> 2356</span> <span class="keyword">struct </span>VariableWithLargerWeightFirst {</div>
|
|
<div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> WeightedVariable& wv1,</div>
|
|
<div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>  <span class="keyword">const</span> WeightedVariable& wv2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  <span class="keywordflow">return</span> (wv1.weight > wv2.weight ||</div>
|
|
<div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>  (wv1.weight == wv2.weight && wv1.var < wv2.var));</div>
|
|
<div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  }</div>
|
|
<div class="line"><a name="l02362"></a><span class="lineno"> 2362</span> };</div>
|
|
<div class="line"><a name="l02363"></a><span class="lineno"> 2363</span> } <span class="comment">// namespace.</span></div>
|
|
<div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>  </div>
|
|
<div class="line"><a name="l02365"></a><span class="lineno"> 2365</span> <span class="comment">// This function allows a conflict variable to be replaced by another variable</span></div>
|
|
<div class="line"><a name="l02366"></a><span class="lineno"> 2366</span> <span class="comment">// not originally in the conflict. Greater reduction and backtracking can be</span></div>
|
|
<div class="line"><a name="l02367"></a><span class="lineno"> 2367</span> <span class="comment">// achieved this way, but the effect of this is not clear.</span></div>
|
|
<div class="line"><a name="l02368"></a><span class="lineno"> 2368</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02369"></a><span class="lineno"> 2369</span> <span class="comment">// TODO(user): More investigation needed. This seems to help on the Hanoi</span></div>
|
|
<div class="line"><a name="l02370"></a><span class="lineno"> 2370</span> <span class="comment">// problems, but degrades performance on others.</span></div>
|
|
<div class="line"><a name="l02371"></a><span class="lineno"> 2371</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l02372"></a><span class="lineno"> 2372</span> <span class="comment">// TODO(user): Find a reference for this? neither minisat nor glucose do that,</span></div>
|
|
<div class="line"><a name="l02373"></a><span class="lineno"> 2373</span> <span class="comment">// they just do MinimizeConflictRecursively() with a different implementation.</span></div>
|
|
<div class="line"><a name="l02374"></a><span class="lineno"> 2374</span> <span class="comment">// Note that their behavior also make more sense with the way they (and we) bump</span></div>
|
|
<div class="line"><a name="l02375"></a><span class="lineno"> 2375</span> <span class="comment">// the variable activities.</span></div>
|
|
<div class="line"><a name="l02376"></a><span class="lineno"> 2376</span> <span class="keywordtype">void</span> SatSolver::MinimizeConflictExperimental(std::vector<Literal>* conflict) {</div>
|
|
<div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  </div>
|
|
<div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  <span class="comment">// First, sort the variables in the conflict by decreasing decision levels.</span></div>
|
|
<div class="line"><a name="l02380"></a><span class="lineno"> 2380</span>  <span class="comment">// Also initialize is_marked_ to true for all conflict variables.</span></div>
|
|
<div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(num_variables_);</div>
|
|
<div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_level = <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  std::vector<WeightedVariable> variables_sorted_by_level;</div>
|
|
<div class="line"><a name="l02384"></a><span class="lineno"> 2384</span>  <span class="keywordflow">for</span> (Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : *conflict) {</div>
|
|
<div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = DecisionLevel(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>  <span class="keywordflow">if</span> (level < current_level) {</div>
|
|
<div class="line"><a name="l02389"></a><span class="lineno"> 2389</span>  variables_sorted_by_level.push_back(WeightedVariable(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>, level));</div>
|
|
<div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  }</div>
|
|
<div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>  }</div>
|
|
<div class="line"><a name="l02392"></a><span class="lineno"> 2392</span>  std::sort(variables_sorted_by_level.begin(), variables_sorted_by_level.end(),</div>
|
|
<div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  VariableWithLargerWeightFirst());</div>
|
|
<div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>  </div>
|
|
<div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>  <span class="comment">// Then process the reason of the variable with highest level first.</span></div>
|
|
<div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  std::vector<BooleanVariable> to_remove;</div>
|
|
<div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>  <span class="keywordflow">for</span> (WeightedVariable weighted_var : variables_sorted_by_level) {</div>
|
|
<div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> = weighted_var.var;</div>
|
|
<div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  </div>
|
|
<div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>  <span class="comment">// A nullptr reason means that this was a decision variable from the</span></div>
|
|
<div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  <span class="comment">// previous levels.</span></div>
|
|
<div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>  <span class="keyword">const</span> absl::Span<const Literal> reason = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">Reason</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  <span class="keywordflow">if</span> (reason.empty()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02404"></a><span class="lineno"> 2404</span>  </div>
|
|
<div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  <span class="comment">// Compute how many and which literals from the current reason do not appear</span></div>
|
|
<div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  <span class="comment">// in the current conflict. Level 0 literals are ignored.</span></div>
|
|
<div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  std::vector<Literal> not_contained_literals;</div>
|
|
<div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal reason_literal : reason) {</div>
|
|
<div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  <span class="keyword">const</span> BooleanVariable reason_var = reason_literal.Variable();</div>
|
|
<div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>  </div>
|
|
<div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  <span class="comment">// We ignore level 0 variables.</span></div>
|
|
<div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  <span class="keywordflow">if</span> (DecisionLevel(reason_var) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  </div>
|
|
<div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  <span class="comment">// We have a reason literal whose variable is not yet seen.</span></div>
|
|
<div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>  <span class="comment">// If there is more than one, break right away, we will not minimize the</span></div>
|
|
<div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  <span class="comment">// current conflict with this variable.</span></div>
|
|
<div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  <span class="keywordflow">if</span> (!is_marked_[reason_var]) {</div>
|
|
<div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  not_contained_literals.push_back(reason_literal);</div>
|
|
<div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  <span class="keywordflow">if</span> (not_contained_literals.size() > 1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  }</div>
|
|
<div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  }</div>
|
|
<div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  <span class="keywordflow">if</span> (not_contained_literals.empty()) {</div>
|
|
<div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  <span class="comment">// This variable will be deleted from the conflict. Note that we don't</span></div>
|
|
<div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  <span class="comment">// unmark it. This is because this variable can be infered from the other</span></div>
|
|
<div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  <span class="comment">// variables in the conflict, so it is okay to skip it when processing the</span></div>
|
|
<div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  <span class="comment">// reasons of other variables.</span></div>
|
|
<div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  to_remove.push_back(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (not_contained_literals.size() == 1) {</div>
|
|
<div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  <span class="comment">// Replace the literal from variable var with the only</span></div>
|
|
<div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  <span class="comment">// not_contained_literals from the current reason.</span></div>
|
|
<div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  to_remove.push_back(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(not_contained_literals.front().Variable());</div>
|
|
<div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  conflict->push_back(not_contained_literals.front());</div>
|
|
<div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  }</div>
|
|
<div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  }</div>
|
|
<div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  </div>
|
|
<div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  <span class="comment">// Unmark the variable that should be removed from the conflict.</span></div>
|
|
<div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a> : to_remove) {</div>
|
|
<div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  is_marked_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">Clear</a>(<a class="code" href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a>);</div>
|
|
<div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  }</div>
|
|
<div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  </div>
|
|
<div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  <span class="comment">// Remove the now unmarked literals from the conflict.</span></div>
|
|
<div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < conflict->size(); ++i) {</div>
|
|
<div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>  <span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = (*conflict)[i];</div>
|
|
<div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  <span class="keywordflow">if</span> (is_marked_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()]) {</div>
|
|
<div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>  (*conflict)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div>
|
|
<div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  }</div>
|
|
<div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  }</div>
|
|
<div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  conflict->erase(conflict->begin() + <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, conflict->end());</div>
|
|
<div class="line"><a name="l02452"></a><span class="lineno"> 2452</span> }</div>
|
|
<div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  </div>
|
|
<div class="line"><a name="l02454"></a><span class="lineno"> 2454</span> <span class="keywordtype">void</span> SatSolver::CleanClauseDatabaseIfNeeded() {</div>
|
|
<div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>  <span class="keywordflow">if</span> (num_learned_clause_before_cleanup_ > 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  </div>
|
|
<div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>  <span class="comment">// Creates a list of clauses that can be deleted. Note that only the clauses</span></div>
|
|
<div class="line"><a name="l02459"></a><span class="lineno"> 2459</span>  <span class="comment">// that appear in clauses_info can potentially be removed.</span></div>
|
|
<div class="line"><a name="l02460"></a><span class="lineno"> 2460</span>  <span class="keyword">typedef</span> std::pair<SatClause*, ClauseInfo> Entry;</div>
|
|
<div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>  std::vector<Entry> entries;</div>
|
|
<div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  <span class="keyword">auto</span>& clauses_info = *(clauses_propagator_-><a class="code" href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">mutable_clauses_info</a>());</div>
|
|
<div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& entry : clauses_info) {</div>
|
|
<div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  <span class="keywordflow">if</span> (ClauseIsUsedAsReason(entry.first)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  <span class="keywordflow">if</span> (entry.second.protected_during_next_cleanup) {</div>
|
|
<div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  entry.second.protected_during_next_cleanup = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  }</div>
|
|
<div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  entries.push_back(entry);</div>
|
|
<div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  }</div>
|
|
<div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_protected_clauses = clauses_info.size() - entries.size();</div>
|
|
<div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  </div>
|
|
<div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  <span class="keywordflow">if</span> (parameters_->clause_cleanup_ordering() == SatParameters::CLAUSE_LBD) {</div>
|
|
<div class="line"><a name="l02474"></a><span class="lineno"> 2474</span>  <span class="comment">// Order the clauses by decreasing LBD and then increasing activity.</span></div>
|
|
<div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  std::sort(entries.begin(), entries.end(),</div>
|
|
<div class="line"><a name="l02476"></a><span class="lineno"> 2476</span>  [](<span class="keyword">const</span> Entry& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> Entry& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  if (a.second.lbd == b.second.lbd) {</div>
|
|
<div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  return a.second.activity < b.second.activity;</div>
|
|
<div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>  }</div>
|
|
<div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.second.lbd > <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.second.lbd;</div>
|
|
<div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  });</div>
|
|
<div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  <span class="comment">// Order the clauses by increasing activity and then decreasing LBD.</span></div>
|
|
<div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  std::sort(entries.begin(), entries.end(),</div>
|
|
<div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>  [](<span class="keyword">const</span> Entry& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> Entry& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>  if (a.second.activity == b.second.activity) {</div>
|
|
<div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>  return a.second.lbd > b.second.lbd;</div>
|
|
<div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>  }</div>
|
|
<div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.second.activity < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.second.activity;</div>
|
|
<div class="line"><a name="l02490"></a><span class="lineno"> 2490</span>  });</div>
|
|
<div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>  }</div>
|
|
<div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>  </div>
|
|
<div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  <span class="comment">// The clause we want to keep are at the end of the vector.</span></div>
|
|
<div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  <span class="keywordtype">int</span> num_kept_clauses = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(entries.size()),</div>
|
|
<div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  parameters_->clause_cleanup_target());</div>
|
|
<div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  <span class="keywordtype">int</span> num_deleted_clauses = entries.size() - num_kept_clauses;</div>
|
|
<div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  </div>
|
|
<div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>  <span class="comment">// Tricky: Because the order of the clauses_info iteration is NOT</span></div>
|
|
<div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  <span class="comment">// deterministic (pointer keys), we also keep all the clauses which have the</span></div>
|
|
<div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>  <span class="comment">// same LBD and activity as the last one so the behavior is deterministic.</span></div>
|
|
<div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  <span class="keywordflow">while</span> (num_deleted_clauses > 0) {</div>
|
|
<div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  <span class="keyword">const</span> ClauseInfo& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> = entries[num_deleted_clauses].second;</div>
|
|
<div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  <span class="keyword">const</span> ClauseInfo& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a> = entries[num_deleted_clauses - 1].second;</div>
|
|
<div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.activity != <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.activity || <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.lbd != <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.lbd) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02505"></a><span class="lineno"> 2505</span>  --num_deleted_clauses;</div>
|
|
<div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  ++num_kept_clauses;</div>
|
|
<div class="line"><a name="l02507"></a><span class="lineno"> 2507</span>  }</div>
|
|
<div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  <span class="keywordflow">if</span> (num_deleted_clauses > 0) {</div>
|
|
<div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>  entries.resize(num_deleted_clauses);</div>
|
|
<div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Entry& entry : entries) {</div>
|
|
<div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>  SatClause* clause = entry.first;</div>
|
|
<div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>  counters_.num_literals_forgotten += clause->size();</div>
|
|
<div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  clauses_propagator_->LazyDetach(clause);</div>
|
|
<div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  }</div>
|
|
<div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  clauses_propagator_->CleanUpWatchers();</div>
|
|
<div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>  </div>
|
|
<div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  <span class="comment">// TODO(user): If the need arise, we could avoid this linear scan on the</span></div>
|
|
<div class="line"><a name="l02518"></a><span class="lineno"> 2518</span>  <span class="comment">// full list of clauses by not keeping the clauses from clauses_info there.</span></div>
|
|
<div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  <span class="keywordflow">if</span> (!block_clause_deletion_) {</div>
|
|
<div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>  clauses_propagator_->DeleteRemovedClauses();</div>
|
|
<div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  }</div>
|
|
<div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  }</div>
|
|
<div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>  </div>
|
|
<div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  num_learned_clause_before_cleanup_ = parameters_->clause_cleanup_period();</div>
|
|
<div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Database cleanup, #protected:"</span> << num_protected_clauses</div>
|
|
<div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>  << <span class="stringliteral">" #kept:"</span> << num_kept_clauses</div>
|
|
<div class="line"><a name="l02527"></a><span class="lineno"> 2527</span>  << <span class="stringliteral">" #deleted:"</span> << num_deleted_clauses;</div>
|
|
<div class="line"><a name="l02528"></a><span class="lineno"> 2528</span> }</div>
|
|
<div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  </div>
|
|
<div class="line"><a name="l02530"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc"> 2530</a></span> std::string <a class="code" href="namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc">SatStatusString</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> status) {</div>
|
|
<div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  <span class="keywordflow">switch</span> (status) {</div>
|
|
<div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  <span class="keywordflow">case</span> SatSolver::ASSUMPTIONS_UNSAT:</div>
|
|
<div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  <span class="keywordflow">return</span> <span class="stringliteral">"ASSUMPTIONS_UNSAT"</span>;</div>
|
|
<div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  <span class="keywordflow">case</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">SatSolver::INFEASIBLE</a>:</div>
|
|
<div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>  <span class="keywordflow">return</span> <span class="stringliteral">"INFEASIBLE"</span>;</div>
|
|
<div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  <span class="keywordflow">case</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>:</div>
|
|
<div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  <span class="keywordflow">return</span> <span class="stringliteral">"FEASIBLE"</span>;</div>
|
|
<div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  <span class="keywordflow">case</span> SatSolver::LIMIT_REACHED:</div>
|
|
<div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  <span class="keywordflow">return</span> <span class="stringliteral">"LIMIT_REACHED"</span>;</div>
|
|
<div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  }</div>
|
|
<div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  <span class="comment">// Fallback. We don't use "default:" so the compiler will return an error</span></div>
|
|
<div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>  <span class="comment">// if we forgot one enum case above.</span></div>
|
|
<div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Invalid SatSolver::Status "</span> << status;</div>
|
|
<div class="line"><a name="l02544"></a><span class="lineno"> 2544</span>  <span class="keywordflow">return</span> <span class="stringliteral">"UNKNOWN"</span>;</div>
|
|
<div class="line"><a name="l02545"></a><span class="lineno"> 2545</span> }</div>
|
|
<div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  </div>
|
|
<div class="line"><a name="l02547"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492"> 2547</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492">MinimizeCore</a>(<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver, std::vector<Literal>* core) {</div>
|
|
<div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>  std::vector<Literal> temp = *core;</div>
|
|
<div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>  std::reverse(temp.begin(), temp.end());</div>
|
|
<div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">Backtrack</a>(0);</div>
|
|
<div class="line"><a name="l02551"></a><span class="lineno"> 2551</span>  solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">SetAssumptionLevel</a>(0);</div>
|
|
<div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>  </div>
|
|
<div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  <span class="comment">// Note that this Solve() is really fast, since the solver should detect that</span></div>
|
|
<div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  <span class="comment">// the assumptions are unsat with unit propagation only. This is just a</span></div>
|
|
<div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>  <span class="comment">// convenient way to remove assumptions that are propagated by the one before</span></div>
|
|
<div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  <span class="comment">// them.</span></div>
|
|
<div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> status =</div>
|
|
<div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">ResetAndSolveWithGivenAssumptions</a>(temp);</div>
|
|
<div class="line"><a name="l02559"></a><span class="lineno"> 2559</span>  <span class="keywordflow">if</span> (status != SatSolver::ASSUMPTIONS_UNSAT) {</div>
|
|
<div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  <span class="keywordflow">if</span> (status != SatSolver::LIMIT_REACHED) {</div>
|
|
<div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(status, <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1">SatSolver::FEASIBLE</a>);</div>
|
|
<div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  <span class="comment">// This should almost never happen, but it is not impossible. The reason</span></div>
|
|
<div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>  <span class="comment">// is that the solver may delete some learned clauses required by the unit</span></div>
|
|
<div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  <span class="comment">// propagation to show that the core is unsat.</span></div>
|
|
<div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"This should only happen rarely! otherwise, investigate. "</span></div>
|
|
<div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  << <span class="stringliteral">"Returned status is "</span> << <a class="code" href="namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc">SatStatusString</a>(status);</div>
|
|
<div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  }</div>
|
|
<div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>  }</div>
|
|
<div class="line"><a name="l02570"></a><span class="lineno"> 2570</span>  temp = solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">GetLastIncompatibleDecisions</a>();</div>
|
|
<div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>  <span class="keywordflow">if</span> (temp.size() < core->size()) {</div>
|
|
<div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"minimization "</span> << core->size() << <span class="stringliteral">" -> "</span> << temp.size();</div>
|
|
<div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  std::reverse(temp.begin(), temp.end());</div>
|
|
<div class="line"><a name="l02574"></a><span class="lineno"> 2574</span>  *core = temp;</div>
|
|
<div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  }</div>
|
|
<div class="line"><a name="l02576"></a><span class="lineno"> 2576</span> }</div>
|
|
<div class="line"><a name="l02577"></a><span class="lineno"> 2577</span>  </div>
|
|
<div class="line"><a name="l02578"></a><span class="lineno"> 2578</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l02579"></a><span class="lineno"> 2579</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclass_wall_timer_html_a6bdbb9a2345c126ae0d72b1e2a9a21d5"><div class="ttname"><a href="class_wall_timer.html#a6bdbb9a2345c126ae0d72b1e2a9a21d5">WallTimer::Restart</a></div><div class="ttdeci">void Restart()</div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00035">timer.h:35</a></div></div>
|
|
<div class="ttc" id="aclass_wall_timer_html_aec56fe080959ecebec3feaed9dafde84"><div class="ttname"><a href="class_wall_timer.html#aec56fe080959ecebec3feaed9dafde84">WallTimer::Get</a></div><div class="ttdeci">double Get() const</div><div class="ttdef"><b>Definition:</b> <a href="timer_8h_source.html#l00045">timer.h:45</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00813">bitset.h:813</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">operations_research::SparseBitset::Set</a></div><div class="ttdeci">void Set(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00803">bitset.h:803</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a838e4744903ec12e6ebcf2999f4a90df"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a838e4744903ec12e6ebcf2999f4a90df">operations_research::SparseBitset::NumberOfSetCallsWithDifferentArguments</a></div><div class="ttdeci">int NumberOfSetCallsWithDifferentArguments() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00810">bitset.h:810</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ab465e925b8a535e5de8a072174ecafda"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ab465e925b8a535e5de8a072174ecafda">operations_research::SparseBitset::Clear</a></div><div class="ttdeci">void Clear(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00809">bitset.h:809</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ae09e38958e558d2c776bc555a0dc2fc7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">operations_research::SparseBitset::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00778">bitset.h:778</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_stats_group_html_af9bc435481ae9e6e60d66a65d5394a7f"><div class="ttname"><a href="classoperations__research_1_1_stats_group.html#af9bc435481ae9e6e60d66a65d5394a7f">operations_research::StatsGroup::StatString</a></div><div class="ttdeci">std::string StatString() const</div><div class="ttdef"><b>Definition:</b> <a href="stats_8cc_source.html#l00071">stats.cc:71</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_a312550ebabce586fb77c49e813c610f8"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a312550ebabce586fb77c49e813c610f8">operations_research::TimeLimit::ResetLimitFromParameters</a></div><div class="ttdeci">void ResetLimitFromParameters(const Parameters &parameters)</div><div class="ttdoc">Sets new time limits.</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00505">time_limit.h:505</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">operations_research::TimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached()</div><div class="ttdoc">Returns true when the external limit is true, or the deterministic time is over the deterministic lim...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00532">time_limit.h:532</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a04c08271d60e84b5610ec8ed9bd7b9dc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a04c08271d60e84b5610ec8ed9bd7b9dc">operations_research::sat::BinaryClauseManager::newly_added</a></div><div class="ttdeci">const std::vector< BinaryClause > & newly_added() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00403">clause.h:403</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a4690b2e5ad68f70322cca80950f5bf7d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a4690b2e5ad68f70322cca80950f5bf7d">operations_research::sat::BinaryClauseManager::Add</a></div><div class="ttdeci">bool Add(BinaryClause c)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00391">clause.h:391</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_clause_manager_html_a47e143bc6df345d913315f79e0c3d290"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_clause_manager.html#a47e143bc6df345d913315f79e0c3d290">operations_research::sat::BinaryClauseManager::ClearNewlyAdded</a></div><div class="ttdeci">void ClearNewlyAdded()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00404">clause.h:404</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html">operations_research::sat::BinaryImplicationGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00456">clause.h:456</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a226de3db7ac8ac7a33cd682911672830"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a226de3db7ac8ac7a33cd682911672830">operations_research::sat::BinaryImplicationGraph::num_inspections</a></div><div class="ttdeci">int64 num_inspections() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00608">clause.h:608</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a26fc07b3630b79be6914e6387b63a073"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a26fc07b3630b79be6914e6387b63a073">operations_research::sat::BinaryImplicationGraph::AddBinaryClause</a></div><div class="ttdeci">void AddBinaryClause(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00491">clause.cc:491</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a29701fe3514ad84a5e8ad3e925cf3804"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a29701fe3514ad84a5e8ad3e925cf3804">operations_research::sat::BinaryImplicationGraph::num_literals_removed</a></div><div class="ttdeci">int64 num_literals_removed() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00612">clause.h:612</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a311c7dc55d8a10542d54dfeabca48450"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a311c7dc55d8a10542d54dfeabca48450">operations_research::sat::BinaryImplicationGraph::MinimizeConflictWithReachability</a></div><div class="ttdeci">void MinimizeConflictWithReachability(std::vector< Literal > *c)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00754">clause.cc:754</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a357657ded604ecb97b76251146f7ac75"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a357657ded604ecb97b76251146f7ac75">operations_research::sat::BinaryImplicationGraph::IsEmpty</a></div><div class="ttdeci">bool IsEmpty()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00483">clause.h:483</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a3f25e4bf6f5972768cb431e51ac01b82"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a3f25e4bf6f5972768cb431e51ac01b82">operations_research::sat::BinaryImplicationGraph::num_minimization</a></div><div class="ttdeci">int64 num_minimization() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00611">clause.h:611</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a4a2107f2a0daf6968b6c0dded5964497"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a4a2107f2a0daf6968b6c0dded5964497">operations_research::sat::BinaryImplicationGraph::AddBinaryClauseDuringSearch</a></div><div class="ttdeci">bool AddBinaryClauseDuringSearch(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00508">clause.cc:508</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a6cbb84e00be8d376ad8bf7d0e333a46a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6cbb84e00be8d376ad8bf7d0e333a46a">operations_research::sat::BinaryImplicationGraph::MinimizeConflictFirstWithTransitiveReduction</a></div><div class="ttdeci">void MinimizeConflictFirstWithTransitiveReduction(const Trail &trail, std::vector< Literal > *c, SparseBitset< BooleanVariable > *marked, absl::BitGenRef random)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00849">clause.cc:849</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a6dcddbd6c9e8a05ca2170a13c9ff8cbb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a6dcddbd6c9e8a05ca2170a13c9ff8cbb">operations_research::sat::BinaryImplicationGraph::num_implications</a></div><div class="ttdeci">int64 num_implications() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00635">clause.h:635</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a7b5f3592cdf12c0df22b6583b3e9ed61"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a7b5f3592cdf12c0df22b6583b3e9ed61">operations_research::sat::BinaryImplicationGraph::num_propagations</a></div><div class="ttdeci">int64 num_propagations() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00605">clause.h:605</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a95cb5284ae22d2cbca6cd69a275d8a98"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#a95cb5284ae22d2cbca6cd69a275d8a98">operations_research::sat::BinaryImplicationGraph::MinimizeConflictFirst</a></div><div class="ttdeci">void MinimizeConflictFirst(const Trail &trail, std::vector< Literal > *c, SparseBitset< BooleanVariable > *marked)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00831">clause.cc:831</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_abcad56047cef75a12528fe99794a6e1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#abcad56047cef75a12528fe99794a6e1e">operations_research::sat::BinaryImplicationGraph::RemoveFixedVariables</a></div><div class="ttdeci">void RemoveFixedVariables()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00962">clause.cc:962</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_ac40b290f8a1345fdf85dd5ca6e185f4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#ac40b290f8a1345fdf85dd5ca6e185f4f">operations_research::sat::BinaryImplicationGraph::num_redundant_implications</a></div><div class="ttdeci">int64 num_redundant_implications() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00627">clause.h:627</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_aec717d6bc59b3b48bb21276a081c62c1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#aec717d6bc59b3b48bb21276a081c62c1">operations_research::sat::BinaryImplicationGraph::AddAtMostOne</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool AddAtMostOne(absl::Span< const Literal > at_most_one)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00531">clause.cc:531</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_af30fd0373e896f83bb84d2295a310492"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af30fd0373e896f83bb84d2295a310492">operations_research::sat::BinaryImplicationGraph::MinimizeConflictExperimental</a></div><div class="ttdeci">void MinimizeConflictExperimental(const Trail &trail, std::vector< Literal > *c)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00911">clause.cc:911</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_binary_implication_graph.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::BinaryImplicationGraph::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00477">clause.cc:477</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_proof_handler_html_a18349231154d0f5eaee94fe213f347e6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a18349231154d0f5eaee94fe213f347e6">operations_research::sat::DratProofHandler::DeleteClause</a></div><div class="ttdeci">void DeleteClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__proof__handler_8cc_source.html#l00082">drat_proof_handler.cc:82</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_proof_handler_html_a98bacf41c50979896b4a5f5e41fb0ccf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_proof_handler.html#a98bacf41c50979896b4a5f5e41fb0ccf">operations_research::sat::DratProofHandler::AddClause</a></div><div class="ttdeci">void AddClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="drat__proof__handler_8cc_source.html#l00072">drat_proof_handler.cc:72</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00064">sat_base.h:64</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a6a5dcff82096cd7a7147bf996dbaa5a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">operations_research::sat::Literal::Variable</a></div><div class="ttdeci">BooleanVariable Variable() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00080">sat_base.h:80</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00091">sat_base.h:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html">operations_research::sat::LiteralWatchers</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00160">clause.h:160</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a0569d77056e622964bd02dd901950ede"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a0569d77056e622964bd02dd901950ede">operations_research::sat::LiteralWatchers::AllClausesInCreationOrder</a></div><div class="ttdeci">const std::vector< SatClause * > & AllClausesInCreationOrder() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00211">clause.h:211</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a1ba4013455d8c21e62115060dabf9364"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a1ba4013455d8c21e62115060dabf9364">operations_research::sat::LiteralWatchers::mutable_clauses_info</a></div><div class="ttdeci">absl::flat_hash_map< SatClause *, ClauseInfo > * mutable_clauses_info()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00223">clause.h:223</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a6af58ea401f90fe1a40be4558dba478a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a6af58ea401f90fe1a40be4558dba478a">operations_research::sat::LiteralWatchers::AddRemovableClause</a></div><div class="ttdeci">SatClause * AddRemovableClause(const std::vector< Literal > &literals, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00212">clause.cc:212</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a75eea7bb53aaf332edafd3a6c1dffdeb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a75eea7bb53aaf332edafd3a6c1dffdeb">operations_research::sat::LiteralWatchers::num_removable_clauses</a></div><div class="ttdeci">int64 num_removable_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00222">clause.h:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a818f775987a7cd9a94b6616bd2e5e1cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a818f775987a7cd9a94b6616bd2e5e1cc">operations_research::sat::LiteralWatchers::num_clauses</a></div><div class="ttdeci">int64 num_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00210">clause.h:210</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a88608365af082d6228a4e75955e6dc31"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a88608365af082d6228a4e75955e6dc31">operations_research::sat::LiteralWatchers::num_inspected_clauses</a></div><div class="ttdeci">int64 num_inspected_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00228">clause.h:228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_a90d7f1e5714fb18a623b54a9148d636d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#a90d7f1e5714fb18a623b54a9148d636d">operations_research::sat::LiteralWatchers::num_watched_clauses</a></div><div class="ttdeci">int64 num_watched_clauses() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00237">clause.h:237</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aa21bc79521e779410da749e892e004db"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aa21bc79521e779410da749e892e004db">operations_research::sat::LiteralWatchers::num_inspected_clause_literals</a></div><div class="ttdeci">int64 num_inspected_clause_literals() const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00229">clause.h:229</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aab21bb15f39af99c400610195b7c682d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aab21bb15f39af99c400610195b7c682d">operations_research::sat::LiteralWatchers::NextClauseToMinimize</a></div><div class="ttdeci">SatClause * NextClauseToMinimize()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00246">clause.h:246</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aaec5e05be5e5e385c6222c023587cb05"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaec5e05be5e5e385c6222c023587cb05">operations_research::sat::LiteralWatchers::AddClause</a></div><div class="ttdeci">bool AddClause(absl::Span< const Literal > literals, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00205">clause.cc:205</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_aaf9f3bc83c843a94dd2240e2a81a5e3b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#aaf9f3bc83c843a94dd2240e2a81a5e3b">operations_research::sat::LiteralWatchers::ReasonClause</a></div><div class="ttdeci">SatClause * ReasonClause(int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00197">clause.cc:197</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab054db78fc1b1e1681d2fc4e9fd1ca45"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45">operations_research::sat::LiteralWatchers::IsRemovable</a></div><div class="ttdeci">bool IsRemovable(SatClause *const clause) const</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00219">clause.h:219</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab17b31190c5ab58a1334139848335283"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab17b31190c5ab58a1334139848335283">operations_research::sat::LiteralWatchers::InprocessingRewriteClause</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool InprocessingRewriteClause(SatClause *clause, absl::Span< const Literal > new_clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00367">clause.cc:367</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ab6bd51395bef8b42ac66ad9b52635084"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ab6bd51395bef8b42ac66ad9b52635084">operations_research::sat::LiteralWatchers::LazyDetach</a></div><div class="ttdeci">void LazyDetach(SatClause *clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00294">clause.cc:294</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ada4c57ad822069c6c61a93973dc39c4d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ada4c57ad822069c6c61a93973dc39c4d">operations_research::sat::LiteralWatchers::ResetToMinimizeIndex</a></div><div class="ttdeci">void ResetToMinimizeIndex()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00257">clause.h:257</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ae234022ee7c496416290d1946f56e1ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad">operations_research::sat::LiteralWatchers::DeleteRemovedClauses</a></div><div class="ttdeci">void DeleteRemovedClauses()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00454">clause.cc:454</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_ae57f3c4e72eb63a34fa09e707a18e6d3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#ae57f3c4e72eb63a34fa09e707a18e6d3">operations_research::sat::LiteralWatchers::CleanUpWatchers</a></div><div class="ttdeci">void CleanUpWatchers()</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00441">clause.cc:441</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_af3769ff2cdf469ae4a13cc4f6b15bc14"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#af3769ff2cdf469ae4a13cc4f6b15bc14">operations_research::sat::LiteralWatchers::Detach</a></div><div class="ttdeci">void Detach(SatClause *clause)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00301">clause.cc:301</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_watchers_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal_watchers.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::LiteralWatchers::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="clause_8cc_source.html#l00069">clause.cc:69</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html_a7fac5de5604ea8668bc414536e8aa7ee"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html#a7fac5de5604ea8668bc414536e8aa7ee">operations_research::sat::Model::Register</a></div><div class="ttdeci">void Register(T *non_owned_class)</div><div class="ttdoc">Register a non-owned class that will be "singleton" in the model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00169">sat/model.h:169</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html_a8d72645353ea6770911c4e0724995ed6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">operations_research::sat::Model::GetOrCreate</a></div><div class="ttdeci">T * GetOrCreate()</div><div class="ttdoc">Returns an object of type T that is unique to this model (like a "local" singleton).</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00106">sat/model.h:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a3061094c37b507ae2834cb7d86fbcf39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">operations_research::sat::MutableUpperBoundedLinearConstraint::ComputeSlackForTrailPrefix</a></div><div class="ttdeci">Coefficient ComputeSlackForTrailPrefix(const Trail &trail, int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00290">pb_constraint.cc:290</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a4556e82417879ecf2bf14a4ee7bfce9e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a4556e82417879ecf2bf14a4ee7bfce9e">operations_research::sat::MutableUpperBoundedLinearConstraint::Rhs</a></div><div class="ttdeci">Coefficient Rhs() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00268">pb_constraint.h:268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_aaff50cb53673c51920c6bcb567ca8806"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aaff50cb53673c51920c6bcb567ca8806">operations_research::sat::MutableUpperBoundedLinearConstraint::AddTerm</a></div><div class="ttdeci">void AddTerm(Literal literal, Coefficient coeff)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00273">pb_constraint.h:273</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ac4fb16d0641ccef0502adb8bbe3909af"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac4fb16d0641ccef0502adb8bbe3909af">operations_research::sat::MutableUpperBoundedLinearConstraint::AddToRhs</a></div><div class="ttdeci">void AddToRhs(Coefficient value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00264">pb_constraint.h:264</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ac85244c6eaf57970b2057657ae70ee17"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac85244c6eaf57970b2057657ae70ee17">operations_research::sat::MutableUpperBoundedLinearConstraint::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00239">pb_constraint.cc:239</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ad49fd13bba7789f08d81d6c71d856082"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad49fd13bba7789f08d81d6c71d856082">operations_research::sat::MutableUpperBoundedLinearConstraint::CopyIntoVector</a></div><div class="ttdeci">void CopyIntoVector(std::vector< LiteralWithCoeff > *output)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00370">pb_constraint.cc:370</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html">operations_research::sat::PbConstraints</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00515">pb_constraint.h:515</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a18ab319435ed80315e0c35ca40a7c2a0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a18ab319435ed80315e0c35ca40a7c2a0">operations_research::sat::PbConstraints::NumberOfConstraints</a></div><div class="ttdeci">int NumberOfConstraints() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00572">pb_constraint.h:572</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a31db3a3e839ea89186d44f0f3025f506"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a31db3a3e839ea89186d44f0f3025f506">operations_research::sat::PbConstraints::num_threshold_updates</a></div><div class="ttdeci">int64 num_threshold_updates() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00606">pb_constraint.h:606</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a5116e268e9144cf6ee197450e0eda486"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a5116e268e9144cf6ee197450e0eda486">operations_research::sat::PbConstraints::ClearConflictingConstraint</a></div><div class="ttdeci">void ClearConflictingConstraint()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00579">pb_constraint.h:579</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a668f93c96cd8a83dd4bf3da35ba8b7b0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a668f93c96cd8a83dd4bf3da35ba8b7b0">operations_research::sat::PbConstraints::AddConstraint</a></div><div class="ttdeci">bool AddConstraint(const std::vector< LiteralWithCoeff > &cst, Coefficient rhs, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00824">pb_constraint.cc:824</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a9699443a7a311c163aa4ef9990f493a4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a9699443a7a311c163aa4ef9990f493a4">operations_research::sat::PbConstraints::num_inspected_constraint_literals</a></div><div class="ttdeci">int64 num_inspected_constraint_literals() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00603">pb_constraint.h:603</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a991506896584b01b214102ac3ed2ddb5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a991506896584b01b214102ac3ed2ddb5">operations_research::sat::PbConstraints::num_constraint_lookups</a></div><div class="ttdeci">int64 num_constraint_lookups() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00602">pb_constraint.h:602</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_aa3bdbedb1d2e7db11727770605cee8cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#aa3bdbedb1d2e7db11727770605cee8cc">operations_research::sat::PbConstraints::ConflictingConstraint</a></div><div class="ttdeci">UpperBoundedLinearConstraint * ConflictingConstraint()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00580">pb_constraint.h:580</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ab00d5c5d5edf37a9568363ba39e02c11"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ab00d5c5d5edf37a9568363ba39e02c11">operations_research::sat::PbConstraints::ReasonPbConstraint</a></div><div class="ttdeci">UpperBoundedLinearConstraint * ReasonPbConstraint(int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00977">pb_constraint.cc:977</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ad064f7982ad8af720e437b82380b629f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ad064f7982ad8af720e437b82380b629f">operations_research::sat::PbConstraints::UpdateActivityIncrement</a></div><div class="ttdeci">void UpdateActivityIncrement()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l01084">pb_constraint.cc:1084</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ae087fb0f8731e64e65fb00e517fe8966"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae087fb0f8731e64e65fb00e517fe8966">operations_research::sat::PbConstraints::BumpActivity</a></div><div class="ttdeci">void BumpActivity(UpperBoundedLinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l01067">pb_constraint.cc:1067</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::PbConstraints::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00543">pb_constraint.h:543</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_afea0121eba5886052ba91716acf7f29f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#afea0121eba5886052ba91716acf7f29f">operations_research::sat::PbConstraints::AddLearnedConstraint</a></div><div class="ttdeci">bool AddLearnedConstraint(const std::vector< LiteralWithCoeff > &cst, Coefficient rhs, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00885">pb_constraint.cc:885</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_restart_policy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html">operations_research::sat::RestartPolicy</a></div><div class="ttdef"><b>Definition:</b> <a href="restart_8h_source.html#l00029">restart.h:29</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_restart_policy_html_a372de693ad40b3f42839c8ec6ac845f4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html#a372de693ad40b3f42839c8ec6ac845f4">operations_research::sat::RestartPolicy::Reset</a></div><div class="ttdeci">void Reset()</div><div class="ttdef"><b>Definition:</b> <a href="restart_8cc_source.html#l00023">restart.cc:23</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_restart_policy_html_a3b30aa3a72ace837ddc29fd371c6e46e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html#a3b30aa3a72ace837ddc29fd371c6e46e">operations_research::sat::RestartPolicy::InfoString</a></div><div class="ttdeci">std::string InfoString() const</div><div class="ttdef"><b>Definition:</b> <a href="restart_8cc_source.html#l00173">restart.cc:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_restart_policy_html_a6656a848070cf8e91a9af92feee0477c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html#a6656a848070cf8e91a9af92feee0477c">operations_research::sat::RestartPolicy::OnConflict</a></div><div class="ttdeci">void OnConflict(int conflict_trail_index, int conflict_decision_level, int conflict_lbd)</div><div class="ttdef"><b>Definition:</b> <a href="restart_8cc_source.html#l00144">restart.cc:144</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_restart_policy_html_a9a4dbc2c6849f437d4f08288eeffbfed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html#a9a4dbc2c6849f437d4f08288eeffbfed">operations_research::sat::RestartPolicy::ShouldRestart</a></div><div class="ttdeci">bool ShouldRestart()</div><div class="ttdef"><b>Definition:</b> <a href="restart_8cc_source.html#l00081">restart.cc:81</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_restart_policy_html_aea2ab8041aa76772ba75a3ca8c2cfd81"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_restart_policy.html#aea2ab8041aa76772ba75a3ca8c2cfd81">operations_research::sat::RestartPolicy::NumRestarts</a></div><div class="ttdeci">int NumRestarts() const</div><div class="ttdef"><b>Definition:</b> <a href="restart_8h_source.html#l00052">restart.h:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_clause_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_clause.html">operations_research::sat::SatClause</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00051">clause.h:51</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html">operations_research::sat::SatDecisionPolicy</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8h_source.html#l00034">sat_decision.h:34</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a19614231a107b165113595bf8edf60bf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a19614231a107b165113595bf8edf60bf">operations_research::sat::SatDecisionPolicy::IncreaseNumVariables</a></div><div class="ttdeci">void IncreaseNumVariables(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00026">sat_decision.cc:26</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a8bc0829ef9f6099106cab480e71ab847"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#a8bc0829ef9f6099106cab480e71ab847">operations_research::sat::SatDecisionPolicy::UpdateVariableActivityIncrement</a></div><div class="ttdeci">void UpdateVariableActivityIncrement()</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00332">sat_decision.cc:332</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_aa62b9215667a0b7dc6af8251dbaba486"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aa62b9215667a0b7dc6af8251dbaba486">operations_research::sat::SatDecisionPolicy::Untrail</a></div><div class="ttdeci">void Untrail(int target_trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00395">sat_decision.cc:395</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_aab615de1a3b2016b0a8b8cdf05e9cf0b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#aab615de1a3b2016b0a8b8cdf05e9cf0b">operations_research::sat::SatDecisionPolicy::BumpVariableActivities</a></div><div class="ttdeci">void BumpVariableActivities(const std::vector< Literal > &literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00287">sat_decision.cc:287</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_abe906f3b347e87b5e91e7ab5609b0f36"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#abe906f3b347e87b5e91e7ab5609b0f36">operations_research::sat::SatDecisionPolicy::BeforeConflict</a></div><div class="ttdeci">void BeforeConflict(int trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00055">sat_decision.cc:55</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_acf014a334d9412c245c083ce69aa8716"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf014a334d9412c245c083ce69aa8716">operations_research::sat::SatDecisionPolicy::NextBranch</a></div><div class="ttdeci">Literal NextBranch()</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00336">sat_decision.cc:336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_acf5ac4ce7b95b26c0eadcd6b8cbffe74"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_decision_policy.html#acf5ac4ce7b95b26c0eadcd6b8cbffe74">operations_research::sat::SatDecisionPolicy::UpdateWeightedSign</a></div><div class="ttdeci">void UpdateWeightedSign(const std::vector< LiteralWithCoeff > &terms, Coefficient rhs)</div><div class="ttdef"><b>Definition:</b> <a href="sat__decision_8cc_source.html#l00277">sat_decision.cc:277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html">operations_research::sat::SatPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00445">sat_base.h:445</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html_a5298758773353d79435345e19a7b3a38"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html#a5298758773353d79435345e19a7b3a38">operations_research::sat::SatPropagator::PropagatorId</a></div><div class="ttdeci">int PropagatorId() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00453">sat_base.h:453</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00057">sat_solver.h:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a01fd4c9f5286534866c6c5ee2c160fe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a01fd4c9f5286534866c6c5ee2c160fe9">operations_research::sat::SatSolver::LiteralTrail</a></div><div class="ttdeci">const Trail & LiteralTrail() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00361">sat_solver.h:361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a05c49a95f6af6f8d873c96cae6ab6653"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653">operations_research::sat::SatSolver::AddLinearConstraint</a></div><div class="ttdeci">bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector< LiteralWithCoeff > *cst)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00299">sat_solver.cc:299</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a093c00c2bd81c8ec7a5f86a4466fa7d5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a093c00c2bd81c8ec7a5f86a4466fa7d5">operations_research::sat::SatSolver::EnqueueDecisionIfNotConflicting</a></div><div class="ttdeci">bool EnqueueDecisionIfNotConflicting(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00873">sat_solver.cc:873</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a0b58ef3a397720b272662f8bc45585cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb">operations_research::sat::SatSolver::SetNumVariables</a></div><div class="ttdeci">void SetNumVariables(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00064">sat_solver.cc:64</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a0e8b0117614d340615ab66abec430d78"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78">operations_research::sat::SatSolver::AddTernaryClause</a></div><div class="ttdeci">bool AddTernaryClause(Literal a, Literal b, Literal c)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00191">sat_solver.cc:191</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a17c09186d8dd4922296e97185f685c97"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a17c09186d8dd4922296e97185f685c97">operations_research::sat::SatSolver::AddLastPropagator</a></div><div class="ttdeci">void AddLastPropagator(SatPropagator *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00413">sat_solver.cc:413</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a1a5e26554d014197de9434d2c39e07e9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9">operations_research::sat::SatSolver::parameters</a></div><div class="ttdeci">const SatParameters & parameters() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00110">sat_solver.cc:110</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a25eb4ef5875f4884226251b66eb61bc0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a25eb4ef5875f4884226251b66eb61bc0">operations_research::sat::SatSolver::AddClauseDuringSearch</a></div><div class="ttdeci">bool AddClauseDuringSearch(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00134">sat_solver.cc:134</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a27e14216f4d9330375fc0089a1919f20"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a27e14216f4d9330375fc0089a1919f20">operations_research::sat::SatSolver::SolveWithTimeLimit</a></div><div class="ttdeci">Status SolveWithTimeLimit(TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00968">sat_solver.cc:968</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a2aafb0d6bd7d95f183e87866d0ade374"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a2aafb0d6bd7d95f183e87866d0ade374">operations_research::sat::SatSolver::ProcessNewlyFixedVariables</a></div><div class="ttdeci">void ProcessNewlyFixedVariables()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l01563">sat_solver.cc:1563</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a2abca6db0c780a4482d1ac9eb6365057"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057">operations_research::sat::SatSolver::ResetAndSolveWithGivenAssumptions</a></div><div class="ttdeci">Status ResetAndSolveWithGivenAssumptions(const std::vector< Literal > &assumptions)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00947">sat_solver.cc:947</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a2b006481369eb4f4cb7f3037dfdd8404"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404">operations_research::sat::SatSolver::Solve</a></div><div class="ttdeci">Status Solve()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00972">sat_solver.cc:972</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a2d1cea64152ca53ac5df160b48059800"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a2d1cea64152ca53ac5df160b48059800">operations_research::sat::SatSolver::AddPropagator</a></div><div class="ttdeci">void AddPropagator(SatPropagator *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00405">sat_solver.cc:405</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a42c1fced0014f47ce16a512d454cee0f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a42c1fced0014f47ce16a512d454cee0f">operations_research::sat::SatSolver::num_failures</a></div><div class="ttdeci">int64 num_failures() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00084">sat_solver.cc:84</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a4e9c1f685afe26db1566eaa65724b40b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a4e9c1f685afe26db1566eaa65724b40b">operations_research::sat::SatSolver::NewlyAddedBinaryClauses</a></div><div class="ttdeci">const std::vector< BinaryClause > & NewlyAddedBinaryClauses()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00932">sat_solver.cc:932</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a4fbc93ff66f372e1b604609fe5b45557"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a4fbc93ff66f372e1b604609fe5b45557">operations_research::sat::SatSolver::num_branches</a></div><div class="ttdeci">int64 num_branches() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00082">sat_solver.cc:82</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a5a9a59c0a2f7fcec81cc44b1aa159186"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a5a9a59c0a2f7fcec81cc44b1aa159186">operations_research::sat::SatSolver::AddBinaryClauses</a></div><div class="ttdeci">bool AddBinaryClauses(const std::vector< BinaryClause > &clauses)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00918">sat_solver.cc:918</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a5bbe13ebae8aa11a8a4ac1cb01bc66ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad">operations_research::sat::SatSolver::UnsatStatus</a></div><div class="ttdeci">Status UnsatStatus() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00309">sat_solver.h:309</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a5ca47674a4a0b5e7f40eb430ab474440"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440">operations_research::sat::SatSolver::SetAssumptionLevel</a></div><div class="ttdeci">void SetAssumptionLevel(int assumption_level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00962">sat_solver.cc:962</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a607d97ccada862073f297bc2d495124d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">operations_research::sat::SatSolver::FinishPropagation</a></div><div class="ttdeci">bool FinishPropagation()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00521">sat_solver.cc:521</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::sat::SatSolver::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00180">sat_solver.h:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1">operations_research::sat::SatSolver::FEASIBLE</a></div><div class="ttdeci">@ FEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00183">sat_solver.h:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::SatSolver::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00182">sat_solver.h:182</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed">operations_research::sat::SatSolver::LIMIT_REACHED</a></div><div class="ttdeci">@ LIMIT_REACHED</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00184">sat_solver.h:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885">operations_research::sat::SatSolver::ASSUMPTIONS_UNSAT</a></div><div class="ttdeci">@ ASSUMPTIONS_UNSAT</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00181">sat_solver.h:181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a68050818df324a24e6309055e857b955"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a68050818df324a24e6309055e857b955">operations_research::sat::SatSolver::SaveDebugAssignment</a></div><div class="ttdeci">void SaveDebugAssignment()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00442">sat_solver.cc:442</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a705eddd5baee23097daf34b73e66eae3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a705eddd5baee23097daf34b73e66eae3">operations_research::sat::SatSolver::AdvanceDeterministicTime</a></div><div class="ttdeci">void AdvanceDeterministicTime(TimeLimit *limit)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00422">sat_solver.h:422</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a7b5f3592cdf12c0df22b6583b3e9ed61"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a7b5f3592cdf12c0df22b6583b3e9ed61">operations_research::sat::SatSolver::num_propagations</a></div><div class="ttdeci">int64 num_propagations() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00086">sat_solver.cc:86</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a8c6812e05685c0b43d4dd8efaf68aa23"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a8c6812e05685c0b43d4dd8efaf68aa23">operations_research::sat::SatSolver::~SatSolver</a></div><div class="ttdeci">~SatSolver()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00062">sat_solver.cc:62</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a8f1f9030283b2fa93b2353ab260ebe1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a8f1f9030283b2fa93b2353ab260ebe1e">operations_research::sat::SatSolver::MinimizeSomeClauses</a></div><div class="ttdeci">void MinimizeSomeClauses(int decisions_budget)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l01247">sat_solver.cc:1247</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a943e1a6b169c75c35c1f596b11fe4fc4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a943e1a6b169c75c35c1f596b11fe4fc4">operations_research::sat::SatSolver::num_restarts</a></div><div class="ttdeci">int64 num_restarts() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00090">sat_solver.cc:90</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::SatSolver::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00362">sat_solver.h:362</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9ae69b015a43c1a94e8815ab0dd8189c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c">operations_research::sat::SatSolver::EnqueueDecisionAndBackjumpOnConflict</a></div><div class="ttdeci">int EnqueueDecisionAndBackjumpOnConflict(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00499">sat_solver.cc:499</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9d584b84d7b882a6017b072b33475172"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172">operations_research::sat::SatSolver::SetParameters</a></div><div class="ttdeci">void SetParameters(const SatParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00115">sat_solver.cc:115</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a9da38c8d2910442d551db5e360423029"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">operations_research::sat::SatSolver::ResetToLevelZero</a></div><div class="ttdeci">bool ResetToLevelZero()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00529">sat_solver.cc:529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_aac912e9410b8989493f492fcbb2d9094"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094">operations_research::sat::SatSolver::AddBinaryClause</a></div><div class="ttdeci">bool AddBinaryClause(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00180">sat_solver.cc:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ab63a08713131e63e9cc4109f98ecf859"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859">operations_research::sat::SatSolver::EnqueueDecisionAndBacktrackOnConflict</a></div><div class="ttdeci">int EnqueueDecisionAndBacktrackOnConflict(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00861">sat_solver.cc:861</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ac035378cea0ed7b0978105547402faa8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8">operations_research::sat::SatSolver::Backtrack</a></div><div class="ttdeci">void Backtrack(int target_level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00888">sat_solver.cc:888</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ac714aeb75f0f6dd87e52e5d1a0d6edc7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7">operations_research::sat::SatSolver::RestoreSolverToAssumptionLevel</a></div><div class="ttdeci">bool RestoreSolverToAssumptionLevel()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00511">sat_solver.cc:511</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_acfbfa9df611cb625ff79785c05784580"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580">operations_research::sat::SatSolver::GetLastIncompatibleDecisions</a></div><div class="ttdeci">std::vector< Literal > GetLastIncompatibleDecisions()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l01272">sat_solver.cc:1272</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ad28cbdd5735a0c111a642f39524d969e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e">operations_research::sat::SatSolver::ReapplyAssumptionsIfNeeded</a></div><div class="ttdeci">bool ReapplyAssumptionsIfNeeded()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00554">sat_solver.cc:554</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ad4494c6831942d344ed1d9758f0e6cd9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9">operations_research::sat::SatSolver::ResetWithGivenAssumptions</a></div><div class="ttdeci">bool ResetWithGivenAssumptions(const std::vector< Literal > &assumptions)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00536">sat_solver.cc:536</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::SatSolver::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00360">sat_solver.h:360</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_adadc001cbdc7263b106fc5886b60ff39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39">operations_research::sat::SatSolver::Propagate</a></div><div class="ttdeci">bool Propagate()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l01622">sat_solver.cc:1622</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_adc7569321b063bae82803229623c8f4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f">operations_research::sat::SatSolver::SatSolver</a></div><div class="ttdeci">SatSolver()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00037">sat_solver.cc:37</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_ae525d235b02bcfc962d845e28f5f0125"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125">operations_research::sat::SatSolver::deterministic_time</a></div><div class="ttdeci">double deterministic_time() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00092">sat_solver.cc:92</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_af67fe279478772a6d1492a7f673bda5d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d">operations_research::sat::SatSolver::AddProblemClause</a></div><div class="ttdeci">bool AddProblemClause(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00203">sat_solver.cc:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_afbbbc2f0845a82a5a5cfb3f00a61abe9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9">operations_research::sat::SatSolver::AddUnitClause</a></div><div class="ttdeci">bool AddUnitClause(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00164">sat_solver.cc:164</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_afdb0cc1ac877cd981dcd3f0b0763e644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#afdb0cc1ac877cd981dcd3f0b0763e644">operations_research::sat::SatSolver::ClearNewlyAddedBinaryClauses</a></div><div class="ttdeci">void ClearNewlyAddedBinaryClauses()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00936">sat_solver.cc:936</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00233">sat_base.h:233</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a02b397f0cd58ae0d26dfeb6182401ece"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a02b397f0cd58ae0d26dfeb6182401ece">operations_research::sat::Trail::FailingClause</a></div><div class="ttdeci">absl::Span< const Literal > FailingClause() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00367">sat_base.h:367</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a120ef5f82f667fe8a6a38db137bfd2a7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a120ef5f82f667fe8a6a38db137bfd2a7">operations_research::sat::Trail::RegisterPropagator</a></div><div class="ttdeci">void RegisterPropagator(SatPropagator *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00551">sat_base.h:551</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a29be1a6b9ba823a6fffb927609d18599"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">operations_research::sat::Trail::Info</a></div><div class="ttdeci">const AssignmentInfo & Info(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00381">sat_base.h:381</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a3d1e83250927b8d13cb65626fdc49b29"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a3d1e83250927b8d13cb65626fdc49b29">operations_research::sat::Trail::FailingSatClause</a></div><div class="ttdeci">SatClause * FailingSatClause() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00373">sat_base.h:373</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a5ed9d5f5c759afe4a008adaabd80c6f8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a5ed9d5f5c759afe4a008adaabd80c6f8">operations_research::sat::Trail::AssignmentType</a></div><div class="ttdeci">int AssignmentType(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00572">sat_base.h:572</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a885bcf9213525765f68daf84eed76c2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a885bcf9213525765f68daf84eed76c2e">operations_research::sat::Trail::Reason</a></div><div class="ttdeci">absl::Span< const Literal > Reason(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00581">sat_base.h:581</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a89ab9ae41ab13f8847ac18e8beac37ed"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a89ab9ae41ab13f8847ac18e8beac37ed">operations_research::sat::Trail::ReferenceVarWithSameReason</a></div><div class="ttdeci">BooleanVariable ReferenceVarWithSameReason(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00560">sat_base.h:560</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::Trail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00378">sat_base.h:378</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::Trail::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00380">sat_base.h:380</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_aa62b9215667a0b7dc6af8251dbaba486"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#aa62b9215667a0b7dc6af8251dbaba486">operations_research::sat::Trail::Untrail</a></div><div class="ttdeci">void Untrail(int target_trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00343">sat_base.h:343</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_aac9a59f50e707a0e0dcff1a2a16f3bf5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#aac9a59f50e707a0e0dcff1a2a16f3bf5">operations_research::sat::Trail::NumberOfEnqueues</a></div><div class="ttdeci">int64 NumberOfEnqueues() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00377">sat_base.h:377</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_adeeeb993a93b815c1c343f9c46ec3564"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#adeeeb993a93b815c1c343f9c46ec3564">operations_research::sat::Trail::SetDecisionLevel</a></div><div class="ttdeci">void SetDecisionLevel(int level)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00354">sat_base.h:354</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::Trail::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00539">sat_base.h:539</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_afb89e56bea39296ff292b51a84491875"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#afb89e56bea39296ff292b51a84491875">operations_research::sat::Trail::EnqueueWithUnitReason</a></div><div class="ttdeci">void EnqueueWithUnitReason(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00265">sat_base.h:265</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_afc2d489cf3ae30c4b27ff1e4359e1be9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#afc2d489cf3ae30c4b27ff1e4359e1be9">operations_research::sat::Trail::EnqueueSearchDecision</a></div><div class="ttdeci">void EnqueueSearchDecision(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00260">sat_base.h:260</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">operations_research::sat::UpperBoundedLinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00373">pb_constraint.h:373</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a79bc25526bc335587dd8b8c433d19306"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">operations_research::sat::UpperBoundedLinearConstraint::AddToConflict</a></div><div class="ttdeci">void AddToConflict(MutableUpperBoundedLinearConstraint *conflict)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00431">pb_constraint.cc:431</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variable_with_same_reason_identifier_html_a85a00c2877e3b249951022638dda5642"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#a85a00c2877e3b249951022638dda5642">operations_research::sat::VariableWithSameReasonIdentifier::FirstVariableWithSameReason</a></div><div class="ttdeci">BooleanVariable FirstVariableWithSameReason(BooleanVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00703">pb_constraint.h:703</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variable_with_same_reason_identifier_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::sat::VariableWithSameReasonIdentifier::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00698">pb_constraint.h:698</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variable_with_same_reason_identifier_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variable_with_same_reason_identifier.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::VariableWithSameReasonIdentifier::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00692">pb_constraint.h:692</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00158">sat_base.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00150">sat_base.h:150</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a945bb6c1e83f281fdde5778473a12b37"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a945bb6c1e83f281fdde5778473a12b37">operations_research::sat::VariablesAssignment::AssignFromTrueLiteral</a></div><div class="ttdeci">void AssignFromTrueLiteral(Literal literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00133">sat_base.h:133</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_ac821b9b8b54da703731ce70864668a89"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#ac821b9b8b54da703731ce70864668a89">operations_research::sat::VariablesAssignment::GetTrueLiteralForAssignedVariable</a></div><div class="ttdeci">Literal GetTrueLiteralForAssignedVariable(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00165">sat_base.h:165</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00147">sat_base.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_ae19413c447377161d432f18d1323a037"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#ae19413c447377161d432f18d1323a037">operations_research::sat::VariablesAssignment::NumberOfVariables</a></div><div class="ttdeci">int NumberOfVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00170">sat_base.h:170</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_af7fbbd00f0e631ce361b5ce6636b2017"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#af7fbbd00f0e631ce361b5ce6636b2017">operations_research::sat::VariablesAssignment::Resize</a></div><div class="ttdeci">void Resize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00126">sat_base.h:126</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_ac3cf9db02b23ea1455b5ae6955d03e47"><div class="ttname"><a href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a></div><div class="ttdeci">SharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02116">cp_model_solver.cc:2116</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_a50e5762f38854b37ee3e2851bc1bb0e7"><div class="ttname"><a href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a></div><div class="ttdeci">const int WARNING</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_abec9e934a51aa2ab519684cc0f446a41"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">operations_research::glop::Index</a></div><div class="ttdeci">int32 Index</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00037">lp_types.h:37</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a01c76d0c46e2975d10e45ab04877f4ac"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a01c76d0c46e2975d10e45ab04877f4ac">operations_research::sat::ComputeCanonicalRhs</a></div><div class="ttdeci">Coefficient ComputeCanonicalRhs(Coefficient upper_bound, Coefficient bound_shift, Coefficient max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00160">pb_constraint.cc:160</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2ef3eb1f5fe6506a5e24115f10d724fc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2ef3eb1f5fe6506a5e24115f10d724fc">operations_research::sat::MoveOneUnprocessedLiteralLast</a></div><div class="ttdeci">int MoveOneUnprocessedLiteralLast(const std::set< LiteralIndex > &processed, int relevant_prefix_size, std::vector< Literal > *literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00024">sat/util.cc:24</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5c5399274f079c718ec46bf4b3032d27"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5c5399274f079c718ec46bf4b3032d27">operations_research::sat::ComputeNegatedCanonicalRhs</a></div><div class="ttdeci">Coefficient ComputeNegatedCanonicalRhs(Coefficient lower_bound, Coefficient bound_shift, Coefficient max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00178">pb_constraint.cc:178</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a6fb8349259fa849de0789a4ec58a8492"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492">operations_research::sat::MinimizeCore</a></div><div class="ttdeci">void MinimizeCore(SatSolver *solver, std::vector< Literal > *core)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l02547">sat_solver.cc:2547</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a762ee6abbb57f9f730df6033aafdf4fc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc">operations_research::sat::SatStatusString</a></div><div class="ttdeci">std::string SatStatusString(SatSolver::Status status)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l02530">sat_solver.cc:2530</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8860b588974cb8ffaf2ac97eafd67b3e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">operations_research::sat::ComputeBooleanLinearExpressionCanonicalForm</a></div><div class="ttdeci">bool ComputeBooleanLinearExpressionCanonicalForm(std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00041">pb_constraint.cc:41</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acf18431db5241d6ae15e5db2470d9079"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acf18431db5241d6ae15e5db2470d9079">operations_research::sat::BooleanLinearExpressionIsCanonical</a></div><div class="ttdeci">bool BooleanLinearExpressionIsCanonical(const std::vector< LiteralWithCoeff > &cst)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00136">pb_constraint.cc:136</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aed3a7826cb80e5dfe7cadb141fde73f2"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2">operations_research::sat::kUnsatTrailIndex</a></div><div class="ttdeci">const int kUnsatTrailIndex</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00052">sat_solver.h:52</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a03f919221217f95d21a593a7120165e1">operations_research::sat::FEASIBLE</a></div><div class="ttdeci">@ FEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00237">cp_model.pb.h:237</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00238">cp_model.pb.h:238</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sysinfo_html_a018ed7fb4eeab0488fafba0261dc6917"><div class="ttname"><a href="namespaceoperations__research_1_1sysinfo.html#a018ed7fb4eeab0488fafba0261dc6917">operations_research::sysinfo::MemoryUsageProcess</a></div><div class="ttdeci">int64 MemoryUsageProcess()</div><div class="ttdef"><b>Definition:</b> <a href="sysinfo__nonport_8cc_source.html#l00020">sysinfo_nonport.cc:20</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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="anamespaceoperations__research_html_a87d7aa58897e0042898d1c2207deda18"><div class="ttname"><a href="namespaceoperations__research.html#a87d7aa58897e0042898d1c2207deda18">operations_research::ProtobufShortDebugString</a></div><div class="ttdeci">std::string ProtobufShortDebugString(const P &message)</div><div class="ttdef"><b>Definition:</b> <a href="port_2proto__utils_8h_source.html#l00058">port/proto_utils.h:58</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_acb92bdbce12d475f965f6db3c5f5b7b5"><div class="ttname"><a href="namespaceoperations__research.html#acb92bdbce12d475f965f6db3c5f5b7b5">operations_research::MemoryUsage</a></div><div class="ttdeci">std::string MemoryUsage()</div><div class="ttdef"><b>Definition:</b> <a href="stats_8cc_source.html#l00025">stats.cc:25</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae1bd0133149b70b678b123524541aaad"><div class="ttname"><a href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">operations_research::SafeAddInto</a></div><div class="ttdeci">bool SafeAddInto(IntegerType a, IntegerType *b)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00087">saturated_arithmetic.h:87</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#l00084">optimization.cc:84</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="aparser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="aport_2proto__utils_8h_html"><div class="ttname"><a href="port_2proto__utils_8h.html">proto_utils.h</a></div></div>
|
|
<div class="ttc" id="aport_2sysinfo_8h_html"><div class="ttname"><a href="port_2sysinfo_8h.html">sysinfo.h</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_af92a8383a05fdf586a52263d358f5ada"><div class="ttname"><a href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a></div><div class="ttdeci">IntervalVar * interval</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00098">resource.cc:98</a></div></div>
|
|
<div class="ttc" id="asat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
|
|
<div class="ttc" id="asat__solver_8cc_html_a8392bdc4ed570e6a95c7fca35b09f83f"><div class="ttname"><a href="sat__solver_8cc.html#a8392bdc4ed570e6a95c7fca35b09f83f">var</a></div><div class="ttdeci">BooleanVariable var</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l02350">sat_solver.cc:2350</a></div></div>
|
|
<div class="ttc" id="asat__solver_8cc_html_aa01147b1f07072d246c76dc85d69df7c"><div class="ttname"><a href="sat__solver_8cc.html#aa01147b1f07072d246c76dc85d69df7c">weight</a></div><div class="ttdeci">int weight</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l02351">sat_solver.cc:2351</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a3c3e6b102f0d91c523099325c98e1887"><div class="ttname"><a href="stats_8h.html#a3c3e6b102f0d91c523099325c98e1887">IF_STATS_ENABLED</a></div><div class="ttdeci">#define IF_STATS_ENABLED(instructions)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00435">stats.h:435</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a9995704aaaf45fc21e08c847551a8d04"><div class="ttname"><a href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a></div><div class="ttdeci">#define SCOPED_TIME_STAT(stats)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00436">stats.h:436</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html">operations_research::sat::AssignmentInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00187">sat_base.h:187</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html_a8843d978bef78a2392a908bd07fffb8e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">operations_research::sat::AssignmentInfo::trail_index</a></div><div class="ttdeci">int32 trail_index</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00208">sat_base.h:208</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html_afefd28242df91e46e762af1f7eaf623f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">operations_research::sat::AssignmentInfo::level</a></div><div class="ttdeci">uint32 level</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00199">sat_base.h:199</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_type_html_a916a0609367bae97bd6788542d4925eb"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_type.html#a916a0609367bae97bd6788542d4925eb">operations_research::sat::AssignmentType::kSearchDecision</a></div><div class="ttdeci">static constexpr int kSearchDecision</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00223">sat_base.h:223</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_binary_clause_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_binary_clause.html">operations_research::sat::BinaryClause</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00375">clause.h:375</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_with_coeff_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">operations_research::sat::LiteralWithCoeff</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00049">pb_constraint.h:49</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="sat__solver_8cc.html">sat_solver.cc</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.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|