Goal:
  
  P : E.t -> Prop
  P_Proper : Proper (E.eq ==> impl) P
  s : t
  x : elt
  xs : list elt
  H : List.Exists P xs -> exists x : elt, InA E.eq x xs /\ P x
  H0 : forall x : elt,
       (fun x0 : elt => InA E.eq x0 xs /\ P x0) x -> List.Exists P xs
  x0 : elt
  H2 : P x0
  H1 : InA E.eq x0 xs
  H3 : forall y : E.t, E.eq x0 y -> impl (P x0) (P y)
  H4 : E.eq x0 x -> impl (P x0) (P x)
  H5 : forall y : E.t, E.eq x y -> impl (P x) (P y)
  ============================
   (P x)


DEBUG:Going to execute:
<Coq.Init.Tauto.axioms> flags ||
             match reverse goal with
             | id:(?X1 -> ?X2) -> ?X3
               |- _ =>
                   cut X3;
                    [ intro; clear id; t_tauto_intuit
                    | cut (X1 -> X2);
                       [ exact
                       id
                       | generalize (fun y : X2 => id (fun x : X1 => y));
                          intro; clear id; (solve 
                          [ t_tauto_intuit ]) ] ]
             | id:~ ?X1 -> ?X3
               |- _ =>
                   cut X3;
                    [ intro; clear id; t_tauto_intuit
                    | cut (~ X1);
                       [ exact
                       id
                       | clear id; intro; (solve [ t_tauto_intuit ]) ] ]
             | |- ?X1 =>
                   <Coq.Init.Tauto.is_disj> flags X1; (solve
                    [ left; t_tauto_intuit | right; t_tauto_intuit ])
             end ||
               match goal with
               | |- _ -> _ => intro; t_tauto_intuit
               | |- _ => t_reduce; t_solver
               end || t_solver
Level 2: evaluation returns
<coq-core.plugins.tauto::is_conj@0>
where
tauto_flags := 
of type
tauto_flags
X1 := P x
of type
constr of type tacvalue

Level 2: Backtrace:

Tactic failure.
Level 2: Backtrace:

Tactic failure.
Level 1: Backtrace:

Tactic failure.
Level 1: Backtrace:

Tactic failure.
Level 0: Backtrace:

No matching clauses for match.
Level 0: Backtrace:

No matching clauses for match.