3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-09-03 16:48:06 +00:00

move a comment

Signed-off-by: Lev Nachmanson <levnach@hotmail.com>
This commit is contained in:
Lev Nachmanson 2025-08-28 17:00:47 -10:00
parent 70aafea26c
commit 61d8e7d035

View file

@ -126,8 +126,6 @@ namespace nlsat {
#endif #endif
} }
std::vector<property> seed_properties() {
std::vector<property> Q;
/* /*
Short: build the initial property set Q so the one-cell algorithm can generalize the Short: build the initial property set Q so the one-cell algorithm can generalize the
conflict around the current sample. The main goal is to eliminate raw input polynomials conflict around the current sample. The main goal is to eliminate raw input polynomials
@ -145,6 +143,8 @@ namespace nlsat {
{ an_del(p) | level(p) == m_n } { an_del(p) | level(p) == m_n }
{ ord_inv(resultant(p_j,p_{j+1})) for adjacent roots }. { ord_inv(resultant(p_j,p_{j+1})) for adjacent roots }.
*/ */
std::vector<property> seed_properties() {
std::vector<property> Q;
std::vector<poly*> ps_of_n_level; std::vector<poly*> ps_of_n_level;
for (unsigned i = 0; i < m_P.size(); ++i) { for (unsigned i = 0; i < m_P.size(); ++i) {
poly* p = m_P[i]; poly* p = m_P[i];
@ -610,10 +610,8 @@ namespace nlsat {
TRACE(levelwise, tout << "apply_pre: an_del processed and removed from m_Q" << std::endl;); TRACE(levelwise, tout << "apply_pre: an_del processed and removed from m_Q" << std::endl;);
return; return;
} }
// ...existing code...
} }
// return an empty vector on failure, otherwis returns the cell representations with intervals // return an empty vector on failure, otherwise returns the cell representations with intervals
std::vector<symbolic_interval> single_cell() { std::vector<symbolic_interval> single_cell() {
TRACE(levelwise, TRACE(levelwise,
m_solver.display_assignment(tout << "sample()") << std::endl; m_solver.display_assignment(tout << "sample()") << std::endl;