Goal:
  
  A : Type
  B : Type
  R : A → B → Prop
  P : ∀ (x : list A) (y : list B), Forall2 R x y → Type
  Hn : P [] [] (Forall2_nil R)
  Hc : ∀ (x : A) (y : B) (l : list A) (l' : list B) 
         (r : R x y) (a : Forall2 R l l'),
         P l l' a → P (x :: l) (y :: l') (Forall2_cons x y r a)
  y : B
  ys : list B
  H : Forall2 R [] (y :: ys)
  ============================
   (False → P [] (y :: ys) H)


DEBUG:Going to execute:
solve [ destruct 1 ]
Level 0: Backtrace:

Proof is not complete.
Level 0: Backtrace:

No applicable tactic.