[dependencies.bitflags]
version = "1.2"
[features]
EVSIDS = []
LR_rewarding = []
Luby_stabilization = []
best_phases_reuse = []
best_phases_tracking = []
boundary_check = []
clause_elimination = []
clause_reduction = []
clause_vivification = []
default = ["clause_elimination", "clause_reduction", "LR_rewarding", "Luby_stabilization", "reason_side_rewarding"]
ema_calibration = []
incremental_solver = []
just_used = []
luby_restart = []
no_IO = []
reason_side_rewarding = []
strategy_adaptation = []
trace_analysis = []
trace_elimination = []
var_staging = []
[package]
authors = ["Narazaki Shuji <shujinarazaki@protonmail.com>"]
categories = ["mathematics", "science"]
description = "A modern CDCL SAT solver in Rust"
edition = "2018"
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"
version = "0.7.0"
[profile.release]
codegen-units = 1
lto = "fat"
opt-level = 3
panic = "abort"