SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
BVSettings.h
Go to the documentation of this file.
1 /**
2  * @file BVSettings.h
3  * @author Andreas Krueger <andreas.krueger@rwth-aachen.de>
4  * @author Florian Corzilius <corzilius@cs.rwth-aachen.de>
5  *
6  * @version 2015-02-05
7  * Created on 2015-02-05.
8  */
9 
10 
11 #pragma once
12 
13 namespace smtrat
14 {
15  struct BVSettings1
16  {
17  static constexpr auto moduleName = "BVModule<BVSettings1>";
18  /**
19  * Add the received formulas incrementally, each time checking and testing if the
20  * found model in the satisfiable case satisfies all remaining received formulas.
21  */
22  static const bool incremental_flattening = false;
23  /**
24  * This weight specifies how much more preference a received formula being an equation should have.
25  */
26  static const size_t equation_preference_weight = 10;
27  };
28 }
Class to create the formulas for axioms.
static const size_t equation_preference_weight
This weight specifies how much more preference a received formula being an equation should have.
Definition: BVSettings.h:26
static constexpr auto moduleName
Definition: BVSettings.h:17
static const bool incremental_flattening
Add the received formulas incrementally, each time checking and testing if the found model in the sat...
Definition: BVSettings.h:22