Goal:
  
  A : Type
  P : tree A -> Type
  empty : P Empty
  node : forall l : tree A,
         P l ->
         forall (o : option A) (r : tree A),
         P r -> not_trivially_empty l o r -> P (Node l o r)
  l : tree' A
  x : A
  ============================
   True


DEBUG:Going to execute:
try (solve
            [ red; intros; destruct_conjs; autoinjections; discriminates ])
Level 2: Backtrace:

No primitive equality found.
Level 2: Backtrace:

No primitive equality found.
Level 1: Backtrace:

No primitive equality found.
Level 0: Backtrace:

No primitive equality found.