Goal:
  
  A : Type
  B : Type
  P : B → A → A → Prop
  h : ∀ b : B, Transitive (P b)
  l'' : list A
  x : B
  y : A
  z : A
  l : list B
  l' : list A
  l''0 : list A
  H : P x y z
  hl : Forall3 P l l' l''0
  IHhl : ∀ l'' : list A, Forall3 P l l''0 l'' → Forall3 P l l' l''
  z0 : A
  l''1 : list A
  H0 : P x z z0
  H1 : Forall3 P l l''0 l''1
  ============================
   (P x z z0)


DEBUG:Going to execute:
let rec use_hyps :=
            match goal with
            | H:_ ∧ _ |- _ => exact H || (destruct_hyp H; use_hyps)
            | H:_ * _ |- _ => exact H || (destruct_hyp H; use_hyps)
            | H:_ |- _ => solve [ inversion H ]
            | _ => idtac
            end
           in
           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"