pub struct Lemma {
pub a: AigLit,
pub b: AigLit,
pub cut: Vec<u32>,
pub proof: Lrat,
}Expand description
A proven equivalence a ≡ b: its proof refutes query_with_cut(a, b, cut, earlier lemmas).
Fields§
§a: AigLit§b: AigLit§cut: Vec<u32>The nodes the formula leaves free, in increasing order; empty for the whole cone.
proof: LratTrait Implementations§
Auto Trait Implementations§
impl Freeze for Lemma
impl RefUnwindSafe for Lemma
impl Send for Lemma
impl Sync for Lemma
impl Unpin for Lemma
impl UnsafeUnpin for Lemma
impl UnwindSafe for Lemma
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more