diff --git a/src/math/polysat/slicing.cpp b/src/math/polysat/slicing.cpp
index ca4c8bd7d..a76d4cb80 100644
--- a/src/math/polysat/slicing.cpp
+++ b/src/math/polysat/slicing.cpp
@@ -289,6 +289,29 @@ namespace polysat {
         ys.push_back(y);
         return merge(xs, ys, dep);  // will clear xs and ys
     }
+
+    bool slicing::is_equal(slice x, slice y) {
+        x = find(x);
+        y = find(y);
+        if (x == y)
+            return true;
+        slice_vector& xs = m_tmp2;
+        slice_vector& ys = m_tmp3;
+        SASSERT(xs.empty());
+        SASSERT(ys.empty());
+        find_base(x, xs);
+        find_base(y, ys);
+        SASSERT(all_of(xs, [this](slice s) { return s == find(s); }));
+        SASSERT(all_of(ys, [this](slice s) { return s == find(s); }));
+        bool result = (xs == ys);
+        xs.clear();
+        ys.clear();
+#if 0
+        if (result) {
+            // TODO: merge equivalence class of x, y (on upper level)? but can we always combine the sub-trees?
+        }
+#endif
+        return result;
     }
 
     void slicing::find_base(slice src, slice_vector& out_base) const {
diff --git a/src/math/polysat/slicing.h b/src/math/polysat/slicing.h
index 0d3b40e33..5aa074a8c 100644
--- a/src/math/polysat/slicing.h
+++ b/src/math/polysat/slicing.h
@@ -148,6 +148,8 @@ namespace polysat {
         [[nodiscard]] bool merge(slice_vector& xs, slice y, dep_t dep);
         [[nodiscard]] bool merge(slice x, slice y, dep_t dep);
 
+        // Check whether two slices are known to be equal
+        bool is_equal(slice x, slice y);
 
         enum class trail_item {
             add_var,