Goal:
    T : Type -> Type  M : Monad T  A : Type  P : nat -> A -> Type
  ============================
   (forall (k : nat) (a : A) (l : list A),
    (forall (n : nat) (x : A),
     nth_error (a :: l) n = Some x -> T (∥ P (k + n) x ∥)) -> 
    Some a = Some a)


DEBUG:Going to execute:
simplify ?
Level 2: Backtrace:

The first hypothesis in the goal is not an equality.
Level 2: Backtrace:

The first hypothesis in the goal is not an equality.