Goal:
  
  A : Type
  P : list A → list A → A → A → Type
  Q : list A → A → Type
  d : A
  d' : A
  Γ : list A
  Γ' : list A
  X : All2_fold (λ (Γ Γ' : list A) (x y : A), Q Γ x × Q Γ' y × P Γ Γ' x y) Γ
        Γ'
  a : Q Γ d
  a0 : All2_fold P Γ Γ'
  a1 : Q Γ' d'
  b1 : P Γ Γ' d d'
  a2 : All_fold Q Γ
  b : All_fold Q Γ'
  ============================
   (All2_fold P (d :: Γ) (d' :: Γ'))


DEBUG:Going to execute:
match goal with
           | |- _ → _ => intro; t_tauto_intuit
           | |- _ => t_reduce; t_solver
           end || t_solver
Level 2: evaluation returns
<coq-core.plugins.tauto::is_disj@0>
where
tauto_flags := 
of type
tauto_flags
X1 := All2_fold P (d :: Γ) (d' :: Γ')
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 0: Backtrace:

Tactic failure.