Goal:
  
  A : Type
  B : Type
  C : Type
  P : A → B → C → Prop
  p : A → B → C → bool
  a : A
  l : list A
  b : B
  l' : list B
  c : C
  l'' : list C
  Hp : ∀ (x : A) (y : B) (z : C), reflect (P x y z) (p x y z)
  IHl : ∀ (l' : list B) (l'' : list C),
          forallb3 p l l' l'' → Forall3 P l l' l''
  pa : is_true true
  pl : is_true (forallb3 p l l' l'')
  p0 : P a b c
  ============================
   (P a b c)


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"