Skip to content

Commit f81303f

Browse files
committed
delete unused nlsat_symmetry_checker
Signed-off-by: Lev Nachmanson <levnach@hotmail.com>
1 parent f7905a5 commit f81303f

File tree

5 files changed

+1
-416
lines changed

5 files changed

+1
-416
lines changed

src/nlsat/CMakeLists.txt

-1
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,6 @@ z3_add_component(nlsat
99
nlsat_types.cpp
1010
nlsat_simple_checker.cpp
1111
nlsat_variable_ordering_strategy.cpp
12-
nlsat_symmetry_checker.cpp
1312
COMPONENT_DEPENDENCIES
1413
polynomial
1514
sat

src/nlsat/nlsat_params.pyg

-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,6 @@ def_module_params('nlsat',
66
('linxi_simple_check', BOOL, False, "linxi precheck about variables sign"),
77
('linxi_variable_ordering_strategy', UINT, 0, "linxi Variable Ordering Strategy, 0 for none, 1 for BROWN, 2 for TRIANGULAR, 3 for ONLYPOLY"),
88
('cell_sample', BOOL, True, "cell sample projection"),
9-
('linxi_symmetry_check', BOOL, False, "linxi symmetry check and learning"),
109
('lazy', UINT, 0, "how lazy the solver is."),
1110
('reorder', BOOL, True, "reorder variables."),
1211
('log_lemmas', BOOL, False, "display lemmas as self-contained SMT formulas"),

src/nlsat/nlsat_solver.cpp

+1-45
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,6 @@ Revision History:
3636
#include "nlsat/nlsat_simplify.h"
3737
#include "nlsat/nlsat_simple_checker.h"
3838
#include "nlsat/nlsat_variable_ordering_strategy.h"
39-
#include "nlsat/nlsat_symmetry_checker.h"
4039

4140
#define NLSAT_EXTRA_VERBOSE
4241

@@ -226,7 +225,6 @@ namespace nlsat {
226225
//#linxi begin
227226
bool m_linxi_simple_check;
228227
unsigned m_linxi_variable_ordering_strategy;
229-
bool m_linxi_symmetry_check;
230228
bool m_linxi_set_0_more;
231229
bool m_cell_sample;
232230
//#linxi end
@@ -302,7 +300,6 @@ namespace nlsat {
302300
//#linxi begin
303301
m_linxi_simple_check = p.linxi_simple_check();
304302
m_linxi_variable_ordering_strategy = p.linxi_variable_ordering_strategy();
305-
m_linxi_symmetry_check = p.linxi_symmetry_check();
306303
//#linxi end
307304

308305

@@ -1836,41 +1833,7 @@ namespace nlsat {
18361833

18371834
//#linxi end Variable Ordering Strategy
18381835

1839-
//#linxi begin symmetry check
1840-
void symmetry_check() {
1841-
unsigned arith_num = m_is_int.size();
1842-
if (arith_num > 10000)
1843-
return ;
1844-
Symmetry_Checker checker(m_pm, m_qm, m_clauses, m_atoms, m_is_int, arith_num);
1845-
for (var x = 0; x < arith_num; ++x) {
1846-
for (var y = x + 1; y < arith_num; ++y) {
1847-
if (checker.check_symmetry(x, y)) {
1848-
TRACE("linxi_symmetry_checker",
1849-
tout << "symmetry: " << x << ", " << y << "\n";
1850-
);
1851-
1852-
rational zero(0);
1853-
vector<rational> as;
1854-
vector<var> xs;
1855-
as.push_back(rational(1));
1856-
xs.push_back(x);
1857-
as.push_back(rational(-1));
1858-
xs.push_back(y);
1859-
polynomial_ref pr(m_pm);
1860-
pr = m_pm.mk_linear(2, as.data(), xs.data(), zero);
1861-
poly* p = pr.get();
1862-
bool is_even = false;
1863-
literal lit = ~mk_ineq_literal(atom::GT, 1, &p, &is_even);
1864-
clause *cla = mk_clause(1, &lit, true, nullptr);
1865-
}
1866-
}
1867-
}
1868-
TRACE("linxi_symmetry_checker",
1869-
display(tout);
1870-
);
1871-
1872-
}
1873-
//#linxi end symmetry check
1836+
18741837
void apply_reorder() {
18751838
m_reordered = false;
18761839
if (!can_reorder())
@@ -1887,13 +1850,6 @@ namespace nlsat {
18871850

18881851
lbool check() {
18891852

1890-
//#linxi begin symmetry check
1891-
if (m_linxi_symmetry_check) {
1892-
symmetry_check();
1893-
}
1894-
// exit(0);
1895-
//#linxi end symmetry check
1896-
18971853
//#linxi begin simple check
18981854
if (m_linxi_simple_check) {
18991855
if (!simple_check()) {

0 commit comments

Comments
 (0)