veripb 3.0.2

VeriPB is a proof checker for verifying pseudo-Boolean certificates of satisfiability, unsatisfiability, and optimality bounds.
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

use std::rc::Rc;

use veripb_formula::prelude::*;

use crate::{order_context::TransitivityContext, prelude::*};

#[derive(Debug)]
pub struct OrderTransitivityRule;

impl Rule for OrderTransitivityRule {
    #[inline]
    fn compute(
        &mut self,
        context: &mut Context,
        _database: &mut Database,
    ) -> Result<Vec<Rc<DBConstraint>>, CheckingError> {
        context
            .subcontexts
            .push(Subcontext::Transitivity(TransitivityContext::default()));
        Ok(vec![])
    }

    #[inline]
    fn elaborate(
        &self,
        context: &mut Context,
        _database: &Database,
    ) -> Result<(), ElaborationError> {
        context
            .elaborator
            .as_mut()
            .unwrap()
            .writeln("\ttransitivity");
        Ok(())
    }
}