diff --git a/src/math/polysat/slicing.cpp b/src/math/polysat/slicing.cpp
index 89434d0db..0ad634c42 100644
--- a/src/math/polysat/slicing.cpp
+++ b/src/math/polysat/slicing.cpp
@@ -45,6 +45,7 @@ TODO:
     if slice has value but parent has no value, then check if sub_other(parent(s)) [sibling(s)?] has a value.
     if yes, can propagate value upwards. (add a congruence term to track deps properly?).
     we have to check the whole equivalence class, because the parents may be in different classes.
+    it is enough to propagate values to variables. we could count (in the variable slice) the number of its base slices that are still unassigned.
 
 */
 
@@ -56,8 +57,6 @@ TODO:
 #include "util/tptr.h"
 
 
-#define PROPAGATE_UPWARDS 0
-
 namespace {
 
     template <typename>
@@ -233,7 +232,6 @@ namespace polysat {
         }
         m_egraph.pop(num_scopes);
         m_needs_congruence.reset();
-        m_to_propagate_upwards.reset();
         m_disequality_conflict = nullptr;
         m_dep_var.shrink(m_dep_size_trail[target_lvl]);
         m_dep_lit.shrink(m_dep_size_trail[target_lvl]);
@@ -912,11 +910,6 @@ namespace polysat {
             if (!v2) set_value_node(other, v1);
             rational const val = get_value(v1 ? v1 : v2);
             for (enode* n : euf::enode_class(other)) {
-#if PROPAGATE_UPWARDS
-                if (is_proper_slice(n))
-                    if (enode* p = parent(n))
-                        m_to_propagate_upwards.push_back(p);
-#endif
                 pvar const v = slice2var(n);
                 if (v == null_var)
                     continue;
@@ -928,50 +921,6 @@ namespace polysat {
         }
     }
 
-#if PROPAGATE_UPWARDS
-    void slicing::propagate_value_upwards(enode* p) {
-        LOG("propagate value upwards to: " << slice_pp(*this, p));
-        if (get_value_node(p))
-            return;
-        enode* p_hi = sub_hi(p);
-        enode* p_lo = sub_lo(p);
-        if (!get_value_node(p_hi))
-            return;
-        if (!get_value_node(p_lo))
-            return;
-        // both children of p have a value, but p itself does not => propagate upwards by congruence
-        enode* v_hi = get_value_node(p_hi);
-        enode* v_lo = get_value_node(p_lo);
-        unsigned const w_hi = width(v_hi);
-        unsigned const w_lo = width(v_lo);
-        rational value = get_value(v_hi) * rational::power_of_two(w_lo) + get_value(v_lo);
-        enode* v_concat = mk_concat_node({v_hi, v_lo});
-        if (m_info[v_concat->get_id()].slice) {
-            enode* v = mk_value_slice(value, w_hi + w_lo);
-            info(v).set_cut(get_cut(p), v_hi, v_lo);
-            // v == concat(v_hi, v_lo)
-            add_concat_node(v, v_concat);
-        }
-        // p == concat(p_hi, p_lo)
-        add_concat_node(p, mk_concat_node({p_hi, p_lo}));
-        // TODO: continue with parent(p) and equivalents if possible?
-        // TODO: it's probably enough to do this for variables on base slices, but how to efficiently detect when value congruence is available? (could count the number of unassigned base slices in the parent)
-    }
-
-    void slicing::propagate_values_upwards() {
-        SASSERT(all_of(m_egraph.nodes(), [](enode* n){ return !n->is_marked3(); }));
-        for (enode* p : m_to_propagate_upwards) {
-            if (p->is_marked3())
-                continue;
-            p->mark3();
-            propagate_value_upwards(p);
-        }
-        for (enode* p : m_to_propagate_upwards)
-            p->unmark3();
-        m_to_propagate_upwards.reset();
-    }
-#endif
-
     void slicing::set_value_node(enode* s, enode* value_node) {
         SASSERT(!info(s).value_node);
         SASSERT(is_value(value_node));
@@ -1004,8 +953,6 @@ namespace polysat {
     bool slicing::can_propagate() const {
         if (use_var_congruences() && !m_needs_congruence.empty())
             return true;
-        if (!m_to_propagate_upwards.empty())
-            return true;
         return m_egraph.can_propagate();
     }
 
@@ -1014,9 +961,6 @@ namespace polysat {
         if (is_conflict())
             return;
         update_var_congruences();
-#if PROPAGATE_UPWARDS
-        propagate_values_upwards();
-#endif
         m_egraph.propagate();
     }
 
diff --git a/src/math/polysat/slicing.h b/src/math/polysat/slicing.h
index 5b481c493..fcb5d9e02 100644
--- a/src/math/polysat/slicing.h
+++ b/src/math/polysat/slicing.h
@@ -120,7 +120,6 @@ namespace polysat {
         slice_info_vector       m_info;         // indexed by enode::get_id()
         enode_vector            m_var2slice;    // pvar -> slice
         tracked_uint_set        m_needs_congruence;     // set of pvars that need updated concat(...) expressions
-        enode_vector            m_to_propagate_upwards;
         enode*                  m_disequality_conflict = nullptr;
 
         // Add an equation v = concat(s1, ..., sn)
@@ -211,8 +210,6 @@ namespace polysat {
 
         void egraph_on_make(enode* n);
         void egraph_on_merge(enode* root, enode* other);
-        void propagate_value_upwards(enode* n);
-        void propagate_values_upwards();
         void egraph_on_propagate(enode* lit, enode* ante);
 
         // Merge slices in the e-graph.