diff --git a/src/math/polysat/conflict.cpp b/src/math/polysat/conflict.cpp
index f63d12f25..18491308c 100644
--- a/src/math/polysat/conflict.cpp
+++ b/src/math/polysat/conflict.cpp
@@ -187,10 +187,6 @@ namespace polysat {
         m_kind = conflict_kind_t::backtrack;
 
     }
-    void conflict::set_backjump() {
-        SASSERT(m_kind == conflict_kind_t::ok);
-        m_kind = conflict_kind_t::backjump;
-    }
 
     bool conflict::is_relevant_pvar(pvar v) const {
         switch (m_kind) {
@@ -200,9 +196,6 @@ namespace polysat {
             return true;
         case conflict_kind_t::backtrack:
             return pvar_occurs_in_constraints(v) || m_relevant_vars.contains(v);
-        case conflict_kind_t::backjump:
-            UNREACHABLE();  // we don't follow the regular loop when backjumping
-            return false;
         }
         UNREACHABLE();
         return false;
@@ -412,9 +405,6 @@ namespace polysat {
         SASSERT(contains(lit));
         SASSERT(!contains(~lit));
 
-        if (is_backjumping())
-            return;
-
         unsigned const lvl = s.m_bvars.level(lit);
         signed_constraint c = s.lit2cnstr(lit);
 
diff --git a/src/math/polysat/conflict.h b/src/math/polysat/conflict.h
index 59816dffe..e2a3c3721 100644
--- a/src/math/polysat/conflict.h
+++ b/src/math/polysat/conflict.h
@@ -90,9 +90,6 @@ namespace polysat {
         //       we should find a way to use resolve_value with these lemmas,
         //       to properly eliminate value propagations. (see todo notes above)
         backtrack,
-        // conflict contains the final lemma;
-        // force backjumping without further conflict resolution because a good lemma has been found
-        backjump,
     };
 
     class conflict {
@@ -154,10 +151,8 @@ namespace polysat {
         conflict_kind_t kind() const { return m_kind; }
         bool is_bailout() const { return m_kind == conflict_kind_t::bailout; }
         bool is_backtracking() const { return m_kind == conflict_kind_t::backtrack; }
-        bool is_backjumping() const { return m_kind == conflict_kind_t::backjump; }
         void set_bailout();
         void set_backtrack();
-        void set_backjump();
 
         bool is_relevant_pvar(pvar v) const;
         bool is_relevant(sat::literal lit) const;
diff --git a/src/math/polysat/inference_logger.cpp b/src/math/polysat/inference_logger.cpp
index c7b6affb7..56eb6c3f3 100644
--- a/src/math/polysat/inference_logger.cpp
+++ b/src/math/polysat/inference_logger.cpp
@@ -86,9 +86,6 @@ namespace polysat {
         case conflict_kind_t::backtrack:
             out_indent() << "(backtrack)\n";
             break;
-        case conflict_kind_t::backjump:
-            out_indent() << "(backjump)\n";
-            break;
         }
         for (clause* lemma : core.side_lemmas()) {
             out_indent() << "Side lemma: " << *lemma << "\n";
diff --git a/src/math/polysat/saturation.cpp b/src/math/polysat/saturation.cpp
index 9bd823120..17bea5ecd 100644
--- a/src/math/polysat/saturation.cpp
+++ b/src/math/polysat/saturation.cpp
@@ -97,13 +97,13 @@ namespace polysat {
         if (!inserting)
             return false;
 
+        // TODO: add as a side lemma instead of changing the conflict
         core.remove_all();
         for (auto d : m_new_constraints)
             core.insert_eval(d);
         if (c.bvalue(s) != l_false)  // conflict is due to the evaluation of c, so it depends on the variable values
             core.insert_vars(c);
         core.insert_eval(~c);
-        core.set_backjump();
         core.logger().log(inf_name);
         LOG("Core " << core);
         return true;        
diff --git a/src/math/polysat/solver.cpp b/src/math/polysat/solver.cpp
index 26ca34c6f..16791d368 100644
--- a/src/math/polysat/solver.cpp
+++ b/src/math/polysat/solver.cpp
@@ -707,10 +707,6 @@ namespace polysat {
                     revert_decision(v);
                     return;
                 }
-                if (m_conflict.is_backjumping()) {
-                    backjump_lemma();
-                    return;
-                }
                 m_search.pop_assignment();
             }
             else {
@@ -747,6 +743,7 @@ namespace polysat {
         report_unsat();
     }
 
+#if 0
     /**
      * Simple backjumping for lemmas:
      * jump to the level where the lemma can be (bool-)propagated,
@@ -775,6 +772,7 @@ namespace polysat {
         jump_level = std::max(jump_level, base_level());
         backjump_and_learn(jump_level, *lemma);
     }
+#endif
 
     /**
      * Revert a decision that caused a conflict.
diff --git a/src/math/polysat/solver.h b/src/math/polysat/solver.h
index 8c9af88b6..f033a344a 100644
--- a/src/math/polysat/solver.h
+++ b/src/math/polysat/solver.h
@@ -210,7 +210,6 @@ namespace polysat {
         unsigned base_level() const;
 
         void resolve_conflict();
-        void backjump_lemma();
         void revert_decision(pvar v);
         void revert_bool_decision(sat::literal lit);
         void backjump_and_learn(unsigned jump_level, clause& lemma);