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 ∥)
  n : nat
  x : A
  hnth : nth_error l n = Some x
  px : P (S (k + n)) x
  X : P (k + 0) a
  ============================
   (P (S (k + n)) x)


DEBUG:Going to execute:
MCPrelude.easy0 || (solve [ intuition eauto  3 with core terms ])