splr 0.17.0

A modern CDCL SAT solver in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

[[example]]
name = "all-solutions"
path = "misc/splr-all.rs"
[dependencies.bitflags]
version = "^1.3"

[features]
EMA_calibration = []
EVSIDS = []
LRB_rewarding = []
assign_rate = []
best_phases_tracking = []
bi_clause_completion = []
boundary_check = []
chrono_BT = []
clause_rewarding = []
clause_vivification = []
debug_propagation = []
default = ["unsafe_access", "dynamic_restart_threshold", "LRB_rewarding", "reason_side_rewarding", "rephase", "reward_annealing", "two_mode_reduction", "trail_saving", "clause_vivification"]
dynamic_restart_threshold = []
incremental_solver = ["no_clause_elimination"]
just_used = []
maintain_watch_cache = []
no_IO = []
no_clause_elimination = []
reason_side_rewarding = []
rephase = ["best_phases_tracking"]
reward_annealing = []
stochastic_local_search = ["rephase"]
support_user_assumption = []
suppress_reason_chain = []
trace_analysis = []
trace_elimination = []
trace_equivalency = []
trail_saving = []
two_mode_reduction = []
unsafe_access = []

[package]
authors = ["Narazaki Shuji <shujinarazaki@protonmail.com>"]
categories = ["science", "mathematics"]
default-run = "splr"
description = "A modern CDCL SAT solver in Rust"
edition = "2021"
homepage = "https://github.com/shnarazk/splr"
keywords = ["SAT", "SAT-solver", "logic", "satisfiability"]
license = "MPL-2.0"
name = "splr"
readme = "README.md"
repository = "https://github.com/shnarazk/splr"
rust-version = "1.65"
version = "0.17.0"
[profile.release]
codegen-units = 1
lto = "fat"
opt-level = 3
panic = "abort"
strip = true