10 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
11 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
19 com.google.protobuf.ExtensionRegistryLite registry) {
23 com.google.protobuf.ExtensionRegistry registry) {
25 (com.google.protobuf.ExtensionRegistryLite) registry);
27 static final com.google.protobuf.Descriptors.Descriptor
28 internal_static_operations_research_sat_SatParameters_descriptor;
30 com.google.protobuf.GeneratedMessage.FieldAccessorTable
31 internal_static_operations_research_sat_SatParameters_fieldAccessorTable;
33 public static com.google.protobuf.Descriptors.FileDescriptor
37 private static com.google.protobuf.Descriptors.FileDescriptor
40 java.lang.String[] descriptorData = {
41 "\n ortools/sat/sat_parameters.proto\022\027oper" +
42 "ations_research.sat\"\302b\n\rSatParameters\022\017\n" +
43 "\004name\030\253\001 \001(\t:\000\022`\n\030preferred_variable_ord" +
44 "er\030\001 \001(\01624.operations_research.sat.SatPa" +
45 "rameters.VariableOrder:\010IN_ORDER\022Y\n\020init" +
46 "ial_polarity\030\002 \001(\0162/.operations_research" +
47 ".sat.SatParameters.Polarity:\016POLARITY_FA" +
48 "LSE\022\036\n\020use_phase_saving\030, \001(\010:\004true\022)\n\032p" +
49 "olarity_rephase_increment\030\250\001 \001(\005:\0041000\022 " +
50 "\n\025random_polarity_ratio\030- \001(\001:\0010\022 \n\025rand" +
51 "om_branches_ratio\030 \001(\001:\0010\022!\n\022use_erwa_h" +
52 "euristic\030K \001(\010:\005false\022%\n\032initial_variabl" +
53 "es_activity\030L \001(\001:\0010\0226\n\'also_bump_variab" +
54 "les_in_conflict_reasons\030M \001(\010:\005false\022o\n\026" +
55 "minimization_algorithm\030\004 \001(\0162D.operation" +
56 "s_research.sat.SatParameters.ConflictMin" +
57 "imizationAlgorithm:\tRECURSIVE\022\202\001\n\035binary" +
58 "_minimization_algorithm\030\" \001(\0162@.operatio" +
59 "ns_research.sat.SatParameters.BinaryMini" +
60 "zationAlgorithm:\031BINARY_MINIMIZATION_FIR" +
61 "ST\0222\n$subsumption_during_conflict_analys" +
62 "is\0308 \001(\010:\004true\022$\n\025clause_cleanup_period\030" +
63 "\013 \001(\005:\00510000\022 \n\025clause_cleanup_target\030\r " +
64 "\001(\005:\0010\022\"\n\024clause_cleanup_ratio\030\276\001 \001(\001:\0030" +
65 ".5\022k\n\031clause_cleanup_protection\030: \001(\01627." +
66 "operations_research.sat.SatParameters.Cl" +
67 "auseProtection:\017PROTECTION_NONE\022#\n\030claus" +
68 "e_cleanup_lbd_bound\030; \001(\005:\0015\022g\n\027clause_c" +
69 "leanup_ordering\030< \001(\01625.operations_resea" +
70 "rch.sat.SatParameters.ClauseOrdering:\017CL" +
71 "AUSE_ACTIVITY\022!\n\024pb_cleanup_increment\030. " +
72 "\001(\005:\003200\022\035\n\020pb_cleanup_ratio\030/ \001(\001:\0030.5\022" +
73 "$\n\027variable_activity_decay\030\017 \001(\001:\0030.8\022+\n" +
74 "\033max_variable_activity_value\030\020 \001(\001:\0061e+1" +
75 "00\022\037\n\021glucose_max_decay\030\026 \001(\001:\0040.95\022%\n\027g" +
76 "lucose_decay_increment\030\027 \001(\001:\0040.01\022,\n\036gl" +
77 "ucose_decay_increment_period\030\030 \001(\005:\0045000" +
78 "\022$\n\025clause_activity_decay\030\021 \001(\001:\0050.999\022(" +
79 "\n\031max_clause_activity_value\030\022 \001(\001:\0051e+20" +
80 "\022S\n\022restart_algorithms\030= \003(\01627.operation" +
81 "s_research.sat.SatParameters.RestartAlgo" +
82 "rithm\022e\n\032default_restart_algorithms\030F \001(" +
83 "\t:ALUBY_RESTART,LBD_MOVING_AVERAGE_RESTA" +
84 "RT,DL_MOVING_AVERAGE_RESTART\022\032\n\016restart_" +
85 "period\030\036 \001(\005:\00250\022\'\n\033restart_running_wind" +
86 "ow_size\030> \001(\005:\00250\022#\n\030restart_dl_average_" +
87 "ratio\030? \001(\001:\0011\022$\n\031restart_lbd_average_ra" +
88 "tio\030G \001(\001:\0011\022#\n\024use_blocking_restart\030@ \001" +
89 "(\010:\005false\022*\n\034blocking_restart_window_siz" +
90 "e\030A \001(\005:\0045000\022(\n\033blocking_restart_multip" +
91 "lier\030B \001(\001:\0031.4\0220\n%num_conflicts_before_" +
92 "strategy_changes\030D \001(\005:\0010\022)\n\036strategy_ch" +
93 "ange_increase_ratio\030E \001(\001:\0010\022 \n\023max_time" +
94 "_in_seconds\030$ \001(\001:\003inf\022#\n\026max_determinis" +
95 "tic_time\030C \001(\001:\003inf\022)\n\035max_num_determini" +
96 "stic_batches\030\243\002 \001(\005:\0010\0224\n\027max_number_of_" +
97 "conflicts\030% \001(\003:\0239223372036854775807\022\037\n\020" +
98 "max_memory_in_mb\030( \001(\003:\00510000\022#\n\022absolut" +
99 "e_gap_limit\030\237\001 \001(\001:\0060.0001\022\036\n\022relative_g" +
100 "ap_limit\030\240\001 \001(\001:\0010\022\026\n\013random_seed\030\037 \001(\005:" +
101 "\0011\022)\n\031permute_variable_randomly\030\262\001 \001(\010:\005" +
102 "false\0221\n!permute_presolve_constraint_ord" +
103 "er\030\263\001 \001(\010:\005false\022\037\n\017use_absl_random\030\264\001 \001" +
104 "(\010:\005false\022\"\n\023log_search_progress\030) \001(\010:\005" +
105 "false\022(\n\030log_subsolver_statistics\030\275\001 \001(\010" +
106 ":\005false\022\025\n\nlog_prefix\030\271\001 \001(\t:\000\022\034\n\rlog_to" +
107 "_stdout\030\272\001 \001(\010:\004true\022\037\n\017log_to_response\030" +
108 "\273\001 \001(\010:\005false\022 \n\021use_pb_resolution\030+ \001(\010" +
109 ":\005false\0226\n\'minimize_reduction_during_pb_" +
110 "resolution\0300 \001(\010:\005false\022,\n\036count_assumpt" +
111 "ion_levels_in_lbd\0301 \001(\010:\004true\022#\n\026presolv" +
112 "e_bve_threshold\0306 \001(\005:\003500\022%\n\032presolve_b" +
113 "ve_clause_weight\0307 \001(\005:\0013\022,\n probing_det" +
114 "erministic_time_limit\030\342\001 \001(\001:\0011\0225\n)preso" +
115 "lve_probing_deterministic_time_limit\0309 \001" +
116 "(\001:\00230\022%\n\027presolve_blocked_clause\030X \001(\010:" +
117 "\004true\022\036\n\020presolve_use_bva\030H \001(\010:\004true\022!\n" +
118 "\026presolve_bva_threshold\030I \001(\005:\0011\022#\n\027max_" +
119 "presolve_iterations\030\212\001 \001(\005:\0013\022\037\n\021cp_mode" +
120 "l_presolve\030V \001(\010:\004true\022!\n\026cp_model_probi" +
121 "ng_level\030n \001(\005:\0012\022\'\n\031cp_model_use_sat_pr" +
122 "esolve\030] \001(\010:\004true\022&\n\026detect_table_with_" +
123 "cost\030\330\001 \001(\010:\005false\022#\n\027table_compression_" +
124 "level\030\331\001 \001(\005:\0012\022*\n\032expand_alldiff_constr" +
125 "aints\030\252\001 \001(\010:\005false\022+\n\034expand_reservoir_" +
126 "constraints\030\266\001 \001(\010:\004true\022.\n\036expand_reser" +
127 "voir_using_circuit\030\240\002 \001(\010:\005false\022.\n\036enco" +
128 "de_cumulative_as_reservoir\030\237\002 \001(\010:\005false" +
129 "\022*\n\036max_lin_max_size_for_expansion\030\230\002 \001(" +
130 "\005:\0010\022,\n\034disable_constraint_expansion\030\265\001 " +
131 "\001(\010:\005false\022=\n-encode_complex_linear_cons" +
132 "traint_with_integer\030\337\001 \001(\010:\005false\0223\n\033mer" +
133 "ge_no_overlap_work_limit\030\221\001 \001(\001:\r1000000" +
134 "000000\0220\n\034merge_at_most_one_work_limit\030\222" +
135 "\001 \001(\001:\t100000000\022\'\n\033presolve_substitutio" +
136 "n_level\030\223\001 \001(\005:\0011\0224\n$presolve_extract_in" +
137 "teger_enforcement\030\256\001 \001(\010:\005false\0221\n\035preso" +
138 "lve_inclusion_work_limit\030\311\001 \001(\003:\t1000000" +
139 "00\022\033\n\014ignore_names\030\312\001 \001(\010:\004true\022\036\n\017infer" +
140 "_all_diffs\030\351\001 \001(\010:\004true\022&\n\027find_big_line" +
141 "ar_overlap\030\352\001 \001(\010:\004true\022#\n\024use_sat_inpro" +
142 "cessing\030\243\001 \001(\010:\004true\022&\n\030inprocessing_dti" +
143 "me_ratio\030\221\002 \001(\001:\0030.2\022&\n\032inprocessing_pro" +
144 "bing_dtime\030\222\002 \001(\001:\0011\022+\n\037inprocessing_min" +
145 "imization_dtime\030\223\002 \001(\001:\0011\022\027\n\013num_workers" +
146 "\030\316\001 \001(\005:\0010\022\035\n\022num_search_workers\030d \001(\005:\001" +
147 "0\022\037\n\023num_full_subsolvers\030\246\002 \001(\005:\0010\022\023\n\nsu" +
148 "bsolvers\030\317\001 \003(\t\022\031\n\020extra_subsolvers\030\333\001 \003" +
149 "(\t\022\032\n\021ignore_subsolvers\030\321\001 \003(\t\022\032\n\021filter" +
150 "_subsolvers\030\245\002 \003(\t\022A\n\020subsolver_params\030\322" +
151 "\001 \003(\0132&.operations_research.sat.SatParam" +
152 "eters\022!\n\021interleave_search\030\210\001 \001(\010:\005false" +
153 "\022!\n\025interleave_batch_size\030\206\001 \001(\005:\0010\022$\n\026s" +
154 "hare_objective_bounds\030q \001(\010:\004true\022%\n\027sha" +
155 "re_level_zero_bounds\030r \001(\010:\004true\022#\n\024shar" +
156 "e_binary_clauses\030\313\001 \001(\010:\004true\022\"\n\022share_g" +
157 "lue_clauses\030\235\002 \001(\010:\005false\0220\n debug_posts" +
158 "olve_with_full_solver\030\242\001 \001(\010:\005false\022-\n!d" +
159 "ebug_max_num_presolve_operations\030\227\001 \001(\005:" +
160 "\0010\022\'\n\027debug_crash_on_bad_hint\030\303\001 \001(\010:\005fa" +
161 "lse\022$\n\026use_optimization_hints\030# \001(\010:\004tru" +
162 "e\022\"\n\027core_minimization_level\0302 \001(\005:\0012\022!\n" +
163 "\023find_multiple_cores\030T \001(\010:\004true\022 \n\022cove" +
164 "r_optimization\030Y \001(\010:\004true\022x\n\030max_sat_as" +
165 "sumption_order\0303 \001(\0162<.operations_resear" +
166 "ch.sat.SatParameters.MaxSatAssumptionOrd" +
167 "er:\030DEFAULT_ASSUMPTION_ORDER\022/\n max_sat_" +
168 "reverse_assumption_order\0304 \001(\010:\005false\022|\n" +
169 "\026max_sat_stratification\0305 \001(\0162D.operatio" +
170 "ns_research.sat.SatParameters.MaxSatStra" +
171 "tificationAlgorithm:\026STRATIFICATION_DESC" +
172 "ENT\022.\n!propagation_loop_detection_factor" +
173 "\030\335\001 \001(\001:\00210\0227\n)use_precedences_in_disjun" +
174 "ctive_constraint\030J \001(\010:\004true\022B\n5max_size" +
175 "_to_create_precedence_literals_in_disjun" +
176 "ctive\030\345\001 \001(\005:\00260\0225\n%use_strong_propagati" +
177 "on_in_disjunctive\030\346\001 \001(\010:\005false\0225\n%use_d" +
178 "ynamic_precedence_in_disjunctive\030\207\002 \001(\010:" +
179 "\005false\0224\n$use_dynamic_precedence_in_cumu" +
180 "lative\030\214\002 \001(\010:\005false\0221\n\"use_overload_che" +
181 "cker_in_cumulative\030N \001(\010:\005false\0227\n\'use_c" +
182 "onservative_scale_overload_checker\030\236\002 \001(" +
183 "\010:\005false\0227\n(use_timetable_edge_finding_i" +
184 "n_cumulative\030O \001(\010:\005false\022:\n,max_num_int" +
185 "ervals_for_timetable_edge_finding\030\204\002 \001(\005" +
186 ":\003100\0222\n\"use_hard_precedences_in_cumulat" +
187 "ive\030\327\001 \001(\010:\005false\022\'\n\027exploit_all_precede" +
188 "nces\030\334\001 \001(\010:\005false\0226\n(use_disjunctive_co" +
189 "nstraint_in_cumulative\030P \001(\010:\004true\0220\n us" +
190 "e_timetabling_in_no_overlap_2d\030\310\001 \001(\010:\005f" +
191 "alse\0228\n(use_energetic_reasoning_in_no_ov" +
192 "erlap_2d\030\325\001 \001(\010:\005false\022=\n-use_area_energ" +
193 "etic_reasoning_in_no_overlap_2d\030\217\002 \001(\010:\005" +
194 "false\022<\n-max_pairs_pairwise_reasoning_in" +
195 "_no_overlap_2d\030\224\002 \001(\005:\0041250\022-\n\036use_dual_" +
196 "scheduling_heuristics\030\326\001 \001(\010:\004true\022b\n\020se" +
197 "arch_branching\030R \001(\01626.operations_resear" +
198 "ch.sat.SatParameters.SearchBranching:\020AU" +
199 "TOMATIC_SEARCH\022 \n\023hint_conflict_limit\030\231\001" +
200 " \001(\005:\00210\022\033\n\013repair_hint\030\247\001 \001(\010:\005false\0223\n" +
201 "#fix_variables_to_their_hinted_value\030\300\001 " +
202 "\001(\010:\005false\022\"\n\022use_probing_search\030\260\001 \001(\010:" +
203 "\005false\022#\n\024use_extended_probing\030\215\002 \001(\010:\004t" +
204 "rue\022.\n\036probing_num_combinations_limit\030\220\002" +
205 " \001(\005:\00520000\022,\n\035use_shaving_in_probing_se" +
206 "arch\030\314\001 \001(\010:\004true\0221\n!shaving_search_dete" +
207 "rministic_time\030\315\001 \001(\001:\0050.001\022%\n\030shaving_" +
208 "search_threshold\030\242\002 \001(\003:\00264\022\'\n\027use_objec" +
209 "tive_lb_search\030\344\001 \001(\010:\005false\022,\n\034use_obje" +
210 "ctive_shaving_search\030\375\001 \001(\010:\005false\022,\n\034us" +
211 "e_variables_shaving_search\030\241\002 \001(\010:\005false" +
212 "\022.\n!pseudo_cost_reliability_threshold\030{ " +
213 "\001(\003:\003100\022!\n\022optimize_with_core\030S \001(\010:\005fa" +
214 "lse\022,\n\034optimize_with_lb_tree_search\030\274\001 \001" +
215 "(\010:\005false\022/\n\037save_lp_basis_in_lb_tree_se" +
216 "arch\030\234\002 \001(\010:\005false\022\'\n\033binary_search_num_" +
217 "conflicts\030c \001(\005:\002-1\022#\n\024optimize_with_max" +
218 "_hs\030U \001(\010:\005false\022#\n\024use_feasibility_jump" +
219 "\030\211\002 \001(\010:\004true\022\033\n\013use_ls_only\030\360\001 \001(\010:\005fal" +
220 "se\022%\n\026feasibility_jump_decay\030\362\001 \001(\001:\0040.9" +
221 "5\0220\n$feasibility_jump_linearization_leve" +
222 "l\030\201\002 \001(\005:\0012\022+\n\037feasibility_jump_restart_" +
223 "factor\030\202\002 \001(\005:\0011\022*\n\034feasibility_jump_bat" +
224 "ch_dtime\030\244\002 \001(\001:\0030.1\022=\n.feasibility_jump" +
225 "_var_randomization_probability\030\367\001 \001(\001:\0040" +
226 ".05\022;\n-feasibility_jump_var_perburbation" +
227 "_range_ratio\030\370\001 \001(\001:\0030.2\022/\n feasibility_" +
228 "jump_enable_restarts\030\372\001 \001(\010:\004true\022;\n-fea" +
229 "sibility_jump_max_expanded_constraint_si" +
230 "ze\030\210\002 \001(\005:\003500\022\034\n\020num_violation_ls\030\364\001 \001(" +
231 "\005:\0010\022.\n violation_ls_perturbation_period" +
232 "\030\371\001 \001(\005:\003100\0224\n&violation_ls_compound_mo" +
233 "ve_probability\030\203\002 \001(\001:\0030.5\022#\n\027shared_tre" +
234 "e_num_workers\030\353\001 \001(\005:\0010\022&\n\026use_shared_tr" +
235 "ee_search\030\354\001 \001(\010:\005false\022<\n.shared_tree_w" +
236 "orker_objective_split_probability\030\355\001 \001(\001" +
237 ":\0030.5\0227\n+shared_tree_worker_min_restarts" +
238 "_per_subtree\030\232\002 \001(\005:\0011\0226\n\'shared_tree_wo" +
239 "rker_enable_trail_sharing\030\247\002 \001(\010:\004true\022." +
240 "\n\"shared_tree_open_leaves_per_worker\030\231\002 " +
241 "\001(\001:\0012\0221\n shared_tree_max_nodes_per_work" +
242 "er\030\356\001 \001(\005:\006100000\022x\n\032shared_tree_split_s" +
243 "trategy\030\357\001 \001(\0162>.operations_research.sat" +
244 ".SatParameters.SharedTreeSplitStrategy:\023" +
245 "SPLIT_STRATEGY_AUTO\022&\n\027enumerate_all_sol" +
246 "utions\030W \001(\010:\005false\0227\n\'keep_all_feasible" +
247 "_solutions_in_presolve\030\255\001 \001(\010:\005false\0222\n\"" +
248 "fill_tightened_domains_in_response\030\204\001 \001(" +
249 "\010:\005false\0225\n%fill_additional_solutions_in" +
250 "_response\030\302\001 \001(\010:\005false\022\'\n\031instantiate_a" +
251 "ll_variables\030j \001(\010:\004true\0226\n(auto_detect_" +
252 "greater_than_at_least_one_of\030_ \001(\010:\004true" +
253 "\022(\n\031stop_after_first_solution\030b \001(\010:\005fal" +
254 "se\022#\n\023stop_after_presolve\030\225\001 \001(\010:\005false\022" +
255 "+\n\033stop_after_root_propagation\030\374\001 \001(\010:\005f" +
256 "alse\022\026\n\007use_lns\030\233\002 \001(\010:\004true\022\033\n\014use_lns_" +
257 "only\030e \001(\010:\005false\022\036\n\022solution_pool_size\030" +
258 "\301\001 \001(\005:\0013\022\033\n\014use_rins_lns\030\201\001 \001(\010:\004true\022#" +
259 "\n\024use_feasibility_pump\030\244\001 \001(\010:\004true\022 \n\020u" +
260 "se_lb_relax_lns\030\377\001 \001(\010:\005false\022c\n\013fp_roun" +
261 "ding\030\245\001 \001(\01627.operations_research.sat.Sa" +
262 "tParameters.FPRoundingMethod:\024PROPAGATIO" +
263 "N_ASSISTED\022$\n\024diversify_lns_params\030\211\001 \001(" +
264 "\010:\005false\022\037\n\020randomize_search\030g \001(\010:\005fals" +
265 "e\022+\n search_random_variable_pool_size\030h " +
266 "\001(\003:\0010\022+\n\033push_all_tasks_toward_start\030\206\002" +
267 " \001(\010:\005false\022%\n\026use_optional_variables\030l " +
268 "\001(\010:\005false\022!\n\023use_exact_lp_reason\030m \001(\010:" +
269 "\004true\022\'\n\027use_combined_no_overlap\030\205\001 \001(\010:" +
270 "\005false\022*\n\036at_most_one_max_expansion_size" +
271 "\030\216\002 \001(\005:\0013\022\"\n\023catch_sigint_signal\030\207\001 \001(\010" +
272 ":\004true\022!\n\022use_implied_bounds\030\220\001 \001(\010:\004tru" +
273 "e\022\"\n\022polish_lp_solution\030\257\001 \001(\010:\005false\022#\n" +
274 "\023lp_primal_tolerance\030\212\002 \001(\001:\0051e-07\022!\n\021lp" +
275 "_dual_tolerance\030\213\002 \001(\001:\0051e-07\022 \n\021convert" +
276 "_intervals\030\261\001 \001(\010:\004true\022\032\n\016symmetry_leve" +
277 "l\030\267\001 \001(\005:\0012\022%\n\026new_linear_propagation\030\340\001" +
278 " \001(\010:\004true\022\037\n\021linear_split_size\030\200\002 \001(\005:\003" +
279 "100\022\036\n\023linearization_level\030Z \001(\005:\0011\022!\n\026b" +
280 "oolean_encoding_level\030k \001(\005:\0011\022=\n0max_do" +
281 "main_size_when_encoding_eq_neq_constrain" +
282 "ts\030\277\001 \001(\005:\00216\022\033\n\014max_num_cuts\030[ \001(\005:\005100" +
283 "00\022\025\n\tcut_level\030\304\001 \001(\005:\0011\022*\n\033only_add_cu" +
284 "ts_at_level_zero\030\\ \001(\010:\005false\022!\n\021add_obj" +
285 "ective_cut\030\305\001 \001(\010:\005false\022\031\n\013add_cg_cuts\030" +
286 "u \001(\010:\004true\022\032\n\014add_mir_cuts\030x \001(\010:\004true\022" +
287 "!\n\022add_zero_half_cuts\030\251\001 \001(\010:\004true\022\036\n\017ad" +
288 "d_clique_cuts\030\254\001 \001(\010:\004true\022\033\n\014add_rlt_cu" +
289 "ts\030\227\002 \001(\010:\004true\022\"\n\025max_all_diff_cut_size" +
290 "\030\224\001 \001(\005:\00264\022\037\n\020add_lin_max_cuts\030\230\001 \001(\010:\004" +
291 "true\022)\n\034max_integer_rounding_scaling\030w \001" +
292 "(\005:\003600\022\'\n\031add_lp_constraints_lazily\030p \001" +
293 "(\010:\004true\022!\n\022root_lp_iterations\030\343\001 \001(\005:\0042" +
294 "000\0222\n$min_orthogonality_for_lp_constrai" +
295 "nts\030s \001(\001:\0040.05\022(\n\034max_cut_rounds_at_lev" +
296 "el_zero\030\232\001 \001(\005:\0011\022+\n\036max_consecutive_ina" +
297 "ctive_count\030y \001(\005:\003100\0220\n\032cut_max_active" +
298 "_count_value\030\233\001 \001(\001:\01310000000000\022$\n\026cut_" +
299 "active_count_decay\030\234\001 \001(\001:\0030.8\022!\n\022cut_cl" +
300 "eanup_target\030\235\001 \001(\005:\0041000\022&\n\032new_constra" +
301 "ints_batch_size\030z \001(\005:\00250\022)\n\033exploit_int" +
302 "eger_lp_solution\030^ \001(\010:\004true\022%\n\027exploit_" +
303 "all_lp_solution\030t \001(\010:\004true\022%\n\025exploit_b" +
304 "est_solution\030\202\001 \001(\010:\005false\022+\n\033exploit_re" +
305 "laxation_solution\030\241\001 \001(\010:\005false\022 \n\021explo" +
306 "it_objective\030\203\001 \001(\010:\004true\022)\n\031detect_line" +
307 "arized_product\030\225\002 \001(\010:\005false\022\037\n\rmip_max_" +
308 "bound\030| \001(\001:\01010000000\022\032\n\017mip_var_scaling" +
309 "\030} \001(\001:\0011\022&\n\026mip_scale_large_domain\030\341\001 \001" +
310 "(\010:\005false\0220\n!mip_automatically_scale_var" +
311 "iables\030\246\001 \001(\010:\004true\022\035\n\ronly_solve_ip\030\336\001 " +
312 "\001(\010:\005false\022#\n\024mip_wanted_precision\030~ \001(\001" +
313 ":\0051e-06\022%\n\031mip_max_activity_exponent\030\177 \001" +
314 "(\005:\00253\022$\n\023mip_check_precision\030\200\001 \001(\001:\0060." +
315 "0001\022/\n mip_compute_true_objective_bound" +
316 "\030\306\001 \001(\010:\004true\022\'\n\027mip_max_valid_magnitude" +
317 "\030\307\001 \001(\001:\0051e+20\022;\n+mip_treat_high_magnitu" +
318 "de_bounds_as_infinity\030\226\002 \001(\010:\005false\022\"\n\022m" +
319 "ip_drop_tolerance\030\350\001 \001(\001:\0051e-16\022\036\n\022mip_p" +
320 "resolve_level\030\205\002 \001(\005:\0012\"H\n\rVariableOrder" +
321 "\022\014\n\010IN_ORDER\020\000\022\024\n\020IN_REVERSE_ORDER\020\001\022\023\n\017" +
322 "IN_RANDOM_ORDER\020\002\"F\n\010Polarity\022\021\n\rPOLARIT" +
323 "Y_TRUE\020\000\022\022\n\016POLARITY_FALSE\020\001\022\023\n\017POLARITY" +
324 "_RANDOM\020\002\"V\n\035ConflictMinimizationAlgorit" +
325 "hm\022\010\n\004NONE\020\000\022\n\n\006SIMPLE\020\001\022\r\n\tRECURSIVE\020\002\022" +
326 "\020\n\014EXPERIMENTAL\020\003\"\340\001\n\031BinaryMinizationAl" +
327 "gorithm\022\032\n\026NO_BINARY_MINIMIZATION\020\000\022\035\n\031B" +
328 "INARY_MINIMIZATION_FIRST\020\001\0227\n3BINARY_MIN" +
329 "IMIZATION_FIRST_WITH_TRANSITIVE_REDUCTIO" +
330 "N\020\004\022)\n%BINARY_MINIMIZATION_WITH_REACHABI" +
331 "LITY\020\002\022$\n EXPERIMENTAL_BINARY_MINIMIZATI" +
332 "ON\020\003\"R\n\020ClauseProtection\022\023\n\017PROTECTION_N" +
333 "ONE\020\000\022\025\n\021PROTECTION_ALWAYS\020\001\022\022\n\016PROTECTI" +
334 "ON_LBD\020\002\"5\n\016ClauseOrdering\022\023\n\017CLAUSE_ACT" +
335 "IVITY\020\000\022\016\n\nCLAUSE_LBD\020\001\"\206\001\n\020RestartAlgor" +
336 "ithm\022\016\n\nNO_RESTART\020\000\022\020\n\014LUBY_RESTART\020\001\022\035" +
337 "\n\031DL_MOVING_AVERAGE_RESTART\020\002\022\036\n\032LBD_MOV" +
338 "ING_AVERAGE_RESTART\020\003\022\021\n\rFIXED_RESTART\020\004" +
339 "\"t\n\025MaxSatAssumptionOrder\022\034\n\030DEFAULT_ASS" +
340 "UMPTION_ORDER\020\000\022\035\n\031ORDER_ASSUMPTION_BY_D" +
341 "EPTH\020\001\022\036\n\032ORDER_ASSUMPTION_BY_WEIGHT\020\002\"o" +
342 "\n\035MaxSatStratificationAlgorithm\022\027\n\023STRAT" +
343 "IFICATION_NONE\020\000\022\032\n\026STRATIFICATION_DESCE" +
344 "NT\020\001\022\031\n\025STRATIFICATION_ASCENT\020\002\"\341\001\n\017Sear" +
345 "chBranching\022\024\n\020AUTOMATIC_SEARCH\020\000\022\020\n\014FIX" +
346 "ED_SEARCH\020\001\022\024\n\020PORTFOLIO_SEARCH\020\002\022\r\n\tLP_" +
347 "SEARCH\020\003\022\026\n\022PSEUDO_COST_SEARCH\020\004\022\'\n#PORT" +
348 "FOLIO_WITH_QUICK_RESTART_SEARCH\020\005\022\017\n\013HIN" +
349 "T_SEARCH\020\006\022\030\n\024PARTIAL_FIXED_SEARCH\020\007\022\025\n\021" +
350 "RANDOMIZED_SEARCH\020\010\"\270\001\n\027SharedTreeSplitS" +
351 "trategy\022\027\n\023SPLIT_STRATEGY_AUTO\020\000\022\036\n\032SPLI" +
352 "T_STRATEGY_DISCREPANCY\020\001\022\037\n\033SPLIT_STRATE" +
353 "GY_OBJECTIVE_LB\020\002\022 \n\034SPLIT_STRATEGY_BALA" +
354 "NCED_TREE\020\003\022!\n\035SPLIT_STRATEGY_FIRST_PROP" +
355 "OSAL\020\004\"h\n\020FPRoundingMethod\022\023\n\017NEAREST_IN" +
356 "TEGER\020\000\022\016\n\nLOCK_BASED\020\001\022\025\n\021ACTIVE_LOCK_B" +
357 "ASED\020\003\022\030\n\024PROPAGATION_ASSISTED\020\002B/\n\026com." +
358 "google.ortools.satP\001\252\002\022Google.OrTools.Sa" +
361 descriptor = com.google.protobuf.Descriptors.FileDescriptor
362 .internalBuildGeneratedFileFrom(descriptorData,
363 new com.google.protobuf.Descriptors.FileDescriptor[] {
365 internal_static_operations_research_sat_SatParameters_descriptor =
367 internal_static_operations_research_sat_SatParameters_fieldAccessorTable =
new
368 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
369 internal_static_operations_research_sat_SatParameters_descriptor,
370 new java.lang.String[] {
"Name",
"PreferredVariableOrder",
"InitialPolarity",
"UsePhaseSaving",
"PolarityRephaseIncrement",
"RandomPolarityRatio",
"RandomBranchesRatio",
"UseErwaHeuristic",
"InitialVariablesActivity",
"AlsoBumpVariablesInConflictReasons",
"MinimizationAlgorithm",
"BinaryMinimizationAlgorithm",
"SubsumptionDuringConflictAnalysis",
"ClauseCleanupPeriod",
"ClauseCleanupTarget",
"ClauseCleanupRatio",
"ClauseCleanupProtection",
"ClauseCleanupLbdBound",
"ClauseCleanupOrdering",
"PbCleanupIncrement",
"PbCleanupRatio",
"VariableActivityDecay",
"MaxVariableActivityValue",
"GlucoseMaxDecay",
"GlucoseDecayIncrement",
"GlucoseDecayIncrementPeriod",
"ClauseActivityDecay",
"MaxClauseActivityValue",
"RestartAlgorithms",
"DefaultRestartAlgorithms",
"RestartPeriod",
"RestartRunningWindowSize",
"RestartDlAverageRatio",
"RestartLbdAverageRatio",
"UseBlockingRestart",
"BlockingRestartWindowSize",
"BlockingRestartMultiplier",
"NumConflictsBeforeStrategyChanges",
"StrategyChangeIncreaseRatio",
"MaxTimeInSeconds",
"MaxDeterministicTime",
"MaxNumDeterministicBatches",
"MaxNumberOfConflicts",
"MaxMemoryInMb",
"AbsoluteGapLimit",
"RelativeGapLimit",
"RandomSeed",
"PermuteVariableRandomly",
"PermutePresolveConstraintOrder",
"UseAbslRandom",
"LogSearchProgress",
"LogSubsolverStatistics",
"LogPrefix",
"LogToStdout",
"LogToResponse",
"UsePbResolution",
"MinimizeReductionDuringPbResolution",
"CountAssumptionLevelsInLbd",
"PresolveBveThreshold",
"PresolveBveClauseWeight",
"ProbingDeterministicTimeLimit",
"PresolveProbingDeterministicTimeLimit",
"PresolveBlockedClause",
"PresolveUseBva",
"PresolveBvaThreshold",
"MaxPresolveIterations",
"CpModelPresolve",
"CpModelProbingLevel",
"CpModelUseSatPresolve",
"DetectTableWithCost",
"TableCompressionLevel",
"ExpandAlldiffConstraints",
"ExpandReservoirConstraints",
"ExpandReservoirUsingCircuit",
"EncodeCumulativeAsReservoir",
"MaxLinMaxSizeForExpansion",
"DisableConstraintExpansion",
"EncodeComplexLinearConstraintWithInteger",
"MergeNoOverlapWorkLimit",
"MergeAtMostOneWorkLimit",
"PresolveSubstitutionLevel",
"PresolveExtractIntegerEnforcement",
"PresolveInclusionWorkLimit",
"IgnoreNames",
"InferAllDiffs",
"FindBigLinearOverlap",
"UseSatInprocessing",
"InprocessingDtimeRatio",
"InprocessingProbingDtime",
"InprocessingMinimizationDtime",
"NumWorkers",
"NumSearchWorkers",
"NumFullSubsolvers",
"Subsolvers",
"ExtraSubsolvers",
"IgnoreSubsolvers",
"FilterSubsolvers",
"SubsolverParams",
"InterleaveSearch",
"InterleaveBatchSize",
"ShareObjectiveBounds",
"ShareLevelZeroBounds",
"ShareBinaryClauses",
"ShareGlueClauses",
"DebugPostsolveWithFullSolver",
"DebugMaxNumPresolveOperations",
"DebugCrashOnBadHint",
"UseOptimizationHints",
"CoreMinimizationLevel",
"FindMultipleCores",
"CoverOptimization",
"MaxSatAssumptionOrder",
"MaxSatReverseAssumptionOrder",
"MaxSatStratification",
"PropagationLoopDetectionFactor",
"UsePrecedencesInDisjunctiveConstraint",
"MaxSizeToCreatePrecedenceLiteralsInDisjunctive",
"UseStrongPropagationInDisjunctive",
"UseDynamicPrecedenceInDisjunctive",
"UseDynamicPrecedenceInCumulative",
"UseOverloadCheckerInCumulative",
"UseConservativeScaleOverloadChecker",
"UseTimetableEdgeFindingInCumulative",
"MaxNumIntervalsForTimetableEdgeFinding",
"UseHardPrecedencesInCumulative",
"ExploitAllPrecedences",
"UseDisjunctiveConstraintInCumulative",
"UseTimetablingInNoOverlap2D",
"UseEnergeticReasoningInNoOverlap2D",
"UseAreaEnergeticReasoningInNoOverlap2D",
"MaxPairsPairwiseReasoningInNoOverlap2D",
"UseDualSchedulingHeuristics",
"SearchBranching",
"HintConflictLimit",
"RepairHint",
"FixVariablesToTheirHintedValue",
"UseProbingSearch",
"UseExtendedProbing",
"ProbingNumCombinationsLimit",
"UseShavingInProbingSearch",
"ShavingSearchDeterministicTime",
"ShavingSearchThreshold",
"UseObjectiveLbSearch",
"UseObjectiveShavingSearch",
"UseVariablesShavingSearch",
"PseudoCostReliabilityThreshold",
"OptimizeWithCore",
"OptimizeWithLbTreeSearch",
"SaveLpBasisInLbTreeSearch",
"BinarySearchNumConflicts",
"OptimizeWithMaxHs",
"UseFeasibilityJump",
"UseLsOnly",
"FeasibilityJumpDecay",
"FeasibilityJumpLinearizationLevel",
"FeasibilityJumpRestartFactor",
"FeasibilityJumpBatchDtime",
"FeasibilityJumpVarRandomizationProbability",
"FeasibilityJumpVarPerburbationRangeRatio",
"FeasibilityJumpEnableRestarts",
"FeasibilityJumpMaxExpandedConstraintSize",
"NumViolationLs",
"ViolationLsPerturbationPeriod",
"ViolationLsCompoundMoveProbability",
"SharedTreeNumWorkers",
"UseSharedTreeSearch",
"SharedTreeWorkerObjectiveSplitProbability",
"SharedTreeWorkerMinRestartsPerSubtree",
"SharedTreeWorkerEnableTrailSharing",
"SharedTreeOpenLeavesPerWorker",
"SharedTreeMaxNodesPerWorker",
"SharedTreeSplitStrategy",
"EnumerateAllSolutions",
"KeepAllFeasibleSolutionsInPresolve",
"FillTightenedDomainsInResponse",
"FillAdditionalSolutionsInResponse",
"InstantiateAllVariables",
"AutoDetectGreaterThanAtLeastOneOf",
"StopAfterFirstSolution",
"StopAfterPresolve",
"StopAfterRootPropagation",
"UseLns",
"UseLnsOnly",
"SolutionPoolSize",
"UseRinsLns",
"UseFeasibilityPump",
"UseLbRelaxLns",
"FpRounding",
"DiversifyLnsParams",
"RandomizeSearch",
"SearchRandomVariablePoolSize",
"PushAllTasksTowardStart",
"UseOptionalVariables",
"UseExactLpReason",
"UseCombinedNoOverlap",
"AtMostOneMaxExpansionSize",
"CatchSigintSignal",
"UseImpliedBounds",
"PolishLpSolution",
"LpPrimalTolerance",
"LpDualTolerance",
"ConvertIntervals",
"SymmetryLevel",
"NewLinearPropagation",
"LinearSplitSize",
"LinearizationLevel",
"BooleanEncodingLevel",
"MaxDomainSizeWhenEncodingEqNeqConstraints",
"MaxNumCuts",
"CutLevel",
"OnlyAddCutsAtLevelZero",
"AddObjectiveCut",
"AddCgCuts",
"AddMirCuts",
"AddZeroHalfCuts",
"AddCliqueCuts",
"AddRltCuts",
"MaxAllDiffCutSize",
"AddLinMaxCuts",
"MaxIntegerRoundingScaling",
"AddLpConstraintsLazily",
"RootLpIterations",
"MinOrthogonalityForLpConstraints",
"MaxCutRoundsAtLevelZero",
"MaxConsecutiveInactiveCount",
"CutMaxActiveCountValue",
"CutActiveCountDecay",
"CutCleanupTarget",
"NewConstraintsBatchSize",
"ExploitIntegerLpSolution",
"ExploitAllLpSolution",
"ExploitBestSolution",
"ExploitRelaxationSolution",
"ExploitObjective",
"DetectLinearizedProduct",
"MipMaxBound",
"MipVarScaling",
"MipScaleLargeDomain",
"MipAutomaticallyScaleVariables",
"OnlySolveIp",
"MipWantedPrecision",
"MipMaxActivityExponent",
"MipCheckPrecision",
"MipComputeTrueObjectiveBound",
"MipMaxValidMagnitude",
"MipTreatHighMagnitudeBoundsAsInfinity",
"MipDropTolerance",
"MipPresolveLevel", });
371 descriptor.resolveAllFeaturesImmutable();
1.12.0