2020-09-02 09:42:51 +02:00
<!-- 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" / >
2022-01-17 21:42:14 +01:00
< meta name = "generator" content = "Doxygen 1.9.3" / >
2020-09-02 09:42:51 +02:00
< meta name = "viewport" content = "width=device-width, initial-scale=1" / >
< title > OR-Tools: sat_solver.h Source File< / title >
< link href = "tabs.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "jquery.js" > < / script >
< script type = "text/javascript" src = "dynsections.js" > < / script >
< link href = "navtree.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "resize.js" > < / script >
< script type = "text/javascript" src = "navtreedata.js" > < / script >
< script type = "text/javascript" src = "navtree.js" > < / script >
< link href = "search/search.css" rel = "stylesheet" type = "text/css" / >
< script type = "text/javascript" src = "search/searchdata.js" > < / script >
< script type = "text/javascript" src = "search/search.js" > < / script >
< link href = "doxygen.css" rel = "stylesheet" type = "text/css" / >
< link href = "styleSheet.tmp.css" rel = "stylesheet" type = "text/css" / >
< / head >
< body >
< div id = "top" > <!-- do not remove this div, it is closed by doxygen! -->
< div id = "titlearea" >
< table cellspacing = "0" cellpadding = "0" >
< tbody >
< tr style = "height: 56px;" >
< td id = "projectlogo" > < img alt = "Logo" src = "orLogo.png" / > < / td >
< td id = "projectalign" style = "padding-left: 0.5em;" >
< div id = "projectname" > OR-Tools
2022-03-04 00:11:33 +01:00
  < span id = "projectnumber" > 9.3< / span >
