3 files changed, 27 insertions, 8 deletions
diff --git a/test-suite/bugs/closed/shouldfail/1915.v b/test-suite/bugs/closed/shouldfail/1915.v
new file mode 100644
index 00000000..a96a482c
--- /dev/null
+++ b/test-suite/bugs/closed/shouldfail/1915.v
@@ -0,0 +1,6 @@
+
+Require Import Setoid.
+
+Goal forall x, impl True (x = 0) -> x = 0 -> False.
+intros x H E.
+rewrite H in E.
+\ No newline at end of file
diff --git a/test-suite/bugs/closed/shouldsucceed/1784.v b/test-suite/bugs/closed/shouldsucceed/1784.v
index 616dd26f..5855b168 100644
--- a/test-suite/bugs/closed/shouldsucceed/1784.v
+++ b/test-suite/bugs/closed/shouldsucceed/1784.v
@@ -85,17 +85,17 @@ Program Fixpoint lt_dec (x y:sv) { struct x } : {slt x y}+{~slt x y} :=
       end
   end.
 
-Next Obligation. apply H; inversion H0; subst; trivial. Defined.
-Next Obligation. inversion H. Defined.
-Next Obligation. inversion H. Defined.
-Next Obligation. inversion H; subst. Defined.
+Next Obligation. intro H0. apply H; inversion H0; subst; trivial. Defined.
+Next Obligation. intro H; inversion H. Defined.
+Next Obligation. intro H; inversion H. Defined.
+Next Obligation. intro H; inversion H; subst. Defined.
 Next Obligation.
-  contradict H. inversion H1; subst. assumption. 
+  intro H1; contradict H. inversion H1; subst. assumption. 
   contradict H0; assumption. Defined.
 Next Obligation.
-  contradict H0. inversion H1; subst. assumption. Defined.
+  intro H1; contradict H0. inversion H1; subst. assumption. Defined.
 Next Obligation.
-  contradict H. inversion H0; subst. assumption. Defined.
+  intro H0; contradict H. inversion H0; subst. assumption. Defined.
 Next Obligation.
-  contradict H. inversion H0; subst; auto. Defined.
+  intro H0; contradict H. inversion H0; subst; auto. Defined.
 
diff --git a/test-suite/bugs/closed/shouldsucceed/1905.v b/test-suite/bugs/closed/shouldsucceed/1905.v
new file mode 100644
index 00000000..bd7fd796
--- /dev/null
+++ b/test-suite/bugs/closed/shouldsucceed/1905.v
@@ -0,0 +1,13 @@
+
+Require Import Setoid.
+
+Axiom t : Set.
+Axiom In : nat -> t -> Prop.
+Axiom InE : forall (x : nat) (s:t), impl (In x s) True.
+
+Goal forall a s, 
+ In a s -> False.
+Proof.
+ intros a s Ia.
+ rewrite InE in Ia.
+Admitted.
+\ No newline at end of file