Goal:
  
  A : Type
  B : Type
  C : Type
  Q : C → Type
  P : C → A → Prop
  x : A
  xs : list A
  y : C
  X : Q y
  p : P y x
  h : All (P y) xs
  ============================
   (P y x)


DEBUG:Going to execute:
let do_atom := solve
           [ trivial
           with eq_true
           | reflexivity
           | symmetry; trivial
           | contradiction
           | congruence ]
           in
           let rec do_ccl :=
            try do_atom; repeat (do_intro; try do_atom); try arith_congr;
             (solve [ split; do_ccl ])
           in
           (solve [ do_atom | use_hyps; do_ccl ]) ||
             fail "Cannot solve this goal"