27 return Make( pf2, pf1, op2, op1 );
110 s <<
" _ _ @pn" <<
abs(
d_var ) <<
" ";
157 ose <<
"ERROR:make_polynomial_proof: Trying to make non-atomic " << e1 <<
" " << e.
isNot() <<
std::endl;
void print_rational(const Rational &r, std::ostream &s)
static LFSCProof * MakeEq()
Data structure of expressions in CVC3.
static LFSCProof * Make(LFSCProof *pf1, LFSCProof *pf2, int op1, int op2)
void print_pf(std::ostream &s, int ind=0)
static int queryM(const Expr &expr, bool add=true, bool trusted=false)
LFSCLraAdd(LFSCProof *pf1, LFSCProof *pf2, int op1, int op2)
LFSCLraSub(LFSCProof *pf1, LFSCProof *pf2, int op1, int op2)
virtual LFSCLraMulC * AsLFSCLraMulC()
static int queryMt(const Expr &expr)
CVC3::ExprStream & endl(CVC3::ExprStream &os)
Print the end-of-line.
int get_normalized(int knd, bool isnot)
static void print_error(const char *c, std::ostream &s)
static Expr queryAtomic(const Expr &expr, bool getBase=false)
void print_pf(std::ostream &s, int ind=0)
bool is_opposite(int knd)
void print_pf(std::ostream &s, int ind=0)
void print_pf(std::ostream &s, int ind=0)
int get_knd_order(int knd)
static LFSCProof * Make(LFSCProof *pf, Rational r, int op)
LFSCLraMulC(LFSCProof *pf, Rational r, int op)
string kind_to_str(int knd)
static RefPtr< LFSCProof > eq
void print(std::ostream &s, int ind=0)
static LFSCProof * Make(LFSCProof *pf, int var, int op)
void print_pf(std::ostream &s, int ind=0)
static LFSCProof * Make(LFSCProof *pf1, LFSCProof *pf2, int op1, int op2)
RefPtr< LFSCProof > d_children[2]
RefPtr< LFSCProof > d_children[2]
static ExprMap< int > d_pn_form