Goal:
  
  A : Type
  a : A
  l : list A
  P : A → bool
  d : A
  IHl : ∀ n : nat, forallb P l → n < #|l| → ∃ x : A, nth n l d = x ∧ P x
  H : is_true (P a && forallb P l)
  H0 : 0 < S #|l|
  ============================
   (∃ x : A, a = x ∧ P x)


DEBUG:Going to execute:
match goal with
           | |- _ → _ => intro; t_tauto_intuit
           | |- _ => t_reduce; t_solver
           end || t_solver
Level 2: evaluation returns
<coq-core.plugins.tauto::is_disj@0>
where
tauto_flags := 
of type
tauto_flags
X1 := ∃ x : A, a = x ∧ 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:

Tactic failure.