mirror of
https://github.com/Z3Prover/z3
synced 2025-04-27 19:05:51 +00:00
54 lines
1.3 KiB
C++
54 lines
1.3 KiB
C++
/*++
|
|
Copyright (c) 2020 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
int_gcd_test.h
|
|
|
|
Abstract:
|
|
|
|
Gcd_Test heuristic
|
|
|
|
gcd test
|
|
5*x + 3*y + 6*z = 5
|
|
suppose x is fixed at 2.
|
|
so we have 10 + 3(y + 2z) = 5
|
|
5 = -3(y + 2z)
|
|
this is unsolvable because 5/3 is not an integer.
|
|
so we create a lemma that rules out this condition.
|
|
|
|
|
|
Author:
|
|
Nikolaj Bjorner (nbjorner)
|
|
Lev Nachmanson (levnach)
|
|
|
|
Revision History:
|
|
--*/
|
|
#pragma once
|
|
|
|
#include "math/lp/lia_move.h"
|
|
|
|
namespace lp {
|
|
class int_solver;
|
|
class lar_solver;
|
|
class int_gcd_test {
|
|
class int_solver& lia;
|
|
class lar_solver& lra;
|
|
unsigned m_next_gcd;
|
|
unsigned m_delay;
|
|
|
|
bool gcd_test();
|
|
bool gcd_test_for_row(const static_matrix<mpq, numeric_pair<mpq>> & A, unsigned i);
|
|
bool ext_gcd_test(const row_strip<mpq> & row,
|
|
mpq const & least_coeff,
|
|
mpq const & lcm_den,
|
|
mpq const & consts);
|
|
void fill_explanation_from_fixed_columns(const row_strip<mpq> & row);
|
|
void add_to_explanation_from_fixed_or_boxed_column(unsigned j);
|
|
public:
|
|
int_gcd_test(int_solver& lia);
|
|
~int_gcd_test() {}
|
|
lia_move operator()();
|
|
bool should_apply();
|
|
};
|
|
}
|