Goal:
  
  T : Type -> Type
  M : Monad T
  A : Type
  P : A -> Type
  Q : A -> Type
  f : forall x : A, ∥ Q x ∥ -> T (∥ P x ∥)
  l0 : list A
  a : A
  l : list A
  allq : ∥ All Q (a :: l) ∥
  X : ∥ P a ∥
  ============================
   (∥ All Q l ∥)


DEBUG:Going to execute:
Tactics.program_solve_wf