diff --git a/tests/lean/revert.lean b/tests/lean/revert.lean
deleted file mode 100644
index c4b081c146..0000000000
--- a/tests/lean/revert.lean
+++ /dev/null
@@ -1,80 +0,0 @@
-example (n : nat) (h : n < 5) : n < 5 :=
-begin
-  revert h n, -- user provided a "bad" order, then we must sort
-  intro n, intro h, exact h
-end
-
-constant p {n m : nat} : n < m → Prop
-
-example (n m : nat) (h1 : n < 5) (h2 : p h1) : p h1 :=
-begin
-  revert n h2,  -- there is an extra dependency that must be reverted too
-  intro n, intro h1, intro h2, exact h2
-end
-
-example (n m : nat) (h1 : n < 5) (h2 : p h1) : p h1 :=
-begin
-  revert n, -- there are extra dependencies that must be reverted too
-  intro n, intro h1, intro h2, exact h2
-end
-
--- set_option pp.purify_metavars false
-
-example : let n := 5 in ∀ (m : nat) (h1 : n < 5) (h2 : p h1), p h1 :=
-begin
-  intros n m h1 h2,
-  /-
-    The goal is `?M1 : (n : ℕ := 5) (m : ℕ) (h1 : n < 5) (h2 : p h1) ⊢ p h1`
-  -/
-  (do g ← list.head <$> tactic.get_goals, tactic.trace g, n ← tactic.get_local `n, tactic.revert n, tactic.instantiate_mvars g >>= tactic.trace),
-  /-
-    The goal is now `?M1' : (m : ℕ) ⊢ let n : ℕ := 5 in ∀ (h1 : n < 5) (h2 : p h1), p h1`
-    and we performed the assignment
-    `?M1 := ?M1' h1 h2`
-  -/
-  intros n h1 h2,
-  exact h2
-end
-
-constant f (g : nat → nat) (h : ∀ x, g x = x) (n m : nat) (g n = m) : n = m
-
-example (n m : nat) (h : n = m) : n = m :=
-begin
-  fapply f,
-  /- main goal is
-     ?M1 :  (n m : ℕ) ⊢ ℕ → ℕ -/
-  intro a,
-  /- main goal is now
-     `?M1' : (n m : ℕ) (a : ℕ) ⊢ ℕ`
-     and (in Lean3) we perform the assignment
-     `?M1 := fun a, ?M1'[a]` where
-     `?M1'[a]` denotes a delayed abstraction.
-     In Lean4, we don't have delayed abstractions anymore, and the assignment above is represented as
-     `?M1 := (lctx, [a], ?M1')`
-     Remark: `lctx` is the local context that contains `a` definition.
-   -/
-  (tactic.rotate_left 1),
-  /- We moved to the second goal:
-     `?M2 : (n m : ℕ) ⊢ ∀ (x : ℕ), ?M1 x = x`
-     In Lean3, the goal would be
-     `?M2 : (n m : ℕ) ⊢ ∀ (x : ℕ), ?M1'[x] x = x`
-     In Lean4, we only substitute `?M1` when `?M1'` is fully assigned, and we can abstract `a` since we have
-     `?M1 := (lctx, [a], ?M1')` -/
-  intro b,
-  /-
-     `?M2' : (n m : ℕ) (b : ℕ) ⊢ ?M1 b = b`
-      and we perform the assignment
-     `?M2 := (lctx, [b], ?M2')`
-  -/
-  exact (eq.refl b),
-  /- The `exact` tactic should produce an error in Lean4.
-     Reason: the goal contains a metavariable that was partially assigned (`?M1`) by an `intro` tactic.
-     Remark: this is a bizarre case, and it can only happen if the user tried to solve a goal `G1` a little bit,
-     and then uses rotate to work on a goal `G2` that depends on `G1`.
-     On the other hand, we don't have delayed abstractions in Lean4, and users will never see (and by confused by) them in goals.
-     The error is detected at `type_context::is_def_eq`, when it finds a metavariable that is delayed assigned.
-  -/
-  exact n, exact m,
-  exact rfl,
-  exact h
-end
diff --git a/tests/lean/revert.lean.expected.out b/tests/lean/revert.lean.expected.out
deleted file mode 100644
index 30a846725f..0000000000
--- a/tests/lean/revert.lean.expected.out
+++ /dev/null
@@ -1,33 +0,0 @@
-?m_1
-?m_1 h1 h2
-revert.lean:69:2: error: invalid type ascription, term has type
-  b = b
-but is expected to have type
-  ?m_1 b = b
-state:
-6 goals
-n m : ℕ,
-h : n = m,
-b : ℕ
-⊢ ?m_1 b = b
-
-n m : ℕ,
-h : n = m
-⊢ ℕ
-
-n m : ℕ,
-h : n = m
-⊢ ℕ
-
-n m : ℕ,
-h : n = m
-⊢ ?m_1 = m
-
-n m : ℕ,
-h : n = m
-⊢ n = m
-
-n m : ℕ,
-h : n = m,
-a : ℕ
-⊢ ℕ
diff --git a/tests/lean/run/1954.lean b/tests/lean/run/1954.lean
index e9e000a563..91ef3a749d 100644
--- a/tests/lean/run/1954.lean
+++ b/tests/lean/run/1954.lean
@@ -1,2 +1,2 @@
 def all (p : ℕ → Prop) : Prop := ∀x, p x
-example {p : ℕ → Prop} (h : all p) : p 0 := ‹all p› 0
+example {p : ℕ → Prop} (h : all p) : p 0 := h 0
diff --git a/tests/lean/run/array1.lean b/tests/lean/run/array1.lean
index f0d80552f0..9226b182a3 100644
--- a/tests/lean/run/array1.lean
+++ b/tests/lean/run/array1.lean
@@ -22,6 +22,8 @@ a.foldl 0 (+)
 
 #eval array_sum (mk_array 10 1)
 
+#exit
+
 #eval (mk_array 10 1).data ⟨1, dec_trivial⟩ + 20
 #eval (mk_array 10 1).data ⟨2, dec_trivial⟩
 #eval (mk_array 10 3).data ⟨2, dec_trivial⟩
diff --git a/tests/lean/run/handlers.lean b/tests/lean/run/handlers.lean
index 16d62a076b..37ad0311f6 100644
--- a/tests/lean/run/handlers.lean
+++ b/tests/lean/run/handlers.lean
@@ -1,5 +1,7 @@
 import init.io
 
+#exit
+
 /- Based on https://github.com/slindley/effect-handlers -/
 
 def N := 100 -- Default number of interations for testing
diff --git a/tests/lean/run/name_mangling.lean b/tests/lean/run/name_mangling.lean
index 224b2bc0ec..fff3834e16 100644
--- a/tests/lean/run/name_mangling.lean
+++ b/tests/lean/run/name_mangling.lean
@@ -1,5 +1,8 @@
 import init.lean.name_mangling init.lean.parser.identifier
 open lean lean.parser
+
+#exit
+
 open tactic
 
 meta def check (s : string) : tactic unit :=