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
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

use std::rc::Rc;

use logos::{Lexer, Logos};
use veripb_formula::prelude::*;
use veripb_parser::{error::ParserError, opb_parser::parse_single_constraint, opb_token::OPBToken};

use crate::prelude::*;

use super::ConstraintDefRuleToken;

#[derive(Debug)]
pub struct OrderDefConstraintRule {
    constraint: Rc<DBConstraint>,
}

impl OrderDefConstraintRule {
    pub fn new(constraint: PBConstraintEnum) -> Self {
        Self {
            constraint: Rc::new(DBConstraint::from(constraint)),
        }
    }

    pub fn parse(
        lex: Lexer<ConstraintDefRuleToken>,
        context: &mut Context,
    ) -> Result<Self, ParserError> {
        let mut lex = OPBToken::lexer(lex.source());
        let (geq_constraint, leq_constraint) =
            parse_single_constraint(&mut lex, &mut context.var_names)?;
        if leq_constraint.is_some() {
            Err(ParserError::token_error(
                0..lex.span().end,
                "inequality constraint",
            ))
        } else {
            Ok(OrderDefConstraintRule {
                constraint: Rc::new(DBConstraint::from(geq_constraint)),
            })
        }
    }
}

impl Rule for OrderDefConstraintRule {
    #[inline]
    fn compute(
        &mut self,
        context: &mut Context,
        _database: &mut Database,
    ) -> Result<Vec<Rc<DBConstraint>>, CheckingError> {
        if let Some(Subcontext::Order(order_context)) = context.subcontexts.last_mut() {
            let contains_only_order_vars = match &self.constraint.constraint {
                PBConstraintEnum::Clause(clause) => clause.get_lits().all(|lit| {
                    order_context
                        .constructed_order
                        .is_order_variable(lit.get_var())
                }),
                PBConstraintEnum::Cardinality(cardinality) => cardinality.get_lits().all(|lit| {
                    order_context
                        .constructed_order
                        .is_order_variable(lit.get_var())
                }),
                PBConstraintEnum::GeneralPBI64(constraint) => constraint.get_lits().all(|lit| {
                    order_context
                        .constructed_order
                        .is_order_variable(lit.get_var())
                }),
                PBConstraintEnum::GeneralPBI128(constraint) => constraint.get_lits().all(|lit| {
                    order_context
                        .constructed_order
                        .is_order_variable(lit.get_var())
                }),
                PBConstraintEnum::GeneralPBBigInt(constraint) => constraint.get_lits().all(|lit| {
                    order_context
                        .constructed_order
                        .is_order_variable(lit.get_var())
                }),
            };
            if contains_only_order_vars {
                order_context
                    .constructed_order
                    .definition
                    .push(self.constraint.clone());
                Ok(vec![])
            } else {
                Err(CheckingError::UndeclaredVariablesInOrder)
            }
        } else {
            Err(CheckingError::OnlyAllowedInOrderDef)
        }
    }

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