Goal:
  
  A : Type
  P : nat → A → A → Type
  Q : nat → A → A → Type
  i : nat
  hd : A
  hd' : A
  tl : list A
  p : P i hd hd'
  HPQ : ∀ (i : nat) (x y : A), P i x y → ∑ z : A, Q i x z × Q i y z
  x : A
  q : Q i hd x
  q0 : Q i hd' x
  ============================
   (OnOne2i Q i (hd :: tl) (x :: tl) × OnOne2i Q i (hd' :: tl) (x :: tl))


DEBUG:Going to execute:
<Coq.Init.Tauto.simplif> flags;
            <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