Goal:
  
  A : Type
  P : list A → A → Type
  a : A
  Γ : list A
  Δ : list A
  IHΓ : All_fold P (Γ ++ Δ)
        → All_fold P Δ × All_fold (λ Γ : list A, P (Γ ++ Δ)) Γ
  X : All_fold P (Γ ++ Δ)
  p : P (Γ ++ Δ) a
  ============================
   (All_fold (λ Γ : list A, P (Γ ++ Δ)) Γ)


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 := P (Γ ++ Δ) a
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.