2020-09-02 09:42:51 +02:00
< / div >
< / td >
< / tr >
< / tbody >
< / table >
< / div >
<!-- end header part -->
2022-01-17 21:42:14 +01:00
<!-- Generated by Doxygen 1.9.3 -->
2020-09-02 09:42:51 +02:00
< script type = "text/javascript" >
2022-01-17 21:42:14 +01:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
2020-09-02 09:42:51 +02:00
/* @license-end */
< / script >
< script type = "text/javascript" src = "menudata.js" > < / script >
< script type = "text/javascript" src = "menu.js" > < / script >
< script type = "text/javascript" >
2022-01-17 21:42:14 +01:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
2020-09-02 09:42:51 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
2022-01-17 21:42:14 +01:00
/* @license-end */
< / script >
2020-09-02 09:42:51 +02:00
< 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" >
2022-01-17 21:42:14 +01:00
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699& dn=expat.txt MIT */
$(document).ready(function(){initNavTree('sat__solver_8h_source.html',''); initResizable(); });
2020-09-02 09:42:51 +02:00
/* @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" >
2022-01-17 21:42:14 +01:00
< div class = "headertitle" > < div class = "title" > sat_solver.h< / div > < / div >
2020-09-02 09:42:51 +02:00
< / div > <!-- header -->
< div class = "contents" >
2022-01-17 21:42:14 +01:00
< a href = "sat__solver_8h.html" > Go to the documentation of this file.< / a > < div class = "fragment" > < div class = "line" > < a id = "l00001" name = "l00001" > < / a > < span class = "lineno" > 1< / span > < span class = "comment" > // Copyright 2010-2021 Google LLC< / span > < / div >
< div class = "line" > < a id = "l00002" name = "l00002" > < / a > < span class = "lineno" > 2< / span > < span class = "comment" > // Licensed under the Apache License, Version 2.0 (the " License" );< / span > < / div >
< div class = "line" > < a id = "l00003" name = "l00003" > < / a > < span class = "lineno" > 3< / span > < span class = "comment" > // you may not use this file except in compliance with the License.< / span > < / div >
< div class = "line" > < a id = "l00004" name = "l00004" > < / a > < span class = "lineno" > 4< / span > < span class = "comment" > // You may obtain a copy of the License at< / span > < / div >
< div class = "line" > < a id = "l00005" name = "l00005" > < / a > < span class = "lineno" > 5< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00006" name = "l00006" > < / a > < span class = "lineno" > 6< / span > < span class = "comment" > // http://www.apache.org/licenses/LICENSE-2.0< / span > < / div >
< div class = "line" > < a id = "l00007" name = "l00007" > < / a > < span class = "lineno" > 7< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00008" name = "l00008" > < / a > < span class = "lineno" > 8< / span > < span class = "comment" > // Unless required by applicable law or agreed to in writing, software< / span > < / div >
< div class = "line" > < a id = "l00009" name = "l00009" > < / a > < span class = "lineno" > 9< / span > < span class = "comment" > // distributed under the License is distributed on an " AS IS" BASIS,< / span > < / div >
< div class = "line" > < a id = "l00010" name = "l00010" > < / a > < span class = "lineno" > 10< / span > < span class = "comment" > // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.< / span > < / div >
< div class = "line" > < a id = "l00011" name = "l00011" > < / a > < span class = "lineno" > 11< / span > < span class = "comment" > // See the License for the specific language governing permissions and< / span > < / div >
< div class = "line" > < a id = "l00012" name = "l00012" > < / a > < span class = "lineno" > 12< / span > < span class = "comment" > // limitations under the License.< / span > < / div >
< div class = "line" > < a id = "l00013" name = "l00013" > < / a > < span class = "lineno" > 13< / span > < / div >
< div class = "line" > < a id = "l00014" name = "l00014" > < / a > < span class = "lineno" > 14< / span > < span class = "comment" > // This file implements a SAT solver.< / span > < / div >
< div class = "line" > < a id = "l00015" name = "l00015" > < / a > < span class = "lineno" > 15< / span > < span class = "comment" > // see http://en.wikipedia.org/wiki/Boolean_satisfiability_problem< / span > < / div >
< div class = "line" > < a id = "l00016" name = "l00016" > < / a > < span class = "lineno" > 16< / span > < span class = "comment" > // for more detail.< / span > < / div >
< div class = "line" > < a id = "l00017" name = "l00017" > < / a > < span class = "lineno" > 17< / span > < span class = "comment" > // TODO(user): Expand.< / span > < / div >
< div class = "line" > < a id = "l00018" name = "l00018" > < / a > < span class = "lineno" > 18< / span > < / div >
< div class = "line" > < a id = "l00019" name = "l00019" > < / a > < span class = "lineno" > 19< / span > < span class = "preprocessor" > #ifndef OR_TOOLS_SAT_SAT_SOLVER_H_< / span > < / div >
< div class = "line" > < a id = "l00020" name = "l00020" > < / a > < span class = "lineno" > 20< / span > < span class = "preprocessor" > #define OR_TOOLS_SAT_SAT_SOLVER_H_< / span > < / div >
< div class = "line" > < a id = "l00021" name = "l00021" > < / a > < span class = "lineno" > 21< / span > < / div >
< div class = "line" > < a id = "l00022" name = "l00022" > < / a > < span class = "lineno" > 22< / span > < span class = "preprocessor" > #include < cstdint> < / span > < / div >
< div class = "line" > < a id = "l00023" name = "l00023" > < / a > < span class = "lineno" > 23< / span > < span class = "preprocessor" > #include < functional> < / span > < / div >
< div class = "line" > < a id = "l00024" name = "l00024" > < / a > < span class = "lineno" > 24< / span > < span class = "preprocessor" > #include < limits> < / span > < / div >
< div class = "line" > < a id = "l00025" name = "l00025" > < / a > < span class = "lineno" > 25< / span > < span class = "preprocessor" > #include < memory> < / span > < / div >
< div class = "line" > < a id = "l00026" name = "l00026" > < / a > < span class = "lineno" > 26< / span > < span class = "preprocessor" > #include < string> < / span > < / div >
< div class = "line" > < a id = "l00027" name = "l00027" > < / a > < span class = "lineno" > 27< / span > < span class = "preprocessor" > #include < utility> < / span > < / div >
< div class = "line" > < a id = "l00028" name = "l00028" > < / a > < span class = "lineno" > 28< / span > < span class = "preprocessor" > #include < vector> < / span > < / div >
< div class = "line" > < a id = "l00029" name = "l00029" > < / a > < span class = "lineno" > 29< / span > < / div >
< div class = "line" > < a id = "l00030" name = "l00030" > < / a > < span class = "lineno" > 30< / span > < span class = "preprocessor" > #include " absl/container/flat_hash_map.h" < / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00031" name = "l00031" > < / a > < span class = "lineno" > 31< / span > < span class = "preprocessor" > #include " absl/strings/string_view.h" < / span > < / div >
< div class = "line" > < a id = "l00032" name = "l00032" > < / a > < span class = "lineno" > 32< / span > < span class = "preprocessor" > #include " absl/types/span.h" < / span > < / div >
< div class = "line" > < a id = "l00033" name = "l00033" > < / a > < span class = "lineno" > 33< / span > < span class = "preprocessor" > #include " < a class = "code" href = "hash_8h.html" > ortools/base/hash.h< / a > " < / span > < / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00034" name = "l00034" > < / a > < span class = "lineno" > 34< / 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 id = "l00035" name = "l00035" > < / a > < span class = "lineno" > 35< / span > < span class = "preprocessor" > #include " < a class = "code" href = "base_2logging_8h.html" > ortools/base/logging.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00036" name = "l00036" > < / a > < span class = "lineno" > 36< / span > < span class = "preprocessor" > #include " < a class = "code" href = "macros_8h.html" > ortools/base/macros.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00037" name = "l00037" > < / a > < span class = "lineno" > 37< / span > < span class = "preprocessor" > #include " < a class = "code" href = "timer_8h.html" > ortools/base/timer.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00038" name = "l00038" > < / a > < span class = "lineno" > 38< / span > < span class = "preprocessor" > #include " < a class = "code" href = "clause_8h.html" > ortools/sat/clause.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00039" name = "l00039" > < / a > < span class = "lineno" > 39< / span > < span class = "preprocessor" > #include " < a class = "code" href = "drat__proof__handler_8h.html" > ortools/sat/drat_proof_handler.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00040" name = "l00040" > < / a > < span class = "lineno" > 40< / span > < span class = "preprocessor" > #include " < a class = "code" href = "sat_2model_8h.html" > ortools/sat/model.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00041" name = "l00041" > < / a > < span class = "lineno" > 41< / span > < span class = "preprocessor" > #include " < a class = "code" href = "pb__constraint_8h.html" > ortools/sat/pb_constraint.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00042" name = "l00042" > < / a > < span class = "lineno" > 42< / span > < span class = "preprocessor" > #include " < a class = "code" href = "restart_8h.html" > ortools/sat/restart.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00043" name = "l00043" > < / a > < span class = "lineno" > 43< / span > < span class = "preprocessor" > #include " < a class = "code" href = "sat__base_8h.html" > ortools/sat/sat_base.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00044" name = "l00044" > < / a > < span class = "lineno" > 44< / span > < span class = "preprocessor" > #include " < a class = "code" href = "sat__decision_8h.html" > ortools/sat/sat_decision.h< / a > " < / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00045" name = "l00045" > < / a > < span class = "lineno" > 45< / span > < span class = "preprocessor" > #include " ortools/sat/sat_parameters.pb.h" < / span > < / div >
< div class = "line" > < a id = "l00046" name = "l00046" > < / a > < span class = "lineno" > 46< / span > < span class = "preprocessor" > #include " < a class = "code" href = "bitset_8h.html" > ortools/util/bitset.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00047" name = "l00047" > < / a > < span class = "lineno" > 47< / span > < span class = "preprocessor" > #include " < a class = "code" href = "util_2logging_8h.html" > ortools/util/logging.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00048" name = "l00048" > < / a > < span class = "lineno" > 48< / span > < span class = "preprocessor" > #include " < a class = "code" href = "stats_8h.html" > ortools/util/stats.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00049" name = "l00049" > < / a > < span class = "lineno" > 49< / span > < span class = "preprocessor" > #include " < a class = "code" href = "strong__integers_8h.html" > ortools/util/strong_integers.h< / a > " < / span > < / div >
< div class = "line" > < a id = "l00050" name = "l00050" > < / a > < span class = "lineno" > 50< / span > < span class = "preprocessor" > #include " < a class = "code" href = "time__limit_8h.html" > ortools/util/time_limit.h< / a > " < / span > < / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00051" name = "l00051" > < / a > < span class = "lineno" > 51< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00052" name = "l00052" > < / a > < span class = "lineno" > 52< / span > < span class = "keyword" > namespace < / span > < a class = "code hl_namespace" href = "namespaceoperations__research.html" > operations_research< / a > {< / div >
< div class = "line" > < a id = "l00053" name = "l00053" > < / a > < span class = "lineno" > 53< / span > < span class = "keyword" > namespace < / span > sat {< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00054" name = "l00054" > < / a > < span class = "lineno" > 54< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00055" name = "l00055" > < / a > < span class = "lineno" > 55< / span > < span class = "comment" > // A constant used by the EnqueueDecision*() API.< / span > < / div >
< div class = "line" > < a id = "l00056" name = "l00056" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2" > 56< / a > < / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > < a class = "code hl_variable" href = "namespaceoperations__research_1_1sat.html#aed3a7826cb80e5dfe7cadb141fde73f2" > kUnsatTrailIndex< / a > = -1;< / div >
< div class = "line" > < a id = "l00057" name = "l00057" > < / a > < span class = "lineno" > 57< / span > < / div >
< div class = "line" > < a id = "l00058" name = "l00058" > < / a > < span class = "lineno" > 58< / span > < span class = "comment" > // The main SAT solver.< / span > < / div >
< div class = "line" > < a id = "l00059" name = "l00059" > < / a > < span class = "lineno" > 59< / span > < span class = "comment" > // It currently implements the CDCL algorithm. See< / span > < / div >
< div class = "line" > < a id = "l00060" name = "l00060" > < / a > < span class = "lineno" > 60< / span > < span class = "comment" > // http://en.wikipedia.org/wiki/Conflict_Driven_Clause_Learning< / span > < / div >
< div class = "line" > < a id = "l00061" name = "l00061" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > 61< / a > < / span > < span class = "keyword" > class < / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > {< / div >
< div class = "line" > < a id = "l00062" name = "l00062" > < / a > < span class = "lineno" > 62< / span > < span class = "keyword" > public< / span > :< / div >
< div class = "line" > < a id = "l00063" name = "l00063" > < / a > < span class = "lineno" > 63< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f" > SatSolver< / a > ();< / div >
< div class = "line" > < a id = "l00064" name = "l00064" > < / a > < span class = "lineno" > 64< / span > < span class = "keyword" > explicit< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f" > SatSolver< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a27c4cf985792880dfea9d42c79f13920" > model< / a > );< / div >
< div class = "line" > < a id = "l00065" name = "l00065" > < / a > < span class = "lineno" > 65< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a8c6812e05685c0b43d4dd8efaf68aa23" > ~SatSolver< / a > ();< / div >
< div class = "line" > < a id = "l00066" name = "l00066" > < / a > < span class = "lineno" > 66< / span > < / div >
< div class = "line" > < a id = "l00067" name = "l00067" > < / a > < span class = "lineno" > 67< / span > < span class = "comment" > // TODO(user): Remove. This is temporary for accessing the model deep within< / span > < / div >
< div class = "line" > < a id = "l00068" name = "l00068" > < / a > < span class = "lineno" > 68< / span > < span class = "comment" > // some old code that didn' t use the Model object.< / span > < / div >
< div class = "line" > < a id = "l00069" name = "l00069" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a27c4cf985792880dfea9d42c79f13920" > 69< / a > < / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a27c4cf985792880dfea9d42c79f13920" > model< / a > () { < span class = "keywordflow" > return< / span > model_; }< / div >
< div class = "line" > < a id = "l00070" name = "l00070" > < / a > < span class = "lineno" > 70< / span > < / div >
< div class = "line" > < a id = "l00071" name = "l00071" > < / a > < span class = "lineno" > 71< / span > < span class = "comment" > // Parameters management. Note that calling SetParameters() will reset the< / span > < / div >
< div class = "line" > < a id = "l00072" name = "l00072" > < / a > < span class = "lineno" > 72< / span > < span class = "comment" > // value of many heuristics. For instance:< / span > < / div >
< div class = "line" > < a id = "l00073" name = "l00073" > < / a > < span class = "lineno" > 73< / span > < span class = "comment" > // - The restart strategy will be reinitialized.< / span > < / div >
< div class = "line" > < a id = "l00074" name = "l00074" > < / a > < span class = "lineno" > 74< / span > < span class = "comment" > // - The random seed and random generator will be reset to the value given in< / span > < / div >
< div class = "line" > < a id = "l00075" name = "l00075" > < / a > < span class = "lineno" > 75< / span > < span class = "comment" > // parameters.< / span > < / div >
< div class = "line" > < a id = "l00076" name = "l00076" > < / a > < span class = "lineno" > 76< / span > < span class = "comment" > // - The global TimeLimit singleton will be reset and time will be< / span > < / div >
< div class = "line" > < a id = "l00077" name = "l00077" > < / a > < span class = "lineno" > 77< / span > < span class = "comment" > // counted from this call.< / span > < / div >
< div class = "line" > < a id = "l00078" name = "l00078" > < / a > < span class = "lineno" > 78< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d584b84d7b882a6017b072b33475172" > SetParameters< / a > (< span class = "keyword" > const< / span > SatParameters& < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > );< / div >
< div class = "line" > < a id = "l00079" name = "l00079" > < / a > < span class = "lineno" > 79< / span > < span class = "keyword" > const< / span > SatParameters& < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1a5e26554d014197de9434d2c39e07e9" > parameters< / a > () < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00080" name = "l00080" > < / a > < span class = "lineno" > 80< / span > < / div >
< div class = "line" > < a id = "l00081" name = "l00081" > < / a > < span class = "lineno" > 81< / span > < span class = "comment" > // Increases the number of variables of the current problem.< / span > < / div >
< div class = "line" > < a id = "l00082" name = "l00082" > < / a > < span class = "lineno" > 82< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00083" name = "l00083" > < / a > < span class = "lineno" > 83< / span > < span class = "comment" > // TODO(user): Rename to IncreaseNumVariablesTo() until we support removing< / span > < / div >
< div class = "line" > < a id = "l00084" name = "l00084" > < / a > < span class = "lineno" > 84< / span > < span class = "comment" > // variables...< / span > < / div >
< div class = "line" > < a id = "l00085" name = "l00085" > < / a > < span class = "lineno" > 85< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (< span class = "keywordtype" > int< / span > num_variables);< / div >
< div class = "line" > < a id = "l00086" name = "l00086" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > 86< / a > < / span > < span class = "keywordtype" > int< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > num_variables_.value(); }< / div >
< div class = "line" > < a id = "l00087" name = "l00087" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a43684a0a8ef85b1cea0076dba3fb271d" > 87< / a > < / span > BooleanVariable < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a43684a0a8ef85b1cea0076dba3fb271d" > NewBooleanVariable< / a > () {< / div >
< div class = "line" > < a id = "l00088" name = "l00088" > < / a > < span class = "lineno" > 88< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > num_vars = < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > ();< / div >
< div class = "line" > < a id = "l00089" name = "l00089" > < / a > < span class = "lineno" > 89< / span > < / div >
< div class = "line" > < a id = "l00090" name = "l00090" > < / a > < span class = "lineno" > 90< / span > < span class = "comment" > // We need to be able to encode the variable as a literal.< / span > < / div >
< div class = "line" > < a id = "l00091" name = "l00091" > < / a > < span class = "lineno" > 91< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82" > CHECK_LT< / a > (2 * num_vars, < a class = "code hl_variable" href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > std::numeric_limits< int32_t> ::max< / a > ());< / div >
< div class = "line" > < a id = "l00092" name = "l00092" > < / a > < span class = "lineno" > 92< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b58ef3a397720b272662f8bc45585cb" > SetNumVariables< / a > (num_vars + 1);< / div >
< div class = "line" > < a id = "l00093" name = "l00093" > < / a > < span class = "lineno" > 93< / span > < span class = "keywordflow" > return< / span > BooleanVariable(num_vars);< / div >
< div class = "line" > < a id = "l00094" name = "l00094" > < / a > < span class = "lineno" > 94< / span > }< / div >
< div class = "line" > < a id = "l00095" name = "l00095" > < / a > < span class = "lineno" > 95< / span > < / div >
< div class = "line" > < a id = "l00096" name = "l00096" > < / a > < span class = "lineno" > 96< / span > < span class = "comment" > // Fixes a variable so that the given literal is true. This can be used to< / span > < / div >
< div class = "line" > < a id = "l00097" name = "l00097" > < / a > < span class = "lineno" > 97< / span > < span class = "comment" > // solve a subproblem where some variables are fixed. Note that it is more< / span > < / div >
< div class = "line" > < a id = "l00098" name = "l00098" > < / a > < span class = "lineno" > 98< / span > < span class = "comment" > // efficient to add such unit clause before all the others.< / span > < / div >
< div class = "line" > < a id = "l00099" name = "l00099" > < / a > < span class = "lineno" > 99< / span > < span class = "comment" > // Returns false if the problem is detected to be UNSAT.< / span > < / div >
< div class = "line" > < a id = "l00100" name = "l00100" > < / a > < span class = "lineno" > 100< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afbbbc2f0845a82a5a5cfb3f00a61abe9" > AddUnitClause< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > true_literal);< / div >
< div class = "line" > < a id = "l00101" name = "l00101" > < / a > < span class = "lineno" > 101< / span > < / div >
< div class = "line" > < a id = "l00102" name = "l00102" > < / a > < span class = "lineno" > 102< / span > < span class = "comment" > // Same as AddProblemClause() below, but for small clauses.< / span > < / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00103" name = "l00103" > < / a > < span class = "lineno" > 103< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aac912e9410b8989493f492fcbb2d9094" > AddBinaryClause< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > );< / div >
< div class = "line" > < a id = "l00104" name = "l00104" > < / a > < span class = "lineno" > 104< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0e8b0117614d340615ab66abec430d78" > AddTernaryClause< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > c);< / div >
< div class = "line" > < a id = "l00105" name = "l00105" > < / a > < span class = "lineno" > 105< / span > < / div >
< div class = "line" > < a id = "l00106" name = "l00106" > < / a > < span class = "lineno" > 106< / span > < span class = "comment" > // Adds a clause to the problem. Returns false if the problem is detected to< / span > < / div >
< div class = "line" > < a id = "l00107" name = "l00107" > < / a > < span class = "lineno" > 107< / span > < span class = "comment" > // be UNSAT.< / span > < / div >
< div class = "line" > < a id = "l00108" name = "l00108" > < / a > < span class = "lineno" > 108< / span > < span class = "comment" > //< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00109" name = "l00109" > < / a > < span class = "lineno" > 109< / span > < span class = "comment" > // TODO(user): Rename this to AddClause(), also get rid of the specialized< / span > < / div >
< div class = "line" > < a id = "l00110" name = "l00110" > < / a > < span class = "lineno" > 110< / span > < span class = "comment" > // AddUnitClause(), AddBinaryClause() and AddTernaryClause() since they< / span > < / div >
< div class = "line" > < a id = "l00111" name = "l00111" > < / a > < span class = "lineno" > 111< / span > < span class = "comment" > // just end up calling this?< / span > < / div >
< div class = "line" > < a id = "l00112" name = "l00112" > < / a > < span class = "lineno" > 112< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#af67fe279478772a6d1492a7f673bda5d" > AddProblemClause< / a > (absl::Span< const Literal> literals);< / div >
< div class = "line" > < a id = "l00113" name = "l00113" > < / a > < span class = "lineno" > 113< / span > < / div >
< div class = "line" > < a id = "l00114" name = "l00114" > < / a > < span class = "lineno" > 114< / span > < span class = "comment" > // Adds a pseudo-Boolean constraint to the problem. Returns false if the< / span > < / div >
< div class = "line" > < a id = "l00115" name = "l00115" > < / a > < span class = "lineno" > 115< / span > < span class = "comment" > // problem is detected to be UNSAT. If the constraint is always true, this< / span > < / div >
< div class = "line" > < a id = "l00116" name = "l00116" > < / a > < span class = "lineno" > 116< / span > < span class = "comment" > // detects it and does nothing.< / span > < / div >
< div class = "line" > < a id = "l00117" name = "l00117" > < / a > < span class = "lineno" > 117< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00118" name = "l00118" > < / a > < span class = "lineno" > 118< / span > < span class = "comment" > // Note(user): There is an optimization if the same constraint is added< / span > < / div >
< div class = "line" > < a id = "l00119" name = "l00119" > < / a > < span class = "lineno" > 119< / span > < span class = "comment" > // consecutively (even if the bounds are different). This is particularly< / span > < / div >
< div class = "line" > < a id = "l00120" name = "l00120" > < / a > < span class = "lineno" > 120< / span > < span class = "comment" > // useful for an optimization problem when we want to constrain the objective< / span > < / div >
< div class = "line" > < a id = "l00121" name = "l00121" > < / a > < span class = "lineno" > 121< / span > < span class = "comment" > // of the problem more and more. Just re-adding such constraint is relatively< / span > < / div >
< div class = "line" > < a id = "l00122" name = "l00122" > < / a > < span class = "lineno" > 122< / span > < span class = "comment" > // efficient.< / span > < / div >
< div class = "line" > < a id = "l00123" name = "l00123" > < / a > < span class = "lineno" > 123< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00124" name = "l00124" > < / a > < span class = "lineno" > 124< / span > < span class = "comment" > // OVERFLOW: The sum of the absolute value of all the coefficients< / span > < / div >
< div class = "line" > < a id = "l00125" name = "l00125" > < / a > < span class = "lineno" > 125< / span > < span class = "comment" > // in the constraint must not overflow. This is currently CHECKed().< / span > < / div >
< div class = "line" > < a id = "l00126" name = "l00126" > < / a > < span class = "lineno" > 126< / span > < span class = "comment" > // TODO(user): Instead of failing, implement an error handling code.< / span > < / div >
< div class = "line" > < a id = "l00127" name = "l00127" > < / a > < span class = "lineno" > 127< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a05c49a95f6af6f8d873c96cae6ab6653" > AddLinearConstraint< / a > (< span class = "keywordtype" > bool< / span > use_lower_bound, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ,< / div >
< div class = "line" > < a id = "l00128" name = "l00128" > < / a > < span class = "lineno" > 128< / span > < span class = "keywordtype" > bool< / span > use_upper_bound, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ,< / div >
< div class = "line" > < a id = "l00129" name = "l00129" > < / a > < span class = "lineno" > 129< / span > std::vector< LiteralWithCoeff> * cst);< / div >
< div class = "line" > < a id = "l00130" name = "l00130" > < / a > < span class = "lineno" > 130< / span > < / div >
< div class = "line" > < a id = "l00131" name = "l00131" > < / a > < span class = "lineno" > 131< / span > < span class = "comment" > // Returns true if the model is UNSAT. Note that currently the status is< / span > < / div >
< div class = "line" > < a id = "l00132" name = "l00132" > < / a > < span class = "lineno" > 132< / span > < span class = "comment" > // " sticky" and once this happen, nothing else can be done with the solver.< / span > < / div >
< div class = "line" > < a id = "l00133" name = "l00133" > < / a > < span class = "lineno" > 133< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00134" name = "l00134" > < / a > < span class = "lineno" > 134< / span > < span class = "comment" > // Thanks to this function, a client can safely ignore the return value of any< / span > < / div >
< div class = "line" > < a id = "l00135" name = "l00135" > < / a > < span class = "lineno" > 135< / span > < span class = "comment" > // Add*() functions. If one of them return false, then IsModelUnsat() will< / span > < / div >
< div class = "line" > < a id = "l00136" name = "l00136" > < / a > < span class = "lineno" > 136< / span > < span class = "comment" > // return true.< / span > < / div >
< div class = "line" > < a id = "l00137" name = "l00137" > < / a > < span class = "lineno" > 137< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00138" name = "l00138" > < / a > < span class = "lineno" > 138< / span > < span class = "comment" > // TODO(user): Rename to ModelIsUnsat().< / span > < / div >
< div class = "line" > < a id = "l00139" name = "l00139" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > 139< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > IsModelUnsat< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > model_is_unsat_; }< / div >
< div class = "line" > < a id = "l00140" name = "l00140" > < / a > < span class = "lineno" > 140< / span > < / div >
< div class = "line" > < a id = "l00141" name = "l00141" > < / a > < span class = "lineno" > 141< / span > < span class = "comment" > // Adds and registers the given propagator with the sat solver. Note that< / span > < / div >
< div class = "line" > < a id = "l00142" name = "l00142" > < / a > < span class = "lineno" > 142< / span > < span class = "comment" > // during propagation, they will be called in the order they were added.< / span > < / div >
< div class = "line" > < a id = "l00143" name = "l00143" > < / a > < span class = "lineno" > 143< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2d1cea64152ca53ac5df160b48059800" > AddPropagator< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_propagator.html" > SatPropagator< / a > * propagator);< / div >
< div class = "line" > < a id = "l00144" name = "l00144" > < / a > < span class = "lineno" > 144< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a17c09186d8dd4922296e97185f685c97" > AddLastPropagator< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_propagator.html" > SatPropagator< / a > * propagator);< / div >
< div class = "line" > < a id = "l00145" name = "l00145" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad085476234b92559b93383f9e1264af6" > 145< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad085476234b92559b93383f9e1264af6" > TakePropagatorOwnership< / a > (std::unique_ptr< SatPropagator> propagator) {< / div >
< div class = "line" > < a id = "l00146" name = "l00146" > < / a > < span class = "lineno" > 146< / span > owned_propagators_.push_back(std::move(propagator));< / div >
< div class = "line" > < a id = "l00147" name = "l00147" > < / a > < span class = "lineno" > 147< / span > }< / div >
< div class = "line" > < a id = "l00148" name = "l00148" > < / a > < span class = "lineno" > 148< / span > < / div >
< div class = "line" > < a id = "l00149" name = "l00149" > < / a > < span class = "lineno" > 149< / span > < span class = "comment" > // Wrapper around the same functions in SatDecisionPolicy.< / span > < / div >
< div class = "line" > < a id = "l00150" name = "l00150" > < / a > < span class = "lineno" > 150< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00151" name = "l00151" > < / a > < span class = "lineno" > 151< / span > < span class = "comment" > // TODO(user): Clean this up by making clients directly talk to< / span > < / div >
< div class = "line" > < a id = "l00152" name = "l00152" > < / a > < span class = "lineno" > 152< / span > < span class = "comment" > // SatDecisionPolicy.< / span > < / div >
< div class = "line" > < a id = "l00153" name = "l00153" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a955786dcbe82b7c4dc9924a5473ac1e8" > 153< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a955786dcbe82b7c4dc9924a5473ac1e8" > SetAssignmentPreference< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > , < span class = "keywordtype" > double< / span > < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > ) {< / div >
< div class = "line" > < a id = "l00154" name = "l00154" > < / a > < span class = "lineno" > 154< / span > decision_policy_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a955786dcbe82b7c4dc9924a5473ac1e8" > SetAssignmentPreference< / a > (< a class = "code hl_variable" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > , < a class = "code hl_variable" href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > );< / div >
< div class = "line" > < a id = "l00155" name = "l00155" > < / a > < span class = "lineno" > 155< / span > }< / div >
< div class = "line" > < a id = "l00156" name = "l00156" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b5d7f31620ad7b364e7415c47ee5e0d" > 156< / a > < / span > std::vector< std::pair< Literal, double> > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b5d7f31620ad7b364e7415c47ee5e0d" > AllPreferences< / a > ()< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00157" name = "l00157" > < / a > < span class = "lineno" > 157< / span > < span class = "keywordflow" > return< / span > decision_policy_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a0b5d7f31620ad7b364e7415c47ee5e0d" > AllPreferences< / a > ();< / div >
< div class = "line" > < a id = "l00158" name = "l00158" > < / a > < span class = "lineno" > 158< / span > }< / div >
< div class = "line" > < a id = "l00159" name = "l00159" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > 159< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > ResetDecisionHeuristic< / a > () {< / div >
< div class = "line" > < a id = "l00160" name = "l00160" > < / a > < span class = "lineno" > 160< / span > < span class = "keywordflow" > return< / span > decision_policy_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > ResetDecisionHeuristic< / a > ();< / div >
< div class = "line" > < a id = "l00161" name = "l00161" > < / a > < span class = "lineno" > 161< / span > }< / div >
< div class = "line" > < a id = "l00162" name = "l00162" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a99ad912d89d06226159ee1d4478b6af6" > 162< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a99ad912d89d06226159ee1d4478b6af6" > ResetDecisionHeuristicAndSetAllPreferences< / a > (< / div >
< div class = "line" > < a id = "l00163" name = "l00163" > < / a > < span class = "lineno" > 163< / span > < span class = "keyword" > const< / span > std::vector< std::pair< Literal, double> > & prefs) {< / div >
< div class = "line" > < a id = "l00164" name = "l00164" > < / a > < span class = "lineno" > 164< / span > decision_policy_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > ResetDecisionHeuristic< / a > ();< / div >
< div class = "line" > < a id = "l00165" name = "l00165" > < / a > < span class = "lineno" > 165< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > std::pair< Literal, double> & p : prefs) {< / div >
< div class = "line" > < a id = "l00166" name = "l00166" > < / a > < span class = "lineno" > 166< / span > decision_policy_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a955786dcbe82b7c4dc9924a5473ac1e8" > SetAssignmentPreference< / a > (p.first, p.second);< / div >
< div class = "line" > < a id = "l00167" name = "l00167" > < / a > < span class = "lineno" > 167< / span > }< / div >
< div class = "line" > < a id = "l00168" name = "l00168" > < / a > < span class = "lineno" > 168< / span > }< / div >
< div class = "line" > < a id = "l00169" name = "l00169" > < / a > < span class = "lineno" > 169< / span > < / div >
< div class = "line" > < a id = "l00170" name = "l00170" > < / a > < span class = "lineno" > 170< / span > < span class = "comment" > // Solves the problem and returns its status.< / span > < / div >
< div class = "line" > < a id = "l00171" name = "l00171" > < / a > < span class = "lineno" > 171< / span > < span class = "comment" > // An empty problem is considered to be SAT.< / span > < / div >
< div class = "line" > < a id = "l00172" name = "l00172" > < / a > < span class = "lineno" > 172< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00173" name = "l00173" > < / a > < span class = "lineno" > 173< / span > < span class = "comment" > // Note that the conflict limit applies only to this function and starts< / span > < / div >
< div class = "line" > < a id = "l00174" name = "l00174" > < / a > < span class = "lineno" > 174< / span > < span class = "comment" > // counting from the time it is called.< / span > < / div >
< div class = "line" > < a id = "l00175" name = "l00175" > < / a > < span class = "lineno" > 175< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00176" name = "l00176" > < / a > < span class = "lineno" > 176< / span > < span class = "comment" > // This will restart from the current solver configuration. If a previous call< / span > < / div >
< div class = "line" > < a id = "l00177" name = "l00177" > < / a > < span class = "lineno" > 177< / span > < span class = "comment" > // to Solve() was interrupted by a conflict or time limit, calling this again< / span > < / div >
< div class = "line" > < a id = "l00178" name = "l00178" > < / a > < span class = "lineno" > 178< / span > < span class = "comment" > // will resume the search exactly as it would have continued.< / span > < / div >
< div class = "line" > < a id = "l00179" name = "l00179" > < / a > < span class = "lineno" > 179< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00180" name = "l00180" > < / a > < span class = "lineno" > 180< / span > < span class = "comment" > // Note that this will use the TimeLimit singleton, so the time limit< / span > < / div >
< div class = "line" > < a id = "l00181" name = "l00181" > < / a > < span class = "lineno" > 181< / span > < span class = "comment" > // will be counted since the last time TimeLimit was reset, not from< / span > < / div >
< div class = "line" > < a id = "l00182" name = "l00182" > < / a > < span class = "lineno" > 182< / span > < span class = "comment" > // the start of this function.< / span > < / div >
< div class = "line" > < a id = "l00183" name = "l00183" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > 183< / a > < / span > < span class = "keyword" > enum< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > {< / div >
< div class = "line" > < a id = "l00184" name = "l00184" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > 184< / a > < / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > ASSUMPTIONS_UNSAT< / a > ,< / div >
< div class = "line" > < a id = "l00185" name = "l00185" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > 185< / a > < / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > INFEASIBLE< / a > ,< / div >
< div class = "line" > < a id = "l00186" name = "l00186" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > 186< / a > < / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba03f919221217f95d21a593a7120165e1" > FEASIBLE< / a > ,< / div >
< div class = "line" > < a id = "l00187" name = "l00187" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > 187< / a > < / span > < a class = "code hl_enumvalue" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba72c2402449caa8f3edc8aa0a3816baed" > LIMIT_REACHED< / a > ,< / div >
< div class = "line" > < a id = "l00188" name = "l00188" > < / a > < span class = "lineno" > 188< / span > };< / div >
< div class = "line" > < a id = "l00189" name = "l00189" > < / a > < span class = "lineno" > 189< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2b006481369eb4f4cb7f3037dfdd8404" > Solve< / a > ();< / div >
< div class = "line" > < a id = "l00190" name = "l00190" > < / a > < span class = "lineno" > 190< / span > < / div >
< div class = "line" > < a id = "l00191" name = "l00191" > < / a > < span class = "lineno" > 191< / span > < span class = "comment" > // Same as Solve(), but with a given time limit. Note that this will not< / span > < / div >
< div class = "line" > < a id = "l00192" name = "l00192" > < / a > < span class = "lineno" > 192< / span > < span class = "comment" > // update the TimeLimit singleton, but only the passed object instead.< / span > < / div >
< div class = "line" > < a id = "l00193" name = "l00193" > < / a > < span class = "lineno" > 193< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a27e14216f4d9330375fc0089a1919f20" > SolveWithTimeLimit< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > );< / div >
< div class = "line" > < a id = "l00194" name = "l00194" > < / a > < span class = "lineno" > 194< / span > < / div >
< div class = "line" > < a id = "l00195" name = "l00195" > < / a > < span class = "lineno" > 195< / span > < span class = "comment" > // Simple interface to solve a problem under the given assumptions. This< / span > < / div >
< div class = "line" > < a id = "l00196" name = "l00196" > < / a > < span class = "lineno" > 196< / span > < span class = "comment" > // simply ask the solver to solve a problem given a set of variables fixed to< / span > < / div >
< div class = "line" > < a id = "l00197" name = "l00197" > < / a > < span class = "lineno" > 197< / span > < span class = "comment" > // a given value (the assumptions). Compared to simply calling AddUnitClause()< / span > < / div >
< div class = "line" > < a id = "l00198" name = "l00198" > < / a > < span class = "lineno" > 198< / span > < span class = "comment" > // and fixing the variables once and for all, this allow to backtrack over the< / span > < / div >
< div class = "line" > < a id = "l00199" name = "l00199" > < / a > < span class = "lineno" > 199< / span > < span class = "comment" > // assumptions and thus exploit the incrementally between subsequent solves.< / span > < / div >
< div class = "line" > < a id = "l00200" name = "l00200" > < / a > < span class = "lineno" > 200< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00201" name = "l00201" > < / a > < span class = "lineno" > 201< / span > < span class = "comment" > // This function backtrack over all the current decision, tries to enqueue the< / span > < / div >
< div class = "line" > < a id = "l00202" name = "l00202" > < / a > < span class = "lineno" > 202< / span > < span class = "comment" > // given assumptions, sets the assumption level accordingly and finally calls< / span > < / div >
< div class = "line" > < a id = "l00203" name = "l00203" > < / a > < span class = "lineno" > 203< / span > < span class = "comment" > // Solve().< / span > < / div >
< div class = "line" > < a id = "l00204" name = "l00204" > < / a > < span class = "lineno" > 204< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00205" name = "l00205" > < / a > < span class = "lineno" > 205< / span > < span class = "comment" > // If, given these assumptions, the model is UNSAT, this returns the< / span > < / div >
< div class = "line" > < a id = "l00206" name = "l00206" > < / a > < span class = "lineno" > 206< / span > < span class = "comment" > // ASSUMPTIONS_UNSAT status. INFEASIBLE is reserved for the case where the< / span > < / div >
< div class = "line" > < a id = "l00207" name = "l00207" > < / a > < span class = "lineno" > 207< / span > < span class = "comment" > // model is proven to be unsat without any assumptions.< / span > < / div >
< div class = "line" > < a id = "l00208" name = "l00208" > < / a > < span class = "lineno" > 208< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00209" name = "l00209" > < / a > < span class = "lineno" > 209< / span > < span class = "comment" > // If ASSUMPTIONS_UNSAT is returned, it is possible to get a " core" of unsat< / span > < / div >
< div class = "line" > < a id = "l00210" name = "l00210" > < / a > < span class = "lineno" > 210< / span > < span class = "comment" > // assumptions by calling GetLastIncompatibleDecisions().< / span > < / div >
< div class = "line" > < a id = "l00211" name = "l00211" > < / a > < span class = "lineno" > 211< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2abca6db0c780a4482d1ac9eb6365057" > ResetAndSolveWithGivenAssumptions< / a > (< / div >
< div class = "line" > < a id = "l00212" name = "l00212" > < / a > < span class = "lineno" > 212< / span > < span class = "keyword" > const< / span > std::vector< Literal> & assumptions);< / div >
< div class = "line" > < a id = "l00213" name = "l00213" > < / a > < span class = "lineno" > 213< / span > < / div >
< div class = "line" > < a id = "l00214" name = "l00214" > < / a > < span class = "lineno" > 214< / span > < span class = "comment" > // Changes the assumption level. All the decisions below this level will be< / span > < / div >
< div class = "line" > < a id = "l00215" name = "l00215" > < / a > < span class = "lineno" > 215< / span > < span class = "comment" > // treated as assumptions by the next Solve(). Note that this may impact some< / span > < / div >
< div class = "line" > < a id = "l00216" name = "l00216" > < / a > < span class = "lineno" > 216< / span > < span class = "comment" > // heuristics, like the LBD value of a clause.< / span > < / div >
< div class = "line" > < a id = "l00217" name = "l00217" > < / a > < span class = "lineno" > 217< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5ca47674a4a0b5e7f40eb430ab474440" > SetAssumptionLevel< / a > (< span class = "keywordtype" > int< / span > assumption_level);< / div >
< div class = "line" > < a id = "l00218" name = "l00218" > < / a > < span class = "lineno" > 218< / span > < / div >
< div class = "line" > < a id = "l00219" name = "l00219" > < / a > < span class = "lineno" > 219< / span > < span class = "comment" > // Returns the current assumption level. Note that if a solve was done since< / span > < / div >
< div class = "line" > < a id = "l00220" name = "l00220" > < / a > < span class = "lineno" > 220< / span > < span class = "comment" > // the last SetAssumptionLevel(), then the returned level may be lower than< / span > < / div >
< div class = "line" > < a id = "l00221" name = "l00221" > < / a > < span class = "lineno" > 221< / span > < span class = "comment" > // the one that was set. This is because some assumptions may now be< / span > < / div >
< div class = "line" > < a id = "l00222" name = "l00222" > < / a > < span class = "lineno" > 222< / span > < span class = "comment" > // consequences of others before them due to the newly learned clauses.< / span > < / div >
< div class = "line" > < a id = "l00223" name = "l00223" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a88dcaf0cf27bb4991376ed54d8f2698f" > 223< / a > < / span > < span class = "keywordtype" > int< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a88dcaf0cf27bb4991376ed54d8f2698f" > AssumptionLevel< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > assumption_level_; }< / div >
< div class = "line" > < a id = "l00224" name = "l00224" > < / a > < span class = "lineno" > 224< / span > < / div >
< div class = "line" > < a id = "l00225" name = "l00225" > < / a > < span class = "lineno" > 225< / span > < span class = "comment" > // This can be called just after SolveWithAssumptions() returned< / span > < / div >
< div class = "line" > < a id = "l00226" name = "l00226" > < / a > < span class = "lineno" > 226< / span > < span class = "comment" > // ASSUMPTION_UNSAT or after EnqueueDecisionAndBacktrackOnConflict() leaded< / span > < / div >
< div class = "line" > < a id = "l00227" name = "l00227" > < / a > < span class = "lineno" > 227< / span > < span class = "comment" > // to a conflict. It returns a subsequence (in the correct order) of the< / span > < / div >
< div class = "line" > < a id = "l00228" name = "l00228" > < / a > < span class = "lineno" > 228< / span > < span class = "comment" > // previously enqueued decisions that cannot be taken together without making< / span > < / div >
< div class = "line" > < a id = "l00229" name = "l00229" > < / a > < span class = "lineno" > 229< / span > < span class = "comment" > // the problem UNSAT.< / span > < / div >
< div class = "line" > < a id = "l00230" name = "l00230" > < / a > < span class = "lineno" > 230< / span > std::vector< Literal> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acfbfa9df611cb625ff79785c05784580" > GetLastIncompatibleDecisions< / a > ();< / div >
< div class = "line" > < a id = "l00231" name = "l00231" > < / a > < span class = "lineno" > 231< / span > < / div >
< div class = "line" > < a id = "l00232" name = "l00232" > < / a > < span class = "lineno" > 232< / span > < span class = "comment" > // Advanced usage. The next 3 functions allow to drive the search from outside< / span > < / div >
< div class = "line" > < a id = "l00233" name = "l00233" > < / a > < span class = "lineno" > 233< / span > < span class = "comment" > // the solver.< / span > < / div >
< div class = "line" > < a id = "l00234" name = "l00234" > < / a > < span class = "lineno" > 234< / span > < / div >
< div class = "line" > < a id = "l00235" name = "l00235" > < / a > < span class = "lineno" > 235< / span > < span class = "comment" > // Takes a new decision (the given true_literal must be unassigned) and< / span > < / div >
< div class = "line" > < a id = "l00236" name = "l00236" > < / a > < span class = "lineno" > 236< / span > < span class = "comment" > // propagates it. Returns the trail index of the first newly propagated< / span > < / div >
< div class = "line" > < a id = "l00237" name = "l00237" > < / a > < span class = "lineno" > 237< / span > < span class = "comment" > // literal. If there is a conflict and the problem is detected to be UNSAT,< / span > < / div >
< div class = "line" > < a id = "l00238" name = "l00238" > < / a > < span class = "lineno" > 238< / span > < span class = "comment" > // returns kUnsatTrailIndex.< / span > < / div >
< div class = "line" > < a id = "l00239" name = "l00239" > < / a > < span class = "lineno" > 239< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00240" name = "l00240" > < / a > < span class = "lineno" > 240< / span > < span class = "comment" > // Important: In the presence of assumptions, this also returns< / span > < / div >
< div class = "line" > < a id = "l00241" name = "l00241" > < / a > < span class = "lineno" > 241< / span > < span class = "comment" > // kUnsatTrailIndex on ASSUMPTION_UNSAT. One can know the difference with< / span > < / div >
< div class = "line" > < a id = "l00242" name = "l00242" > < / a > < span class = "lineno" > 242< / span > < span class = "comment" > // IsModelUnsat().< / span > < / div >
< div class = "line" > < a id = "l00243" name = "l00243" > < / a > < span class = "lineno" > 243< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00244" name = "l00244" > < / a > < span class = "lineno" > 244< / span > < span class = "comment" > // A client can determine if there is a conflict by checking if the< / span > < / div >
< div class = "line" > < a id = "l00245" name = "l00245" > < / a > < span class = "lineno" > 245< / span > < span class = "comment" > // CurrentDecisionLevel() was increased by 1 or not.< / span > < / div >
< div class = "line" > < a id = "l00246" name = "l00246" > < / a > < span class = "lineno" > 246< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00247" name = "l00247" > < / a > < span class = "lineno" > 247< / span > < span class = "comment" > // If there is a conflict, the given decision is not applied and:< / span > < / div >
< div class = "line" > < a id = "l00248" name = "l00248" > < / a > < span class = "lineno" > 248< / span > < span class = "comment" > // - The conflict is learned.< / span > < / div >
< div class = "line" > < a id = "l00249" name = "l00249" > < / a > < span class = "lineno" > 249< / span > < span class = "comment" > // - The decisions are potentially backtracked to the first decision that< / span > < / div >
< div class = "line" > < a id = "l00250" name = "l00250" > < / a > < span class = "lineno" > 250< / span > < span class = "comment" > // propagates more variables because of the newly learned conflict.< / span > < / div >
< div class = "line" > < a id = "l00251" name = "l00251" > < / a > < span class = "lineno" > 251< / span > < span class = "comment" > // - The returned value is equal to trail_-> Index() after this backtracking< / span > < / div >
< div class = "line" > < a id = "l00252" name = "l00252" > < / a > < span class = "lineno" > 252< / span > < span class = "comment" > // and just before the new propagation (due to the conflict) which is also< / span > < / div >
< div class = "line" > < a id = "l00253" name = "l00253" > < / a > < span class = "lineno" > 253< / span > < span class = "comment" > // performed by this function.< / span > < / div >
< div class = "line" > < a id = "l00254" name = "l00254" > < / a > < span class = "lineno" > 254< / span > < span class = "keywordtype" > int< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9ae69b015a43c1a94e8815ab0dd8189c" > EnqueueDecisionAndBackjumpOnConflict< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > true_literal);< / div >
< div class = "line" > < a id = "l00255" name = "l00255" > < / a > < span class = "lineno" > 255< / span > < / div >
< div class = "line" > < a id = "l00256" name = "l00256" > < / a > < span class = "lineno" > 256< / span > < span class = "comment" > // This function starts by calling EnqueueDecisionAndBackjumpOnConflict(). If< / span > < / div >
< div class = "line" > < a id = "l00257" name = "l00257" > < / a > < span class = "lineno" > 257< / span > < span class = "comment" > // there is no conflict, it stops there. Otherwise, it tries to reapply all< / span > < / div >
< div class = "line" > < a id = "l00258" name = "l00258" > < / a > < span class = "lineno" > 258< / span > < span class = "comment" > // the decisions that were backjumped over until the first one that can' t be< / span > < / div >
< div class = "line" > < a id = "l00259" name = "l00259" > < / a > < span class = "lineno" > 259< / span > < span class = "comment" > // taken because it is incompatible. Note that during this process, more< / span > < / div >
< div class = "line" > < a id = "l00260" name = "l00260" > < / a > < span class = "lineno" > 260< / span > < span class = "comment" > // conflicts may happen and the trail may be backtracked even further.< / span > < / div >
< div class = "line" > < a id = "l00261" name = "l00261" > < / a > < span class = "lineno" > 261< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00262" name = "l00262" > < / a > < span class = "lineno" > 262< / span > < span class = "comment" > // In any case, the new decisions stack will be the largest valid " prefix" < / span > < / div >
< div class = "line" > < a id = "l00263" name = "l00263" > < / a > < span class = "lineno" > 263< / span > < span class = "comment" > // of the old stack. Note that decisions that are now consequence of the ones< / span > < / div >
< div class = "line" > < a id = "l00264" name = "l00264" > < / a > < span class = "lineno" > 264< / span > < span class = "comment" > // before them will no longer be decisions.< / span > < / div >
< div class = "line" > < a id = "l00265" name = "l00265" > < / a > < span class = "lineno" > 265< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00266" name = "l00266" > < / a > < span class = "lineno" > 266< / span > < span class = "comment" > // Note(user): This function can be called with an already assigned literal.< / span > < / div >
< div class = "line" > < a id = "l00267" name = "l00267" > < / a > < span class = "lineno" > 267< / span > < span class = "keywordtype" > int< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859" > EnqueueDecisionAndBacktrackOnConflict< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > true_literal);< / div >
< div class = "line" > < a id = "l00268" name = "l00268" > < / a > < span class = "lineno" > 268< / span > < / div >
< div class = "line" > < a id = "l00269" name = "l00269" > < / a > < span class = "lineno" > 269< / span > < span class = "comment" > // Tries to enqueue the given decision and performs the propagation.< / span > < / div >
< div class = "line" > < a id = "l00270" name = "l00270" > < / a > < span class = "lineno" > 270< / span > < span class = "comment" > // Returns true if no conflict occurred. Otherwise, returns false and restores< / span > < / div >
< div class = "line" > < a id = "l00271" name = "l00271" > < / a > < span class = "lineno" > 271< / span > < span class = "comment" > // the solver to the state just before this was called.< / span > < / div >
< div class = "line" > < a id = "l00272" name = "l00272" > < / a > < span class = "lineno" > 272< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00273" name = "l00273" > < / a > < span class = "lineno" > 273< / span > < span class = "comment" > // Note(user): With this function, the solver doesn' t learn anything.< / span > < / div >
< div class = "line" > < a id = "l00274" name = "l00274" > < / a > < span class = "lineno" > 274< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a093c00c2bd81c8ec7a5f86a4466fa7d5" > EnqueueDecisionIfNotConflicting< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > true_literal);< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00275" name = "l00275" > < / a > < span class = "lineno" > 275< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00276" name = "l00276" > < / a > < span class = "lineno" > 276< / span > < span class = "comment" > // Restores the state to the given target decision level. The decision at that< / span > < / div >
< div class = "line" > < a id = "l00277" name = "l00277" > < / a > < span class = "lineno" > 277< / span > < span class = "comment" > // level and all its propagation will not be undone. But all the trail after< / span > < / div >
< div class = "line" > < a id = "l00278" name = "l00278" > < / a > < span class = "lineno" > 278< / span > < span class = "comment" > // this will be cleared. Calling this with 0 will revert all the decisions and< / span > < / div >
< div class = "line" > < a id = "l00279" name = "l00279" > < / a > < span class = "lineno" > 279< / span > < span class = "comment" > // only the fixed variables will be left on the trail.< / span > < / div >
< div class = "line" > < a id = "l00280" name = "l00280" > < / a > < span class = "lineno" > 280< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (< span class = "keywordtype" > int< / span > target_level);< / div >
< div class = "line" > < a id = "l00281" name = "l00281" > < / a > < span class = "lineno" > 281< / span > < / div >
< div class = "line" > < a id = "l00282" name = "l00282" > < / a > < span class = "lineno" > 282< / span > < span class = "comment" > // Advanced usage. This is meant to restore the solver to a " proper" state< / span > < / div >
< div class = "line" > < a id = "l00283" name = "l00283" > < / a > < span class = "lineno" > 283< / span > < span class = "comment" > // after a solve was interrupted due to a limit reached.< / span > < / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00284" name = "l00284" > < / a > < span class = "lineno" > 284< / span > < span class = "comment" > //< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00285" name = "l00285" > < / a > < span class = "lineno" > 285< / span > < span class = "comment" > // Without assumption (i.e. if AssumptionLevel() is 0), this will revert all< / span > < / div >
< div class = "line" > < a id = "l00286" name = "l00286" > < / a > < span class = "lineno" > 286< / span > < span class = "comment" > // decisions and make sure that all the fixed literals are propagated. In< / span > < / div >
< div class = "line" > < a id = "l00287" name = "l00287" > < / a > < span class = "lineno" > 287< / span > < span class = "comment" > // presence of assumptions, this will either backtrack to the assumption level< / span > < / div >
< div class = "line" > < a id = "l00288" name = "l00288" > < / a > < span class = "lineno" > 288< / span > < span class = "comment" > // or re-enqueue any assumptions that may have been backtracked over due to< / span > < / div >
< div class = "line" > < a id = "l00289" name = "l00289" > < / a > < span class = "lineno" > 289< / span > < span class = "comment" > // conflits resolution. In both cases, the propagation is finished.< / span > < / div >
< div class = "line" > < a id = "l00290" name = "l00290" > < / a > < span class = "lineno" > 290< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00291" name = "l00291" > < / a > < span class = "lineno" > 291< / span > < span class = "comment" > // Note that this may prove the model to be UNSAT or ASSUMPTION_UNSAT in which< / span > < / div >
< div class = "line" > < a id = "l00292" name = "l00292" > < / a > < span class = "lineno" > 292< / span > < span class = "comment" > // case it will return false.< / span > < / div >
< div class = "line" > < a id = "l00293" name = "l00293" > < / a > < span class = "lineno" > 293< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac714aeb75f0f6dd87e52e5d1a0d6edc7" > RestoreSolverToAssumptionLevel< / a > ();< / div >
< div class = "line" > < a id = "l00294" name = "l00294" > < / a > < span class = "lineno" > 294< / span > < / div >
< div class = "line" > < a id = "l00295" name = "l00295" > < / a > < span class = "lineno" > 295< / span > < span class = "comment" > // Advanced usage. Finish the progation if it was interrupted. Note that this< / span > < / div >
< div class = "line" > < a id = "l00296" name = "l00296" > < / a > < span class = "lineno" > 296< / span > < span class = "comment" > // might run into conflict and will propagate again until a fixed point is< / span > < / div >
< div class = "line" > < a id = "l00297" name = "l00297" > < / a > < span class = "lineno" > 297< / span > < span class = "comment" > // reached or the model was proven UNSAT. Returns IsModelUnsat().< / span > < / div >
< div class = "line" > < a id = "l00298" name = "l00298" > < / a > < span class = "lineno" > 298< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d" > FinishPropagation< / a > ();< / div >
< div class = "line" > < a id = "l00299" name = "l00299" > < / a > < span class = "lineno" > 299< / span > < / div >
< div class = "line" > < a id = "l00300" name = "l00300" > < / a > < span class = "lineno" > 300< / span > < span class = "comment" > // Like Backtrack(0) but make sure the propagation is finished and return< / span > < / div >
< div class = "line" > < a id = "l00301" name = "l00301" > < / a > < span class = "lineno" > 301< / span > < span class = "comment" > // false if unsat was detected. This also removes any assumptions level.< / span > < / div >
< div class = "line" > < a id = "l00302" name = "l00302" > < / a > < span class = "lineno" > 302< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029" > ResetToLevelZero< / a > ();< / div >
< div class = "line" > < a id = "l00303" name = "l00303" > < / a > < span class = "lineno" > 303< / span > < / div >
< div class = "line" > < a id = "l00304" name = "l00304" > < / a > < span class = "lineno" > 304< / span > < span class = "comment" > // Changes the assumptions level and the current solver assumptions. Returns< / span > < / div >
< div class = "line" > < a id = "l00305" name = "l00305" > < / a > < span class = "lineno" > 305< / span > < span class = "comment" > // false if the model is UNSAT or ASSUMPTION_UNSAT, true otherwise.< / span > < / div >
< div class = "line" > < a id = "l00306" name = "l00306" > < / a > < span class = "lineno" > 306< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00307" name = "l00307" > < / a > < span class = "lineno" > 307< / span > < span class = "comment" > // This uses the " new" assumptions handling, where all assumptions are< / span > < / div >
< div class = "line" > < a id = "l00308" name = "l00308" > < / a > < span class = "lineno" > 308< / span > < span class = "comment" > // enqueued at once at decision level 1 before we start to propagate. This has< / span > < / div >
< div class = "line" > < a id = "l00309" name = "l00309" > < / a > < span class = "lineno" > 309< / span > < span class = "comment" > // many advantages. In particular, because we propagate with the binary< / span > < / div >
< div class = "line" > < a id = "l00310" name = "l00310" > < / a > < span class = "lineno" > 310< / span > < span class = "comment" > // implications first, if we ever have assumption => not(other_assumptions) we< / span > < / div >
< div class = "line" > < a id = "l00311" name = "l00311" > < / a > < span class = "lineno" > 311< / span > < span class = "comment" > // are guaranteed to find it and returns a core of size 2.< / span > < / div >
< div class = "line" > < a id = "l00312" name = "l00312" > < / a > < span class = "lineno" > 312< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00313" name = "l00313" > < / a > < span class = "lineno" > 313< / span > < span class = "comment" > // Paper: " Speeding Up Assumption-Based SAT" , Randy Hickey and Fahiem Bacchus< / span > < / div >
< div class = "line" > < a id = "l00314" name = "l00314" > < / a > < span class = "lineno" > 314< / span > < span class = "comment" > // http://www.maxhs.org/docs/Hickey-Bacchus2019_Chapter_SpeedingUpAssumption-BasedSAT.pdf< / span > < / div >
< div class = "line" > < a id = "l00315" name = "l00315" > < / a > < span class = "lineno" > 315< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad4494c6831942d344ed1d9758f0e6cd9" > ResetWithGivenAssumptions< / a > (< span class = "keyword" > const< / span > std::vector< Literal> & assumptions);< / div >
< div class = "line" > < a id = "l00316" name = "l00316" > < / a > < span class = "lineno" > 316< / span > < / div >
< div class = "line" > < a id = "l00317" name = "l00317" > < / a > < span class = "lineno" > 317< / span > < span class = "comment" > // Advanced usage. If the decision level is smaller than the assumption level,< / span > < / div >
< div class = "line" > < a id = "l00318" name = "l00318" > < / a > < span class = "lineno" > 318< / span > < span class = "comment" > // this will try to reapply all assumptions. Returns true if this was doable,< / span > < / div >
< div class = "line" > < a id = "l00319" name = "l00319" > < / a > < span class = "lineno" > 319< / span > < span class = "comment" > // otherwise returns false in which case the model is either UNSAT or< / span > < / div >
< div class = "line" > < a id = "l00320" name = "l00320" > < / a > < span class = "lineno" > 320< / span > < span class = "comment" > // ASSUMPTION_UNSAT.< / span > < / div >
< div class = "line" > < a id = "l00321" name = "l00321" > < / a > < span class = "lineno" > 321< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad28cbdd5735a0c111a642f39524d969e" > ReapplyAssumptionsIfNeeded< / a > ();< / div >
< div class = "line" > < a id = "l00322" name = "l00322" > < / a > < span class = "lineno" > 322< / span > < / div >
< div class = "line" > < a id = "l00323" name = "l00323" > < / a > < span class = "lineno" > 323< / span > < span class = "comment" > // Helper functions to get the correct status when one of the functions above< / span > < / div >
< div class = "line" > < a id = "l00324" name = "l00324" > < / a > < span class = "lineno" > 324< / span > < span class = "comment" > // returns false.< / span > < / div >
< div class = "line" > < a id = "l00325" name = "l00325" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad" > 325< / a > < / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5bbe13ebae8aa11a8a4ac1cb01bc66ad" > UnsatStatus< / a > ()< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00326" name = "l00326" > < / a > < span class = "lineno" > 326< / span > < span class = "keywordflow" > return< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > IsModelUnsat< / a > () ? < a class = "code hl_enumvalue" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483" > INFEASIBLE< / a > : < a class = "code hl_enumvalue" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70bae5ba802809eb747ea486ca3fae32a885" > ASSUMPTIONS_UNSAT< / a > ;< / div >
< div class = "line" > < a id = "l00327" name = "l00327" > < / a > < span class = "lineno" > 327< / span > }< / div >
< div class = "line" > < a id = "l00328" name = "l00328" > < / a > < span class = "lineno" > 328< / span > < / div >
< div class = "line" > < a id = "l00329" name = "l00329" > < / a > < span class = "lineno" > 329< / span > < span class = "comment" > // Extract the current problem clauses. The Output type must support the two< / span > < / div >
< div class = "line" > < a id = "l00330" name = "l00330" > < / a > < span class = "lineno" > 330< / span > < span class = "comment" > // functions:< / span > < / div >
< div class = "line" > < a id = "l00331" name = "l00331" > < / a > < span class = "lineno" > 331< / span > < span class = "comment" > // - void AddBinaryClause(Literal a, Literal b);< / span > < / div >
< div class = "line" > < a id = "l00332" name = "l00332" > < / a > < span class = "lineno" > 332< / span > < span class = "comment" > // - void AddClause(absl::Span< const Literal> clause);< / span > < / div >
< div class = "line" > < a id = "l00333" name = "l00333" > < / a > < span class = "lineno" > 333< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00334" name = "l00334" > < / a > < span class = "lineno" > 334< / span > < span class = "comment" > // TODO(user): also copy the removable clauses?< / span > < / div >
< div class = "line" > < a id = "l00335" name = "l00335" > < / a > < span class = "lineno" > 335< / span > < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > Output> < / div >
< div class = "line" > < a id = "l00336" name = "l00336" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ab5bc2f86603d9fdb9a51305ab431530d" > 336< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ab5bc2f86603d9fdb9a51305ab431530d" > ExtractClauses< / a > (Output* out) {< / div >
< div class = "line" > < a id = "l00337" name = "l00337" > < / a > < span class = "lineno" > 337< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (!< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > IsModelUnsat< / a > ());< / div >
< div class = "line" > < a id = "l00338" name = "l00338" > < / a > < span class = "lineno" > 338< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a id = "l00339" name = "l00339" > < / a > < span class = "lineno" > 339< / span > < span class = "keywordflow" > if< / span > (!< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d" > FinishPropagation< / a > ()) < span class = "keywordflow" > return< / span > ;< / div >
< div class = "line" > < a id = "l00340" name = "l00340" > < / a > < span class = "lineno" > 340< / span > < / div >
< div class = "line" > < a id = "l00341" name = "l00341" > < / a > < span class = "lineno" > 341< / span > < span class = "comment" > // It is important to process the newly fixed variables, so they are not< / span > < / div >
< div class = "line" > < a id = "l00342" name = "l00342" > < / a > < span class = "lineno" > 342< / span > < span class = "comment" > // present in the clauses we export.< / span > < / div >
< div class = "line" > < a id = "l00343" name = "l00343" > < / a > < span class = "lineno" > 343< / span > < span class = "keywordflow" > if< / span > (num_processed_fixed_variables_ < trail_-> < a class = "code hl_typedef" href = "namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e" > Index< / a > ()) {< / div >
< div class = "line" > < a id = "l00344" name = "l00344" > < / a > < span class = "lineno" > 344< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2aafb0d6bd7d95f183e87866d0ade374" > ProcessNewlyFixedVariables< / a > ();< / div >
< div class = "line" > < a id = "l00345" name = "l00345" > < / a > < span class = "lineno" > 345< / span > }< / div >
< div class = "line" > < a id = "l00346" name = "l00346" > < / a > < span class = "lineno" > 346< / span > clauses_propagator_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_literal_watchers.html#ae234022ee7c496416290d1946f56e1ad" > DeleteRemovedClauses< / a > ();< / div >
< div class = "line" > < a id = "l00347" name = "l00347" > < / a > < span class = "lineno" > 347< / span > < / div >
< div class = "line" > < a id = "l00348" name = "l00348" > < / a > < span class = "lineno" > 348< / span > < span class = "comment" > // Note(user): Putting the binary clauses first help because the presolver< / span > < / div >
< div class = "line" > < a id = "l00349" name = "l00349" > < / a > < span class = "lineno" > 349< / span > < span class = "comment" > // currently process the clauses in order.< / span > < / div >
< div class = "line" > < a id = "l00350" name = "l00350" > < / a > < span class = "lineno" > 350< / span > out-> SetNumVariables(< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > NumVariables< / a > ());< / div >
< div class = "line" > < a id = "l00351" name = "l00351" > < / a > < span class = "lineno" > 351< / span > binary_implication_graph_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_binary_implication_graph.html#a558f9dd435d1f46d7408d60d0e9969f1" > ExtractAllBinaryClauses< / a > (out);< / div >
< div class = "line" > < a id = "l00352" name = "l00352" > < / a > < span class = "lineno" > 352< / span > < span class = "keywordflow" > for< / span > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_clause.html" > SatClause< / a > * clause : clauses_propagator_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_literal_watchers.html#abe425f3287da97e7ffaa8c9dfb3dcefe" > AllClausesInCreationOrder< / a > ()) {< / div >
< div class = "line" > < a id = "l00353" name = "l00353" > < / a > < span class = "lineno" > 353< / span > < span class = "keywordflow" > if< / span > (!clauses_propagator_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_literal_watchers.html#ab054db78fc1b1e1681d2fc4e9fd1ca45" > IsRemovable< / a > (clause)) {< / div >
< div class = "line" > < a id = "l00354" name = "l00354" > < / a > < span class = "lineno" > 354< / span > out-> AddClause(clause-> AsSpan());< / div >
< div class = "line" > < a id = "l00355" name = "l00355" > < / a > < span class = "lineno" > 355< / span > }< / div >
< div class = "line" > < a id = "l00356" name = "l00356" > < / a > < span class = "lineno" > 356< / span > }< / div >
< div class = "line" > < a id = "l00357" name = "l00357" > < / a > < span class = "lineno" > 357< / span > }< / div >
< div class = "line" > < a id = "l00358" name = "l00358" > < / a > < span class = "lineno" > 358< / span > < / div >
< div class = "line" > < a id = "l00359" name = "l00359" > < / a > < span class = "lineno" > 359< / span > < span class = "comment" > // Functions to manage the set of learned binary clauses.< / span > < / div >
< div class = "line" > < a id = "l00360" name = "l00360" > < / a > < span class = "lineno" > 360< / span > < span class = "comment" > // Only clauses added/learned when TrackBinaryClause() is true are managed.< / span > < / div >
< div class = "line" > < a id = "l00361" name = "l00361" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aa5e0514942c20e89148448f4d0572cd0" > 361< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#aa5e0514942c20e89148448f4d0572cd0" > TrackBinaryClauses< / a > (< span class = "keywordtype" > bool< / span > < a class = "code hl_variable" href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > ) { track_binary_clauses_ = < a class = "code hl_variable" href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > ; }< / div >
< div class = "line" > < a id = "l00362" name = "l00362" > < / a > < span class = "lineno" > 362< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5a9a59c0a2f7fcec81cc44b1aa159186" > AddBinaryClauses< / a > (< span class = "keyword" > const< / span > std::vector< BinaryClause> & < a class = "code hl_variable" href = "cp__model__solver_8cc.html#a21696c8707868a3d522d1bee261f4185" > clauses< / a > );< / div >
< div class = "line" > < a id = "l00363" name = "l00363" > < / a > < span class = "lineno" > 363< / span > < span class = "keyword" > const< / span > std::vector< BinaryClause> & < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4e9c1f685afe26db1566eaa65724b40b" > NewlyAddedBinaryClauses< / a > ();< / div >
< div class = "line" > < a id = "l00364" name = "l00364" > < / a > < span class = "lineno" > 364< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#afdb0cc1ac877cd981dcd3f0b0763e644" > ClearNewlyAddedBinaryClauses< / a > ();< / div >
< div class = "line" > < a id = "l00365" name = "l00365" > < / a > < span class = "lineno" > 365< / span > < / div >
< div class = "line" > < a id = "l00366" name = "l00366" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html" > 366< / a > < / span > < span class = "keyword" > struct < / span > < a class = "code hl_struct" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html" > Decision< / a > {< / div >
< div class = "line" > < a id = "l00367" name = "l00367" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#abd62b993702516d946bdbef25f6d29b0" > 367< / a > < / span > < a class = "code hl_function" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#abd62b993702516d946bdbef25f6d29b0" > Decision< / a > () {}< / div >
< div class = "line" > < a id = "l00368" name = "l00368" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a2949c912240ff8a61f4a6751250bba27" > 368< / a > < / span > < a class = "code hl_function" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a2949c912240ff8a61f4a6751250bba27" > Decision< / a > (< span class = "keywordtype" > int< / span > i, < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l) : < a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a84b0a5cf3a019584a6f21ec98136c60a" > trail_index< / a > (i), < a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > (l) {}< / div >
< div class = "line" > < a id = "l00369" name = "l00369" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a84b0a5cf3a019584a6f21ec98136c60a" > 369< / a > < / span > < span class = "keywordtype" > int< / span > < a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a84b0a5cf3a019584a6f21ec98136c60a" > trail_index< / a > = 0;< / div >
< div class = "line" > < a id = "l00370" name = "l00370" > < / a > < span class = "lineno" > < a class = "line" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#af63dcc00f2023fdf498e0829e6fb8a6b" > 370< / a > < / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > ;< / div >
< div class = "line" > < a id = "l00371" name = "l00371" > < / a > < span class = "lineno" > 371< / span > };< / div >
< div class = "line" > < a id = "l00372" name = "l00372" > < / a > < span class = "lineno" > 372< / span > < / div >
< div class = "line" > < a id = "l00373" name = "l00373" > < / a > < span class = "lineno" > 373< / span > < span class = "comment" > // Note that the Decisions() vector is always of size NumVariables(), and that< / span > < / div >
< div class = "line" > < a id = "l00374" name = "l00374" > < / a > < span class = "lineno" > 374< / span > < span class = "comment" > // only the first CurrentDecisionLevel() entries have a meaning.< / span > < / div >
< div class = "line" > < a id = "l00375" name = "l00375" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5048581740d1affcc6168f56fe88ff58" > 375< / a > < / span > < span class = "keyword" > const< / span > std::vector< Decision> & < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5048581740d1affcc6168f56fe88ff58" > Decisions< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > decisions_; }< / div >
< div class = "line" > < a id = "l00376" name = "l00376" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > 376< / a > < / span > < span class = "keywordtype" > int< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > current_decision_level_; }< / div >
< div class = "line" > < a id = "l00377" name = "l00377" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5b06f24fb581de78b321dfd793931439" > 377< / a > < / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_trail.html" > Trail< / a > & < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5b06f24fb581de78b321dfd793931439" > LiteralTrail< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > *trail_; }< / div >
< div class = "line" > < a id = "l00378" name = "l00378" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b" > 378< / a > < / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_variables_assignment.html" > VariablesAssignment< / a > & < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b" > Assignment< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > trail_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b" > Assignment< / a > (); }< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00379" name = "l00379" > < / a > < span class = "lineno" > 379< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00380" name = "l00380" > < / a > < span class = "lineno" > 380< / span > < span class = "comment" > // Some statistics since the creation of the solver.< / span > < / div >
< div class = "line" > < a id = "l00381" name = "l00381" > < / a > < span class = "lineno" > 381< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a8fa29503728270c9696389c9e590c242" > num_branches< / a > () < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00382" name = "l00382" > < / a > < span class = "lineno" > 382< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f" > num_failures< / a > () < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00383" name = "l00383" > < / a > < span class = "lineno" > 383< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#abaadd9bf3136af09f2d2ae695439c4fa" > num_propagations< / a > () < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00384" name = "l00384" > < / a > < span class = "lineno" > 384< / span > < / div >
< div class = "line" > < a id = "l00385" name = "l00385" > < / a > < span class = "lineno" > 385< / span > < span class = "comment" > // Note that we count the number of backtrack to level zero from a positive< / span > < / div >
< div class = "line" > < a id = "l00386" name = "l00386" > < / a > < span class = "lineno" > 386< / span > < span class = "comment" > // level. Those can corresponds to actual restarts, or conflicts that learn< / span > < / div >
< div class = "line" > < a id = "l00387" name = "l00387" > < / a > < span class = "lineno" > 387< / span > < span class = "comment" > // unit clauses or any other reason that trigger such backtrack.< / span > < / div >
< div class = "line" > < a id = "l00388" name = "l00388" > < / a > < span class = "lineno" > 388< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a7ab8996f31104834f27a232817731314" > num_restarts< / a > () < span class = "keyword" > const< / span > ;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00389" name = "l00389" > < / a > < span class = "lineno" > 389< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00390" name = "l00390" > < / a > < span class = "lineno" > 390< / span > < span class = "comment" > // A deterministic number that should be correlated with the time spent in< / span > < / div >
< div class = "line" > < a id = "l00391" name = "l00391" > < / a > < span class = "lineno" > 391< / span > < span class = "comment" > // the Solve() function. The order of magnitude should be close to the time< / span > < / div >
< div class = "line" > < a id = "l00392" name = "l00392" > < / a > < span class = "lineno" > 392< / span > < span class = "comment" > // in seconds.< / span > < / div >
< div class = "line" > < a id = "l00393" name = "l00393" > < / a > < span class = "lineno" > 393< / span > < span class = "keywordtype" > double< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125" > deterministic_time< / a > () < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00394" name = "l00394" > < / a > < span class = "lineno" > 394< / span > < / div >
< div class = "line" > < a id = "l00395" name = "l00395" > < / a > < span class = "lineno" > 395< / span > < span class = "comment" > // Only used for debugging. Save the current assignment in debug_assignment_.< / span > < / div >
< div class = "line" > < a id = "l00396" name = "l00396" > < / a > < span class = "lineno" > 396< / span > < span class = "comment" > // The idea is that if we know that a given assignment is satisfiable, then< / span > < / div >
< div class = "line" > < a id = "l00397" name = "l00397" > < / a > < span class = "lineno" > 397< / span > < span class = "comment" > // all the learned clauses or PB constraints must be satisfiable by it. In< / span > < / div >
< div class = "line" > < a id = "l00398" name = "l00398" > < / a > < span class = "lineno" > 398< / span > < span class = "comment" > // debug mode, and after this is called, all the learned clauses are tested to< / span > < / div >
< div class = "line" > < a id = "l00399" name = "l00399" > < / a > < span class = "lineno" > 399< / span > < span class = "comment" > // satisfy this saved assignment.< / span > < / div >
< div class = "line" > < a id = "l00400" name = "l00400" > < / a > < span class = "lineno" > 400< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a68050818df324a24e6309055e857b955" > SaveDebugAssignment< / a > ();< / div >
< div class = "line" > < a id = "l00401" name = "l00401" > < / a > < span class = "lineno" > 401< / span > < / div >
< div class = "line" > < a id = "l00402" name = "l00402" > < / a > < span class = "lineno" > 402< / span > < span class = "comment" > // Returns true iff the loaded problem only contains clauses.< / span > < / div >
< div class = "line" > < a id = "l00403" name = "l00403" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a678cca4fb095d5dee896dd687649a5de" > 403< / a > < / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a678cca4fb095d5dee896dd687649a5de" > ProblemIsPureSat< / a > ()< span class = "keyword" > const < / span > { < span class = "keywordflow" > return< / span > problem_is_pure_sat_; }< / div >
< div class = "line" > < a id = "l00404" name = "l00404" > < / a > < span class = "lineno" > 404< / span > < / div >
< div class = "line" > < a id = "l00405" name = "l00405" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a75f1d17f36330a1c8a96e43fe8805598" > 405< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a75f1d17f36330a1c8a96e43fe8805598" > SetDratProofHandler< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_drat_proof_handler.html" > DratProofHandler< / a > * drat_proof_handler) {< / div >
< div class = "line" > < a id = "l00406" name = "l00406" > < / a > < span class = "lineno" > 406< / span > drat_proof_handler_ = drat_proof_handler;< / div >
< div class = "line" > < a id = "l00407" name = "l00407" > < / a > < span class = "lineno" > 407< / span > clauses_propagator_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_literal_watchers.html#a75f1d17f36330a1c8a96e43fe8805598" > SetDratProofHandler< / a > (drat_proof_handler_);< / div >
< div class = "line" > < a id = "l00408" name = "l00408" > < / a > < span class = "lineno" > 408< / span > binary_implication_graph_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_binary_implication_graph.html#a75f1d17f36330a1c8a96e43fe8805598" > SetDratProofHandler< / a > (drat_proof_handler_);< / div >
< div class = "line" > < a id = "l00409" name = "l00409" > < / a > < span class = "lineno" > 409< / span > }< / div >
< div class = "line" > < a id = "l00410" name = "l00410" > < / a > < span class = "lineno" > 410< / span > < / div >
< div class = "line" > < a id = "l00411" name = "l00411" > < / a > < span class = "lineno" > 411< / span > < span class = "comment" > // This function is here to deal with the case where a SAT/CP model is found< / span > < / div >
< div class = "line" > < a id = "l00412" name = "l00412" > < / a > < span class = "lineno" > 412< / span > < span class = "comment" > // to be trivially UNSAT while the user is constructing the model. Instead of< / span > < / div >
< div class = "line" > < a id = "l00413" name = "l00413" > < / a > < span class = "lineno" > 413< / span > < span class = "comment" > // having to test the status of all the lines adding a constraint, one can< / span > < / div >
< div class = "line" > < a id = "l00414" name = "l00414" > < / a > < span class = "lineno" > 414< / span > < span class = "comment" > // just check if the solver is not UNSAT once the model is constructed. Note< / span > < / div >
< div class = "line" > < a id = "l00415" name = "l00415" > < / a > < span class = "lineno" > 415< / span > < span class = "comment" > // that we usually log a warning on the first constraint that caused a< / span > < / div >
< div class = "line" > < a id = "l00416" name = "l00416" > < / a > < span class = "lineno" > 416< / span > < span class = "comment" > // " trival" unsatisfiability.< / span > < / div >
< div class = "line" > < a id = "l00417" name = "l00417" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea" > 417< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea" > NotifyThatModelIsUnsat< / a > () { model_is_unsat_ = < span class = "keyword" > true< / span > ; }< / div >
< div class = "line" > < a id = "l00418" name = "l00418" > < / a > < span class = "lineno" > 418< / span > < / div >
< div class = "line" > < a id = "l00419" name = "l00419" > < / a > < span class = "lineno" > 419< / span > < span class = "comment" > // Adds a clause at any level of the tree and propagate any new deductions.< / span > < / div >
< div class = "line" > < a id = "l00420" name = "l00420" > < / a > < span class = "lineno" > 420< / span > < span class = "comment" > // Returns false if the model becomes UNSAT. Important: We currently do not< / span > < / div >
< div class = "line" > < a id = "l00421" name = "l00421" > < / a > < span class = "lineno" > 421< / span > < span class = "comment" > // support adding a clause that is already falsified at a positive decision< / span > < / div >
< div class = "line" > < a id = "l00422" name = "l00422" > < / a > < span class = "lineno" > 422< / span > < span class = "comment" > // level. Doing that will cause a check fail.< / span > < / div >
< div class = "line" > < a id = "l00423" name = "l00423" > < / a > < span class = "lineno" > 423< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00424" name = "l00424" > < / a > < span class = "lineno" > 424< / span > < span class = "comment" > // TODO(user): Backjump and propagate on a falsified clause? this is currently< / span > < / div >
< div class = "line" > < a id = "l00425" name = "l00425" > < / a > < span class = "lineno" > 425< / span > < span class = "comment" > // not needed.< / span > < / div >
< div class = "line" > < a id = "l00426" name = "l00426" > < / a > < span class = "lineno" > 426< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a25eb4ef5875f4884226251b66eb61bc0" > AddClauseDuringSearch< / a > (absl::Span< const Literal> literals);< / div >
< div class = "line" > < a id = "l00427" name = "l00427" > < / a > < span class = "lineno" > 427< / span > < / div >
< div class = "line" > < a id = "l00428" name = "l00428" > < / a > < span class = "lineno" > 428< / span > < span class = "comment" > // Performs propagation of the recently enqueued elements.< / span > < / div >
< div class = "line" > < a id = "l00429" name = "l00429" > < / a > < span class = "lineno" > 429< / span > < span class = "comment" > // Mainly visible for testing.< / span > < / div >
< div class = "line" > < a id = "l00430" name = "l00430" > < / a > < span class = "lineno" > 430< / span > < span class = "keywordtype" > bool< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#adadc001cbdc7263b106fc5886b60ff39" > Propagate< / a > ();< / div >
< div class = "line" > < a id = "l00431" name = "l00431" > < / a > < span class = "lineno" > 431< / span > < / div >
< div class = "line" > < a id = "l00432" name = "l00432" > < / a > < span class = "lineno" > 432< / span > < span class = "comment" > // This must be called at level zero. It will spend the given num decision and< / span > < / div >
< div class = "line" > < a id = "l00433" name = "l00433" > < / a > < span class = "lineno" > 433< / span > < span class = "comment" > // use propagation to try to minimize some clauses from the database.< / span > < / div >
< div class = "line" > < a id = "l00434" name = "l00434" > < / a > < span class = "lineno" > 434< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a8f1f9030283b2fa93b2353ab260ebe1e" > MinimizeSomeClauses< / a > (< span class = "keywordtype" > int< / span > decisions_budget);< / div >
< div class = "line" > < a id = "l00435" name = "l00435" > < / a > < span class = "lineno" > 435< / span > < / div >
< div class = "line" > < a id = "l00436" name = "l00436" > < / a > < span class = "lineno" > 436< / span > < span class = "comment" > // Sets the export function to the shared clauses manager.< / span > < / div >
< div class = "line" > < a id = "l00437" name = "l00437" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a748882726e16a456976b3753478a0496" > 437< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a748882726e16a456976b3753478a0496" > SetShareBinaryClauseCallback< / a > (< span class = "keyword" > const< / span > std::function< < span class = "keywordtype" > void< / span > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > )> & < / div >
< div class = "line" > < a id = "l00438" name = "l00438" > < / a > < span class = "lineno" > 438< / span > shared_binary_clauses_callback) {< / div >
< div class = "line" > < a id = "l00439" name = "l00439" > < / a > < span class = "lineno" > 439< / span > shared_binary_clauses_callback_ = shared_binary_clauses_callback;< / div >
< div class = "line" > < a id = "l00440" name = "l00440" > < / a > < span class = "lineno" > 440< / span > }< / div >
< div class = "line" > < a id = "l00441" name = "l00441" > < / a > < span class = "lineno" > 441< / span > < / div >
< div class = "line" > < a id = "l00442" name = "l00442" > < / a > < span class = "lineno" > 442< / span > < span class = "comment" > // Advance the given time limit with all the deterministic time that was< / span > < / div >
< div class = "line" > < a id = "l00443" name = "l00443" > < / a > < span class = "lineno" > 443< / span > < span class = "comment" > // elapsed since last call.< / span > < / div >
< div class = "line" > < a id = "l00444" name = "l00444" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a705eddd5baee23097daf34b73e66eae3" > 444< / a > < / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a705eddd5baee23097daf34b73e66eae3" > AdvanceDeterministicTime< / a > (< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * limit) {< / div >
< div class = "line" > < a id = "l00445" name = "l00445" > < / a > < span class = "lineno" > 445< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > double< / span > current = < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ae525d235b02bcfc962d845e28f5f0125" > deterministic_time< / a > ();< / div >
< div class = "line" > < a id = "l00446" name = "l00446" > < / a > < span class = "lineno" > 446< / span > limit-> < a class = "code hl_function" href = "classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9" > AdvanceDeterministicTime< / a > (< / div >
< div class = "line" > < a id = "l00447" name = "l00447" > < / a > < span class = "lineno" > 447< / span > current - deterministic_time_at_last_advanced_time_limit_);< / div >
< div class = "line" > < a id = "l00448" name = "l00448" > < / a > < span class = "lineno" > 448< / span > deterministic_time_at_last_advanced_time_limit_ = current;< / div >
< div class = "line" > < a id = "l00449" name = "l00449" > < / a > < span class = "lineno" > 449< / span > }< / div >
< div class = "line" > < a id = "l00450" name = "l00450" > < / a > < span class = "lineno" > 450< / span > < / div >
< div class = "line" > < a id = "l00451" name = "l00451" > < / a > < span class = "lineno" > 451< / span > < span class = "comment" > // Simplifies the problem when new variables are assigned at level 0.< / span > < / div >
< div class = "line" > < a id = "l00452" name = "l00452" > < / a > < span class = "lineno" > 452< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a2aafb0d6bd7d95f183e87866d0ade374" > ProcessNewlyFixedVariables< / a > ();< / div >
< div class = "line" > < a id = "l00453" name = "l00453" > < / a > < span class = "lineno" > 453< / span > < / div >
< div class = "line" > < a id = "l00454" name = "l00454" > < / a > < span class = "lineno" > < a class = "line" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a50d602d16dde52a55910bb160baa7719" > 454< / a > < / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a50d602d16dde52a55910bb160baa7719" > NumFixedVariables< / a > ()< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00455" name = "l00455" > < / a > < span class = "lineno" > 455< / span > < span class = "keywordflow" > if< / span > (!decisions_.empty()) < span class = "keywordflow" > return< / span > decisions_[0].trail_index;< / div >
< div class = "line" > < a id = "l00456" name = "l00456" > < / a > < span class = "lineno" > 456< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b" > CHECK_EQ< / a > (< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > (), 0);< / div >
< div class = "line" > < a id = "l00457" name = "l00457" > < / a > < span class = "lineno" > 457< / span > < span class = "keywordflow" > return< / span > trail_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179" > Index< / a > ();< / div >
< div class = "line" > < a id = "l00458" name = "l00458" > < / a > < span class = "lineno" > 458< / span > }< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00459" name = "l00459" > < / a > < span class = "lineno" > 459< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00460" name = "l00460" > < / a > < span class = "lineno" > 460< / span > < span class = "keyword" > private< / span > :< / div >
< div class = "line" > < a id = "l00461" name = "l00461" > < / a > < span class = "lineno" > 461< / span > < span class = "comment" > // Calls Propagate() and returns true if no conflict occurred. Otherwise,< / span > < / div >
< div class = "line" > < a id = "l00462" name = "l00462" > < / a > < span class = "lineno" > 462< / span > < span class = "comment" > // learns the conflict, backtracks, enqueues the consequence of the learned< / span > < / div >
< div class = "line" > < a id = "l00463" name = "l00463" > < / a > < span class = "lineno" > 463< / span > < span class = "comment" > // conflict and returns false.< / span > < / div >
< div class = "line" > < a id = "l00464" name = "l00464" > < / a > < span class = "lineno" > 464< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00465" name = "l00465" > < / a > < span class = "lineno" > 465< / span > < span class = "comment" > // When handling assumptions, this might return false without backtracking< / span > < / div >
< div class = "line" > < a id = "l00466" name = "l00466" > < / a > < span class = "lineno" > 466< / span > < span class = "comment" > // in case of ASSUMPTIONS_UNSAT.< / span > < / div >
< div class = "line" > < a id = "l00467" name = "l00467" > < / a > < span class = "lineno" > 467< / span > < span class = "keywordtype" > bool< / span > PropagateAndStopAfterOneConflictResolution();< / div >
< div class = "line" > < a id = "l00468" name = "l00468" > < / a > < span class = "lineno" > 468< / span > < / div >
< div class = "line" > < a id = "l00469" name = "l00469" > < / a > < span class = "lineno" > 469< / span > < span class = "comment" > // All Solve() functions end up calling this one.< / span > < / div >
< div class = "line" > < a id = "l00470" name = "l00470" > < / a > < span class = "lineno" > 470< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > SolveInternal(< a class = "code hl_class" href = "classoperations__research_1_1_time_limit.html" > TimeLimit< / a > * < a class = "code hl_variable" href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > );< / div >
< div class = "line" > < a id = "l00471" name = "l00471" > < / a > < span class = "lineno" > 471< / span > < / div >
< div class = "line" > < a id = "l00472" name = "l00472" > < / a > < span class = "lineno" > 472< / span > < span class = "comment" > // Adds a binary clause to the BinaryImplicationGraph and to the< / span > < / div >
< div class = "line" > < a id = "l00473" name = "l00473" > < / a > < span class = "lineno" > 473< / span > < span class = "comment" > // BinaryClauseManager when track_binary_clauses_ is true.< / span > < / div >
< div class = "line" > < a id = "l00474" name = "l00474" > < / a > < span class = "lineno" > 474< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00475" name = "l00475" > < / a > < span class = "lineno" > 475< / span > < span class = "comment" > // If export_clause is true, then we will also export_clause that to a< / span > < / div >
< div class = "line" > < a id = "l00476" name = "l00476" > < / a > < span class = "lineno" > 476< / span > < span class = "comment" > // potential shared_binary_clauses_callback_.< / span > < / div >
< div class = "line" > < a id = "l00477" name = "l00477" > < / a > < span class = "lineno" > 477< / span > < span class = "keywordtype" > void< / span > AddBinaryClauseInternal(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > , < span class = "keywordtype" > bool< / span > export_clause);< / div >
< div class = "line" > < a id = "l00478" name = "l00478" > < / a > < span class = "lineno" > 478< / span > < / div >
< div class = "line" > < a id = "l00479" name = "l00479" > < / a > < span class = "lineno" > 479< / span > < span class = "comment" > // See SaveDebugAssignment(). Note that these functions only consider the< / span > < / div >
< div class = "line" > < a id = "l00480" name = "l00480" > < / a > < span class = "lineno" > 480< / span > < span class = "comment" > // variables at the time the debug_assignment_ was saved. If new variables< / span > < / div >
< div class = "line" > < a id = "l00481" name = "l00481" > < / a > < span class = "lineno" > 481< / span > < span class = "comment" > // were added since that time, they will be considered unassigned.< / span > < / div >
< div class = "line" > < a id = "l00482" name = "l00482" > < / a > < span class = "lineno" > 482< / span > < span class = "keywordtype" > bool< / span > ClauseIsValidUnderDebugAssignment(< / div >
< div class = "line" > < a id = "l00483" name = "l00483" > < / a > < span class = "lineno" > 483< / span > < span class = "keyword" > const< / span > std::vector< Literal> & clause) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00484" name = "l00484" > < / a > < span class = "lineno" > 484< / span > < span class = "keywordtype" > bool< / span > PBConstraintIsValidUnderDebugAssignment(< / div >
< div class = "line" > < a id = "l00485" name = "l00485" > < / a > < span class = "lineno" > 485< / span > < span class = "keyword" > const< / span > std::vector< LiteralWithCoeff> & cst, < span class = "keyword" > const< / span > < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > rhs) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00486" name = "l00486" > < / a > < span class = "lineno" > 486< / span > < / div >
< div class = "line" > < a id = "l00487" name = "l00487" > < / a > < span class = "lineno" > 487< / span > < span class = "comment" > // Logs the given status if parameters_.log_search_progress() is true.< / span > < / div >
< div class = "line" > < a id = "l00488" name = "l00488" > < / a > < span class = "lineno" > 488< / span > < span class = "comment" > // Also returns it.< / span > < / div >
< div class = "line" > < a id = "l00489" name = "l00489" > < / a > < span class = "lineno" > 489< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > StatusWithLog(< a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > < a class = "code hl_variable" href = "g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d" > status< / a > );< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00490" name = "l00490" > < / a > < span class = "lineno" > 490< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00491" name = "l00491" > < / a > < span class = "lineno" > 491< / span > < span class = "comment" > // Main function called from SolveWithAssumptions() or from Solve() with an< / span > < / div >
< div class = "line" > < a id = "l00492" name = "l00492" > < / a > < span class = "lineno" > 492< / span > < span class = "comment" > // assumption_level of 0 (meaning no assumptions).< / span > < / div >
< div class = "line" > < a id = "l00493" name = "l00493" > < / a > < span class = "lineno" > 493< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > SolveInternal(< span class = "keywordtype" > int< / span > assumption_level);< / div >
< div class = "line" > < a id = "l00494" name = "l00494" > < / a > < span class = "lineno" > 494< / span > < / div >
< div class = "line" > < a id = "l00495" name = "l00495" > < / a > < span class = "lineno" > 495< / span > < span class = "comment" > // Applies the previous decisions (which are still on decisions_), in order,< / span > < / div >
< div class = "line" > < a id = "l00496" name = "l00496" > < / a > < span class = "lineno" > 496< / span > < span class = "comment" > // starting from the one at the current decision level. Stops at the one at< / span > < / div >
< div class = "line" > < a id = "l00497" name = "l00497" > < / a > < span class = "lineno" > 497< / span > < span class = "comment" > // decisions_[level] or on the first decision already propagated to " false" < / span > < / div >
< div class = "line" > < a id = "l00498" name = "l00498" > < / a > < span class = "lineno" > 498< / span > < span class = "comment" > // and thus incompatible.< / span > < / div >
< div class = "line" > < a id = "l00499" name = "l00499" > < / a > < span class = "lineno" > 499< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00500" name = "l00500" > < / a > < span class = "lineno" > 500< / span > < span class = "comment" > // Note that during this process, conflicts may arise which will lead to< / span > < / div >
< div class = "line" > < a id = "l00501" name = "l00501" > < / a > < span class = "lineno" > 501< / span > < span class = "comment" > // backjumps. In this case, we will simply keep reapplying decisions from the< / span > < / div >
< div class = "line" > < a id = "l00502" name = "l00502" > < / a > < span class = "lineno" > 502< / span > < span class = "comment" > // last one backtracked over and so on.< / span > < / div >
< div class = "line" > < a id = "l00503" name = "l00503" > < / a > < span class = "lineno" > 503< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00504" name = "l00504" > < / a > < span class = "lineno" > 504< / span > < span class = "comment" > // Returns FEASIBLE if no conflict occurred, INFEASIBLE if the model was< / span > < / div >
< div class = "line" > < a id = "l00505" name = "l00505" > < / a > < span class = "lineno" > 505< / span > < span class = "comment" > // proven unsat and ASSUMPTION_UNSAT otherwise. In the last case the first non< / span > < / div >
< div class = "line" > < a id = "l00506" name = "l00506" > < / a > < span class = "lineno" > 506< / span > < span class = "comment" > // taken old decision will be propagated to false by the ones before.< / span > < / div >
< div class = "line" > < a id = "l00507" name = "l00507" > < / a > < span class = "lineno" > 507< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00508" name = "l00508" > < / a > < span class = "lineno" > 508< / span > < span class = "comment" > // first_propagation_index will be filled with the trail index of the first< / span > < / div >
< div class = "line" > < a id = "l00509" name = "l00509" > < / a > < span class = "lineno" > 509< / span > < span class = "comment" > // newly propagated literal, or with -1 if INFEASIBLE is returned.< / span > < / div >
< div class = "line" > < a id = "l00510" name = "l00510" > < / a > < span class = "lineno" > 510< / span > < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > ReapplyDecisionsUpTo(< span class = "keywordtype" > int< / span > level, < span class = "keywordtype" > int< / span > * first_propagation_index);< / div >
< div class = "line" > < a id = "l00511" name = "l00511" > < / a > < span class = "lineno" > 511< / span > < / div >
< div class = "line" > < a id = "l00512" name = "l00512" > < / a > < span class = "lineno" > 512< / span > < span class = "comment" > // Returns false if the thread memory is over the limit.< / span > < / div >
< div class = "line" > < a id = "l00513" name = "l00513" > < / a > < span class = "lineno" > 513< / span > < span class = "keywordtype" > bool< / span > IsMemoryLimitReached() < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00514" name = "l00514" > < / a > < span class = "lineno" > 514< / span > < / div >
< div class = "line" > < a id = "l00515" name = "l00515" > < / a > < span class = "lineno" > 515< / span > < span class = "comment" > // Sets model_is_unsat_ to true and return false.< / span > < / div >
< div class = "line" > < a id = "l00516" name = "l00516" > < / a > < span class = "lineno" > 516< / span > < span class = "keywordtype" > bool< / span > SetModelUnsat();< / div >
< div class = "line" > < a id = "l00517" name = "l00517" > < / a > < span class = "lineno" > 517< / span > < / div >
< div class = "line" > < a id = "l00518" name = "l00518" > < / a > < span class = "lineno" > 518< / span > < span class = "comment" > // Returns the decision level of a given variable.< / span > < / div >
< div class = "line" > < a id = "l00519" name = "l00519" > < / a > < span class = "lineno" > 519< / span > < span class = "keywordtype" > int< / span > DecisionLevel(BooleanVariable < a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > )< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00520" name = "l00520" > < / a > < span class = "lineno" > 520< / span > < span class = "keywordflow" > return< / span > trail_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#aba78b12088909fb59dbdd0cb064412ae" > Info< / a > (< a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ).< a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_assignment_info.html#a6a330c3b2adf87bfa27e9a9450d8bc40" > level< / a > ;< / div >
< div class = "line" > < a id = "l00521" name = "l00521" > < / a > < span class = "lineno" > 521< / span > }< / div >
< div class = "line" > < a id = "l00522" name = "l00522" > < / a > < span class = "lineno" > 522< / span > < / div >
< div class = "line" > < a id = "l00523" name = "l00523" > < / a > < span class = "lineno" > 523< / span > < span class = "comment" > // Returns the relevant pointer if the given variable was propagated by the< / span > < / div >
< div class = "line" > < a id = "l00524" name = "l00524" > < / a > < span class = "lineno" > 524< / span > < span class = "comment" > // constraint in question. This is used to bump the activity of the learned< / span > < / div >
< div class = "line" > < a id = "l00525" name = "l00525" > < / a > < span class = "lineno" > 525< / span > < span class = "comment" > // clauses or pb constraints.< / span > < / div >
< div class = "line" > < a id = "l00526" name = "l00526" > < / a > < span class = "lineno" > 526< / span > SatClause* ReasonClauseOrNull(BooleanVariable < a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00527" name = "l00527" > < / a > < span class = "lineno" > 527< / span > UpperBoundedLinearConstraint* ReasonPbConstraintOrNull(< / div >
< div class = "line" > < a id = "l00528" name = "l00528" > < / a > < span class = "lineno" > 528< / span > BooleanVariable < a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00529" name = "l00529" > < / a > < span class = "lineno" > 529< / span > < / div >
< div class = "line" > < a id = "l00530" name = "l00530" > < / a > < span class = "lineno" > 530< / span > < span class = "comment" > // This does one step of a pseudo-Boolean resolution:< / span > < / div >
< div class = "line" > < a id = "l00531" name = "l00531" > < / a > < span class = "lineno" > 531< / span > < span class = "comment" > // - The variable var has been assigned to l at a given trail_index.< / span > < / div >
< div class = "line" > < a id = "l00532" name = "l00532" > < / a > < span class = "lineno" > 532< / span > < span class = "comment" > // - The reason for var propagates it to l.< / span > < / div >
< div class = "line" > < a id = "l00533" name = "l00533" > < / a > < span class = "lineno" > 533< / span > < span class = "comment" > // - The conflict propagates it to not(l)< / span > < / div >
< div class = "line" > < a id = "l00534" name = "l00534" > < / a > < span class = "lineno" > 534< / span > < span class = "comment" > // The goal of the operation is to combine the two constraints in order to< / span > < / div >
< div class = "line" > < a id = "l00535" name = "l00535" > < / a > < span class = "lineno" > 535< / span > < span class = "comment" > // have a new conflict at a lower trail_index.< / span > < / div >
< div class = "line" > < a id = "l00536" name = "l00536" > < / a > < span class = "lineno" > 536< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00537" name = "l00537" > < / a > < span class = "lineno" > 537< / span > < span class = "comment" > // Returns true if the reason for var was a normal clause. In this case,< / span > < / div >
< div class = "line" > < a id = "l00538" name = "l00538" > < / a > < span class = "lineno" > 538< / span > < span class = "comment" > // the *slack is updated to its new value.< / span > < / div >
< div class = "line" > < a id = "l00539" name = "l00539" > < / a > < span class = "lineno" > 539< / span > < span class = "keywordtype" > bool< / span > ResolvePBConflict(BooleanVariable < a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ,< / div >
< div class = "line" > < a id = "l00540" name = "l00540" > < / a > < span class = "lineno" > 540< / span > MutableUpperBoundedLinearConstraint* conflict,< / div >
< div class = "line" > < a id = "l00541" name = "l00541" > < / a > < span class = "lineno" > 541< / span > < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > * slack);< / div >
< div class = "line" > < a id = "l00542" name = "l00542" > < / a > < span class = "lineno" > 542< / span > < / div >
< div class = "line" > < a id = "l00543" name = "l00543" > < / a > < span class = "lineno" > 543< / span > < span class = "comment" > // Returns true iff the clause is the reason for an assigned variable.< / span > < / div >
< div class = "line" > < a id = "l00544" name = "l00544" > < / a > < span class = "lineno" > 544< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00545" name = "l00545" > < / a > < span class = "lineno" > 545< / span > < span class = "comment" > // TODO(user): With our current data structures, we could also return true< / span > < / div >
< div class = "line" > < a id = "l00546" name = "l00546" > < / a > < span class = "lineno" > 546< / span > < span class = "comment" > // for clauses that were just used as a reason (like just before an untrail).< / span > < / div >
< div class = "line" > < a id = "l00547" name = "l00547" > < / a > < span class = "lineno" > 547< / span > < span class = "comment" > // This may be beneficial, but should properly be defined so that we can< / span > < / div >
< div class = "line" > < a id = "l00548" name = "l00548" > < / a > < span class = "lineno" > 548< / span > < span class = "comment" > // have the same behavior if we change the implementation.< / span > < / div >
< div class = "line" > < a id = "l00549" name = "l00549" > < / a > < span class = "lineno" > 549< / span > < span class = "keywordtype" > bool< / span > ClauseIsUsedAsReason(SatClause* clause)< span class = "keyword" > const < / span > {< / div >
< div class = "line" > < a id = "l00550" name = "l00550" > < / a > < span class = "lineno" > 550< / span > < span class = "keyword" > const< / span > BooleanVariable < a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > = clause-> PropagatedLiteral().Variable();< / div >
< div class = "line" > < a id = "l00551" name = "l00551" > < / a > < span class = "lineno" > 551< / span > < span class = "keywordflow" > return< / span > trail_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#aba78b12088909fb59dbdd0cb064412ae" > Info< / a > (< a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ).< a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_assignment_info.html#a0f2d611d5c2d56f60646827438acf3af" > trail_index< / a > < trail_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179" > Index< / a > () & & < / div >
< div class = "line" > < a id = "l00552" name = "l00552" > < / a > < span class = "lineno" > 552< / span > (*trail_)[trail_-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#aba78b12088909fb59dbdd0cb064412ae" > Info< / a > (< a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ).< a class = "code hl_variable" href = "structoperations__research_1_1sat_1_1_assignment_info.html#a0f2d611d5c2d56f60646827438acf3af" > trail_index< / a > ].Variable() == < a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > & & < / div >
< div class = "line" > < a id = "l00553" name = "l00553" > < / a > < span class = "lineno" > 553< / span > ReasonClauseOrNull(< a class = "code hl_variable" href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > ) == clause;< / div >
< div class = "line" > < a id = "l00554" name = "l00554" > < / a > < span class = "lineno" > 554< / span > }< / div >
< div class = "line" > < a id = "l00555" name = "l00555" > < / a > < span class = "lineno" > 555< / span > < / div >
< div class = "line" > < a id = "l00556" name = "l00556" > < / a > < span class = "lineno" > 556< / span > < span class = "comment" > // Add a problem clause. The clause is assumed to be " cleaned" , that is no< / span > < / div >
< div class = "line" > < a id = "l00557" name = "l00557" > < / a > < span class = "lineno" > 557< / span > < span class = "comment" > // duplicate variables (not strictly required) and not empty.< / span > < / div >
< div class = "line" > < a id = "l00558" name = "l00558" > < / a > < span class = "lineno" > 558< / span > < span class = "keywordtype" > bool< / span > AddProblemClauseInternal(absl::Span< const Literal> literals);< / div >
< div class = "line" > < a id = "l00559" name = "l00559" > < / a > < span class = "lineno" > 559< / span > < / div >
< div class = "line" > < a id = "l00560" name = "l00560" > < / a > < span class = "lineno" > 560< / span > < span class = "comment" > // This is used by all the Add*LinearConstraint() functions. It detects< / span > < / div >
< div class = "line" > < a id = "l00561" name = "l00561" > < / a > < span class = "lineno" > 561< / span > < span class = "comment" > // infeasible/trivial constraints or clause constraints and takes the proper< / span > < / div >
< div class = "line" > < a id = "l00562" name = "l00562" > < / a > < span class = "lineno" > 562< / span > < span class = "comment" > // action.< / span > < / div >
< div class = "line" > < a id = "l00563" name = "l00563" > < / a > < span class = "lineno" > 563< / span > < span class = "keywordtype" > bool< / span > AddLinearConstraintInternal(< span class = "keyword" > const< / span > std::vector< LiteralWithCoeff> & cst,< / div >
< div class = "line" > < a id = "l00564" name = "l00564" > < / a > < span class = "lineno" > 564< / span > < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > rhs, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > max_value);< / div >
< div class = "line" > < a id = "l00565" name = "l00565" > < / a > < span class = "lineno" > 565< / span > < / div >
< div class = "line" > < a id = "l00566" name = "l00566" > < / a > < span class = "lineno" > 566< / span > < span class = "comment" > // Makes sure a pseudo boolean constraint is in canonical form.< / span > < / div >
< div class = "line" > < a id = "l00567" name = "l00567" > < / a > < span class = "lineno" > 567< / span > < span class = "keywordtype" > void< / span > CanonicalizeLinear(std::vector< LiteralWithCoeff> * cst,< / div >
< div class = "line" > < a id = "l00568" name = "l00568" > < / a > < span class = "lineno" > 568< / span > < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > * bound_shift, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > * max_value);< / div >
< div class = "line" > < a id = "l00569" name = "l00569" > < / a > < span class = "lineno" > 569< / span > < / div >
< div class = "line" > < a id = "l00570" name = "l00570" > < / a > < span class = "lineno" > 570< / span > < span class = "comment" > // Adds a learned clause to the problem. This should be called after< / span > < / div >
< div class = "line" > < a id = "l00571" name = "l00571" > < / a > < span class = "lineno" > 571< / span > < span class = "comment" > // Backtrack(). The backtrack is such that after it is applied, all the< / span > < / div >
< div class = "line" > < a id = "l00572" name = "l00572" > < / a > < span class = "lineno" > 572< / span > < span class = "comment" > // literals of the learned close except one will be false. Thus the last one< / span > < / div >
< div class = "line" > < a id = "l00573" name = "l00573" > < / a > < span class = "lineno" > 573< / span > < span class = "comment" > // will be implied True. This function also Enqueue() the implied literal.< / span > < / div >
< div class = "line" > < a id = "l00574" name = "l00574" > < / a > < span class = "lineno" > 574< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00575" name = "l00575" > < / a > < span class = "lineno" > 575< / span > < span class = "comment" > // Returns the LBD of the clause.< / span > < / div >
< div class = "line" > < a id = "l00576" name = "l00576" > < / a > < span class = "lineno" > 576< / span > < span class = "keywordtype" > int< / span > AddLearnedClauseAndEnqueueUnitPropagation(< / div >
< div class = "line" > < a id = "l00577" name = "l00577" > < / a > < span class = "lineno" > 577< / span > < span class = "keyword" > const< / span > std::vector< Literal> & literals, < span class = "keywordtype" > bool< / span > is_redundant);< / div >
< div class = "line" > < a id = "l00578" name = "l00578" > < / a > < span class = "lineno" > 578< / span > < / div >
< div class = "line" > < a id = "l00579" name = "l00579" > < / a > < span class = "lineno" > 579< / span > < span class = "comment" > // Creates a new decision which corresponds to setting the given literal to< / span > < / div >
< div class = "line" > < a id = "l00580" name = "l00580" > < / a > < span class = "lineno" > 580< / span > < span class = "comment" > // True and Enqueue() this change.< / span > < / div >
< div class = "line" > < a id = "l00581" name = "l00581" > < / a > < span class = "lineno" > 581< / span > < span class = "keywordtype" > void< / span > EnqueueNewDecision(Literal < a class = "code hl_variable" href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > );< / div >
< div class = "line" > < a id = "l00582" name = "l00582" > < / a > < span class = "lineno" > 582< / span > < / div >
< div class = "line" > < a id = "l00583" name = "l00583" > < / a > < span class = "lineno" > 583< / span > < span class = "comment" > // Returns true if everything has been propagated.< / span > < / div >
< div class = "line" > < a id = "l00584" name = "l00584" > < / a > < span class = "lineno" > 584< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00585" name = "l00585" > < / a > < span class = "lineno" > 585< / span > < span class = "comment" > // TODO(user): This test is fast but not exhaustive, especially regarding the< / span > < / div >
< div class = "line" > < a id = "l00586" name = "l00586" > < / a > < span class = "lineno" > 586< / span > < span class = "comment" > // integer propagators. Fix.< / span > < / div >
< div class = "line" > < a id = "l00587" name = "l00587" > < / a > < span class = "lineno" > 587< / span > < span class = "keywordtype" > bool< / span > PropagationIsDone() < span class = "keyword" > const< / span > ;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00588" name = "l00588" > < / a > < span class = "lineno" > 588< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00589" name = "l00589" > < / a > < span class = "lineno" > 589< / span > < span class = "comment" > // Update the propagators_ list with the relevant propagators.< / span > < / div >
< div class = "line" > < a id = "l00590" name = "l00590" > < / a > < span class = "lineno" > 590< / span > < span class = "keywordtype" > void< / span > InitializePropagators();< / div >
< div class = "line" > < a id = "l00591" name = "l00591" > < / a > < span class = "lineno" > 591< / span > < / div >
< div class = "line" > < a id = "l00592" name = "l00592" > < / a > < span class = "lineno" > 592< / span > < span class = "comment" > // Unrolls the trail until a given point. This unassign the assigned variables< / span > < / div >
< div class = "line" > < a id = "l00593" name = "l00593" > < / a > < span class = "lineno" > 593< / span > < span class = "comment" > // and add them to the priority queue with the correct weight.< / span > < / div >
< div class = "line" > < a id = "l00594" name = "l00594" > < / a > < span class = "lineno" > 594< / span > < span class = "keywordtype" > void< / span > Untrail(< span class = "keywordtype" > int< / span > target_trail_index);< / div >
< div class = "line" > < a id = "l00595" name = "l00595" > < / a > < span class = "lineno" > 595< / span > < / div >
< div class = "line" > < a id = "l00596" name = "l00596" > < / a > < span class = "lineno" > 596< / span > < span class = "comment" > // Output to the DRAT proof handler any newly fixed variables.< / span > < / div >
< div class = "line" > < a id = "l00597" name = "l00597" > < / a > < span class = "lineno" > 597< / span > < span class = "keywordtype" > void< / span > ProcessNewlyFixedVariablesForDratProof();< / div >
< div class = "line" > < a id = "l00598" name = "l00598" > < / a > < span class = "lineno" > 598< / span > < / div >
< div class = "line" > < a id = "l00599" name = "l00599" > < / a > < span class = "lineno" > 599< / span > < span class = "comment" > // Returns the maximum trail_index of the literals in the given clause.< / span > < / div >
< div class = "line" > < a id = "l00600" name = "l00600" > < / a > < span class = "lineno" > 600< / span > < span class = "comment" > // All the literals must be assigned. Returns -1 if the clause is empty.< / span > < / div >
< div class = "line" > < a id = "l00601" name = "l00601" > < / a > < span class = "lineno" > 601< / span > < span class = "keywordtype" > int< / span > ComputeMaxTrailIndex(absl::Span< const Literal> clause) < span class = "keyword" > const< / span > ;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00602" name = "l00602" > < / a > < span class = "lineno" > 602< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00603" name = "l00603" > < / a > < span class = "lineno" > 603< / span > < span class = "comment" > // Computes what is known as the first UIP (Unique implication point) conflict< / span > < / div >
< div class = "line" > < a id = "l00604" name = "l00604" > < / a > < span class = "lineno" > 604< / span > < span class = "comment" > // clause starting from the failing clause. For a definition of UIP and a< / span > < / div >
< div class = "line" > < a id = "l00605" name = "l00605" > < / a > < span class = "lineno" > 605< / span > < span class = "comment" > // comparison of the different possible conflict clause computation, see the< / span > < / div >
< div class = "line" > < a id = "l00606" name = "l00606" > < / a > < span class = "lineno" > 606< / span > < span class = "comment" > // reference below.< / span > < / div >
< div class = "line" > < a id = "l00607" name = "l00607" > < / a > < span class = "lineno" > 607< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00608" name = "l00608" > < / a > < span class = "lineno" > 608< / span > < span class = "comment" > // The conflict will have only one literal at the highest decision level, and< / span > < / div >
< div class = "line" > < a id = "l00609" name = "l00609" > < / a > < span class = "lineno" > 609< / span > < span class = "comment" > // this literal will always be the first in the conflict vector.< / span > < / div >
< div class = "line" > < a id = "l00610" name = "l00610" > < / a > < span class = "lineno" > 610< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00611" name = "l00611" > < / a > < span class = "lineno" > 611< / span > < span class = "comment" > // L Zhang, CF Madigan, MH Moskewicz, S Malik, " Efficient conflict driven< / span > < / div >
< div class = "line" > < a id = "l00612" name = "l00612" > < / a > < span class = "lineno" > 612< / span > < span class = "comment" > // learning in a boolean satisfiability solver" Proceedings of the 2001< / span > < / div >
< div class = "line" > < a id = "l00613" name = "l00613" > < / a > < span class = "lineno" > 613< / span > < span class = "comment" > // IEEE/ACM international conference on Computer-aided design, Pages 279-285.< / span > < / div >
< div class = "line" > < a id = "l00614" name = "l00614" > < / a > < span class = "lineno" > 614< / span > < span class = "comment" > // http://www.cs.tau.ac.il/~msagiv/courses/ATP/iccad2001_final.pdf< / span > < / div >
< div class = "line" > < a id = "l00615" name = "l00615" > < / a > < span class = "lineno" > 615< / span > < span class = "keywordtype" > void< / span > ComputeFirstUIPConflict(< / div >
< div class = "line" > < a id = "l00616" name = "l00616" > < / a > < span class = "lineno" > 616< / span > < span class = "keywordtype" > int< / span > max_trail_index, std::vector< Literal> * conflict,< / div >
< div class = "line" > < a id = "l00617" name = "l00617" > < / a > < span class = "lineno" > 617< / span > std::vector< Literal> * reason_used_to_infer_the_conflict,< / div >
< div class = "line" > < a id = "l00618" name = "l00618" > < / a > < span class = "lineno" > 618< / span > std::vector< SatClause*> * subsumed_clauses);< / div >
< div class = "line" > < a id = "l00619" name = "l00619" > < / a > < span class = "lineno" > 619< / span > < / div >
< div class = "line" > < a id = "l00620" name = "l00620" > < / a > < span class = "lineno" > 620< / span > < span class = "comment" > // Fills literals with all the literals in the reasons of the literals in the< / span > < / div >
< div class = "line" > < a id = "l00621" name = "l00621" > < / a > < span class = "lineno" > 621< / span > < span class = "comment" > // given input. The output vector will have no duplicates and will not contain< / span > < / div >
< div class = "line" > < a id = "l00622" name = "l00622" > < / a > < span class = "lineno" > 622< / span > < span class = "comment" > // the literals already present in the input.< / span > < / div >
< div class = "line" > < a id = "l00623" name = "l00623" > < / a > < span class = "lineno" > 623< / span > < span class = "keywordtype" > void< / span > ComputeUnionOfReasons(< span class = "keyword" > const< / span > std::vector< Literal> & < a class = "code hl_function" href = "parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051" > input< / a > ,< / div >
< div class = "line" > < a id = "l00624" name = "l00624" > < / a > < span class = "lineno" > 624< / span > std::vector< Literal> * literals);< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00625" name = "l00625" > < / a > < span class = "lineno" > 625< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00626" name = "l00626" > < / a > < span class = "lineno" > 626< / span > < span class = "comment" > // Do the full pseudo-Boolean constraint analysis. This calls multiple< / span > < / div >
< div class = "line" > < a id = "l00627" name = "l00627" > < / a > < span class = "lineno" > 627< / span > < span class = "comment" > // time ResolvePBConflict() on the current conflict until we have a conflict< / span > < / div >
< div class = "line" > < a id = "l00628" name = "l00628" > < / a > < span class = "lineno" > 628< / span > < span class = "comment" > // that allow us to propagate more at a lower decision level. This level< / span > < / div >
< div class = "line" > < a id = "l00629" name = "l00629" > < / a > < span class = "lineno" > 629< / span > < span class = "comment" > // is the one returned in backjump_level.< / span > < / div >
< div class = "line" > < a id = "l00630" name = "l00630" > < / a > < span class = "lineno" > 630< / span > < span class = "keywordtype" > void< / span > ComputePBConflict(< span class = "keywordtype" > int< / span > max_trail_index, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > initial_slack,< / div >
< div class = "line" > < a id = "l00631" name = "l00631" > < / a > < span class = "lineno" > 631< / span > MutableUpperBoundedLinearConstraint* conflict,< / div >
< div class = "line" > < a id = "l00632" name = "l00632" > < / a > < span class = "lineno" > 632< / span > < span class = "keywordtype" > int< / span > * backjump_level);< / div >
< div class = "line" > < a id = "l00633" name = "l00633" > < / a > < span class = "lineno" > 633< / span > < / div >
< div class = "line" > < a id = "l00634" name = "l00634" > < / a > < span class = "lineno" > 634< / span > < span class = "comment" > // Applies some heuristics to a conflict in order to minimize its size and/or< / span > < / div >
< div class = "line" > < a id = "l00635" name = "l00635" > < / a > < span class = "lineno" > 635< / span > < span class = "comment" > // replace literals by other literals from lower decision levels. The first< / span > < / div >
< div class = "line" > < a id = "l00636" name = "l00636" > < / a > < span class = "lineno" > 636< / span > < span class = "comment" > // function choose which one of the other functions to call depending on the< / span > < / div >
< div class = "line" > < a id = "l00637" name = "l00637" > < / a > < span class = "lineno" > 637< / span > < span class = "comment" > // parameters.< / span > < / div >
< div class = "line" > < a id = "l00638" name = "l00638" > < / a > < span class = "lineno" > 638< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00639" name = "l00639" > < / a > < span class = "lineno" > 639< / span > < span class = "comment" > // Precondidtion: is_marked_ should be set to true for all the variables of< / span > < / div >
< div class = "line" > < a id = "l00640" name = "l00640" > < / a > < span class = "lineno" > 640< / span > < span class = "comment" > // the conflict. It can also contains false non-conflict variables that< / span > < / div >
< div class = "line" > < a id = "l00641" name = "l00641" > < / a > < span class = "lineno" > 641< / span > < span class = "comment" > // are implied by the negation of the 1-UIP conflict literal.< / span > < / div >
< div class = "line" > < a id = "l00642" name = "l00642" > < / a > < span class = "lineno" > 642< / span > < span class = "keywordtype" > void< / span > MinimizeConflict(< / div >
< div class = "line" > < a id = "l00643" name = "l00643" > < / a > < span class = "lineno" > 643< / span > std::vector< Literal> * conflict,< / div >
< div class = "line" > < a id = "l00644" name = "l00644" > < / a > < span class = "lineno" > 644< / span > std::vector< Literal> * reason_used_to_infer_the_conflict);< / div >
< div class = "line" > < a id = "l00645" name = "l00645" > < / a > < span class = "lineno" > 645< / span > < span class = "keywordtype" > void< / span > MinimizeConflictExperimental(std::vector< Literal> * conflict);< / div >
< div class = "line" > < a id = "l00646" name = "l00646" > < / a > < span class = "lineno" > 646< / span > < span class = "keywordtype" > void< / span > MinimizeConflictSimple(std::vector< Literal> * conflict);< / div >
< div class = "line" > < a id = "l00647" name = "l00647" > < / a > < span class = "lineno" > 647< / span > < span class = "keywordtype" > void< / span > MinimizeConflictRecursively(std::vector< Literal> * conflict);< / div >
< div class = "line" > < a id = "l00648" name = "l00648" > < / a > < span class = "lineno" > 648< / span > < / div >
< div class = "line" > < a id = "l00649" name = "l00649" > < / a > < span class = "lineno" > 649< / span > < span class = "comment" > // Utility function used by MinimizeConflictRecursively().< / span > < / div >
< div class = "line" > < a id = "l00650" name = "l00650" > < / a > < span class = "lineno" > 650< / span > < span class = "keywordtype" > bool< / span > CanBeInferedFromConflictVariables(BooleanVariable variable);< / div >
< div class = "line" > < a id = "l00651" name = "l00651" > < / a > < span class = "lineno" > 651< / span > < / div >
< div class = "line" > < a id = "l00652" name = "l00652" > < / a > < span class = "lineno" > 652< / span > < span class = "comment" > // To be used in DCHECK(). Verifies some property of the conflict clause:< / span > < / div >
< div class = "line" > < a id = "l00653" name = "l00653" > < / a > < span class = "lineno" > 653< / span > < span class = "comment" > // - There is an unique literal with the highest decision level.< / span > < / div >
< div class = "line" > < a id = "l00654" name = "l00654" > < / a > < span class = "lineno" > 654< / span > < span class = "comment" > // - This literal appears in the first position.< / span > < / div >
< div class = "line" > < a id = "l00655" name = "l00655" > < / a > < span class = "lineno" > 655< / span > < span class = "comment" > // - All the other literals are of smaller decision level.< / span > < / div >
< div class = "line" > < a id = "l00656" name = "l00656" > < / a > < span class = "lineno" > 656< / span > < span class = "comment" > // - Ther is no literal with a decision level of zero.< / span > < / div >
< div class = "line" > < a id = "l00657" name = "l00657" > < / a > < span class = "lineno" > 657< / span > < span class = "keywordtype" > bool< / span > IsConflictValid(< span class = "keyword" > const< / span > std::vector< Literal> & literals);< / div >
< div class = "line" > < a id = "l00658" name = "l00658" > < / a > < span class = "lineno" > 658< / span > < / div >
< div class = "line" > < a id = "l00659" name = "l00659" > < / a > < span class = "lineno" > 659< / span > < span class = "comment" > // Given the learned clause after a conflict, this computes the correct< / span > < / div >
< div class = "line" > < a id = "l00660" name = "l00660" > < / a > < span class = "lineno" > 660< / span > < span class = "comment" > // backtrack level to call Backtrack() with.< / span > < / div >
< div class = "line" > < a id = "l00661" name = "l00661" > < / a > < span class = "lineno" > 661< / span > < span class = "keywordtype" > int< / span > ComputeBacktrackLevel(< span class = "keyword" > const< / span > std::vector< Literal> & literals);< / div >
< div class = "line" > < a id = "l00662" name = "l00662" > < / a > < span class = "lineno" > 662< / span > < / div >
< div class = "line" > < a id = "l00663" name = "l00663" > < / a > < span class = "lineno" > 663< / span > < span class = "comment" > // The LBD (Literal Blocks Distance) is the number of different decision< / span > < / div >
< div class = "line" > < a id = "l00664" name = "l00664" > < / a > < span class = "lineno" > 664< / span > < span class = "comment" > // levels at which the literals of the clause were assigned. Note that we< / span > < / div >
< div class = "line" > < a id = "l00665" name = "l00665" > < / a > < span class = "lineno" > 665< / span > < span class = "comment" > // ignore the decision level 0 whereas the definition in the paper below< / span > < / div >
< div class = "line" > < a id = "l00666" name = "l00666" > < / a > < span class = "lineno" > 666< / span > < span class = "comment" > // doesn' t:< / span > < / div >
< div class = "line" > < a id = "l00667" name = "l00667" > < / a > < span class = "lineno" > 667< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00668" name = "l00668" > < / a > < span class = "lineno" > 668< / span > < span class = "comment" > // G. Audemard, L. Simon, " Predicting Learnt Clauses Quality in Modern SAT< / span > < / div >
< div class = "line" > < a id = "l00669" name = "l00669" > < / a > < span class = "lineno" > 669< / span > < span class = "comment" > // Solver" in Twenty-first International Joint Conference on Artificial< / span > < / div >
< div class = "line" > < a id = "l00670" name = "l00670" > < / a > < span class = "lineno" > 670< / span > < span class = "comment" > // Intelligence (IJCAI' 09), july 2009.< / span > < / div >
< div class = "line" > < a id = "l00671" name = "l00671" > < / a > < span class = "lineno" > 671< / span > < span class = "comment" > // http://www.ijcai.org/papers09/Papers/IJCAI09-074.pdf< / span > < / div >
< div class = "line" > < a id = "l00672" name = "l00672" > < / a > < span class = "lineno" > 672< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00673" name = "l00673" > < / a > < span class = "lineno" > 673< / span > < span class = "comment" > // IMPORTANT: All the literals of the clause must be assigned, and the first< / span > < / div >
< div class = "line" > < a id = "l00674" name = "l00674" > < / a > < span class = "lineno" > 674< / span > < span class = "comment" > // literal must be of the highest decision level. This will be the case for< / span > < / div >
< div class = "line" > < a id = "l00675" name = "l00675" > < / a > < span class = "lineno" > 675< / span > < span class = "comment" > // all the reason clauses.< / span > < / div >
< div class = "line" > < a id = "l00676" name = "l00676" > < / a > < span class = "lineno" > 676< / span > < span class = "keyword" > template< / span > < < span class = "keyword" > typename< / span > LiteralList> < / div >
< div class = "line" > < a id = "l00677" name = "l00677" > < / a > < span class = "lineno" > 677< / span > < span class = "keywordtype" > int< / span > ComputeLbd(< span class = "keyword" > const< / span > LiteralList& literals);< / div >
< div class = "line" > < a id = "l00678" name = "l00678" > < / a > < span class = "lineno" > 678< / span > < / div >
< div class = "line" > < a id = "l00679" name = "l00679" > < / a > < span class = "lineno" > 679< / span > < span class = "comment" > // Checks if we need to reduce the number of learned clauses and do< / span > < / div >
< div class = "line" > < a id = "l00680" name = "l00680" > < / a > < span class = "lineno" > 680< / span > < span class = "comment" > // it if needed. Also updates the learned clause limit for the next cleanup.< / span > < / div >
< div class = "line" > < a id = "l00681" name = "l00681" > < / a > < span class = "lineno" > 681< / span > < span class = "keywordtype" > void< / span > CleanClauseDatabaseIfNeeded();< / div >
< div class = "line" > < a id = "l00682" name = "l00682" > < / a > < span class = "lineno" > 682< / span > < / div >
< div class = "line" > < a id = "l00683" name = "l00683" > < / a > < span class = "lineno" > 683< / span > < span class = "comment" > // Activity management for clauses. This work the same way at the ones for< / span > < / div >
< div class = "line" > < a id = "l00684" name = "l00684" > < / a > < span class = "lineno" > 684< / span > < span class = "comment" > // variables, but with different parameters.< / span > < / div >
< div class = "line" > < a id = "l00685" name = "l00685" > < / a > < span class = "lineno" > 685< / span > < span class = "keywordtype" > void< / span > BumpReasonActivities(< span class = "keyword" > const< / span > std::vector< Literal> & literals);< / div >
< div class = "line" > < a id = "l00686" name = "l00686" > < / a > < span class = "lineno" > 686< / span > < span class = "keywordtype" > void< / span > BumpClauseActivity(SatClause* clause);< / div >
< div class = "line" > < a id = "l00687" name = "l00687" > < / a > < span class = "lineno" > 687< / span > < span class = "keywordtype" > void< / span > RescaleClauseActivities(< span class = "keywordtype" > double< / span > scaling_factor);< / div >
< div class = "line" > < a id = "l00688" name = "l00688" > < / a > < span class = "lineno" > 688< / span > < span class = "keywordtype" > void< / span > UpdateClauseActivityIncrement();< / div >
< div class = "line" > < a id = "l00689" name = "l00689" > < / a > < span class = "lineno" > 689< / span > < / div >
< div class = "line" > < a id = "l00690" name = "l00690" > < / a > < span class = "lineno" > 690< / span > std::string DebugString(< span class = "keyword" > const< / span > SatClause& clause) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00691" name = "l00691" > < / a > < span class = "lineno" > 691< / span > std::string StatusString(< a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > Status< / a > < a class = "code hl_variable" href = "g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d" > status< / a > ) < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00692" name = "l00692" > < / a > < span class = "lineno" > 692< / span > std::string RunningStatisticsString() < span class = "keyword" > const< / span > ;< / div >
< div class = "line" > < a id = "l00693" name = "l00693" > < / a > < span class = "lineno" > 693< / span > < / div >
< div class = "line" > < a id = "l00694" name = "l00694" > < / a > < span class = "lineno" > 694< / span > < span class = "comment" > // Marks as " non-deletable" all clauses that were used to infer the given< / span > < / div >
< div class = "line" > < a id = "l00695" name = "l00695" > < / a > < span class = "lineno" > 695< / span > < span class = "comment" > // variable. The variable must be currently assigned.< / span > < / div >
< div class = "line" > < a id = "l00696" name = "l00696" > < / a > < span class = "lineno" > 696< / span > < span class = "keywordtype" > void< / span > KeepAllClauseUsedToInfer(BooleanVariable variable);< / div >
< div class = "line" > < a id = "l00697" name = "l00697" > < / a > < span class = "lineno" > 697< / span > < / div >
< div class = "line" > < a id = "l00698" name = "l00698" > < / a > < span class = "lineno" > 698< / span > < span class = "comment" > // Use propagation to try to minimize the given clause. This is really similar< / span > < / div >
< div class = "line" > < a id = "l00699" name = "l00699" > < / a > < span class = "lineno" > 699< / span > < span class = "comment" > // to MinimizeCoreWithPropagation(). It must be called when the current< / span > < / div >
< div class = "line" > < a id = "l00700" name = "l00700" > < / a > < span class = "lineno" > 700< / span > < span class = "comment" > // decision level is zero. Note that because this do a small tree search, it< / span > < / div >
< div class = "line" > < a id = "l00701" name = "l00701" > < / a > < span class = "lineno" > 701< / span > < span class = "comment" > // will impact the variable/clauses activities and may add new conflicts.< / span > < / div >
< div class = "line" > < a id = "l00702" name = "l00702" > < / a > < span class = "lineno" > 702< / span > < span class = "keywordtype" > void< / span > TryToMinimizeClause(SatClause* clause);< / div >
< div class = "line" > < a id = "l00703" name = "l00703" > < / a > < span class = "lineno" > 703< / span > < / div >
< div class = "line" > < a id = "l00704" name = "l00704" > < / a > < span class = "lineno" > 704< / span > < span class = "comment" > // This is used by the old non-model constructor.< / span > < / div >
< div class = "line" > < a id = "l00705" name = "l00705" > < / a > < span class = "lineno" > 705< / span > Model* model_;< / div >
< div class = "line" > < a id = "l00706" name = "l00706" > < / a > < span class = "lineno" > 706< / span > std::unique_ptr< Model> owned_model_;< / div >
< div class = "line" > < a id = "l00707" name = "l00707" > < / a > < span class = "lineno" > 707< / span > < / div >
< div class = "line" > < a id = "l00708" name = "l00708" > < / a > < span class = "lineno" > 708< / span > BooleanVariable num_variables_ = BooleanVariable(0);< / div >
< div class = "line" > < a id = "l00709" name = "l00709" > < / a > < span class = "lineno" > 709< / span > < / div >
< div class = "line" > < a id = "l00710" name = "l00710" > < / a > < span class = "lineno" > 710< / span > < span class = "comment" > // Internal propagators. We keep them here because we need more than the< / span > < / div >
< div class = "line" > < a id = "l00711" name = "l00711" > < / a > < span class = "lineno" > 711< / span > < span class = "comment" > // SatPropagator interface for them.< / span > < / div >
< div class = "line" > < a id = "l00712" name = "l00712" > < / a > < span class = "lineno" > 712< / span > BinaryImplicationGraph* binary_implication_graph_;< / div >
< div class = "line" > < a id = "l00713" name = "l00713" > < / a > < span class = "lineno" > 713< / span > LiteralWatchers* clauses_propagator_;< / div >
< div class = "line" > < a id = "l00714" name = "l00714" > < / a > < span class = "lineno" > 714< / span > PbConstraints* pb_constraints_;< / div >
< div class = "line" > < a id = "l00715" name = "l00715" > < / a > < span class = "lineno" > 715< / span > < / div >
< div class = "line" > < a id = "l00716" name = "l00716" > < / a > < span class = "lineno" > 716< / span > < span class = "comment" > // Ordered list of propagators used by Propagate()/Untrail().< / span > < / div >
< div class = "line" > < a id = "l00717" name = "l00717" > < / a > < span class = "lineno" > 717< / span > std::vector< SatPropagator*> propagators_;< / div >
< div class = "line" > < a id = "l00718" name = "l00718" > < / a > < span class = "lineno" > 718< / span > std::vector< SatPropagator*> non_empty_propagators_;< / div >
< div class = "line" > < a id = "l00719" name = "l00719" > < / a > < span class = "lineno" > 719< / span > < / div >
< div class = "line" > < a id = "l00720" name = "l00720" > < / a > < span class = "lineno" > 720< / span > < span class = "comment" > // Ordered list of propagators added with AddPropagator().< / span > < / div >
< div class = "line" > < a id = "l00721" name = "l00721" > < / a > < span class = "lineno" > 721< / span > std::vector< SatPropagator*> external_propagators_;< / div >
< div class = "line" > < a id = "l00722" name = "l00722" > < / a > < span class = "lineno" > 722< / span > SatPropagator* last_propagator_ = < span class = "keyword" > nullptr< / span > ;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00723" name = "l00723" > < / a > < span class = "lineno" > 723< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00724" name = "l00724" > < / a > < span class = "lineno" > 724< / span > < span class = "comment" > // For the old, non-model interface.< / span > < / div >
< div class = "line" > < a id = "l00725" name = "l00725" > < / a > < span class = "lineno" > 725< / span > std::vector< std::unique_ptr< SatPropagator> > owned_propagators_;< / div >
< div class = "line" > < a id = "l00726" name = "l00726" > < / a > < span class = "lineno" > 726< / span > < / div >
< div class = "line" > < a id = "l00727" name = "l00727" > < / a > < span class = "lineno" > 727< / span > < span class = "comment" > // Keep track of all binary clauses so they can be exported.< / span > < / div >
< div class = "line" > < a id = "l00728" name = "l00728" > < / a > < span class = "lineno" > 728< / span > < span class = "keywordtype" > bool< / span > track_binary_clauses_;< / div >
< div class = "line" > < a id = "l00729" name = "l00729" > < / a > < span class = "lineno" > 729< / span > BinaryClauseManager binary_clauses_;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00730" name = "l00730" > < / a > < span class = "lineno" > 730< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00731" name = "l00731" > < / a > < span class = "lineno" > 731< / span > < span class = "comment" > // Pointers to singleton Model objects.< / span > < / div >
< div class = "line" > < a id = "l00732" name = "l00732" > < / a > < span class = "lineno" > 732< / span > Trail* trail_;< / div >
< div class = "line" > < a id = "l00733" name = "l00733" > < / a > < span class = "lineno" > 733< / span > TimeLimit* time_limit_;< / div >
< div class = "line" > < a id = "l00734" name = "l00734" > < / a > < span class = "lineno" > 734< / span > SatParameters* parameters_;< / div >
< div class = "line" > < a id = "l00735" name = "l00735" > < / a > < span class = "lineno" > 735< / span > RestartPolicy* restart_;< / div >
< div class = "line" > < a id = "l00736" name = "l00736" > < / a > < span class = "lineno" > 736< / span > SatDecisionPolicy* decision_policy_;< / div >
< div class = "line" > < a id = "l00737" name = "l00737" > < / a > < span class = "lineno" > 737< / span > SolverLogger* logger_;< / div >
< div class = "line" > < a id = "l00738" name = "l00738" > < / a > < span class = "lineno" > 738< / span > < / div >
< div class = "line" > < a id = "l00739" name = "l00739" > < / a > < span class = "lineno" > 739< / span > < span class = "comment" > // Used for debugging only. See SaveDebugAssignment().< / span > < / div >
< div class = "line" > < a id = "l00740" name = "l00740" > < / a > < span class = "lineno" > 740< / span > VariablesAssignment debug_assignment_;< / div >
< div class = "line" > < a id = "l00741" name = "l00741" > < / a > < span class = "lineno" > 741< / span > < / div >
< div class = "line" > < a id = "l00742" name = "l00742" > < / a > < span class = "lineno" > 742< / span > < span class = "comment" > // The stack of decisions taken by the solver. They are stored in [0,< / span > < / div >
< div class = "line" > < a id = "l00743" name = "l00743" > < / a > < span class = "lineno" > 743< / span > < span class = "comment" > // current_decision_level_). The vector is of size num_variables_ so it can< / span > < / div >
< div class = "line" > < a id = "l00744" name = "l00744" > < / a > < span class = "lineno" > 744< / span > < span class = "comment" > // store all the decisions. This is done this way because in some situation we< / span > < / div >
< div class = "line" > < a id = "l00745" name = "l00745" > < / a > < span class = "lineno" > 745< / span > < span class = "comment" > // need to remember the previously taken decisions after a backtrack.< / span > < / div >
< div class = "line" > < a id = "l00746" name = "l00746" > < / a > < span class = "lineno" > 746< / span > < span class = "keywordtype" > int< / span > current_decision_level_ = 0;< / div >
< div class = "line" > < a id = "l00747" name = "l00747" > < / a > < span class = "lineno" > 747< / span > std::vector< Decision> decisions_;< / div >
< div class = "line" > < a id = "l00748" name = "l00748" > < / a > < span class = "lineno" > 748< / span > < / div >
< div class = "line" > < a id = "l00749" name = "l00749" > < / a > < span class = "lineno" > 749< / span > < span class = "comment" > // The trail index after the last Backtrack() call or before the last< / span > < / div >
< div class = "line" > < a id = "l00750" name = "l00750" > < / a > < span class = "lineno" > 750< / span > < span class = "comment" > // EnqueueNewDecision() call.< / span > < / div >
< div class = "line" > < a id = "l00751" name = "l00751" > < / a > < span class = "lineno" > 751< / span > < span class = "keywordtype" > int< / span > last_decision_or_backtrack_trail_index_ = 0;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00752" name = "l00752" > < / a > < span class = "lineno" > 752< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00753" name = "l00753" > < / a > < span class = "lineno" > 753< / span > < span class = "comment" > // The assumption level. See SolveWithAssumptions().< / span > < / div >
< div class = "line" > < a id = "l00754" name = "l00754" > < / a > < span class = "lineno" > 754< / span > < span class = "keywordtype" > int< / span > assumption_level_ = 0;< / div >
< div class = "line" > < a id = "l00755" name = "l00755" > < / a > < span class = "lineno" > 755< / span > std::vector< Literal> assumptions_;< / div >
< div class = "line" > < a id = "l00756" name = "l00756" > < / a > < span class = "lineno" > 756< / span > < / div >
< div class = "line" > < a id = "l00757" name = "l00757" > < / a > < span class = "lineno" > 757< / span > < span class = "comment" > // The size of the trail when ProcessNewlyFixedVariables() was last called.< / span > < / div >
< div class = "line" > < a id = "l00758" name = "l00758" > < / a > < span class = "lineno" > 758< / span > < span class = "comment" > // Note that the trail contains only fixed literals (that is literals of< / span > < / div >
< div class = "line" > < a id = "l00759" name = "l00759" > < / a > < span class = "lineno" > 759< / span > < span class = "comment" > // decision levels 0) before this point.< / span > < / div >
< div class = "line" > < a id = "l00760" name = "l00760" > < / a > < span class = "lineno" > 760< / span > < span class = "keywordtype" > int< / span > num_processed_fixed_variables_ = 0;< / div >
< div class = "line" > < a id = "l00761" name = "l00761" > < / a > < span class = "lineno" > 761< / span > < span class = "keywordtype" > double< / span > deterministic_time_of_last_fixed_variables_cleanup_ = 0.0;< / div >
< div class = "line" > < a id = "l00762" name = "l00762" > < / a > < span class = "lineno" > 762< / span > < / div >
< div class = "line" > < a id = "l00763" name = "l00763" > < / a > < span class = "lineno" > 763< / span > < span class = "comment" > // Used in ProcessNewlyFixedVariablesForDratProof().< / span > < / div >
< div class = "line" > < a id = "l00764" name = "l00764" > < / a > < span class = "lineno" > 764< / span > < span class = "keywordtype" > int< / span > drat_num_processed_fixed_variables_ = 0;< / div >
< div class = "line" > < a id = "l00765" name = "l00765" > < / a > < span class = "lineno" > 765< / span > < / div >
< div class = "line" > < a id = "l00766" name = "l00766" > < / a > < span class = "lineno" > 766< / span > < span class = "comment" > // Tracks various information about the solver progress.< / span > < / div >
< div class = "line" > < a id = "l00767" name = "l00767" > < / a > < span class = "lineno" > 767< / span > < span class = "keyword" > struct < / span > Counters {< / div >
< div class = "line" > < a id = "l00768" name = "l00768" > < / a > < span class = "lineno" > 768< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a8fa29503728270c9696389c9e590c242" > num_branches< / a > = 0;< / div >
< div class = "line" > < a id = "l00769" name = "l00769" > < / a > < span class = "lineno" > 769< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f" > num_failures< / a > = 0;< / div >
< div class = "line" > < a id = "l00770" name = "l00770" > < / a > < span class = "lineno" > 770< / span > int64_t < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a7ab8996f31104834f27a232817731314" > num_restarts< / a > = 0;< / div >
< div class = "line" > < a id = "l00771" name = "l00771" > < / a > < span class = "lineno" > 771< / span > < / div >
< div class = "line" > < a id = "l00772" name = "l00772" > < / a > < span class = "lineno" > 772< / span > < span class = "comment" > // Minimization stats.< / span > < / div >
< div class = "line" > < a id = "l00773" name = "l00773" > < / a > < span class = "lineno" > 773< / span > int64_t num_minimizations = 0;< / div >
< div class = "line" > < a id = "l00774" name = "l00774" > < / a > < span class = "lineno" > 774< / span > int64_t num_literals_removed = 0;< / div >
< div class = "line" > < a id = "l00775" name = "l00775" > < / a > < span class = "lineno" > 775< / span > < / div >
< div class = "line" > < a id = "l00776" name = "l00776" > < / a > < span class = "lineno" > 776< / span > < span class = "comment" > // PB constraints.< / span > < / div >
< div class = "line" > < a id = "l00777" name = "l00777" > < / a > < span class = "lineno" > 777< / span > int64_t num_learned_pb_literals = 0;< / div >
< div class = "line" > < a id = "l00778" name = "l00778" > < / a > < span class = "lineno" > 778< / span > < / div >
< div class = "line" > < a id = "l00779" name = "l00779" > < / a > < span class = "lineno" > 779< / span > < span class = "comment" > // Clause learning /deletion stats.< / span > < / div >
< div class = "line" > < a id = "l00780" name = "l00780" > < / a > < span class = "lineno" > 780< / span > int64_t num_literals_learned = 0;< / div >
< div class = "line" > < a id = "l00781" name = "l00781" > < / a > < span class = "lineno" > 781< / span > int64_t num_literals_forgotten = 0;< / div >
< div class = "line" > < a id = "l00782" name = "l00782" > < / a > < span class = "lineno" > 782< / span > int64_t num_subsumed_clauses = 0;< / div >
< div class = "line" > < a id = "l00783" name = "l00783" > < / a > < span class = "lineno" > 783< / span > < / div >
< div class = "line" > < a id = "l00784" name = "l00784" > < / a > < span class = "lineno" > 784< / span > < span class = "comment" > // TryToMinimizeClause() stats.< / span > < / div >
< div class = "line" > < a id = "l00785" name = "l00785" > < / a > < span class = "lineno" > 785< / span > int64_t minimization_num_clauses = 0;< / div >
< div class = "line" > < a id = "l00786" name = "l00786" > < / a > < span class = "lineno" > 786< / span > int64_t minimization_num_decisions = 0;< / div >
< div class = "line" > < a id = "l00787" name = "l00787" > < / a > < span class = "lineno" > 787< / span > int64_t minimization_num_true = 0;< / div >
< div class = "line" > < a id = "l00788" name = "l00788" > < / a > < span class = "lineno" > 788< / span > int64_t minimization_num_subsumed = 0;< / div >
< div class = "line" > < a id = "l00789" name = "l00789" > < / a > < span class = "lineno" > 789< / span > int64_t minimization_num_removed_literals = 0;< / div >
< div class = "line" > < a id = "l00790" name = "l00790" > < / a > < span class = "lineno" > 790< / span > };< / div >
< div class = "line" > < a id = "l00791" name = "l00791" > < / a > < span class = "lineno" > 791< / span > Counters counters_;< / div >
< div class = "line" > < a id = "l00792" name = "l00792" > < / a > < span class = "lineno" > 792< / span > < / div >
< div class = "line" > < a id = "l00793" name = "l00793" > < / a > < span class = "lineno" > 793< / span > < span class = "comment" > // Solver information.< / span > < / div >
< div class = "line" > < a id = "l00794" name = "l00794" > < / a > < span class = "lineno" > 794< / span > < a class = "code hl_class" href = "class_wall_timer.html" > WallTimer< / a > timer_;< / div >
< div class = "line" > < a id = "l00795" name = "l00795" > < / a > < span class = "lineno" > 795< / span > < / div >
< div class = "line" > < a id = "l00796" name = "l00796" > < / a > < span class = "lineno" > 796< / span > < span class = "comment" > // This is set to true if the model is found to be UNSAT when adding new< / span > < / div >
< div class = "line" > < a id = "l00797" name = "l00797" > < / a > < span class = "lineno" > 797< / span > < span class = "comment" > // constraints.< / span > < / div >
< div class = "line" > < a id = "l00798" name = "l00798" > < / a > < span class = "lineno" > 798< / span > < span class = "keywordtype" > bool< / span > model_is_unsat_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00799" name = "l00799" > < / a > < span class = "lineno" > 799< / span > < / div >
< div class = "line" > < a id = "l00800" name = "l00800" > < / a > < span class = "lineno" > 800< / span > < span class = "comment" > // Increment used to bump the variable activities.< / span > < / div >
< div class = "line" > < a id = "l00801" name = "l00801" > < / a > < span class = "lineno" > 801< / span > < span class = "keywordtype" > double< / span > clause_activity_increment_;< / div >
< div class = "line" > < a id = "l00802" name = "l00802" > < / a > < span class = "lineno" > 802< / span > < / div >
< div class = "line" > < a id = "l00803" name = "l00803" > < / a > < span class = "lineno" > 803< / span > < span class = "comment" > // This counter is decremented each time we learn a clause that can be< / span > < / div >
< div class = "line" > < a id = "l00804" name = "l00804" > < / a > < span class = "lineno" > 804< / span > < span class = "comment" > // deleted. When it reaches zero, a clause cleanup is triggered.< / span > < / div >
< div class = "line" > < a id = "l00805" name = "l00805" > < / a > < span class = "lineno" > 805< / span > < span class = "keywordtype" > int< / span > num_learned_clause_before_cleanup_ = 0;< / div >
< div class = "line" > < a id = "l00806" name = "l00806" > < / a > < span class = "lineno" > 806< / span > < / div >
< div class = "line" > < a id = "l00807" name = "l00807" > < / a > < span class = "lineno" > 807< / span > < span class = "comment" > // Temporary members used during conflict analysis.< / span > < / div >
< div class = "line" > < a id = "l00808" name = "l00808" > < / a > < span class = "lineno" > 808< / span > SparseBitset< BooleanVariable> is_marked_;< / div >
< div class = "line" > < a id = "l00809" name = "l00809" > < / a > < span class = "lineno" > 809< / span > SparseBitset< BooleanVariable> is_independent_;< / div >
< div class = "line" > < a id = "l00810" name = "l00810" > < / a > < span class = "lineno" > 810< / span > SparseBitset< BooleanVariable> tmp_mark_;< / div >
< div class = "line" > < a id = "l00811" name = "l00811" > < / a > < span class = "lineno" > 811< / span > std::vector< int> min_trail_index_per_level_;< / div >
< div class = "line" > < a id = "l00812" name = "l00812" > < / a > < span class = "lineno" > 812< / span > < / div >
< div class = "line" > < a id = "l00813" name = "l00813" > < / a > < span class = "lineno" > 813< / span > < span class = "comment" > // Temporary members used by CanBeInferedFromConflictVariables().< / span > < / div >
< div class = "line" > < a id = "l00814" name = "l00814" > < / a > < span class = "lineno" > 814< / span > std::vector< BooleanVariable> dfs_stack_;< / div >
< div class = "line" > < a id = "l00815" name = "l00815" > < / a > < span class = "lineno" > 815< / span > std::vector< BooleanVariable> variable_to_process_;< / div >
< div class = "line" > < a id = "l00816" name = "l00816" > < / a > < span class = "lineno" > 816< / span > < / div >
< div class = "line" > < a id = "l00817" name = "l00817" > < / a > < span class = "lineno" > 817< / span > < span class = "comment" > // Temporary member used when adding clauses.< / span > < / div >
< div class = "line" > < a id = "l00818" name = "l00818" > < / a > < span class = "lineno" > 818< / span > std::vector< Literal> literals_scratchpad_;< / div >
< div class = "line" > < a id = "l00819" name = "l00819" > < / a > < span class = "lineno" > 819< / span > < / div >
< div class = "line" > < a id = "l00820" name = "l00820" > < / a > < span class = "lineno" > 820< / span > < span class = "comment" > // A boolean vector used to temporarily mark decision levels.< / span > < / div >
< div class = "line" > < a id = "l00821" name = "l00821" > < / a > < span class = "lineno" > 821< / span > DEFINE_STRONG_INDEX_TYPE(SatDecisionLevel);< / div >
< div class = "line" > < a id = "l00822" name = "l00822" > < / a > < span class = "lineno" > 822< / span > SparseBitset< SatDecisionLevel> is_level_marked_;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00823" name = "l00823" > < / a > < span class = "lineno" > 823< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00824" name = "l00824" > < / a > < span class = "lineno" > 824< / span > < span class = "comment" > // Temporary vectors used by EnqueueDecisionAndBackjumpOnConflict().< / span > < / div >
< div class = "line" > < a id = "l00825" name = "l00825" > < / a > < span class = "lineno" > 825< / span > std::vector< Literal> learned_conflict_;< / div >
< div class = "line" > < a id = "l00826" name = "l00826" > < / a > < span class = "lineno" > 826< / span > std::vector< Literal> reason_used_to_infer_the_conflict_;< / div >
< div class = "line" > < a id = "l00827" name = "l00827" > < / a > < span class = "lineno" > 827< / span > std::vector< Literal> extra_reason_literals_;< / div >
< div class = "line" > < a id = "l00828" name = "l00828" > < / a > < span class = "lineno" > 828< / span > std::vector< SatClause*> subsumed_clauses_;< / div >
< div class = "line" > < a id = "l00829" name = "l00829" > < / a > < span class = "lineno" > 829< / span > < / div >
< div class = "line" > < a id = "l00830" name = "l00830" > < / a > < span class = "lineno" > 830< / span > < span class = "comment" > // When true, temporarily disable the deletion of clauses that are not needed< / span > < / div >
< div class = "line" > < a id = "l00831" name = "l00831" > < / a > < span class = "lineno" > 831< / span > < span class = "comment" > // anymore. This is a hack for TryToMinimizeClause() because we use< / span > < / div >
< div class = "line" > < a id = "l00832" name = "l00832" > < / a > < span class = "lineno" > 832< / span > < span class = "comment" > // propagation in this function which might trigger a clause database< / span > < / div >
< div class = "line" > < a id = "l00833" name = "l00833" > < / a > < span class = "lineno" > 833< / span > < span class = "comment" > // deletion, but we still want the pointer to the clause we wants to minimize< / span > < / div >
< div class = "line" > < a id = "l00834" name = "l00834" > < / a > < span class = "lineno" > 834< / span > < span class = "comment" > // to be valid until the end of that function.< / span > < / div >
< div class = "line" > < a id = "l00835" name = "l00835" > < / a > < span class = "lineno" > 835< / span > < span class = "keywordtype" > bool< / span > block_clause_deletion_ = < span class = "keyword" > false< / span > ;< / div >
< div class = "line" > < a id = "l00836" name = "l00836" > < / a > < span class = "lineno" > 836< / span > < / div >
< div class = "line" > < a id = "l00837" name = "l00837" > < / a > < span class = "lineno" > 837< / span > < span class = "comment" > // " cache" to avoid inspecting many times the same reason during conflict< / span > < / div >
< div class = "line" > < a id = "l00838" name = "l00838" > < / a > < span class = "lineno" > 838< / span > < span class = "comment" > // analysis.< / span > < / div >
< div class = "line" > < a id = "l00839" name = "l00839" > < / a > < span class = "lineno" > 839< / span > VariableWithSameReasonIdentifier same_reason_identifier_;< / div >
< div class = "line" > < a id = "l00840" name = "l00840" > < / a > < span class = "lineno" > 840< / span > < / div >
< div class = "line" > < a id = "l00841" name = "l00841" > < / a > < span class = "lineno" > 841< / span > < span class = "comment" > // Boolean used to include/exclude constraints from the core computation.< / span > < / div >
< div class = "line" > < a id = "l00842" name = "l00842" > < / a > < span class = "lineno" > 842< / span > < span class = "keywordtype" > bool< / span > is_relevant_for_core_computation_;< / div >
< div class = "line" > < a id = "l00843" name = "l00843" > < / a > < span class = "lineno" > 843< / span > < / div >
< div class = "line" > < a id = "l00844" name = "l00844" > < / a > < span class = "lineno" > 844< / span > < span class = "comment" > // The current pseudo-Boolean conflict used in PB conflict analysis.< / span > < / div >
< div class = "line" > < a id = "l00845" name = "l00845" > < / a > < span class = "lineno" > 845< / span > MutableUpperBoundedLinearConstraint pb_conflict_;< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00846" name = "l00846" > < / a > < span class = "lineno" > 846< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00847" name = "l00847" > < / a > < span class = "lineno" > 847< / span > < span class = "comment" > // The deterministic time when the time limit was updated.< / span > < / div >
< div class = "line" > < a id = "l00848" name = "l00848" > < / a > < span class = "lineno" > 848< / span > < span class = "comment" > // As the deterministic time in the time limit has to be advanced manually,< / span > < / div >
< div class = "line" > < a id = "l00849" name = "l00849" > < / a > < span class = "lineno" > 849< / span > < span class = "comment" > // it is necessary to keep track of the last time the time was advanced.< / span > < / div >
< div class = "line" > < a id = "l00850" name = "l00850" > < / a > < span class = "lineno" > 850< / span > < span class = "keywordtype" > double< / span > deterministic_time_at_last_advanced_time_limit_ = 0;< / div >
< div class = "line" > < a id = "l00851" name = "l00851" > < / a > < span class = "lineno" > 851< / span > < / div >
< div class = "line" > < a id = "l00852" name = "l00852" > < / a > < span class = "lineno" > 852< / span > < span class = "comment" > // This is true iff the loaded problem only contains clauses.< / span > < / div >
< div class = "line" > < a id = "l00853" name = "l00853" > < / a > < span class = "lineno" > 853< / span > < span class = "keywordtype" > bool< / span > problem_is_pure_sat_;< / div >
< div class = "line" > < a id = "l00854" name = "l00854" > < / a > < span class = "lineno" > 854< / span > < / div >
< div class = "line" > < a id = "l00855" name = "l00855" > < / a > < span class = "lineno" > 855< / span > DratProofHandler* drat_proof_handler_;< / div >
< div class = "line" > < a id = "l00856" name = "l00856" > < / a > < span class = "lineno" > 856< / span > < / div >
< div class = "line" > < a id = "l00857" name = "l00857" > < / a > < span class = "lineno" > 857< / span > < span class = "keyword" > mutable< / span > StatsGroup stats_;< / div >
< div class = "line" > < a id = "l00858" name = "l00858" > < / a > < span class = "lineno" > 858< / span > < / div >
< div class = "line" > < a id = "l00859" name = "l00859" > < / a > < span class = "lineno" > 859< / span > std::function< void(Literal, Literal)> shared_binary_clauses_callback_ =< / div >
< div class = "line" > < a id = "l00860" name = "l00860" > < / a > < span class = "lineno" > 860< / span > < span class = "keyword" > nullptr< / span > ;< / div >
< div class = "line" > < a id = "l00861" name = "l00861" > < / a > < span class = "lineno" > 861< / span > < / div >
< div class = "line" > < a id = "l00862" name = "l00862" > < / a > < span class = "lineno" > 862< / span > DISALLOW_COPY_AND_ASSIGN(< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#adc7569321b063bae82803229623c8f4f" > SatSolver< / a > );< / div >
< div class = "line" > < a id = "l00863" name = "l00863" > < / a > < span class = "lineno" > 863< / span > };< / div >
< div class = "line" > < a id = "l00864" name = "l00864" > < / a > < span class = "lineno" > 864< / span > < / div >
< div class = "line" > < a id = "l00865" name = "l00865" > < / a > < span class = "lineno" > 865< / span > < span class = "comment" > // Tries to minimize the given UNSAT core with a really simple heuristic.< / span > < / div >
< div class = "line" > < a id = "l00866" name = "l00866" > < / a > < span class = "lineno" > 866< / span > < span class = "comment" > // The idea is to remove literals that are consequences of others in the core.< / span > < / div >
< div class = "line" > < a id = "l00867" name = "l00867" > < / a > < span class = "lineno" > 867< / span > < span class = "comment" > // We already know that in the initial order, no literal is propagated by the< / span > < / div >
< div class = "line" > < a id = "l00868" name = "l00868" > < / a > < span class = "lineno" > 868< / span > < span class = "comment" > // one before it, so we just look for propagation in the reverse order.< / span > < / div >
< div class = "line" > < a id = "l00869" name = "l00869" > < / a > < span class = "lineno" > 869< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00870" name = "l00870" > < / a > < span class = "lineno" > 870< / span > < span class = "comment" > // Important: The given SatSolver must be the one that just produced the given< / span > < / div >
< div class = "line" > < a id = "l00871" name = "l00871" > < / a > < span class = "lineno" > 871< / span > < span class = "comment" > // core.< / span > < / div >
< div class = "line" > < a id = "l00872" name = "l00872" > < / a > < span class = "lineno" > 872< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00873" name = "l00873" > < / a > < span class = "lineno" > 873< / span > < span class = "comment" > // TODO(user): One should use MinimizeCoreWithPropagation() instead.< / span > < / div >
< div class = "line" > < a id = "l00874" name = "l00874" > < / a > < span class = "lineno" > 874< / span > < span class = "keywordtype" > void< / span > < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a6fb8349259fa849de0789a4ec58a8492" > MinimizeCore< / a > (SatSolver* solver, std::vector< Literal> * core);< / div >
< div class = "line" > < a id = "l00875" name = "l00875" > < / a > < span class = "lineno" > 875< / span > < / div >
< div class = "line" > < a id = "l00876" name = "l00876" > < / a > < span class = "lineno" > 876< / span > < span class = "comment" > // ============================================================================< / span > < / div >
< div class = "line" > < a id = "l00877" name = "l00877" > < / a > < span class = "lineno" > 877< / span > < span class = "comment" > // Model based functions.< / span > < / div >
< div class = "line" > < a id = "l00878" name = "l00878" > < / a > < span class = "lineno" > 878< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00879" name = "l00879" > < / a > < span class = "lineno" > 879< / span > < span class = "comment" > // TODO(user): move them in another file, and unit-test them.< / span > < / div >
< div class = "line" > < a id = "l00880" name = "l00880" > < / a > < span class = "lineno" > 880< / span > < span class = "comment" > // ============================================================================< / span > < / div >
< div class = "line" > < a id = "l00881" name = "l00881" > < / a > < span class = "lineno" > 881< / span > < / div >
< div class = "line" > < a id = "l00882" name = "l00882" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ac341ac6090ff0bed8ad2231c94cd3bfc" > 882< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#ac341ac6090ff0bed8ad2231c94cd3bfc" > BooleanLinearConstraint< / a > (< / div >
< div class = "line" > < a id = "l00883" name = "l00883" > < / a > < span class = "lineno" > 883< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > , int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ,< / div >
< div class = "line" > < a id = "l00884" name = "l00884" > < / a > < span class = "lineno" > 884< / span > std::vector< LiteralWithCoeff> * cst) {< / div >
< div class = "line" > < a id = "l00885" name = "l00885" > < / a > < span class = "lineno" > 885< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00886" name = "l00886" > < / a > < span class = "lineno" > 886< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddLinearConstraint(< / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00887" name = "l00887" > < / a > < span class = "lineno" > 887< / span > < span class = "comment" > /*use_lower_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ),< / div >
< div class = "line" > < a id = "l00888" name = "l00888" > < / a > < span class = "lineno" > 888< / span > < span class = "comment" > /*use_upper_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ), cst);< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00889" name = "l00889" > < / a > < span class = "lineno" > 889< / span > };< / div >
< div class = "line" > < a id = "l00890" name = "l00890" > < / a > < span class = "lineno" > 890< / span > }< / div >
< div class = "line" > < a id = "l00891" name = "l00891" > < / a > < span class = "lineno" > 891< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00892" name = "l00892" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#abe0c48f07cc78c2880c84f37601f44ed" > 892< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#abe0c48f07cc78c2880c84f37601f44ed" > CardinalityConstraint< / a > (< / div >
< div class = "line" > < a id = "l00893" name = "l00893" > < / a > < span class = "lineno" > 893< / span > int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > , int64_t < a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ,< / div >
< div class = "line" > < a id = "l00894" name = "l00894" > < / a > < span class = "lineno" > 894< / span > < span class = "keyword" > const< / span > std::vector< Literal> & literals) {< / div >
< div class = "line" > < a id = "l00895" name = "l00895" > < / a > < span class = "lineno" > 895< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00896" name = "l00896" > < / a > < span class = "lineno" > 896< / span > std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a id = "l00897" name = "l00897" > < / a > < span class = "lineno" > 897< / span > cst.reserve(literals.size());< / div >
< div class = "line" > < a id = "l00898" name = "l00898" > < / a > < span class = "lineno" > 898< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < literals.size(); ++i) {< / div >
< div class = "line" > < a id = "l00899" name = "l00899" > < / a > < span class = "lineno" > 899< / span > cst.emplace_back(literals[i], 1);< / div >
< div class = "line" > < a id = "l00900" name = "l00900" > < / a > < span class = "lineno" > 900< / span > }< / div >
< div class = "line" > < a id = "l00901" name = "l00901" > < / a > < span class = "lineno" > 901< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddLinearConstraint(< / div >
< div class = "line" > < a id = "l00902" name = "l00902" > < / a > < span class = "lineno" > 902< / span > < span class = "comment" > /*use_lower_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > ),< / div >
< div class = "line" > < a id = "l00903" name = "l00903" > < / a > < span class = "lineno" > 903< / span > < span class = "comment" > /*use_upper_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (< a class = "code hl_variable" href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > ), & cst);< / div >
< div class = "line" > < a id = "l00904" name = "l00904" > < / a > < span class = "lineno" > 904< / span > };< / div >
< div class = "line" > < a id = "l00905" name = "l00905" > < / a > < span class = "lineno" > 905< / span > }< / div >
< div class = "line" > < a id = "l00906" name = "l00906" > < / a > < span class = "lineno" > 906< / span > < / div >
< div class = "line" > < a id = "l00907" name = "l00907" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#accfda9e32067da0a88da8e325cf39c7c" > 907< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#accfda9e32067da0a88da8e325cf39c7c" > ExactlyOneConstraint< / a > (< / div >
< div class = "line" > < a id = "l00908" name = "l00908" > < / a > < span class = "lineno" > 908< / span > < span class = "keyword" > const< / span > std::vector< Literal> & literals) {< / div >
< div class = "line" > < a id = "l00909" name = "l00909" > < / a > < span class = "lineno" > 909< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00910" name = "l00910" > < / a > < span class = "lineno" > 910< / span > std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a id = "l00911" name = "l00911" > < / a > < span class = "lineno" > 911< / span > cst.reserve(literals.size());< / div >
< div class = "line" > < a id = "l00912" name = "l00912" > < / a > < span class = "lineno" > 912< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : literals) {< / div >
< div class = "line" > < a id = "l00913" name = "l00913" > < / a > < span class = "lineno" > 913< / span > cst.emplace_back(l, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1));< / div >
< div class = "line" > < a id = "l00914" name = "l00914" > < / a > < span class = "lineno" > 914< / span > }< / div >
< div class = "line" > < a id = "l00915" name = "l00915" > < / a > < span class = "lineno" > 915< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddLinearConstraint(< / div >
< div class = "line" > < a id = "l00916" name = "l00916" > < / a > < span class = "lineno" > 916< / span > < span class = "comment" > /*use_lower_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1),< / div >
< div class = "line" > < a id = "l00917" name = "l00917" > < / a > < span class = "lineno" > 917< / span > < span class = "comment" > /*use_upper_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1), & cst);< / div >
< div class = "line" > < a id = "l00918" name = "l00918" > < / a > < span class = "lineno" > 918< / span > };< / div >
< div class = "line" > < a id = "l00919" name = "l00919" > < / a > < span class = "lineno" > 919< / span > }< / div >
< div class = "line" > < a id = "l00920" name = "l00920" > < / a > < span class = "lineno" > 920< / span > < / div >
< div class = "line" > < a id = "l00921" name = "l00921" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a8a759583ee01f89ea955f23368976482" > 921< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a8a759583ee01f89ea955f23368976482" > AtMostOneConstraint< / a > (< / div >
< div class = "line" > < a id = "l00922" name = "l00922" > < / a > < span class = "lineno" > 922< / span > < span class = "keyword" > const< / span > std::vector< Literal> & literals) {< / div >
< div class = "line" > < a id = "l00923" name = "l00923" > < / a > < span class = "lineno" > 923< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00924" name = "l00924" > < / a > < span class = "lineno" > 924< / span > std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a id = "l00925" name = "l00925" > < / a > < span class = "lineno" > 925< / span > cst.reserve(literals.size());< / div >
< div class = "line" > < a id = "l00926" name = "l00926" > < / a > < span class = "lineno" > 926< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : literals) {< / div >
< div class = "line" > < a id = "l00927" name = "l00927" > < / a > < span class = "lineno" > 927< / span > cst.emplace_back(l, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1));< / div >
< div class = "line" > < a id = "l00928" name = "l00928" > < / a > < span class = "lineno" > 928< / span > }< / div >
< div class = "line" > < a id = "l00929" name = "l00929" > < / a > < span class = "lineno" > 929< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddLinearConstraint(< / div >
< div class = "line" > < a id = "l00930" name = "l00930" > < / a > < span class = "lineno" > 930< / span > < span class = "comment" > /*use_lower_bound=*/< / span > < span class = "keyword" > false< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (0),< / div >
< div class = "line" > < a id = "l00931" name = "l00931" > < / a > < span class = "lineno" > 931< / span > < span class = "comment" > /*use_upper_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1), & cst);< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00932" name = "l00932" > < / a > < span class = "lineno" > 932< / span > };< / div >
< div class = "line" > < a id = "l00933" name = "l00933" > < / a > < span class = "lineno" > 933< / span > }< / div >
< div class = "line" > < a id = "l00934" name = "l00934" > < / a > < span class = "lineno" > 934< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00935" name = "l00935" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > 935< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > ClauseConstraint< / a > (< / div >
< div class = "line" > < a id = "l00936" name = "l00936" > < / a > < span class = "lineno" > 936< / span > absl::Span< const Literal> literals) {< / div >
< div class = "line" > < a id = "l00937" name = "l00937" > < / a > < span class = "lineno" > 937< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00938" name = "l00938" > < / a > < span class = "lineno" > 938< / span > std::vector< LiteralWithCoeff> cst;< / div >
< div class = "line" > < a id = "l00939" name = "l00939" > < / a > < span class = "lineno" > 939< / span > cst.reserve(literals.size());< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l00940" name = "l00940" > < / a > < span class = "lineno" > 940< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : literals) {< / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l00941" name = "l00941" > < / a > < span class = "lineno" > 941< / span > cst.emplace_back(l, < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1));< / div >
< div class = "line" > < a id = "l00942" name = "l00942" > < / a > < span class = "lineno" > 942< / span > }< / div >
< div class = "line" > < a id = "l00943" name = "l00943" > < / a > < span class = "lineno" > 943< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddLinearConstraint(< / div >
< div class = "line" > < a id = "l00944" name = "l00944" > < / a > < span class = "lineno" > 944< / span > < span class = "comment" > /*use_lower_bound=*/< / span > < span class = "keyword" > true< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1),< / div >
< div class = "line" > < a id = "l00945" name = "l00945" > < / a > < span class = "lineno" > 945< / span > < span class = "comment" > /*use_upper_bound=*/< / span > < span class = "keyword" > false< / span > , < a class = "code hl_typedef" href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > Coefficient< / a > (1), & cst);< / div >
< div class = "line" > < a id = "l00946" name = "l00946" > < / a > < span class = "lineno" > 946< / span > };< / div >
< div class = "line" > < a id = "l00947" name = "l00947" > < / a > < span class = "lineno" > 947< / span > }< / div >
< div class = "line" > < a id = "l00948" name = "l00948" > < / a > < span class = "lineno" > 948< / span > < / div >
< div class = "line" > < a id = "l00949" name = "l00949" > < / a > < span class = "lineno" > 949< / span > < span class = "comment" > // a => b.< / span > < / div >
< div class = "line" > < a id = "l00950" name = "l00950" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a641e39cef45870bebda662477a8d6771" > 950< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a6e056f4efb99b080ae5bdb7267339f59" > Implication< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > ) {< / div >
< div class = "line" > < a id = "l00951" name = "l00951" > < / a > < span class = "lineno" > 951< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00952" name = "l00952" > < / a > < span class = "lineno" > 952< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddBinaryClause(< a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > .Negated(), < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > );< / div >
< div class = "line" > < a id = "l00953" name = "l00953" > < / a > < span class = "lineno" > 953< / span > };< / div >
< div class = "line" > < a id = "l00954" name = "l00954" > < / a > < span class = "lineno" > 954< / span > }< / div >
< div class = "line" > < a id = "l00955" name = "l00955" > < / a > < span class = "lineno" > 955< / span > < / div >
< div class = "line" > < a id = "l00956" name = "l00956" > < / a > < span class = "lineno" > 956< / span > < span class = "comment" > // a == b.< / span > < / div >
< div class = "line" > < a id = "l00957" name = "l00957" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a1fe51896137f1dc2c0e707695a04183a" > 957< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a134ba4c37e543cb80c698555b6ae89f8" > Equality< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > ) {< / div >
< div class = "line" > < a id = "l00958" name = "l00958" > < / a > < span class = "lineno" > 958< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00959" name = "l00959" > < / a > < span class = "lineno" > 959< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddBinaryClause(< a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > .Negated(), < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > );< / div >
< div class = "line" > < a id = "l00960" name = "l00960" > < / a > < span class = "lineno" > 960< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ()-> AddBinaryClause(< a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > .Negated());< / div >
< div class = "line" > < a id = "l00961" name = "l00961" > < / a > < span class = "lineno" > 961< / span > };< / div >
< div class = "line" > < a id = "l00962" name = "l00962" > < / a > < span class = "lineno" > 962< / span > }< / div >
< div class = "line" > < a id = "l00963" name = "l00963" > < / a > < span class = "lineno" > 963< / span > < / div >
< div class = "line" > < a id = "l00964" name = "l00964" > < / a > < span class = "lineno" > 964< / span > < span class = "comment" > // r < => (at least one literal is true). This is a reified clause.< / span > < / div >
< div class = "line" > < a id = "l00965" name = "l00965" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a17b162d025d26ae56571f2250620c266" > 965< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a17b162d025d26ae56571f2250620c266" > ReifiedBoolOr< / a > (< / div >
< div class = "line" > < a id = "l00966" name = "l00966" > < / a > < span class = "lineno" > 966< / span > < span class = "keyword" > const< / span > std::vector< Literal> & literals, < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > r) {< / div >
< div class = "line" > < a id = "l00967" name = "l00967" > < / a > < span class = "lineno" > 967< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00968" name = "l00968" > < / a > < span class = "lineno" > 968< / span > std::vector< Literal> clause;< / div >
< div class = "line" > < a id = "l00969" name = "l00969" > < / a > < span class = "lineno" > 969< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : literals) {< / div >
< div class = "line" > < a id = "l00970" name = "l00970" > < / a > < span class = "lineno" > 970< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a6e056f4efb99b080ae5bdb7267339f59" > Implication< / a > (l, r)); < span class = "comment" > // l => r.< / span > < / div >
< div class = "line" > < a id = "l00971" name = "l00971" > < / a > < span class = "lineno" > 971< / span > clause.push_back(l);< / div >
< div class = "line" > < a id = "l00972" name = "l00972" > < / a > < span class = "lineno" > 972< / span > }< / div >
< div class = "line" > < a id = "l00973" name = "l00973" > < / a > < span class = "lineno" > 973< / span > < / div >
< div class = "line" > < a id = "l00974" name = "l00974" > < / a > < span class = "lineno" > 974< / span > < span class = "comment" > // All false => r false.< / span > < / div >
< div class = "line" > < a id = "l00975" name = "l00975" > < / a > < span class = "lineno" > 975< / span > clause.push_back(r.< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644" > Negated< / a > ());< / div >
< div class = "line" > < a id = "l00976" name = "l00976" > < / a > < span class = "lineno" > 976< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > ClauseConstraint< / a > (clause));< / div >
< div class = "line" > < a id = "l00977" name = "l00977" > < / a > < span class = "lineno" > 977< / span > };< / div >
< div class = "line" > < a id = "l00978" name = "l00978" > < / a > < span class = "lineno" > 978< / span > }< / div >
< div class = "line" > < a id = "l00979" name = "l00979" > < / a > < span class = "lineno" > 979< / span > < / div >
< div class = "line" > < a id = "l00980" name = "l00980" > < / a > < span class = "lineno" > 980< / span > < span class = "comment" > // enforcement_literals => clause.< / span > < / div >
< div class = "line" > < a id = "l00981" name = "l00981" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a393ff6c6adb9d243cd4b7b7e445a3c23" > 981< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a393ff6c6adb9d243cd4b7b7e445a3c23" > EnforcedClause< / a > (< / div >
< div class = "line" > < a id = "l00982" name = "l00982" > < / a > < span class = "lineno" > 982< / span > absl::Span< const Literal> enforcement_literals,< / div >
< div class = "line" > < a id = "l00983" name = "l00983" > < / a > < span class = "lineno" > 983< / span > absl::Span< const Literal> clause) {< / div >
< div class = "line" > < a id = "l00984" name = "l00984" > < / a > < span class = "lineno" > 984< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l00985" name = "l00985" > < / a > < span class = "lineno" > 985< / span > std::vector< Literal> tmp;< / div >
< div class = "line" > < a id = "l00986" name = "l00986" > < / a > < span class = "lineno" > 986< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : enforcement_literals) {< / div >
< div class = "line" > < a id = "l00987" name = "l00987" > < / a > < span class = "lineno" > 987< / span > tmp.push_back(l.Negated());< / div >
< div class = "line" > < a id = "l00988" name = "l00988" > < / a > < span class = "lineno" > 988< / span > }< / div >
< div class = "line" > < a id = "l00989" name = "l00989" > < / a > < span class = "lineno" > 989< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : clause) {< / div >
< div class = "line" > < a id = "l00990" name = "l00990" > < / a > < span class = "lineno" > 990< / span > tmp.push_back(l);< / div >
< div class = "line" > < a id = "l00991" name = "l00991" > < / a > < span class = "lineno" > 991< / span > }< / div >
< div class = "line" > < a id = "l00992" name = "l00992" > < / a > < span class = "lineno" > 992< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > ClauseConstraint< / a > (tmp));< / div >
< div class = "line" > < a id = "l00993" name = "l00993" > < / a > < span class = "lineno" > 993< / span > };< / div >
< div class = "line" > < a id = "l00994" name = "l00994" > < / a > < span class = "lineno" > 994< / span > }< / div >
< div class = "line" > < a id = "l00995" name = "l00995" > < / a > < span class = "lineno" > 995< / span > < / div >
< div class = "line" > < a id = "l00996" name = "l00996" > < / a > < span class = "lineno" > 996< / span > < span class = "comment" > // r < => (all literals are true).< / span > < / div >
< div class = "line" > < a id = "l00997" name = "l00997" > < / a > < span class = "lineno" > 997< / span > < span class = "comment" > //< / span > < / div >
< div class = "line" > < a id = "l00998" name = "l00998" > < / a > < span class = "lineno" > 998< / span > < span class = "comment" > // Note(user): we could have called ReifiedBoolOr() with everything negated.< / span > < / div >
< div class = "line" > < a id = "l00999" name = "l00999" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aa6d55689d1854993da4a2e31c5539905" > 999< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#aa6d55689d1854993da4a2e31c5539905" > ReifiedBoolAnd< / a > (< / div >
< div class = "line" > < a id = "l01000" name = "l01000" > < / a > < span class = "lineno" > 1000< / span > < span class = "keyword" > const< / span > std::vector< Literal> & literals, < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > r) {< / div >
< div class = "line" > < a id = "l01001" name = "l01001" > < / a > < span class = "lineno" > 1001< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l01002" name = "l01002" > < / a > < span class = "lineno" > 1002< / span > std::vector< Literal> clause;< / div >
< div class = "line" > < a id = "l01003" name = "l01003" > < / a > < span class = "lineno" > 1003< / span > < span class = "keywordflow" > for< / span > (< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l : literals) {< / div >
< div class = "line" > < a id = "l01004" name = "l01004" > < / a > < span class = "lineno" > 1004< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a6e056f4efb99b080ae5bdb7267339f59" > Implication< / a > (r, l)); < span class = "comment" > // r => l.< / span > < / div >
< div class = "line" > < a id = "l01005" name = "l01005" > < / a > < span class = "lineno" > 1005< / span > clause.push_back(l.Negated());< / div >
< div class = "line" > < a id = "l01006" name = "l01006" > < / a > < span class = "lineno" > 1006< / span > }< / div >
< div class = "line" > < a id = "l01007" name = "l01007" > < / a > < span class = "lineno" > 1007< / span > < / div >
< div class = "line" > < a id = "l01008" name = "l01008" > < / a > < span class = "lineno" > 1008< / span > < span class = "comment" > // All true => r true.< / span > < / div >
< div class = "line" > < a id = "l01009" name = "l01009" > < / a > < span class = "lineno" > 1009< / span > clause.push_back(r);< / div >
< div class = "line" > < a id = "l01010" name = "l01010" > < / a > < span class = "lineno" > 1010< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > ClauseConstraint< / a > (clause));< / div >
< div class = "line" > < a id = "l01011" name = "l01011" > < / a > < span class = "lineno" > 1011< / span > };< / div >
< div class = "line" > < a id = "l01012" name = "l01012" > < / a > < span class = "lineno" > 1012< / span > }< / div >
< div class = "line" > < a id = "l01013" name = "l01013" > < / a > < span class = "lineno" > 1013< / span > < / div >
< div class = "line" > < a id = "l01014" name = "l01014" > < / a > < span class = "lineno" > 1014< / span > < span class = "comment" > // r < => (a < = b).< / span > < / div >
< div class = "line" > < a id = "l01015" name = "l01015" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a52e7ea663f64c733766811e8f20a6a13" > 1015< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a52e7ea663f64c733766811e8f20a6a13" > ReifiedBoolLe< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > , < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > ,< / div >
< div class = "line" > < a id = "l01016" name = "l01016" > < / a > < span class = "lineno" > 1016< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > r) {< / div >
< div class = "line" > < a id = "l01017" name = "l01017" > < / a > < span class = "lineno" > 1017< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l01018" name = "l01018" > < / a > < span class = "lineno" > 1018< / span > < span class = "comment" > // r < => (a < = b) is the same as r < => not(a=1 and b=0).< / span > < / div >
< div class = "line" > < a id = "l01019" name = "l01019" > < / a > < span class = "lineno" > 1019< / span > < span class = "comment" > // So r < => a=0 OR b=1.< / span > < / div >
< div class = "line" > < a id = "l01020" name = "l01020" > < / a > < span class = "lineno" > 1020< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a17b162d025d26ae56571f2250620c266" > ReifiedBoolOr< / a > ({< a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > .Negated(), < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > }, r));< / div >
< div class = "line" > < a id = "l01021" name = "l01021" > < / a > < span class = "lineno" > 1021< / span > };< / div >
< div class = "line" > < a id = "l01022" name = "l01022" > < / a > < span class = "lineno" > 1022< / span > }< / div >
< div class = "line" > < a id = "l01023" name = "l01023" > < / a > < span class = "lineno" > 1023< / span > < / div >
< div class = "line" > < a id = "l01024" name = "l01024" > < / a > < span class = "lineno" > 1024< / span > < span class = "comment" > // This checks that the variable is fixed.< / span > < / div >
< div class = "line" > < a id = "l01025" name = "l01025" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#aaa275108375324277e2d6399f6119513" > 1025< / a > < / span > < span class = "keyword" > inline< / span > std::function< int64_t(< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > & )> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984" > Value< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > l) {< / div >
< div class = "line" > < a id = "l01026" name = "l01026" > < / a > < span class = "lineno" > 1026< / span > < span class = "keywordflow" > return< / span > [=](< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > & < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l01027" name = "l01027" > < / a > < span class = "lineno" > 1027< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_trail.html" > Trail< / a > * trail = < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > .Get< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_trail.html" > Trail< / a > > ();< / div >
< div class = "line" > < a id = "l01028" name = "l01028" > < / a > < span class = "lineno" > 1028< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (trail-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b" > Assignment< / a > ().< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d" > VariableIsAssigned< / a > (l.< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8" > Variable< / a > ()));< / div >
< div class = "line" > < a id = "l01029" name = "l01029" > < / a > < span class = "lineno" > 1029< / span > < span class = "keywordflow" > return< / span > trail-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b" > Assignment< / a > ().< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e" > LiteralIsTrue< / a > (l);< / div >
< div class = "line" > < a id = "l01030" name = "l01030" > < / a > < span class = "lineno" > 1030< / span > };< / div >
< div class = "line" > < a id = "l01031" name = "l01031" > < / a > < span class = "lineno" > 1031< / span > }< / div >
< div class = "line" > < a id = "l01032" name = "l01032" > < / a > < span class = "lineno" > 1032< / span > < / div >
< div class = "line" > < a id = "l01033" name = "l01033" > < / a > < span class = "lineno" > 1033< / span > < span class = "comment" > // This checks that the variable is fixed.< / span > < / div >
< div class = "line" > < a id = "l01034" name = "l01034" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a1a3318619f57025ab3d6474542d64994" > 1034< / a > < / span > < span class = "keyword" > inline< / span > std::function< int64_t(< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > & )> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984" > Value< / a > (BooleanVariable < a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > ) {< / div >
< div class = "line" > < a id = "l01035" name = "l01035" > < / a > < span class = "lineno" > 1035< / span > < span class = "keywordflow" > return< / span > [=](< span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > & < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l01036" name = "l01036" > < / a > < span class = "lineno" > 1036< / span > < span class = "keyword" > const< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_trail.html" > Trail< / a > * trail = < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > .Get< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_trail.html" > Trail< / a > > ();< / div >
< div class = "line" > < a id = "l01037" name = "l01037" > < / a > < span class = "lineno" > 1037< / span > < a class = "code hl_define" href = "base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274" > CHECK< / a > (trail-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b" > Assignment< / a > ().< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d" > VariableIsAssigned< / a > (< a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > ));< / div >
< div class = "line" > < a id = "l01038" name = "l01038" > < / a > < span class = "lineno" > 1038< / span > < span class = "keywordflow" > return< / span > trail-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b" > Assignment< / a > ().< a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e" > LiteralIsTrue< / a > (< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_literal.html" > Literal< / a > (< a class = "code hl_variable" href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > , < span class = "keyword" > true< / span > ));< / div >
< div class = "line" > < a id = "l01039" name = "l01039" > < / a > < span class = "lineno" > 1039< / span > };< / div >
2022-01-17 21:42:14 +01:00
< div class = "line" > < a id = "l01040" name = "l01040" > < / a > < span class = "lineno" > 1040< / span > }< / div >
< div class = "line" > < a id = "l01041" name = "l01041" > < / a > < span class = "lineno" > 1041< / span > < / div >
2022-03-04 00:11:33 +01:00
< div class = "line" > < a id = "l01042" name = "l01042" > < / a > < span class = "lineno" > 1042< / span > < span class = "comment" > // This can be used to enumerate all the solutions. After each SAT call to< / span > < / div >
< div class = "line" > < a id = "l01043" name = "l01043" > < / a > < span class = "lineno" > 1043< / span > < span class = "comment" > // Solve(), calling this will reset the solver and exclude the current solution< / span > < / div >
< div class = "line" > < a id = "l01044" name = "l01044" > < / a > < span class = "lineno" > 1044< / span > < span class = "comment" > // so that the next call to Solve() will give a new solution or UNSAT is there< / span > < / div >
< div class = "line" > < a id = "l01045" name = "l01045" > < / a > < span class = "lineno" > 1045< / span > < span class = "comment" > // is no more new solutions.< / span > < / div >
< div class = "line" > < a id = "l01046" name = "l01046" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#ae5713162a0aa0aa8ce18c442afc26254" > 1046< / a > < / span > < span class = "keyword" > inline< / span > std::function< void(< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > *)> < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#ae5713162a0aa0aa8ce18c442afc26254" > ExcludeCurrentSolutionAndBacktrack< / a > () {< / div >
< div class = "line" > < a id = "l01047" name = "l01047" > < / a > < span class = "lineno" > 1047< / span > < span class = "keywordflow" > return< / span > [=](< a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_model.html" > Model< / a > * < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > ) {< / div >
< div class = "line" > < a id = "l01048" name = "l01048" > < / a > < span class = "lineno" > 1048< / span > < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > * sat_solver = < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> GetOrCreate< < a class = "code hl_class" href = "classoperations__research_1_1sat_1_1_sat_solver.html" > SatSolver< / a > > ();< / div >
< div class = "line" > < a id = "l01049" name = "l01049" > < / a > < span class = "lineno" > 1049< / span > < / div >
< div class = "line" > < a id = "l01050" name = "l01050" > < / a > < span class = "lineno" > 1050< / span > < span class = "comment" > // Note that we only exclude the current decisions, which is an efficient< / span > < / div >
< div class = "line" > < a id = "l01051" name = "l01051" > < / a > < span class = "lineno" > 1051< / span > < span class = "comment" > // way to not get the same SAT assignment.< / span > < / div >
< div class = "line" > < a id = "l01052" name = "l01052" > < / a > < span class = "lineno" > 1052< / span > < span class = "keyword" > const< / span > < span class = "keywordtype" > int< / span > current_level = sat_solver-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad63c4461a1384629cb99413c6df8b9ca" > CurrentDecisionLevel< / a > ();< / div >
< div class = "line" > < a id = "l01053" name = "l01053" > < / a > < span class = "lineno" > 1053< / span > std::vector< Literal> clause_to_exclude_solution;< / div >
< div class = "line" > < a id = "l01054" name = "l01054" > < / a > < span class = "lineno" > 1054< / span > clause_to_exclude_solution.reserve(current_level);< / div >
< div class = "line" > < a id = "l01055" name = "l01055" > < / a > < span class = "lineno" > 1055< / span > < span class = "keywordflow" > for< / span > (< span class = "keywordtype" > int< / span > i = 0; i < current_level; ++i) {< / div >
< div class = "line" > < a id = "l01056" name = "l01056" > < / a > < span class = "lineno" > 1056< / span > clause_to_exclude_solution.push_back(< / div >
< div class = "line" > < a id = "l01057" name = "l01057" > < / a > < span class = "lineno" > 1057< / span > sat_solver-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5048581740d1affcc6168f56fe88ff58" > Decisions< / a > ()[i].literal.Negated());< / div >
< div class = "line" > < a id = "l01058" name = "l01058" > < / a > < span class = "lineno" > 1058< / span > }< / div >
< div class = "line" > < a id = "l01059" name = "l01059" > < / a > < span class = "lineno" > 1059< / span > sat_solver-> < a class = "code hl_function" href = "classoperations__research_1_1sat_1_1_sat_solver.html#ac035378cea0ed7b0978105547402faa8" > Backtrack< / a > (0);< / div >
< div class = "line" > < a id = "l01060" name = "l01060" > < / a > < span class = "lineno" > 1060< / span > < a class = "code hl_variable" href = "gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf" > model< / a > -> Add(< a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > ClauseConstraint< / a > (clause_to_exclude_solution));< / div >
< div class = "line" > < a id = "l01061" name = "l01061" > < / a > < span class = "lineno" > 1061< / span > };< / div >
< div class = "line" > < a id = "l01062" name = "l01062" > < / a > < span class = "lineno" > 1062< / span > }< / div >
< div class = "line" > < a id = "l01063" name = "l01063" > < / a > < span class = "lineno" > 1063< / span > < / div >
< div class = "line" > < a id = "l01064" name = "l01064" > < / a > < span class = "lineno" > 1064< / span > < span class = "comment" > // Returns a string representation of a SatSolver::Status.< / span > < / div >
< div class = "line" > < a id = "l01065" name = "l01065" > < / a > < span class = "lineno" > 1065< / span > std::string < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc" > SatStatusString< / a > (< a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code hl_variable" href = "g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d" > status< / a > );< / div >
< div class = "line" > < a id = "l01066" name = "l01066" > < / a > < span class = "lineno" > < a class = "line" href = "namespaceoperations__research_1_1sat.html#a9ba4fb23e5a8ee32e9a2c807ee82b4c4" > 1066< / a > < / span > < span class = "keyword" > inline< / span > std::ostream& < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a15ca399ada8a279dc92f693ede7e4004" > operator< < < / a > (std::ostream& os, < a class = "code hl_enumeration" href = "classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b" > SatSolver::Status< / a > < a class = "code hl_variable" href = "g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d" > status< / a > ) {< / div >
< div class = "line" > < a id = "l01067" name = "l01067" > < / a > < span class = "lineno" > 1067< / span > os < < < a class = "code hl_function" href = "namespaceoperations__research_1_1sat.html#a762ee6abbb57f9f730df6033aafdf4fc" > SatStatusString< / a > (< a class = "code hl_variable" href = "g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d" > status< / a > );< / div >
< div class = "line" > < a id = "l01068" name = "l01068" > < / a > < span class = "lineno" > 1068< / span > < span class = "keywordflow" > return< / span > os;< / div >
< div class = "line" > < a id = "l01069" name = "l01069" > < / a > < span class = "lineno" > 1069< / span > }< / div >
< div class = "line" > < a id = "l01070" name = "l01070" > < / a > < span class = "lineno" > 1070< / span > < / div >
< div class = "line" > < a id = "l01071" name = "l01071" > < / a > < span class = "lineno" > 1071< / span > } < span class = "comment" > // namespace sat< / span > < / div >
< div class = "line" > < a id = "l01072" name = "l01072" > < / a > < span class = "lineno" > 1072< / span > } < span class = "comment" > // namespace operations_research< / span > < / div >
< div class = "line" > < a id = "l01073" name = "l01073" > < / a > < span class = "lineno" > 1073< / span > < / div >
< div class = "line" > < a id = "l01074" name = "l01074" > < / a > < span class = "lineno" > 1074< / span > < span class = "preprocessor" > #endif < / span > < span class = "comment" > // OR_TOOLS_SAT_SAT_SOLVER_H_< / span > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f" > < div class = "ttname" > < a href = "alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f" > max< / a > < / div > < div class = "ttdeci" > int64_t max< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "alldiff__cst_8cc_source.html#l00140" > alldiff_cst.cc:140< / a > < / div > < / div >
< div class = "ttc" id = "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 >
2022-03-04 00:11:33 +01:00
< 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#l00706" > base/logging.h:706< / 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#l00703" > base/logging.h:703< / a > < / div > < / div >
< div class = "ttc" id = "abitset_8h_html" > < div class = "ttname" > < a href = "bitset_8h.html" > bitset.h< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "aclass_wall_timer_html" > < div class = "ttname" > < a href = "class_wall_timer.html" > WallTimer< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "timer_8h_source.html#l00023" > timer.h:23< / 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#l00106" > time_limit.h:106< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1_time_limit_html_af90cfd1fc238433fc303ee28c5914eb9" > < div class = "ttname" > < a href = "classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9" > operations_research::TimeLimit::AdvanceDeterministicTime< / a > < / div > < div class = "ttdeci" > void AdvanceDeterministicTime(double deterministic_duration)< / div > < div class = "ttdoc" > Advances the deterministic time.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "time__limit_8h_source.html#l00227" > time_limit.h:227< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a558f9dd435d1f46d7408d60d0e9969f1" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_binary_implication_graph.html#a558f9dd435d1f46d7408d60d0e9969f1" > operations_research::sat::BinaryImplicationGraph::ExtractAllBinaryClauses< / a > < / div > < div class = "ttdeci" > void ExtractAllBinaryClauses(Output *out) const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "clause_8h_source.html#l00650" > clause.h:650< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_binary_implication_graph_html_a75f1d17f36330a1c8a96e43fe8805598" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_binary_implication_graph.html#a75f1d17f36330a1c8a96e43fe8805598" > operations_research::sat::BinaryImplicationGraph::SetDratProofHandler< / a > < / div > < div class = "ttdeci" > void SetDratProofHandler(DratProofHandler *drat_proof_handler)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "clause_8h_source.html#l00671" > clause.h:671< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_drat_proof_handler_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_drat_proof_handler.html" > operations_research::sat::DratProofHandler< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "drat__proof__handler_8h_source.html#l00043" > drat_proof_handler.h:43< / 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#l00067" > sat_base.h:67< / 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#l00083" > sat_base.h:83< / 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#l00094" > sat_base.h:94< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_literal_watchers_html_a75f1d17f36330a1c8a96e43fe8805598" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_literal_watchers.html#a75f1d17f36330a1c8a96e43fe8805598" > operations_research::sat::LiteralWatchers::SetDratProofHandler< / a > < / div > < div class = "ttdeci" > void SetDratProofHandler(DratProofHandler *drat_proof_handler)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "clause_8h_source.html#l00242" > clause.h:242< / 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#l00222" > clause.h:222< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_literal_watchers_html_abe425f3287da97e7ffaa8c9dfb3dcefe" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_literal_watchers.html#abe425f3287da97e7ffaa8c9dfb3dcefe" > 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#l00214" > clause.h:214< / 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#l00472" > clause.cc:472< / 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#l00042" > sat/model.h:42< / 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#l00054" > clause.h:54< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a0b5d7f31620ad7b364e7415c47ee5e0d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a0b5d7f31620ad7b364e7415c47ee5e0d" > operations_research::sat::SatDecisionPolicy::AllPreferences< / a > < / div > < div class = "ttdeci" > std::vector< std::pair< Literal, double > > AllPreferences() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__decision_8cc_source.html#l00278" > sat_decision.cc:278< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a1dc177ee88f0a7ce2e46a032e5c3cf02" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > operations_research::sat::SatDecisionPolicy::ResetDecisionHeuristic< / a > < / div > < div class = "ttdeci" > void ResetDecisionHeuristic()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__decision_8cc_source.html#l00141" > sat_decision.cc:141< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_decision_policy_html_a955786dcbe82b7c4dc9924a5473ac1e8" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_decision_policy.html#a955786dcbe82b7c4dc9924a5473ac1e8" > operations_research::sat::SatDecisionPolicy::SetAssignmentPreference< / a > < / div > < div class = "ttdeci" > void SetAssignmentPreference(Literal literal, double weight)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__decision_8cc_source.html#l00263" > sat_decision.cc:263< / 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#l00448" > sat_base.h:448< / 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#l00061" > sat_solver.h:61< / 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#l00343" > sat_solver.cc:343< / 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#l00976" > sat_solver.cc:976< / 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#l00085" > sat_solver.cc:85< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a0b5d7f31620ad7b364e7415c47ee5e0d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a0b5d7f31620ad7b364e7415c47ee5e0d" > operations_research::sat::SatSolver::AllPreferences< / a > < / div > < div class = "ttdeci" > std::vector< std::pair< Literal, double > > AllPreferences() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00156" > sat_solver.h:156< / 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#l00193" > sat_solver.cc:193< / 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#l00445" > sat_solver.cc:445< / 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#l00131" > sat_solver.cc:131< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a1dc177ee88f0a7ce2e46a032e5c3cf02" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a1dc177ee88f0a7ce2e46a032e5c3cf02" > operations_research::sat::SatSolver::ResetDecisionHeuristic< / a > < / div > < div class = "ttdeci" > void ResetDecisionHeuristic()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00159" > sat_solver.h:159< / 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#l00157" > sat_solver.cc:157< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a27c4cf985792880dfea9d42c79f13920" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a27c4cf985792880dfea9d42c79f13920" > operations_research::sat::SatSolver::model< / a > < / div > < div class = "ttdeci" > Model * model()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00069" > sat_solver.h:69< / 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#l01072" > sat_solver.cc:1072< / 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#l01659" > sat_solver.cc:1659< / 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#l01047" > sat_solver.cc:1047< / 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#l01076" > sat_solver.cc:1076< / 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#l00437" > sat_solver.cc:437< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a43684a0a8ef85b1cea0076dba3fb271d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a43684a0a8ef85b1cea0076dba3fb271d" > operations_research::sat::SatSolver::NewBooleanVariable< / a > < / div > < div class = "ttdeci" > BooleanVariable NewBooleanVariable()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00087" > sat_solver.h:87< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a4793952607a98dfddfbcc17abfabbb4b" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4793952607a98dfddfbcc17abfabbb4b" > 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#l00378" > sat_solver.h:378< / 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#l01032" > sat_solver.cc:1032< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a4f7251fc4692363cf55796a6f3e267ea" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a4f7251fc4692363cf55796a6f3e267ea" > operations_research::sat::SatSolver::NotifyThatModelIsUnsat< / a > < / div > < div class = "ttdeci" > void NotifyThatModelIsUnsat()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00417" > sat_solver.h:417< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a5048581740d1affcc6168f56fe88ff58" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5048581740d1affcc6168f56fe88ff58" > operations_research::sat::SatSolver::Decisions< / a > < / div > < div class = "ttdeci" > const std::vector< Decision > & Decisions() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00375" > sat_solver.h:375< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a50d602d16dde52a55910bb160baa7719" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a50d602d16dde52a55910bb160baa7719" > operations_research::sat::SatSolver::NumFixedVariables< / a > < / div > < div class = "ttdeci" > int64_t NumFixedVariables() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00454" > sat_solver.h:454< / 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#l01022" > sat_solver.cc:1022< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a5b06f24fb581de78b321dfd793931439" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a5b06f24fb581de78b321dfd793931439" > 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#l00377" > sat_solver.h:377< / 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#l00325" > sat_solver.h:325< / 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#l01060" > sat_solver.cc:1060< / 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#l00561" > sat_solver.cc:561< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a678cca4fb095d5dee896dd687649a5de" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a678cca4fb095d5dee896dd687649a5de" > operations_research::sat::SatSolver::ProblemIsPureSat< / a > < / div > < div class = "ttdeci" > bool ProblemIsPureSat() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00403" > sat_solver.h:403< / 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#l00183" > sat_solver.h:183< / 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#l00186" > sat_solver.h:186< / 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#l00185" > sat_solver.h:185< / 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#l00187" > sat_solver.h:187< / 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#l00184" > sat_solver.h:184< / 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#l00474" > sat_solver.cc:474< / 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#l00444" > sat_solver.h:444< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a748882726e16a456976b3753478a0496" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a748882726e16a456976b3753478a0496" > operations_research::sat::SatSolver::SetShareBinaryClauseCallback< / a > < / div > < div class = "ttdeci" > void SetShareBinaryClauseCallback(const std::function< void(Literal, Literal)> & shared_binary_clauses_callback)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00437" > sat_solver.h:437< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a75f1d17f36330a1c8a96e43fe8805598" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a75f1d17f36330a1c8a96e43fe8805598" > operations_research::sat::SatSolver::SetDratProofHandler< / a > < / div > < div class = "ttdeci" > void SetDratProofHandler(DratProofHandler *drat_proof_handler)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00405" > sat_solver.h:405< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a7ab8996f31104834f27a232817731314" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a7ab8996f31104834f27a232817731314" > operations_research::sat::SatSolver::num_restarts< / a > < / div > < div class = "ttdeci" > int64_t num_restarts() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00111" > sat_solver.cc:111< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a88dcaf0cf27bb4991376ed54d8f2698f" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a88dcaf0cf27bb4991376ed54d8f2698f" > operations_research::sat::SatSolver::AssumptionLevel< / a > < / div > < div class = "ttdeci" > int AssumptionLevel() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00223" > sat_solver.h:223< / 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#l00083" > sat_solver.cc:83< / 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#l01350" > sat_solver.cc:1350< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a8fa29503728270c9696389c9e590c242" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a8fa29503728270c9696389c9e590c242" > operations_research::sat::SatSolver::num_branches< / a > < / div > < div class = "ttdeci" > int64_t num_branches() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00103" > sat_solver.cc:103< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a955786dcbe82b7c4dc9924a5473ac1e8" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a955786dcbe82b7c4dc9924a5473ac1e8" > operations_research::sat::SatSolver::SetAssignmentPreference< / a > < / div > < div class = "ttdeci" > void SetAssignmentPreference(Literal literal, double weight)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00153" > sat_solver.h:153< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a99ad912d89d06226159ee1d4478b6af6" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a99ad912d89d06226159ee1d4478b6af6" > operations_research::sat::SatSolver::ResetDecisionHeuristicAndSetAllPreferences< / a > < / div > < div class = "ttdeci" > void ResetDecisionHeuristicAndSetAllPreferences(const std::vector< std::pair< Literal, double > > & prefs)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00162" > sat_solver.h:162< / 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#l00536" > sat_solver.cc:536< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_a9d3beb2afe4ae647674b054bf29290e2" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#a9d3beb2afe4ae647674b054bf29290e2" > operations_research::sat::SatSolver::NumVariables< / a > < / div > < div class = "ttdeci" > int NumVariables() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00086" > sat_solver.h:86< / 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#l00136" > sat_solver.cc:136< / 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#l00579" > sat_solver.cc:579< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_aa5e0514942c20e89148448f4d0572cd0" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#aa5e0514942c20e89148448f4d0572cd0" > operations_research::sat::SatSolver::TrackBinaryClauses< / a > < / div > < div class = "ttdeci" > void TrackBinaryClauses(bool value)< / 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_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#l00189" > sat_solver.cc:189< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ab5bc2f86603d9fdb9a51305ab431530d" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ab5bc2f86603d9fdb9a51305ab431530d" > operations_research::sat::SatSolver::ExtractClauses< / a > < / div > < div class = "ttdeci" > void ExtractClauses(Output *out)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00336" > sat_solver.h:336< / 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#l00963" > sat_solver.cc:963< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_abaadd9bf3136af09f2d2ae695439c4fa" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#abaadd9bf3136af09f2d2ae695439c4fa" > operations_research::sat::SatSolver::num_propagations< / a > < / div > < div class = "ttdeci" > int64_t num_propagations() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00107" > sat_solver.cc:107< / 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#l00991" > sat_solver.cc:991< / 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#l00551" > sat_solver.cc:551< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_acace892b69b55e3ee219e2893f34ef8f" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#acace892b69b55e3ee219e2893f34ef8f" > operations_research::sat::SatSolver::num_failures< / a > < / div > < div class = "ttdeci" > int64_t num_failures() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8cc_source.html#l00105" > sat_solver.cc:105< / 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#l01375" > sat_solver.cc:1375< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ad085476234b92559b93383f9e1264af6" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad085476234b92559b93383f9e1264af6" > operations_research::sat::SatSolver::TakePropagatorOwnership< / a > < / div > < div class = "ttdeci" > void TakePropagatorOwnership(std::unique_ptr< SatPropagator > propagator)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00145" > sat_solver.h:145< / 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#l00604" > sat_solver.cc:604< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_sat_solver_html_ad2a33e1d9335cce63548abed6b5c8aab" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab" > operations_research::sat::SatSolver::IsModelUnsat< / a > < / div > < div class = "ttdeci" > bool IsModelUnsat() const< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00139" > sat_solver.h:139< / 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#l00587" > sat_solver.cc:587< / 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#l00376" > sat_solver.h:376< / 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#l01731" > sat_solver.cc:1731< / 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#l00056" > sat_solver.cc:56< / 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#l00113" > sat_solver.cc:113< / 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#l00202" > sat_solver.cc:202< / 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#l00185" > sat_solver.cc:185< / 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#l01036" > sat_solver.cc:1036< / 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#l00236" > sat_base.h:236< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_trail_html_a4793952607a98dfddfbcc17abfabbb4b" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_trail.html#a4793952607a98dfddfbcc17abfabbb4b" > 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#l00383" > sat_base.h:383< / 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#l00381" > sat_base.h:381< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_trail_html_aba78b12088909fb59dbdd0cb064412ae" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_trail.html#aba78b12088909fb59dbdd0cb064412ae" > 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#l00384" > sat_base.h:384< / a > < / div > < / div >
< div class = "ttc" id = "aclassoperations__research_1_1sat_1_1_variables_assignment_html" > < div class = "ttname" > < a href = "classoperations__research_1_1sat_1_1_variables_assignment.html" > operations_research::sat::VariablesAssignment< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00125" > sat_base.h:125< / 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#l00161" > sat_base.h:161< / 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#l00153" > sat_base.h:153< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "aclause_8h_html" > < div class = "ttname" > < a href = "clause_8h.html" > clause.h< / a > < / div > < / div >
< div class = "ttc" id = "aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683" > < div class = "ttname" > < a href = "constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683" > b< / a > < / div > < div class = "ttdeci" > int64_t b< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "constraint__solver_2table_8cc_source.html#l00047" > constraint_solver/table.cc:47< / a > < / div > < / div >
< div class = "ttc" id = "aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6" > < div class = "ttname" > < a href = "constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6" > a< / a > < / div > < div class = "ttdeci" > int64_t a< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "constraint__solver_2table_8cc_source.html#l00046" > constraint_solver/table.cc:46< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "acp__model__solver_8cc_html_a21696c8707868a3d522d1bee261f4185" > < div class = "ttname" > < a href = "cp__model__solver_8cc.html#a21696c8707868a3d522d1bee261f4185" > clauses< / a > < / div > < div class = "ttdeci" > SharedClausesManager * clauses< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__solver_8cc_source.html#l02056" > cp_model_solver.cc:2056< / a > < / div > < / div >
< div class = "ttc" id = "acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21" > < div class = "ttname" > < a href = "cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21" > time_limit< / a > < / div > < div class = "ttdeci" > ModelSharedTimeLimit * time_limit< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model__solver_8cc_source.html#l02050" > cp_model_solver.cc:2050< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514" > < div class = "ttname" > < a href = "demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514" > value< / a > < / div > < div class = "ttdeci" > int64_t value< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "demon__profiler_8cc_source.html#l00044" > demon_profiler.cc:44< / a > < / div > < / div >
< div class = "ttc" id = "adrat__proof__handler_8h_html" > < div class = "ttname" > < a href = "drat__proof__handler_8h.html" > drat_proof_handler.h< / a > < / div > < / div >
< div class = "ttc" id = "aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465" > < div class = "ttname" > < a href = "expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465" > var< / a > < / div > < div class = "ttdeci" > IntVar * var< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "expr__array_8cc_source.html#l01874" > expr_array.cc:1874< / a > < / div > < / div >
< div class = "ttc" id = "ag__gurobi_8cc_html_a2237393c7ae7ad7344c9885066d5ab6d" > < div class = "ttname" > < a href = "g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d" > status< / a > < / div > < div class = "ttdeci" > absl::Status status< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "g__gurobi_8cc_source.html#l00035" > g_gurobi.cc:35< / a > < / div > < / div >
< div class = "ttc" id = "agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35" > < div class = "ttname" > < a href = "gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35" > upper_bound< / a > < / div > < div class = "ttdeci" > double upper_bound< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "gscip__solver_8cc_source.html#l00137" > gscip_solver.cc:137< / a > < / div > < / div >
< div class = "ttc" id = "agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec" > < div class = "ttname" > < a href = "gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec" > lower_bound< / a > < / div > < div class = "ttdeci" > double lower_bound< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "gscip__solver_8cc_source.html#l00136" > gscip_solver.cc:136< / 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#l00274" > gurobi_interface.cc:274< / a > < / div > < / div >
< div class = "ttc" id = "ahash_8h_html" > < div class = "ttname" > < a href = "hash_8h.html" > hash.h< / 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 = "amacros_8h_html" > < div class = "ttname" > < a href = "macros_8h.html" > macros.h< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1glop_html_ac89c7b45754e9a6bdabc08bea586fc4e" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1glop.html#ac89c7b45754e9a6bdabc08bea586fc4e" > operations_research::glop::Index< / a > < / div > < div class = "ttdeci" > int32_t Index< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "lp__types_8h_source.html#l00038" > lp_types.h:38< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1math__opt_html_ab61209db5b13f0d424da009e414298fc" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1math__opt.html#ab61209db5b13f0d424da009e414298fc" > operations_research::math_opt::Coefficient< / a > < / div > < div class = "ttdeci" > std::tuple< int64_t, int64_t, const double > Coefficient< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sparse__collection__matchers_8h_source.html#l00061" > sparse_collection_matchers.h:61< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a134ba4c37e543cb80c698555b6ae89f8" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a134ba4c37e543cb80c698555b6ae89f8" > operations_research::sat::Equality< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> Equality(IntegerVariable v, int64_t value)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01721" > integer.h:1721< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a15ca399ada8a279dc92f693ede7e4004" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a15ca399ada8a279dc92f693ede7e4004" > operations_research::sat::operator< < < / a > < / div > < div class = "ttdeci" > std::ostream & operator< < (std::ostream & os, const BoolVar & var)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "cp__model_8cc_source.html#l00089" > cp_model.cc:89< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a17b162d025d26ae56571f2250620c266" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a17b162d025d26ae56571f2250620c266" > operations_research::sat::ReifiedBoolOr< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> ReifiedBoolOr(const std::vector< Literal > & literals, Literal r)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00965" > sat_solver.h:965< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a37093a0df3cca500d5f58b1d5482bdc6" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a37093a0df3cca500d5f58b1d5482bdc6" > operations_research::sat::ClauseConstraint< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> ClauseConstraint(absl::Span< const Literal > literals)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00935" > sat_solver.h:935< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a393ff6c6adb9d243cd4b7b7e445a3c23" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a393ff6c6adb9d243cd4b7b7e445a3c23" > operations_research::sat::EnforcedClause< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> EnforcedClause(absl::Span< const Literal > enforcement_literals, absl::Span< const Literal > clause)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00981" > sat_solver.h:981< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a52e7ea663f64c733766811e8f20a6a13" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a52e7ea663f64c733766811e8f20a6a13" > operations_research::sat::ReifiedBoolLe< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> ReifiedBoolLe(Literal a, Literal b, Literal r)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l01015" > sat_solver.h:1015< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a6e056f4efb99b080ae5bdb7267339f59" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a6e056f4efb99b080ae5bdb7267339f59" > operations_research::sat::Implication< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> Implication(const std::vector< Literal > & enforcement_literals, IntegerLiteral i)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01734" > integer.h:1734< / 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#l02655" > sat_solver.cc:2655< / 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#l02638" > sat_solver.cc:2638< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a8a759583ee01f89ea955f23368976482" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a8a759583ee01f89ea955f23368976482" > operations_research::sat::AtMostOneConstraint< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> AtMostOneConstraint(const std::vector< Literal > & literals)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00921" > sat_solver.h:921< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_a96eab70b5ead3894afac4d4fff0fd984" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984" > operations_research::sat::Value< / a > < / div > < div class = "ttdeci" > std::function< int64_t(const Model & )> Value(IntegerVariable v)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "integer_8h_source.html#l01683" > integer.h:1683< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_aa6d55689d1854993da4a2e31c5539905" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#aa6d55689d1854993da4a2e31c5539905" > operations_research::sat::ReifiedBoolAnd< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> ReifiedBoolAnd(const std::vector< Literal > & literals, Literal r)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00999" > sat_solver.h:999< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_abe0c48f07cc78c2880c84f37601f44ed" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#abe0c48f07cc78c2880c84f37601f44ed" > operations_research::sat::CardinalityConstraint< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> CardinalityConstraint(int64_t lower_bound, int64_t upper_bound, const std::vector< Literal > & literals)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00892" > sat_solver.h:892< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ac341ac6090ff0bed8ad2231c94cd3bfc" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ac341ac6090ff0bed8ad2231c94cd3bfc" > operations_research::sat::BooleanLinearConstraint< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> BooleanLinearConstraint(int64_t lower_bound, int64_t upper_bound, std::vector< LiteralWithCoeff > *cst)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00882" > sat_solver.h:882< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_accfda9e32067da0a88da8e325cf39c7c" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#accfda9e32067da0a88da8e325cf39c7c" > operations_research::sat::ExactlyOneConstraint< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> ExactlyOneConstraint(const std::vector< Literal > & literals)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00907" > sat_solver.h:907< / a > < / div > < / div >
< div class = "ttc" id = "anamespaceoperations__research_1_1sat_html_ae5713162a0aa0aa8ce18c442afc26254" > < div class = "ttname" > < a href = "namespaceoperations__research_1_1sat.html#ae5713162a0aa0aa8ce18c442afc26254" > operations_research::sat::ExcludeCurrentSolutionAndBacktrack< / a > < / div > < div class = "ttdeci" > std::function< void(Model *)> ExcludeCurrentSolutionAndBacktrack()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l01046" > sat_solver.h:1046< / 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#l00056" > sat_solver.h:56< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "anamespaceoperations__research_html" > < div class = "ttname" > < a href = "namespaceoperations__research.html" > operations_research< / a > < / div > < div class = "ttdoc" > Collection of objects used to extend the Constraint Solver library.< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "dense__doubly__linked__list_8h_source.html#l00021" > dense_doubly_linked_list.h:21< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b" > < div class = "ttname" > < a href = "optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b" > literal< / a > < / div > < div class = "ttdeci" > Literal literal< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "optimization_8cc_source.html#l00089" > optimization.cc:89< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "apack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c" > < div class = "ttname" > < a href = "pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c" > weight< / a > < / div > < div class = "ttdeci" > int64_t weight< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "pack_8cc_source.html#l00510" > pack.cc:510< / 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 = "apb__constraint_8h_html" > < div class = "ttname" > < a href = "pb__constraint_8h.html" > pb_constraint.h< / a > < / div > < / div >
< div class = "ttc" id = "arestart_8h_html" > < div class = "ttname" > < a href = "restart_8h.html" > restart.h< / a > < / div > < / div >
< div class = "ttc" id = "asat_2model_8h_html" > < div class = "ttname" > < a href = "sat_2model_8h.html" > model.h< / a > < / div > < / div >
< div class = "ttc" id = "asat__base_8h_html" > < div class = "ttname" > < a href = "sat__base_8h.html" > sat_base.h< / a > < / div > < / div >
< div class = "ttc" id = "asat__decision_8h_html" > < div class = "ttname" > < a href = "sat__decision_8h.html" > sat_decision.h< / a > < / div > < / div >
< div class = "ttc" id = "astats_8h_html" > < div class = "ttname" > < a href = "stats_8h.html" > stats.h< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "astrong__integers_8h_html" > < div class = "ttname" > < a href = "strong__integers_8h.html" > strong_integers.h< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_assignment_info_html_a0f2d611d5c2d56f60646827438acf3af" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_assignment_info.html#a0f2d611d5c2d56f60646827438acf3af" > operations_research::sat::AssignmentInfo::trail_index< / a > < / div > < div class = "ttdeci" > int32_t trail_index< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00211" > sat_base.h:211< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_assignment_info_html_a6a330c3b2adf87bfa27e9a9450d8bc40" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_assignment_info.html#a6a330c3b2adf87bfa27e9a9450d8bc40" > operations_research::sat::AssignmentInfo::level< / a > < / div > < div class = "ttdeci" > uint32_t level< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__base_8h_source.html#l00202" > sat_base.h:202< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_sat_solver_1_1_decision_html" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html" > operations_research::sat::SatSolver::Decision< / a > < / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00366" > sat_solver.h:366< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_sat_solver_1_1_decision_html_a2949c912240ff8a61f4a6751250bba27" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a2949c912240ff8a61f4a6751250bba27" > operations_research::sat::SatSolver::Decision::Decision< / a > < / div > < div class = "ttdeci" > Decision(int i, Literal l)< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00368" > sat_solver.h:368< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_sat_solver_1_1_decision_html_a84b0a5cf3a019584a6f21ec98136c60a" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#a84b0a5cf3a019584a6f21ec98136c60a" > operations_research::sat::SatSolver::Decision::trail_index< / a > < / div > < div class = "ttdeci" > int trail_index< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00369" > sat_solver.h:369< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_sat_solver_1_1_decision_html_abd62b993702516d946bdbef25f6d29b0" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#abd62b993702516d946bdbef25f6d29b0" > operations_research::sat::SatSolver::Decision::Decision< / a > < / div > < div class = "ttdeci" > Decision()< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00367" > sat_solver.h:367< / a > < / div > < / div >
< div class = "ttc" id = "astructoperations__research_1_1sat_1_1_sat_solver_1_1_decision_html_af63dcc00f2023fdf498e0829e6fb8a6b" > < div class = "ttname" > < a href = "structoperations__research_1_1sat_1_1_sat_solver_1_1_decision.html#af63dcc00f2023fdf498e0829e6fb8a6b" > operations_research::sat::SatSolver::Decision::literal< / a > < / div > < div class = "ttdeci" > Literal literal< / div > < div class = "ttdef" > < b > Definition:< / b > < a href = "sat__solver_8h_source.html#l00370" > sat_solver.h:370< / a > < / div > < / div >
2022-01-17 21:42:14 +01:00
< div class = "ttc" id = "atime__limit_8h_html" > < div class = "ttname" > < a href = "time__limit_8h.html" > time_limit.h< / a > < / div > < / div >
< div class = "ttc" id = "atimer_8h_html" > < div class = "ttname" > < a href = "timer_8h.html" > timer.h< / a > < / div > < / div >
2022-03-04 00:11:33 +01:00
< div class = "ttc" id = "autil_2logging_8h_html" > < div class = "ttname" > < a href = "util_2logging_8h.html" > logging.h< / a > < / div > < / div >
2021-01-26 11:28:50 +01:00
< / div > <!-- fragment --> < / div > <!-- contents -->
< / div > <!-- doc - content -->
2020-09-02 09:42:51 +02:00
<!-- 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_8h.html" > sat_solver.h< / a > < / li >
< li class = "footer" > Generated by
< a href = "http://www.doxygen.org/index.html" >
2022-01-17 21:42:14 +01:00
< img class = "footer" src = "doxygen.png" alt = "doxygen" / > < / a > 1.9.3 < / li >
2020-09-02 09:42:51 +02:00
< / ul >
< / div >
< / body >
< / html >
