diff --git a/src/tactic/smtlogics/qfauflia_tactic.cpp b/src/tactic/smtlogics/qfauflia_tactic.cpp
index 206914a0f..20f4791f3 100644
--- a/src/tactic/smtlogics/qfauflia_tactic.cpp
+++ b/src/tactic/smtlogics/qfauflia_tactic.cpp
@@ -30,10 +30,6 @@ tactic * mk_qfauflia_tactic(ast_manager & m, params_ref const & p) {
     main_p.set_bool("som", true);
     main_p.set_bool("sort_store", true);
     
-    params_ref ctx_simp_p;
-    ctx_simp_p.set_uint("max_depth", 30);
-    ctx_simp_p.set_uint("max_steps", 5000000);
-
     params_ref solver_p;
     solver_p.set_bool("array.simplify", false); // disable array simplifications at old_simplify module
 
diff --git a/src/tactic/tactic_params.pyg b/src/tactic/tactic_params.pyg
index 5dfc6e5e8..f6fd48b2e 100644
--- a/src/tactic/tactic_params.pyg
+++ b/src/tactic/tactic_params.pyg
@@ -2,7 +2,7 @@
 def_module_params('tactic', 
                   description='tactic parameters',
                   export=True,
-                  params=(('solve_eqs.context_solve', BOOL, False, "solve equalities within disjunctions."),
+                  params=(('solve_eqs.context_solve', BOOL, True, "solve equalities within disjunctions."),
                           ('solve_eqs.theory_solver', BOOL, True, "use theory solvers."),
                           ('solve_eqs.ite_solver', BOOL, True, "use if-then-else solvers."),
                           ('solve_eqs.max_occs', UINT, UINT_MAX, "maximum number of occurrences for considering a variable for gaussian eliminations."),