Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  Γ : list A
  Γ' : list A
  a : A
  Δ : list A
  a0 : A
  Δ' : list A
  H : S #|Δ| = S #|Δ'|
  H' : All2_fold P (Δ ++ Γ) (Δ' ++ Γ')
  p : P (Δ ++ Γ) (Δ' ++ Γ') a a0
  a1 : All2_fold P Γ Γ'
  b : All2_fold (λ Δ Δ' : list A, P (Δ ++ Γ) (Δ' ++ Γ')) Δ Δ'
  ============================
   (All2_fold (λ Δ Δ' : list A, P (Δ ++ Γ) (Δ' ++ Γ')) (a :: Δ) (a0 :: Δ'))


DEBUG:Going to execute:
<Coq.Init.Tauto.find_cut>
            ltac:(fun id0 id1 X2 =>
                    assert X2; [ exact (id0 id1) | clear id0 ])
Level 2: evaluation returns
<coq-core.plugins.tauto::is_disj@0>
where
tauto_flags := 
of type
tauto_flags
X1 := All2_fold (λ Δ Δ' : list A, P (Δ ++ Γ) (Δ' ++ Γ')) Δ Δ'
of type
constr of type tacvalue

Level 2: Backtrace:

Tactic failure.
Level 2: Backtrace:

Tactic failure.
Level 1: Backtrace:

Tactic failure.
Level 1: Backtrace:

Tactic failure.
Level 1: Backtrace:

Tactic failure.
Level 1: Backtrace:

Tactic failure.