diff --git a/src/ModelTree.cc b/src/ModelTree.cc
index 675a6e435db06fc9bb2e22893691dfad63ffd89f..dbc65069ac3572f053f9234c7c61ef7399f43828 100644
--- a/src/ModelTree.cc
+++ b/src/ModelTree.cc
@@ -511,7 +511,7 @@ ModelTree::computePrologueAndEpilogue()
 }
 
 void
-ModelTree::equationTypeDetermination(const map<tuple<int, int, int>, expr_t> &first_order_endo_derivatives, int mfs)
+ModelTree::equationTypeDetermination(const map<tuple<int, int, int>, expr_t> &first_order_endo_derivatives)
 {
   equation_type_and_normalized_equation.clear();
   equation_type_and_normalized_equation.resize(equations.size());
@@ -2018,7 +2018,7 @@ ModelTree::computingPassBlock(const eval_context_t &eval_context, bool no_tmp_te
     return;
   auto [prologue, epilogue] = computePrologueAndEpilogue();
   auto first_order_endo_derivatives = collectFirstOrderDerivativesEndogenous();
-  equationTypeDetermination(first_order_endo_derivatives, mfs);
+  equationTypeDetermination(first_order_endo_derivatives);
   cout << "Finding the optimal block decomposition of the " << modelClassName() << "..." << endl;
   computeBlockDecomposition(prologue, epilogue);
   reduceBlockDecomposition();
diff --git a/src/ModelTree.hh b/src/ModelTree.hh
index fe25df8168dc3ea771848470d85520d54f738768..c463986010236c07e2a39d743a368a73805edf07 100644
--- a/src/ModelTree.hh
+++ b/src/ModelTree.hh
@@ -478,7 +478,7 @@ private:
      Returns the sizes of the prologue and epilogue. */
   pair<int, int> computePrologueAndEpilogue();
   //! Determine the type of each equation of model and try to normalize the unnormalized equation
-  void equationTypeDetermination(const map<tuple<int, int, int>, expr_t> &first_order_endo_derivatives, int mfs);
+  void equationTypeDetermination(const map<tuple<int, int, int>, expr_t> &first_order_endo_derivatives);
   /* Fills the max lags/leads and n_{static,mixed,forward,backward} fields of a
      given block.
      Needs the fields size and first_equation. */