diff --git a/src/params/smt_parallel_params.pyg b/src/params/smt_parallel_params.pyg
index 1e3e40237..1a043b6fb 100644
--- a/src/params/smt_parallel_params.pyg
+++ b/src/params/smt_parallel_params.pyg
@@ -8,4 +8,5 @@ def_module_params('smt_parallel',
                         ('num_global_bb_batch_threads', UINT, 0, 'run Janota-style chunking backbone worker threads; default is 0 (off), supported values are 1 (negative mode only) or 2 (negative and positive mode)'),
                         ('local_backbones', BOOL, False, 'enable local backbones experiment within the search tree parallelism'),
                         ('core_minimize', BOOL, True, 'minimize unsat cores used for parallel cube backtracking'),
+                        ('ablate_backtracking', BOOL, False, 'ablation: pass entire cube as core instead of unsat core during backtracking'),
                   ))
diff --git a/src/smt/smt_parallel.cpp b/src/smt/smt_parallel.cpp
index 90346311d..7d6dbe612 100644
--- a/src/smt/smt_parallel.cpp
+++ b/src/smt/smt_parallel.cpp
@@ -548,9 +548,34 @@ namespace smt {
 
         if (!targets.empty()) {
             IF_VERBOSE(1, verbose_stream() << " Closing negation of the new global backbone: " << mk_bounded_pp(g_bb_ref, m, 3) << "\n");
-            expr_ref_vector l_core(l2g.from());
-            l_core.push_back(mk_not(backbone));
-            backtrack_unlocked(l2g, UINT_MAX, l_core, nullptr, &targets);
+            
+            if (m_ablate_backtracking) {
+                // Ablation: for each target, pass the entire path from root to that node
+                for (auto const& target : targets) {
+                    if (m_search_tree.is_lease_canceled(target.leased_node, target.cancel_epoch))
+                        continue;
+                    
+                    // Reconstruct the full path from root to this target node
+                    expr_ref_vector full_cube(l2g.from());
+                    node* n = target.leased_node;
+                    while (n) {
+                        if (!cube_config::literal_is_null(n->get_literal())) {
+                            expr* lit = n->get_literal().get();
+                            full_cube.push_back(expr_ref(lit, l2g.from()));
+                        }
+                        n = n->parent();
+                    }
+                    
+                    // Backtrack this one target with its full path
+                    vector<node_lease> single_target = { target };
+                    backtrack_unlocked(l2g, UINT_MAX, full_cube, nullptr, &single_target);
+                }
+            } else {
+                // Normal: just use the negated backbone
+                expr_ref_vector l_core(l2g.from());
+                l_core.push_back(mk_not(backbone));
+                backtrack_unlocked(l2g, UINT_MAX, l_core, nullptr, &targets);
+            }
         }
 
         return true;
@@ -798,7 +823,14 @@ namespace smt {
 
                 LOG_WORKER(1, " found unsat cube\n");
                 node* source = lease.leased_node;
-                b.backtrack(m_l2g, id, unsat_core, lease);
+                
+                // When ablating backtracking, use the entire cube path instead of the unsat core
+                expr_ref_vector const& core_to_use = m_config.m_ablate_backtracking ? cube : unsat_core;
+                if (m_config.m_ablate_backtracking) {
+                    LOG_WORKER(1, " ablating backtracking: using full cube path of size " << core_to_use.size() << "\n");
+                }
+                
+                b.backtrack(m_l2g, id, core_to_use, lease);
                 if (m_config.m_core_minimize)
                     b.enqueue_core_minimization(m_l2g, source, unsat_core);
                 lease = {};
@@ -835,6 +867,12 @@ namespace smt {
         m_config.m_global_backbones = pp.num_global_bb_batch_threads() > 0 || pp.num_global_bb_fl_threads() > 0;
         m_config.m_local_backbones = pp.local_backbones();
         m_config.m_core_minimize = pp.core_minimize();
+        m_config.m_ablate_backtracking = pp.ablate_backtracking();
+        
+        // When ablating backtracking, disable core minimization since we're using the full cube path
+        if (m_config.m_ablate_backtracking) {
+            m_config.m_core_minimize = false;
+        }
     }
 
     parallel::sls_worker::sls_worker(parallel& p)
@@ -1748,6 +1786,9 @@ namespace smt {
         
         m_worker_leases.reset();
         m_worker_leases.resize(p.m_workers.size());
+        
+        smt_parallel_params pp(p.ctx.m_params);
+        m_ablate_backtracking = pp.ablate_backtracking();
     }
 
     void parallel::batch_manager::collect_statistics(::statistics &st) const {
diff --git a/src/smt/smt_parallel.h b/src/smt/smt_parallel.h
index f42addb91..64fcc1186 100644
--- a/src/smt/smt_parallel.h
+++ b/src/smt/smt_parallel.h
@@ -122,6 +122,8 @@ namespace smt {
             // Core minimization job queue
             std::condition_variable m_core_min_cv;
             scoped_ptr_vector<core_min_job> m_core_min_jobs;
+            
+            bool m_ablate_backtracking = false;
 
             // called from batch manager to cancel other workers if we've reached a verdict
             void cancel_workers() {
@@ -258,6 +260,7 @@ namespace smt {
                 unsigned m_max_cube_depth = 20;
                 unsigned m_max_conflicts = UINT_MAX;
                 bool m_core_minimize = false;
+                bool m_ablate_backtracking = false;
             };
 
             unsigned id; // unique identifier for the worker