A library for determining the satisfiability of boolean formulas written in conjunctive normal form, developed to support investigation into solvers by researchers, developers, or anyone curious.
//! Statistics regarding various things.
usestd::time::Duration;/// Dispatches containing statistics.
#[derive(Clone)]pubenumStat{/// The count of iterations made.
Iterations(usize),/// The count of decisions made.
Chosen(usize),/// The count of conflicts seen.
Conflicts(usize),/// The time elapsed.
Time(Duration),}