SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Settings.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include <carl-arith/ran/ran.h>
4 
5 namespace smtrat {
6 namespace cad {
7  enum class Incrementality { NONE, SIMPLE, FULL };
8  enum class Backtracking { ORDERED, UNORDERED, HIDE };
11  D, PD, SD, lD, LD,
12  Default = lD
13  };
14  enum class SampleCompareStrategy {
15  T,
16  TLSA,
17  TSA,
18  TS,
19  LT,
20  LTA,
21  LTS,
22  LTSA,
23  LS,
24  S,
25  Type, Value,
26  Default = LT
27  };
31 
32  struct BaseSettings {
35 
38 
40  static constexpr std::size_t trivialSampleRadius = 1;
41  static constexpr bool simplifyProjectionByBounds = true;
42 
46  };
47 }
48 }
The default SMT-RAT strategy.
Definition: Default.h:30
Incrementality
Definition: Settings.h:7
SampleCompareStrategy
Definition: Settings.h:14
ProjectionCompareStrategy
Definition: Settings.h:10
FullSampleCompareStrategy
Definition: Settings.h:28
ProjectionType
Definition: Settings.h:9
Class to create the formulas for axioms.
static constexpr SampleCompareStrategy sampleComparator
Definition: Settings.h:44
static constexpr ProjectionCompareStrategy projectionComparator
Definition: Settings.h:43
static constexpr FullSampleCompareStrategy fullSampleComparator
Definition: Settings.h:45
static constexpr Incrementality incrementality
Definition: Settings.h:33
static constexpr bool simplifyProjectionByBounds
Definition: Settings.h:41
static constexpr std::size_t trivialSampleRadius
Definition: Settings.h:40
static constexpr CoreHeuristic coreHeuristic
Definition: Settings.h:37
static constexpr MISHeuristic misHeuristic
Definition: Settings.h:39
static constexpr ProjectionType projectionOperator
Definition: Settings.h:36
static constexpr Backtracking backtracking
Definition: Settings.h:34