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 : E.eq x0 x0 -> impl (P x0) (P x0)
  ============================
   (P x)


DEBUG:Going to execute:
auto
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 6: Backtrace:

Proof is not complete.
Level 5: Backtrace:

Proof is not complete.
Level 4: Backtrace:

Proof is not complete.
Level 3: Backtrace:

Proof is not complete.
Level 3: Backtrace:

Proof is not complete.
Level 3: Backtrace:

Proof is not complete.
Level 2: Backtrace:

Proof is not complete.
Level 2: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 2: Backtrace:

Proof is not complete.
Level 2: Backtrace:

Proof is not complete.
Level 2: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 1: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

Proof is not complete.