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


DEBUG:Going to execute:
match H with
           | H' => fail 2
           | _ => unify X Y; clear H' || clear H
           end
Level 4: Backtrace:

k is used in conclusion.
Level 4: Backtrace:

k is used in conclusion.
Level 4: Backtrace:

k is used in conclusion.
Level 4: Backtrace:

k is used in conclusion.
Level 4: Backtrace:

k is used in conclusion.
Level 4: Backtrace:

k is used in conclusion.
Level 4: Backtrace:

k is used in conclusion.
Level 3: Backtrace:

k is used in conclusion.