Goal:
  
  A : Type
  P : nat → A → Type
  x : A
  l : list A
  IHl : ∀ k : nat,
          Alli P k l
          → Alli (λ k' : nat, P (Nat.pred #|l| - k' + k)) 0 (List.rev l)
  k : nat
  a : Alli P k l
  b : Alli P (#|l| + k) [x]
  ============================
   (Alli (λ k' : nat, P (Nat.pred #|l ++ [x]| - k' + k)) 0
      (List.rev (l ++ [x])))


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 := Alli (λ k' : nat, P (Nat.pred #|l ++ [x]| - k' + k)) 0
        (List.rev (l ++ [x]))
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.