Goal:
  
  A : Type
  R : A → A → Prop
  a : A
  l : list A
  H : Forall (λ x : A, R x x) (a :: l)
  x : A
  l0 : list A
  H2 : R a a
  H3 : Forall (λ x : A, R x x) l
  H0 : x = a
  H1 : l0 = l
  H4 : Forall2 R l l
  ============================
   (R a a)


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