From 0ef4bea86bfd593ecd28e3677069856e54ffde57 Mon Sep 17 00:00:00 2001
From: Leonardo de Moura <leonardo@microsoft.com>
Date: Fri, 10 Jun 2016 18:20:24 -0700
Subject: [PATCH] chore(tests/lean): disable tests

---
 src/shell/CMakeLists.txt        |   6 +-
 tests/lean/run/IO3.lean         |   2 -
 tests/lean/slow/list_elab2.lean | 138 --------------------------------
 3 files changed, 3 insertions(+), 143 deletions(-)
 delete mode 100644 tests/lean/slow/list_elab2.lean

diff --git a/src/shell/CMakeLists.txt b/src/shell/CMakeLists.txt
index 61c721177f..af4d7b72d0 100644
--- a/src/shell/CMakeLists.txt
+++ b/src/shell/CMakeLists.txt
@@ -44,9 +44,9 @@ add_test(NAME "lean_print_notation"
 # add_test(NAME "issue_616"
 #          WORKING_DIRECTORY "${LEAN_SOURCE_DIR}/../tests/lean/extra"
 #          COMMAND bash "./issue_616.sh" "${CMAKE_CURRENT_BINARY_DIR}/lean")
-add_test(NAME "show_goal"
-         WORKING_DIRECTORY "${LEAN_SOURCE_DIR}/../tests/lean/extra"
-         COMMAND bash "./show_goal.sh" "${CMAKE_CURRENT_BINARY_DIR}/lean")
+# add_test(NAME "show_goal"
+#          WORKING_DIRECTORY "${LEAN_SOURCE_DIR}/../tests/lean/extra"
+#          COMMAND bash "./show_goal.sh" "${CMAKE_CURRENT_BINARY_DIR}/lean")
 # add_test(NAME "issue_755"
 #          WORKING_DIRECTORY "${LEAN_SOURCE_DIR}/../tests/lean/extra"
 #          COMMAND bash "./issue_755.sh" "${CMAKE_CURRENT_BINARY_DIR}/lean")
diff --git a/tests/lean/run/IO3.lean b/tests/lean/run/IO3.lean
index cb261641d0..9d3e7dd3ef 100644
--- a/tests/lean/run/IO3.lean
+++ b/tests/lean/run/IO3.lean
@@ -6,5 +6,3 @@ do { l ← get_line,
        put_str "you have typed hello\n"
      else
        do {put_str "you did not type hello\n", put_str "-----------\n"} }
-
-vm_eval main
diff --git a/tests/lean/slow/list_elab2.lean b/tests/lean/slow/list_elab2.lean
deleted file mode 100644
index 877afba299..0000000000
--- a/tests/lean/slow/list_elab2.lean
+++ /dev/null
@@ -1,138 +0,0 @@
-----------------------------------------------------------------------------------------------------
---- Copyright (c) 2014 Parikshit Khanna. All rights reserved.
---- Released under Apache 2.0 license as described in the file LICENSE.
---- Authors: Parikshit Khanna, Jeremy Avigad
-----------------------------------------------------------------------------------------------------
-
--- Theory list
--- ===========
---
--- Basic properties of lists.
-
-import logic data.nat
--- import congr
-
-open nat algebra
--- open congr
-open eq.ops eq
-
-inductive list (T : Type) : Type :=
-| nil {} : list T
-| cons : T → list T → list T
-
-definition refl := @eq.refl
-
-namespace list
-
--- Type
--- ----
-
-infixr `::` := cons
-
-section
-
-variable {T : Type}
-
-theorem list_induction_on {P : list T → Prop} (l : list T) (Hnil : P nil)
-    (Hind : forall x : T, forall l : list T, forall H : P l, P (cons x l)) : P l :=
-list.rec Hnil Hind l
-
-theorem list_cases_on {P : list T → Prop} (l : list T) (Hnil : P nil)
-    (Hcons : forall x : T, forall l : list T, P (cons x l)) : P l :=
-list_induction_on l Hnil (take x l IH, Hcons x l)
-
-notation `[` l:(foldr `,` (h t, cons h t) nil) `]` := l
-
-
--- Concat
--- ------
-
-definition concat (s t : list T) : list T :=
-list.rec t (fun x : T, fun l : list T, fun u : list T, cons x u) s
-
-infixl `++` := concat
-
-theorem nil_concat (t : list T) : nil ++ t = t := refl _
-
-theorem cons_concat (x : T) (s t : list T) : (x :: s) ++ t = x :: (s ++ t) := refl _
-
-theorem concat_nil (t : list T) : t ++ nil = t :=
-list_induction_on t (refl _)
-  (take (x : T) (l : list T) (H : concat l nil = l),
-    H ▸ (refl (cons x (concat l nil))))
-
-attribute concat [reducible]
-theorem concat_nil2 (t : list T) : t ++ nil = t :=
-list_induction_on t (refl _)
-  (take (x : T) (l : list T) (H : concat l nil = l),
-    -- H ▸ (refl (cons x (concat l nil))))
-    H ▸ (refl (concat (cons x l) nil)))
-
-theorem concat_assoc (s t u : list T) : s ++ t ++ u = s ++ (t ++ u) :=
-list_induction_on s (refl _)
-  (take x l,
-    assume H : concat (concat l t) u = concat l (concat t u),
-    H ▸ refl _)
-
-theorem concat_assoc2 (s t u : list T) : s ++ t ++ u = s ++ (t ++ u) :=
-sorry
-
-
-theorem concat_assoc3 (s t u : list T) : s ++ t ++ u = s ++ (t ++ u) :=
-sorry
-
-theorem concat_assoc4 (s t u : list T) : s ++ t ++ u = s ++ (t ++ u) :=
-sorry
-
--- Length
--- ------
-
-definition length : list T → ℕ := list.rec 0 (fun x l m, succ m)
-
--- TODO: cannot replace zero by 0
-theorem length_nil : length (@nil T) = zero := refl _
-
-theorem length_cons (x : T) (t : list T) : length (x :: t) = succ (length t) := refl _
-
-theorem length_concat (s t : list T) : length (s ++ t) = length s + length t :=
-sorry
-
--- Reverse
--- -------
-
-definition reverse : list T → list T := list.rec nil (fun x l r, r ++ [x])
-
-theorem reverse_nil : reverse (@nil T) = nil := refl _
-
-theorem reverse_cons (x : T) (l : list T) : reverse (x :: l) = (reverse l) ++ (cons x nil) := refl _
-
--- opaque_hint (hiding reverse)
-
-theorem reverse_concat (s t : list T) : reverse (s ++ t) = (reverse t) ++ (reverse s) :=
-sorry
-
--- -- add_rewrite length_nil length_cons
-theorem reverse_reverse (l : list T) : reverse (reverse l) = l :=
-sorry
--- Append
--- ------
-
--- TODO: define reverse from append
-
-definition append (x : T) : list T → list T := list.rec (x :: nil) (fun y l l', y :: l')
-
-theorem append_nil (x : T) : append x nil = [x] := refl _
-
-theorem append_cons (x : T) (y : T) (l : list T) : append x (y :: l)  = y :: (append x l) := refl _
-
-theorem append_eq_concat  (x : T) (l : list T) : append x l = l ++ [x] :=
-list_induction_on l (refl _)
-  (take y l,
-    assume P : append x l = concat l [x],
-    P ▸ refl _)
-
-theorem append_eq_reverse_cons  (x : T) (l : list T) : append x l = reverse (x :: reverse l) :=
-sorry
-
-end
-end list