Goal:
  
  A : Type
  P : A → A → Type
  hd : A
  tl : list A
  tl' : list A
  h : OnOne2 P tl tl'
  x : A
  y : A
  u : list A
  v : list A
  a : P x y
  H : tl = u ++ x :: v
  H0 : tl' = u ++ y :: v
  ============================
   (hd :: tl' = (hd :: u) ++ y :: v)


DEBUG:Going to execute:
<coq-core.plugins.tauto::is_conj@0>

Goals:
  
  A : Type
  P : A → A → Type
  hd : A
  tl : list A
  tl' : list A
  h : OnOne2 P tl tl'
  x : A
  y : A
  u : list A
  v : list A
  a : P x y
  H : tl = u ++ x :: v
  H0 : tl' = u ++ y :: v
  ============================
   (P x y)

  
  A : Type
  P : A → A → Type
  hd : A
  tl : list A
  tl' : list A
  h : OnOne2 P tl tl'
  x : A
  y : A
  u : list A
  v : list A
  a : P x y
  H : tl = u ++ x :: v
  H0 : tl' = u ++ y :: v
  ============================
   (hd :: tl = (hd :: u) ++ x :: v)

  
  A : Type
  P : A → A → Type
  hd : A
  tl : list A
  tl' : list A
  h : OnOne2 P tl tl'
  x : A
  y : A
  u : list A
  v : list A
  a : P x y
  H : tl = u ++ x :: v
  H0 : tl' = u ++ y :: v
  ============================
   (hd :: tl' = (hd :: u) ++ y :: v)


DEBUG:Going to execute:
<Coq.Init.Tauto.axioms> flags ||
             match reverse goal with
             | id:(?X1 → ?X2) → ?X3
               |- _ =>
                   Ltac.cut X3;
                    [ intro; clear id; t_tauto_intuit
                    | Ltac.cut (X1 → X2);
                       [ exact
                       id
                       | generalize (λ y : X2, id (λ x : X1, y)); intro;
                          clear id; (solve [ t_tauto_intuit ]) ] ]
             | id:¬ ?X1 → ?X3
               |- _ =>
                   Ltac.cut X3;
                    [ intro; clear id; t_tauto_intuit
                    | Ltac.cut (¬ X1);
                       [ exact
                       id
                       | clear id; intro; (solve [ t_tauto_intuit ]) ] ]
             | |- ?X1 =>
                   <Coq.Init.Tauto.is_disj> flags X1; (solve
                    [ Ltac.left; t_tauto_intuit
                    | Ltac.right; t_tauto_intuit ])
             end ||
               match goal with
               | |- _ → _ => intro; t_tauto_intuit
               | |- _ => t_reduce; t_solver
               end || t_solver
Level 2: evaluation returns
<coq-core.plugins.tauto::is_conj@0>
where
tauto_flags := 
of type
tauto_flags
X1 := hd :: tl' = (hd :: u) ++ y :: v
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:

No matching clauses for match.
Level 0: Backtrace:

No matching clauses for match.