oxiz-solver 0.2.0

Main CDCL(T) Solver API for OxiZ
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136

//! OxiZ Solver - Main CDCL(T) SMT Solver
//!
//! This crate provides the main solver API that orchestrates:
//! - SAT core (CDCL)
//! - Theory solvers (EUF, LRA, LIA, BV)
//! - Tactic framework
//! - Parallel portfolio solving

#![allow(clippy::collapsible_if)]
#![allow(clippy::only_used_in_recursion)]
#![allow(clippy::for_kv_map)]
#![allow(clippy::too_many_arguments)]
#![allow(unused_variables)]
#![allow(dead_code)]
//!
//! # Examples
//!
//! ## Basic Boolean Satisfiability
//!
//! ```
//! use oxiz_solver::{Solver, SolverResult};
//! use oxiz_core::ast::TermManager;
//!
//! let mut solver = Solver::new();
//! let mut tm = TermManager::new();
//!
//! // Create boolean variables
//! let p = tm.mk_var("p", tm.sorts.bool_sort);
//! let q = tm.mk_var("q", tm.sorts.bool_sort);
//!
//! // Assert p AND q
//! let formula = tm.mk_and(vec![p, q]);
//! solver.assert(formula, &mut tm);
//!
//! // Check satisfiability
//! match solver.check(&mut tm) {
//!     SolverResult::Sat => println!("Satisfiable!"),
//!     SolverResult::Unsat => println!("Unsatisfiable!"),
//!     SolverResult::Unknown => println!("Unknown"),
//! }
//! ```
//!
//! ## Integer Arithmetic
//!
//! ```
//! use oxiz_solver::{Solver, SolverResult};
//! use oxiz_core::ast::TermManager;
//! use num_bigint::BigInt;
//!
//! let mut solver = Solver::new();
//! let mut tm = TermManager::new();
//!
//! solver.set_logic("QF_LIA");
//!
//! // Create integer variable
//! let x = tm.mk_var("x", tm.sorts.int_sort);
//!
//! // Assert: x >= 5 AND x <= 10
//! let five = tm.mk_int(BigInt::from(5));
//! let ten = tm.mk_int(BigInt::from(10));
//! solver.assert(tm.mk_ge(x, five), &mut tm);
//! solver.assert(tm.mk_le(x, ten), &mut tm);
//!
//! // Should be satisfiable
//! assert_eq!(solver.check(&mut tm), SolverResult::Sat);
//! ```
//!
//! ## Incremental Solving with Push/Pop
//!
//! ```
//! use oxiz_solver::{Solver, SolverResult};
//! use oxiz_core::ast::TermManager;
//!
//! let mut solver = Solver::new();
//! let mut tm = TermManager::new();
//!
//! let p = tm.mk_var("p", tm.sorts.bool_sort);
//! solver.assert(p, &mut tm);
//!
//! // Push a new scope
//! solver.push();
//! let q = tm.mk_var("q", tm.sorts.bool_sort);
//! solver.assert(q, &mut tm);
//! assert_eq!(solver.check(&mut tm), SolverResult::Sat);
//!
//! // Pop back to previous scope
//! solver.pop();
//! assert_eq!(solver.check(&mut tm), SolverResult::Sat);
//! ```

#![cfg_attr(not(feature = "std"), no_std)]
#![forbid(unsafe_code)]
#![warn(missing_docs)]

#[cfg(not(feature = "std"))]
extern crate alloc;

mod prelude;

mod context;
mod nelson_oppen;
mod optimization;
pub mod resource_limits;
mod simplify;
#[cfg(feature = "std")]
pub mod skolemization;
mod solver;

pub use context::Context;
pub use nelson_oppen::{NelsonOppenCombiner, NelsonOppenStats, TheoryId};
pub use optimization::{Objective, ObjectiveKind, OptimizationResult, Optimizer, ParetoPoint};
#[cfg(feature = "std")]
pub use oxiz_proof::replay::VerificationResult;
pub use solver::{Model, Proof, ProofStep, Solver, SolverConfig, SolverResult, TheoryMode};

// Re-export types from oxiz-sat
pub use oxiz_sat::{RestartStrategy, SolverStats};

// Re-export theory combination types from oxiz-theories
pub use oxiz_theories::{EqualityNotification, TheoryCombination};

// Phase 2 enhancements
pub mod combination;
pub mod conflict;
pub mod delayed_combination;
pub mod model;
pub mod propagation;
pub mod propagation_pipeline;
pub mod shared_terms;

// MBQI module (Model-Based Quantifier Instantiation)
pub mod mbqi;

// Z3 API compatibility layer (std-only)
#[cfg(feature = "std")]
pub mod z3_compat;