mirror of
https://github.com/Z3Prover/z3
synced 2025-04-07 09:55:19 +00:00
remove SMTFD
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
7c2fe46eb7
commit
54a75d6a91
|
@ -197,14 +197,6 @@ struct check_logic::imp {
|
||||||
m_dt = true;
|
m_dt = true;
|
||||||
m_nonlinear = true; // non-linear 0-1 variables may get eliminated
|
m_nonlinear = true; // non-linear 0-1 variables may get eliminated
|
||||||
}
|
}
|
||||||
else if (logic == "SMTFD") {
|
|
||||||
m_bvs = true;
|
|
||||||
m_uf = true;
|
|
||||||
m_arrays = true;
|
|
||||||
m_ints = false;
|
|
||||||
m_dt = false;
|
|
||||||
m_nonlinear = false;
|
|
||||||
}
|
|
||||||
else {
|
else {
|
||||||
m_unknown_logic = true;
|
m_unknown_logic = true;
|
||||||
}
|
}
|
||||||
|
|
|
@ -4,10 +4,8 @@ z3_add_component(fd_solver
|
||||||
enum2bv_solver.cpp
|
enum2bv_solver.cpp
|
||||||
fd_solver.cpp
|
fd_solver.cpp
|
||||||
pb2bv_solver.cpp
|
pb2bv_solver.cpp
|
||||||
smtfd_solver.cpp
|
|
||||||
COMPONENT_DEPENDENCIES
|
COMPONENT_DEPENDENCIES
|
||||||
sat_solver
|
sat_solver
|
||||||
TACTIC_HEADERS
|
TACTIC_HEADERS
|
||||||
fd_solver.h
|
fd_solver.h
|
||||||
smtfd_solver.h
|
|
||||||
)
|
)
|
||||||
|
|
File diff suppressed because it is too large
Load diff
|
@ -1,33 +0,0 @@
|
||||||
/*++
|
|
||||||
Copyright (c) 2019 Microsoft Corporation
|
|
||||||
|
|
||||||
Module Name:
|
|
||||||
|
|
||||||
smtfd_solver.h
|
|
||||||
|
|
||||||
Abstract:
|
|
||||||
|
|
||||||
SMT reduction to Finite domain solver.
|
|
||||||
|
|
||||||
Author:
|
|
||||||
|
|
||||||
Nikolaj Bjorner (nbjorner) 2019-09-03
|
|
||||||
|
|
||||||
Notes:
|
|
||||||
|
|
||||||
--*/
|
|
||||||
#pragma once
|
|
||||||
|
|
||||||
#include "ast/ast.h"
|
|
||||||
#include "util/params.h"
|
|
||||||
|
|
||||||
class solver;
|
|
||||||
class tactic;
|
|
||||||
|
|
||||||
solver * mk_smtfd_solver(ast_manager & m, params_ref const & p);
|
|
||||||
tactic * mk_smtfd_tactic(ast_manager & m, params_ref const & p);
|
|
||||||
|
|
||||||
/*
|
|
||||||
ADD_TACTIC("smtfd", "builtin strategy for solving SMT problems by reduction to FD.", "mk_smtfd_tactic(m, p)")
|
|
||||||
*/
|
|
||||||
|
|
|
@ -34,7 +34,6 @@ Notes:
|
||||||
#include "tactic/smtlogics/nra_tactic.h"
|
#include "tactic/smtlogics/nra_tactic.h"
|
||||||
#include "tactic/portfolio/default_tactic.h"
|
#include "tactic/portfolio/default_tactic.h"
|
||||||
#include "tactic/fd_solver/fd_solver.h"
|
#include "tactic/fd_solver/fd_solver.h"
|
||||||
#include "tactic/fd_solver/smtfd_solver.h"
|
|
||||||
#include "tactic/ufbv/ufbv_tactic.h"
|
#include "tactic/ufbv/ufbv_tactic.h"
|
||||||
#include "tactic/fpa/qffp_tactic.h"
|
#include "tactic/fpa/qffp_tactic.h"
|
||||||
#include "muz/fp/horn_tactic.h"
|
#include "muz/fp/horn_tactic.h"
|
||||||
|
@ -108,8 +107,6 @@ static solver* mk_special_solver_for_logic(ast_manager & m, params_ref const & p
|
||||||
parallel_params pp(p);
|
parallel_params pp(p);
|
||||||
if ((logic == "QF_FD" || logic == "SAT") && !m.proofs_enabled() && !pp.enable())
|
if ((logic == "QF_FD" || logic == "SAT") && !m.proofs_enabled() && !pp.enable())
|
||||||
return mk_fd_solver(m, p);
|
return mk_fd_solver(m, p);
|
||||||
if (logic == "SMTFD" && !m.proofs_enabled() && !pp.enable())
|
|
||||||
return mk_smtfd_solver(m, p);
|
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue