Goal:
  
  A : Type
  P : nat → A → A → Type
  Q : nat → A → A → Type
  i : nat
  hd : A
  hd' : A
  tl : list A
  p : P i hd hd'
  X : ∀ (i : nat) (x y : A), P i x y → Q i x y
  ============================
   (Q i hd hd')


DEBUG:Going to execute:
fun flags =>
             match reverse goal with
             | |- ?X1 =>
                   <Coq.Init.Tauto.is_unit_or_eq> flags X1; constructor 1
             | H:?X1 |- _ => <Coq.Init.Tauto.is_empty> flags X1; elim H
             | _ => Ltac.assumption
             end