"lift"
LambdaLift:
 Results:
  case fullyLazyLift (EVar ?) of _ : x -> x ==> ! Prelude.head: empty list
  case addLevels (EVar ?) of (,) x _ -> x ==> ! Prelude.head: empty list
  case rename (EVar ?) of EVar x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EVar ?) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EVar ?) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EVar ?) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EVar ?)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton ?) ([]) ==> ! Prelude.head: empty list
  case addLevels (EVar ?) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EVar ?) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EVar ?)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) (setSingleton ?) (ALam ?1 ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) ?1 (AVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case rename (EVar ?) of EVar x -> x ==> ! Prelude.head: empty list
  case case rename_e ([]) ? (EVar ?1) of (,) _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  float (ELam ? (ELet ?1 ([]) ?2)) ==> ! Prelude.head: empty list
  case case fullyLazyLift (EVar ?) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EVar ?) ?1) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EVar ?)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EVar ?) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EVar ?) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EVar ?) ?1) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EVar ?)) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EVar ?)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EVar ?) ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EVar ?))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton ?) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setFromList ? (: ?1 ([]))) ([]) ==> ! Prelude.head: empty list
  case addLevels (EVar ?) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EVar ?) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EVar ?) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EVar ?1)) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EVar ?)) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EVar ?1)) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EVar ?1) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EVar ?)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (EConst ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EVar ?1) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (ELam ([]) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) (setSingleton ?) (ALam ?1 ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) ?1 (AVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e1 ? (ALam ([]) ((,) -1 ?1)) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e1 ? (ALam ([]) ((,) 0 ?1)) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e1 ? (ALam ([]) ((,) 1 ?1)) of ELam _ x -> x ==> ! Prelude.head: empty list
  case rename (EVar ?) of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (EAp (EVar ?) ?1) of EAp x _ -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (EAp ? (EVar ?1)) of EAp _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (ELam ([]) (EVar ?)) of ELam _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (ELet ? ([]) (EVar ?1)) of ELet _ _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename_e ([]) ? (EVar ?1) of (,) _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (ELam ?1 (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EVar ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (ELet ?1 ([]) ?2)) ?3) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EConst ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (ELam ?1 (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EVar ?1) (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EVar ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EConst ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELet ?1 ([]) ?2) ?3)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EConst ?1) (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (ELet ?1 ([]) ?2)) ==> ! Prelude.head: empty list
  case float_e (ELam ? (ELet ?1 ([]) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EVar ?) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EVar ?) ?1) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EVar ?) ?1) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EVar ?1)) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EVar ?)) ?1) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ([]) (EVar ?1)) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EVar ?1) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EVar ?)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EVar ?) ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELam ([]) (EVar ?))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELet ? ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EVar ?1) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELam ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EVar ?) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EVar ?) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EVar ?) ?1) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EVar ?)) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EVar ?) ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EVar ?)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EVar ?) ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EVar ?) ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EVar ?)) ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EVar ?))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EVar ?) ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: ? ?1) ([])) (EVar ([]))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ([]) ([])) (EVar (: ? ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet False (: ((,) ? (EVar ?1)) ([])) (EConst ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton ?) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton ([])) (: ((,) (: ? ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: ? ?1)) (: ((,) ([]) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setFromList ? (: ?1 ([]))) ([]) ==> ! Prelude.head: empty list
  case addLevels (EVar ?) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EVar ?) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EVar ?) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EVar ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EVar ?1)) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EVar ?)) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar ?) (EConst ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELam ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EVar ?1)) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EVar ?1) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp (EVar ?) ?1) of (,) _ x -> x of AAp x _ -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp ? (EVar ?1)) of (,) _ x -> x of AAp _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EVar ?)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: ? ?1) ([])) (EVar ([]))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: ([]) ([])) (EVar (: ? ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (ELam ?1 (EConst ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (EConst ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (EConst ?1)) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet False ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet True ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam ([]) (EVar ?)) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EVar ?1) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (ELam ?1 (EConst ?2)) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (ELam ([]) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELet ? ([]) (EVar ?1)) of (,) _ x -> x of ALet _ _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AAp ((,) ?1 (AVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AAp ((,) (setSingleton ?1) (ALam ?2 ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AAp ((,) (setEmpty) (ALam ?1 ?2)) ((,) ?3 (AVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AAp ((,) ?1 (AConst ?2)) ((,) ?3 (AVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (AAp ((,) ?1 (AConst ?2)) ((,) (setSingleton ?3) (ALam ?4 ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) (setSingleton ?) (ALam ?1 ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) (setFromList ? (: ?1 ([]))) (ALam ?2 ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (ALet ?1 ([]) ((,) ?2 (AVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel ((,) ? (ALet ?1 ([]) ((,) (setSingleton ?2) (ALam ?3 ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) ?1 (AVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) ?1 (AAp ((,) ?2 (AVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) ?1 (AAp ((,) ?2 (AConst ?3)) ((,) ?4 (AVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) (setSingleton ?1) (ALam ?2 ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeToLevel_e ? ([]) ((,) ?1 (ALet ?2 ([]) ((,) ?3 (AVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case identifyMFEs ((,) 0 (ALam ([]) ((,) -1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs ((,) 0 (ALam ([]) ((,) 0 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs ((,) 0 (ALam ([]) ((,) 1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e -1 ((,) -1 (ALam ([]) ((,) -1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e -1 ((,) -1 (ALam ([]) ((,) 0 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e -1 ((,) -1 (ALam ([]) ((,) 1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e 0 ((,) 0 (ALam ([]) ((,) -1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e 0 ((,) 0 (ALam ([]) ((,) 0 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e 0 ((,) 0 (ALam ([]) ((,) 1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e 1 ((,) 1 (ALam ([]) ((,) -1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e 1 ((,) 1 (ALam ([]) ((,) 0 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e 1 ((,) 1 (ALam ([]) ((,) 1 ?))) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e1 ? (ALam ([]) ((,) -1 ?1)) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e1 ? (ALam ([]) ((,) 0 ?1)) of ELam _ x -> x ==> ! Prelude.head: empty list
  case identifyMFEs_e1 ? (ALam ([]) ((,) 1 ?1)) of ELam _ x -> x ==> ! Prelude.head: empty list
  case rename (EVar ?) of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (EAp (EVar ?) ?1) of EAp x _ -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (EAp ? (EVar ?1)) of EAp _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (ELam ([]) (EVar ?)) of ELam _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename (ELet ? ([]) (EVar ?1)) of ELet _ _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case rename_e ([]) ? (EVar ?1) of (,) _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case case rename_e ([]) ? (EAp (EVar ?1) ?2) of (,) _ x -> x of EAp x _ -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case case rename_e ([]) ? (EAp ?1 (EVar ?2)) of (,) _ x -> x of EAp _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case case rename_e ([]) ? (ELam ([]) (EVar ?1)) of (,) _ x -> x of ELam _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  case case case rename_e ([]) ? (ELet ?1 ([]) (EVar ?2)) of (,) _ x -> x of ELet _ _ x -> x of EVar x -> x ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (EAp (EVar ?1) (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (EAp (ELam ?1 (ELet ?2 ([]) ?3)) ?4)) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (EAp (EConst ?1) (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (ELam ?1 (EAp (EVar ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (ELam ?1 (EAp (ELet ?2 ([]) ?3) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (ELam ?1 (EAp (EConst ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (ELam ?1 (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EVar ?) (ELam ?1 (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (EAp (EAp (EVar ?) (EVar ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EAp (EVar ?) (ELam ?1 (ELet ?2 ([]) ?3))) ?4) ==> ! Prelude.head: empty list
  float (EAp (EAp (EVar ?) (EConst ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EAp (ELam ? (EVar ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ?5) ==> ! Prelude.head: empty list
  float (EAp (EAp (ELam ? (ELet ?1 ([]) ?2)) ?3) ?4) ==> ! Prelude.head: empty list
  float (EAp (EAp (ELam ? (EConst ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ?5) ==> ! Prelude.head: empty list
  float (EAp (EAp (EConst ?) (EVar ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EAp (EConst ?) (ELam ?1 (ELet ?2 ([]) ?3))) ?4) ==> ! Prelude.head: empty list
  float (EAp (EAp (EConst ?) (EConst ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EVar ?1)) (EAp (ELam ?2 (ELet ?3 ([]) ?4)) ?5)) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EVar ?1)) (ELam ?2 (EAp (ELet ?3 ([]) ?4) ?5))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EVar ?1)) (ELam ?2 (ELam ?3 (ELet ?4 ([]) ?5)))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EVar ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EAp (EVar ?1) (ELet ?2 ([]) ?3))) ?4) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EAp (ELam ?1 (EVar ?2)) (ELet ?3 ([]) ?4))) ?5) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EAp (ELam ?1 (EConst ?2)) (ELet ?3 ([]) ?4))) ?5) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EAp (ELet ?1 ([]) ?2) ?3)) ?4) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EAp (EConst ?1) (ELet ?2 ([]) ?3))) ?4) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (ELam ?1 (EVar ?2))) (ELam ?3 (ELet ?4 ([]) ?5))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (ELam ?1 (ELet ?2 ([]) ?3))) ?4) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELam ?3 (ELet ?4 ([]) ?5))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (ELet ?1 ([]) ?2)) ?3) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EConst ?1)) (EAp (ELam ?2 (ELet ?3 ([]) ?4)) ?5)) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EConst ?1)) (ELam ?2 (EAp (ELet ?3 ([]) ?4) ?5))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EConst ?1)) (ELam ?2 (ELam ?3 (ELet ?4 ([]) ?5)))) ==> ! Prelude.head: empty list
  float (EAp (ELam ? (EConst ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (EAp (EVar ?1) (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (EAp (ELam ?1 (ELet ?2 ([]) ?3)) ?4)) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (EAp (EConst ?1) (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (ELam ?1 (EAp (EVar ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (ELam ?1 (EAp (ELet ?2 ([]) ?3) ?4))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (ELam ?1 (EAp (EConst ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (ELam ?1 (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (EAp (EConst ?) (ELam ?1 (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EVar ?1) (EAp (EVar ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EVar ?1) (EAp (ELet ?2 ([]) ?3) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EVar ?1) (EAp (EConst ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EVar ?1) (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EVar ?1) (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (EVar ?1) (EVar ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (EVar ?1) (ELet ?2 ([]) ?3)) ?4)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (EVar ?1) (EConst ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (ELam ?1 (EVar ?2)) (ELet ?3 ([]) ?4)) ?5)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (ELam ?1 (EConst ?2)) (ELet ?3 ([]) ?4)) ?5)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (ELet ?1 ([]) ?2) ?3) ?4)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (EConst ?1) (EVar ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (EConst ?1) (ELet ?2 ([]) ?3)) ?4)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EAp (EConst ?1) (EConst ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EVar ?2)) (EAp (ELet ?3 ([]) ?4) ?5))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EVar ?2)) (ELam ?3 (ELet ?4 ([]) ?5)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EVar ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (ELam ?2 (EVar ?3))) (ELet ?4 ([]) ?5))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (ELam ?2 (EConst ?3))) (ELet ?4 ([]) ?5))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (ELet ?2 ([]) ?3)) ?4)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EConst ?2)) (EAp (ELet ?3 ([]) ?4) ?5))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EConst ?2)) (ELam ?3 (ELet ?4 ([]) ?5)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELam ?1 (EConst ?2)) (ELet ?3 ([]) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (ELet ?1 ([]) ?2) ?3)) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EConst ?1) (EAp (EVar ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EConst ?1) (EAp (ELet ?2 ([]) ?3) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EConst ?1) (EAp (EConst ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EConst ?1) (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (EAp (EConst ?1) (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (EAp (EVar ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (EAp (ELam ?2 (EVar ?3)) (ELet ?4 ([]) ?5)))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (EAp (ELam ?2 (EConst ?3)) (ELet ?4 ([]) ?5)))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (EAp (ELet ?2 ([]) ?3) ?4))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (EAp (EConst ?2) (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (ELam ?2 (ELet ?3 ([]) ?4)))) ==> ! Prelude.head: empty list
  float (ELam ? (ELam ?1 (ELet ?2 ([]) ?3))) ==> ! Prelude.head: empty list
  float (ELam ? (ELet ?1 ([]) ?2)) ==> ! Prelude.head: empty list
  case float (ELet ? ([]) (ELam ?1 (ELet ?2 ([]) ?3))) of ELet _ _ x -> x ==> ! Prelude.head: empty list
  case float_e (EAp (EVar ?) (ELam ?1 (ELet ?2 ([]) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (EAp (ELam ? (EVar ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (EAp (ELam ? (ELet ?1 ([]) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (EAp (ELam ? (EConst ?1)) (ELam ?2 (ELet ?3 ([]) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (EAp (EConst ?) (ELam ?1 (ELet ?2 ([]) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (EAp (EVar ?1) (ELet ?2 ([]) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (EAp (ELam ?1 (EVar ?2)) (ELet ?3 ([]) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (EAp (ELam ?1 (EConst ?2)) (ELet ?3 ([]) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (EAp (ELet ?1 ([]) ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (EAp (EConst ?1) (ELet ?2 ([]) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (ELam ?1 (ELet ?2 ([]) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case float_e (ELam ? (ELet ?1 ([]) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case float_e (ELam ? (ELet ?1 ([]) ?2)) of (,) _ x -> x of ELam _ x -> x ==> ! Prelude.head: empty list
  case case case float_e (ELet ? ([]) ?1) of (,) x _ -> x of x : _ -> x of (,,) x _ _ -> x ==> ! Prelude.head: empty list
  case float_defn ? ((,) ((,) ?1 ?2) (ELam ?3 (ELet ?4 ([]) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case freeVars (EAp (EAp (ELam ? (EVar ?1)) (ELam ?2 (EAp (EVar ?3) (ELet ?4 ?5 ?6)))) ?7) of (,) x _ -> x ==> ! <allocated too much memory!>
  case collectSCs (EAp (ELam ? (EConst ?1)) (ELam ?2 (EAp (EConst ?3) (EAp (ELet ?4 ?5 ?6) ?7)))) of _ : x -> x ==> ! <allocated too much memory!>
  case case fullyLazyLift (EVar ?) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EVar ?) ?1) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EVar ?) ?1) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EVar ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EVar ?1)) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2)) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EConst ?1)) (EVar ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) ?5) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) ?4) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) ?5) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EVar ?6)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EVar ?4) ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EVar ?1)) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EConst ?1))) (EVar ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (ELam ([]) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EVar ?)) ?1) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EAp (EVar ?) ?1)) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EConst ?1))) (EVar ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EConst ?))) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (EVar ?1))) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EVar ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EAp (EVar ?1) ?2) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EConst ?1) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (ELam ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (ELet ?1 ([]) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam (: (: ? ?1) ([])) (EVar ([]))) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam (: ([]) ([])) (EVar (: ? ?1))) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EVar ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EAp (EVar ?2) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ([]) (EVar ?1)) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EVar ?4) ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EVar ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EAp (EVar ?3) ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EVar ?5) ?6) ?7)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EVar ?6))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ([]) (EVar ?5))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EVar ?6))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EVar ?4)) ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EVar ?3)) ?4)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EVar ?4)) ?5)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EVar ?4) ?5))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EVar ?3) ?4))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EVar ?4) ?5))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EVar ?1) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EConst ?1)) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELam ([]) (ELam ([]) (EVar ?1)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELam ([]) (ELet ?1 ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EVar ?)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EVar ?) ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EAp (EVar ?) ?1) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EVar ?)) ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EConst ?)) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (EVar ?1)) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EConst ?) (ELam ([]) (EVar ?1)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELam ([]) (EVar ?))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EVar ?) ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EConst ?) (EVar ?1)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELam ([]) (ELam ([]) (EVar ?)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELam ([]) (ELet ? ([]) (EVar ?1)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELet ? ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EVar ?1) ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EConst ?1) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELet ? ([]) (ELam ([]) (EVar ?1)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam ([]) (ELet ? ([]) (ELet ?1 ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam (: (: ? ?1) ([])) (EVar ([]))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam (: ([]) ([])) (EVar (: ? ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam (: ? ([])) (ELet False ([]) (EConst ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELam (: ? ([])) (ELet True ([]) (EConst ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EVar ?1)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EVar ?1) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EConst ?1)) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELam ([]) (EVar ?1))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EVar ?1) ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELam ([]) (ELam ([]) (EVar ?1)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELam ([]) (ELet ?1 ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case case fullyLazyLift (ELet False (: ((,) ? (EVar ?1)) ([])) (EConst ?2)) of x : _ -> x of (,,) _ _ x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EVar ?) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EVar ?) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EVar ?) ?1) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EVar ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELam ([]) (EConst ?)) (EVar ?1)) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2)) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELam ([]) (EConst ?)) (EConst ?1)) (EVar ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) ?5) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) ?4) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) ?5) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EVar ?6)) ?7) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EVar ?4) ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EConst ?4)) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (ELam ([]) (EConst ?1))) (EVar ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EConst ?4)) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELam ([]) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EAp (EVar ?) ?1)) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EAp (EConst ?) (EConst ?1))) (EVar ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (ELam ([]) (EConst ?))) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (ELet ? ([]) (EVar ?1))) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EVar ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EConst ?3)) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EAp (EAp (EVar ?1) ?2) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EAp (EConst ?1) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (ELam ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (ELet ?1 ([]) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EConst ?1)) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam ([]) (EConst ?)) (EConst ?1)) (EAp (EVar ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam (: (: ? ?1) ([])) (EVar ([]))) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam (: ([]) ([])) (EVar (: ? ?1))) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam (: ? ([])) (EConst ?1)) (EVar ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam (: ? ([])) (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELam (: ? ([])) (EConst ?1)) (EConst ?2)) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EVar ?4) ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EConst ?4)) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EVar ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EAp (EVar ?3) ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EConst ?3)) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) ?7) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EVar ?5) ?6) ?7)) ?8) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EVar ?6))) ?7) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ([]) (EVar ?5))) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EVar ?6))) ?7) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ?6 (EConst ?7))) (EVar ?8)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EConst ?5)) (EVar ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EConst ?5)) (EAp (EVar ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EVar ?4)) ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EVar ?3)) ?4)) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EVar ?4)) ?5)) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6))) ?7) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EVar ?4) ?5))) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EConst ?4))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EVar ?3) ?4))) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EVar ?4) ?5))) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (ELet ?5 ?6 (EConst ?7)))) (EVar ?8)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EVar ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EAp (EVar ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EVar ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EAp (EVar ?4) ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EConst ?4) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (ELam ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (ELet ?4 ([]) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (ELam ([]) (EConst ?1)) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EConst ?4))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ?3 (EConst ?4)))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (ELam ([]) (EVar ?1)))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (ELet ?1 ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (ELet ?1 ?2 (EConst ?3)))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EConst ?1))) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam ([]) (EConst ?1))) (EAp (EVar ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELam (: ?1 ([])) (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EAp (EConst ?3) (EConst ?4)))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELam ([]) (EConst ?3)))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5)))) (EVar ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5)))) (EAp (EVar ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EAp (EVar ?4) ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EConst ?4) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (ELam ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (ELet ?4 ([]) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EAp (EVar ?2) ?3) ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EConst ?2) (EVar ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELam ([]) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELet ?2 ([]) (EVar ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EAp (EVar ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (ELam ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (ELam ([]) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EAp (EVar ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EVar ?)) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EVar ?) ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EAp (EVar ?) ?1) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (ELam ([]) (EVar ?)) ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (ELam ([]) (EConst ?)) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (ELet ? ([]) (EVar ?1)) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4))) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (ELam ([]) (EVar ?1)))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3)))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EConst ?1))) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EAp (EConst ?) (EConst ?1))) (EAp (EVar ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EAp (EVar ?) ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EAp (EConst ?) (EVar ?1)))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (ELam ([]) (EVar ?)))) ?1) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (ELet ? ([]) (EVar ?1)))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (ELet ? ?1 (EConst ?2)))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EConst ?))) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam ([]) (EConst ?))) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELam (: ? ([])) (EConst ?1))) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (EAp (EVar ?1) ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (EAp (EConst ?1) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EAp (EConst ?2) (EConst ?3)))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (ELam ([]) (EVar ?1)))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (ELam ([]) (EConst ?2)))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ([]) (ELet ?1 ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (ELet ?2 ?3 (EConst ?4)))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (ELet ?2 ?3 (EConst ?4)))) (EAp (EVar ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EAp (EAp (EVar ?3) ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EAp (EConst ?3) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (ELam ([]) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (ELet ?3 ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EAp (EVar ?1) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EAp (EAp (EVar ?1) ?2) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (ELam ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (ELam ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam ([]) (EConst ?)) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ([]) ([])) (EVar ([]))) (EVar ?)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: (: ? ?1) ([])) (EVar ([]))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ([]) ([])) (EVar (: ? ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (ELam ([]) (EConst ?1))) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EVar ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EAp (EVar ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (ELam ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? ([])) (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? (: ?1 ([]))) (EConst ?2)) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELam (: ? (: ?1 ([]))) (EConst ?2)) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EVar ?1)) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EAp (EConst ?2) (EConst ?3)) (EConst ?4))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2)) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (ELam ([]) (EConst ?1)) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (ELam ([]) (EConst ?2)) (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) ?5) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) ?6) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (ELet ?5 ?6 (EConst ?7)))) (EVar ?8)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (EConst ?5))) (EVar ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (EConst ?5))) (EAp (EVar ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EAp (EConst ?3) (EConst ?4)))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (ELam ([]) (EConst ?3)))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (ELet ?3 ?4 (EConst ?5)))) (EVar ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (ELet ?3 ?4 (EConst ?5)))) (EAp (EVar ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EVar ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EAp (EVar ?4) ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EConst ?4) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (ELam ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (ELet ?4 ([]) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (EAp (EVar ?1) ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EAp (EConst ?2) (EConst ?3)))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (ELam ([]) (EVar ?1)))) ?2) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (ELam ([]) (EConst ?2)))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELam ([]) (ELet ?1 ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (ELet ?2 ?3 (EConst ?4)))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (ELet ?2 ?3 (EConst ?4)))) (EAp (EVar ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EAp (EAp (EVar ?3) ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EAp (EConst ?3) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (ELam ([]) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (ELet ?3 ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam (: ?2 ([])) (EConst ?3))) (EVar ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELam (: ?2 ([])) (EConst ?3))) (EAp (EVar ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EAp (EConst ?4) (EConst ?5)))) (EVar ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EAp (EConst ?4) (EConst ?5)))) (EAp (EVar ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) ?3) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ([]) (EConst ?4)))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ([]) (EConst ?4)))) (EAp (EVar ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ([]) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) ?4) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EVar ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EAp (EVar ?7) ?8)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EAp (EAp (EVar ?7) ?8) ?9)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EAp (EConst ?7) (EVar ?8))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (ELam ([]) (EVar ?7))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (ELet ?7 ([]) (EVar ?8))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EVar ?5) ?6) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EAp (EVar ?5) ?6) ?7) ?8)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EConst ?5) (EVar ?6)) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELam ([]) (EVar ?5)) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELet ?5 ([]) (EVar ?6)) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELet ?5 ?6 (EConst ?7)) (EVar ?8))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EVar ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EAp (EVar ?6) ?7))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ([]) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ([]) (EAp (EVar ?5) ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EVar ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EAp (EVar ?6) ?7))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EAp (EVar ?3) ?4) ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EAp (EConst ?3) (EVar ?4)) ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELam ([]) (EVar ?3)) ?4) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELet ?3 ([]) (EVar ?4)) ?5) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6)) ?7)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EVar ?4)) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EAp (EVar ?4) ?5)) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EConst ?4)) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EVar ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EAp (EVar ?3) ?4)) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EVar ?4)) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EAp (EVar ?4) ?5)) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (ELet ?5 ?6 (EConst ?7))) (EVar ?8))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EAp (EVar ?6) ?7))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EVar ?4) ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EAp (EVar ?4) ?5) ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EConst ?4) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (ELam ([]) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (ELet ?4 ([]) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EVar ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EAp (EVar ?3) ?4) ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EConst ?3) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (ELam ([]) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (ELet ?3 ([]) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EVar ?4) ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EAp (EVar ?4) ?5) ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EConst ?4) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (ELam ([]) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (ELet ?4 ([]) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EAp (EVar ?1) ?2) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EAp (EConst ?1) (EVar ?2)) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (ELam ([]) (EVar ?1)) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (ELam ([]) (EConst ?1)) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (ELet ?1 ([]) (EVar ?2)) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5)) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EConst ?4)) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EAp (EVar ?2) ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELam ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELet ?2 ?3 (EConst ?4))) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EAp (EVar ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EAp (EVar ?1) ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EAp (EConst ?1) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (ELam ([]) (EVar ?1))) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (ELet ?1 ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (ELet ?1 ?2 (EConst ?3))) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EConst ?1)) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam ([]) (EConst ?1)) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELam (: ?1 ([])) (EConst ?2)) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (EAp (EVar ?2) ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EAp (EConst ?3) (EConst ?4))) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (ELam ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELam ([]) (EConst ?3))) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5))) (EVar ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5))) (EAp (EVar ?6) ?7))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EAp (EVar ?4) ?5) ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EConst ?4) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (ELam ([]) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (ELet ?4 ([]) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EAp (EVar ?2) ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EAp (EConst ?2) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELam ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELet ?2 ([]) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (ELam ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EAp (EVar ?1) ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (ELam ([]) (EVar ?1)) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (ELam ([]) (EVar ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (ELam ([]) (EAp (EVar ?1) ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (ELet ?1 ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam (: (: ?1 ?2) ([])) (EVar ([])))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELam (: ([]) ([])) (EVar (: ?1 ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EAp (EVar ?2) ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EAp (EConst ?2) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELam ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELet ?2 ([]) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (ELam ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EVar ?)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EVar ?) ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EVar ?) ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (ELam ([]) (EConst ?)) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EVar ?)) ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EAp (EVar ?) ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (ELet ? ([]) (EVar ?1))) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (ELet ? ?1 (EConst ?2))) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EConst ?)) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam ([]) (EConst ?)) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELam (: ? ([])) (EConst ?1)) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (ELam ([]) (EConst ?2))) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (ELam ([]) (EVar ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EVar ?))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EVar ?) ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EAp (EVar ?) ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (ELam ([]) (EVar ?)) ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (ELet ? ([]) (EVar ?1)) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EConst ?) (EVar ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (ELam ([]) (EVar ?)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (ELam ([]) (EAp (EVar ?) ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (ELet ? ([]) (EVar ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam ([]) (ELet ? ([]) (EAp (EVar ?1) ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam (: (: ? ?1) ([])) (EVar ([])))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELam (: ([]) ([])) (EVar (: ? ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EConst ?1) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (ELam ([]) (EVar ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (ELam ([]) (EAp (EVar ?1) ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (ELet ?1 ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam ([]) (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: ? ?1) ([])) (EVar ([]))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ([]) ([])) (EVar (: ? ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: 'a' ?) ([])) (EVar (: '\NUL' ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: '0' ?) ([])) (EVar (: '\NUL' ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: '\NUL' ?) ([])) (EVar (: 'a' ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: '0' ?) ([])) (EVar (: 'a' ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: '\NUL' ?) ([])) (EVar (: '0' ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: 'a' ?) ([])) (EVar (: '0' ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: ? ?1) ([])) (EAp (EVar ([])) (EConst ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ([]) ([])) (EAp (EVar (: ? ?1)) (EConst ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: ? ?1) ([])) (EAp (EConst ?2) (EVar ([])))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ([]) ([])) (EAp (EConst ?) (EVar (: ?1 ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: ? ?1) ([])) (ELam ([]) (EVar ([])))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ([]) ([])) (ELam ([]) (EVar (: ? ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ? ([])) (ELet False ([]) (EConst ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ? ([])) (ELet True ([]) (EConst ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: (: ? ?1) (: (: ?2 ?3) ([]))) (EVar ([]))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ([]) (: ([]) ([]))) (EVar (: ? ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ? (: ?1 ([]))) (ELet False ([]) (EConst ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELam (: ? (: ?1 ([]))) (ELet True ([]) (EConst ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EVar ?1)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet False (: ((,) ([]) (EVar ?)) ?1) (EVar ([]))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EVar ?1) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EAp (EVar ([])) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? (: ((,) ([]) ?1) ([])) (EAp (EVar (: ?2 ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EAp (EVar ?1) ?2) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EAp (EConst ?1) (EVar ?2)) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (ELam ([]) (EVar ?1)) ?2) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (ELam ([]) (EConst ?1)) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (ELet ?1 ([]) (EVar ?2)) ?3) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)) ?5)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5)) ?6)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EConst ?4)) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EAp (EVar ?2) ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (ELam ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (ELet ?2 ?3 (EConst ?4))) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EAp (EConst ?1) (EConst ?2)) (EAp (EVar ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EAp (EVar ?1) ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EAp (EConst ?1) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (ELam ([]) (EVar ?1))) ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (ELet ?1 ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (ELet ?1 ?2 (EConst ?3))) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EConst ?1)) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam ([]) (EConst ?1)) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELam (: ?1 ([])) (EConst ?2)) (EVar ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (EAp (EVar ?2) ?3)) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EAp (EConst ?3) (EConst ?4))) (EVar ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (ELam ([]) (EVar ?2))) ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (ELam ([]) (EConst ?3))) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3))) ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5))) (EVar ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5))) (EAp (EVar ?6) ?7))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EAp (EVar ?4) ?5) ?6))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EConst ?4) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (ELam ([]) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (ELet ?4 ([]) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EAp (EVar ?2) ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EAp (EConst ?2) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (ELam ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (ELet ?2 ([]) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (EAp (EConst ?2) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (ELam ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (EAp (EConst ?1) (ELet ?2 ([]) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EVar ?1))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EVar ?1) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EAp (EVar ?1) ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (ELam ([]) (EVar ?1)) ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (ELam ([]) (EVar ?1)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (ELam ([]) (EAp (EVar ?1) ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (ELet ?1 ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam (: (: ?1 ?2) ([])) (EVar ([])))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELam (: ([]) ([])) (EVar (: ?1 ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EAp (EVar ?2) ?3) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EAp (EConst ?2) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (ELam ([]) (EVar ?2)) ?3))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (ELet ?2 ([]) (EVar ?3)) ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (EAp (EConst ?2) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (ELam ([]) (EAp (EVar ?2) ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet ? ([]) (ELet ?1 ([]) (ELet ?2 ([]) (EAp (EVar ?3) ?4)))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet False (: ((,) ? (EVar ?1)) ([])) (ELet ?2 ?3 (EConst ?4))) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet False (: ((,) ? (EVar ?1)) ([])) (EConst ?2)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet False (: ((,) ? (EAp (EVar ?1) ?2)) ([])) (EConst ?3)) of _ : x -> x ==> ! Prelude.head: empty list
  case fullyLazyLift (ELet False (: ((,) ? ?1) (: ((,) ?2 (EVar ?3)) ([]))) (EConst ?4)) of _ : x -> x ==> ! Prelude.head: empty list
  freeSetToLevel (setDifference ? (setSingleton ?1) (setEmpty)) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setUnion ? (setSingleton ?1) (setEmpty)) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setUnion ? (setEmpty) (setSingleton ?1)) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton ?) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton ([])) (: ((,) (: ? ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: ? ?1)) (: ((,) ([]) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: '\NUL' ?)) (: ((,) (: 'a' ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: '\NUL' ?)) (: ((,) (: '0' ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: 'a' ?)) (: ((,) (: '\NUL' ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: 'a' ?)) (: ((,) (: '0' ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: '0' ?)) (: ((,) (: '\NUL' ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setSingleton (: '0' ?)) (: ((,) (: 'a' ?1) ?2) ([])) ==> ! Prelude.head: empty list
  freeSetToLevel (setUnionList ? (: (setSingleton ?1) ([]))) ([]) ==> ! Prelude.head: empty list
  freeSetToLevel (setFromList ? (: ?1 ([]))) ([]) ==> ! Prelude.head: empty list
  case addLevels (EVar ?) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EVar ?) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EVar ?) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EAp (EVar ?) ?1) ?2) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (EVar ?2)) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) ?4) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (ELam ([]) (EVar ?2))) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (ELam ?2 (EConst ?3))) (EVar ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) ?4) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EConst ?3)) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) ?5) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) ?4) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ?3 (EConst ?4))) (EVar ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) ?5) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EVar ?6)) ?7) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EVar ?4) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EConst ?4)) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EVar ?1)) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EConst ?3)) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EConst ?4)) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELet ?2 ?3 (ELam ?4 ?5)) ?6)) ?7) of (,) x _ -> x ==> ! <allocated too much memory!>
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELam ([]) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELam ?2 (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EAp (EConst ?) (EConst ?1)) (EConst ?2)) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (EVar ?)) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam (: (: ? ?1) ([])) (EVar ([]))) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam (: ([]) ([])) (EVar (: ? ?1))) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (EAp (EVar ?) (EConst ?1))) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EAp (EVar ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EConst ?3)) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EAp (EVar ?3) ?4) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EConst ?3) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELam ([]) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELam ?3 (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELet ?3 ([]) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELet ?3 ?4 (EConst ?5))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (EConst ?3)) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELam ?1 (EConst ?2))) (EConst ?3)) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (ELet False ([]) (EVar ?))) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELet False ([]) (EConst ?1))) (EVar ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ([]) (ELet True ([]) (EVar ?))) ?1) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (ELet True ([]) (EConst ?1))) (EVar ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EVar ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EAp (EConst ?2) (EVar ?3)) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (ELam ([]) (EVar ?2)) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (ELam ?2 (EConst ?3)) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ([]) (EVar ?3)) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EAp (EVar ?3) ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELam ([]) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELam ?2 (ELam ?3 (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELam ?2 (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELam ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EAp (EVar ?3) ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (ELam ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ([]) (EVar ?1)) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EVar ?4) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EConst ?4)) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EVar ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EAp (EVar ?4) ?5) ?6)) ?7) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EConst ?4) (EVar ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELam ([]) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELam ?4 (EConst ?5))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELet ?4 ([]) (EVar ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELet ?4 ?5 (EConst ?6))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EConst ?4)) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EConst ?4)) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) ?7) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EVar ?5) ?6) ?7)) ?8) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EVar ?6))) ?7) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ([]) (EVar ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ?5 (EConst ?6))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EVar ?6))) ?7) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ?6 (EConst ?7))) (EVar ?8)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EConst ?5)) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EConst ?5)) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EVar ?4)) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EVar ?3)) ?4)) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ?3 (EConst ?4)) (EVar ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EVar ?4)) ?5)) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6))) ?7) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EVar ?4) ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ?3 (ELam ?4 (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ?3 (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELam ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EVar ?4) ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (ELam ?5 (EConst ?6)))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (ELet ?5 ?6 (EConst ?7)))) (EVar ?8)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ?4 (EConst ?5))) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EAp (EVar ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (EAp (EConst ?4) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (ELam ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (ELet ? ?1 (EConst ?2)) (EConst ?3)) (ELet ?4 ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EVar ?1)) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EVar ?1) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EAp (EVar ?3) ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELam ?2 (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ?3 (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EAp (EConst ?1) (EConst ?2))) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ([]) (EVar ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) (EConst ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EAp (EConst ?2) (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ([]) (ELam ([]) (EVar ?1)))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (ELam ?2 (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (ELam ?2 (EConst ?3)))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EAp (EAp (EVar ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EAp (EConst ?3) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (ELam ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (ELet ?3 ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EAp (EConst ?3) (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELam ?3 (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELam ?3 (EConst ?4)))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5)))) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EAp (EVar ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (EAp (EConst ?4) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (ELam ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (ELet ?1 ?2 (EConst ?3))) (ELet ?4 ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EAp (EVar ?2) ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EAp (EConst ?2) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELam ([]) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELam ?2 (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELet ?2 ([]) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (ELet ?2 ?3 (EConst ?4)) ?5)) of (,) x _ -> x ==> ! <allocated too much memory!>
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (EAp (EConst ?2) (EAp (EVar ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (ELam ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EAp (EConst ?) (EConst ?1)) (ELet ?2 ([]) (EAp (EVar ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EVar ?)) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam (: ([]) ([])) (EVar ([]))) (EVar ?)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam (: (: ? ?1) ([])) (EVar ([]))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam (: ([]) ([])) (EVar (: ? ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar ([])) (EVar ([])))) ?) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar ([])) (EVar (: ? ?1)))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar (: ? ?1)) (EVar ([])))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar ?) (EAp (EConst ?1) (EConst ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar ?) (ELam ?1 (EConst ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EVar ?) (EConst ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EAp (EVar ?) (EConst ?1)) (EConst ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) (EConst ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EAp (EConst ?1) (EConst ?2)) (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (ELam ([]) (EVar ?)) (EConst ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (ELam ? (EConst ?1)) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (ELam ?1 (EConst ?2)) (ELam ?3 (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (ELam ?1 (EConst ?2)) (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (ELam ?1 (EConst ?2)) (EConst ?3))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) (EConst ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EAp (EConst ?2) (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (EAp (EConst ?) (ELam ([]) (EVar ?1)))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (ELam ?2 (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (ELam ?2 (EConst ?3)))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EAp (EAp (EVar ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EAp (EConst ?3) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (ELam ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (ELet ?3 ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELam ([]) (EVar ?))) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELam ([]) (EAp (EVar ?) (EConst ?1)))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELam ([]) (EAp (EConst ?) (EVar ?1)))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EAp (EConst ?2) (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EAp (EConst ?2) (EConst ?3)))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELam ([]) (ELam ([]) (EVar ?)))) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELam ?2 (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELam ?2 (EConst ?3)))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELam ?2 (EConst ?3)))) (EAp (EAp (EVar ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELam ?2 (EConst ?3)))) (EAp (EConst ?4) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELam ?2 (EConst ?3)))) (ELam ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELam ?2 (EConst ?3)))) (ELet ?4 ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELet False ([]) (EConst ?2)))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (ELet True ([]) (EConst ?2)))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EAp (EVar ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EAp (EAp (EVar ?3) ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EAp (EConst ?3) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (ELam ([]) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (ELam ?3 (EConst ?4)) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (ELet ?3 ([]) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EConst ?3) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (EAp (EConst ?3) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELam ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELet ?3 ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELam ?1 (EConst ?2))) (ELet ?3 ([]) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELet False ([]) (EVar ?))) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELet False ([]) (ELam ?1 (EConst ?2)))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELet False ([]) (EConst ?1))) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELet False ([]) (EConst ?1))) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ([]) (ELet True ([]) (EVar ?))) ?1) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELet True ([]) (ELam ?1 (EConst ?2)))) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELet True ([]) (EConst ?1))) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (ELet True ([]) (EConst ?1))) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EVar ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EVar ?2) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EAp (EVar ?2) ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EAp (EConst ?2) (EVar ?3)) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (ELam ([]) (EVar ?2)) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (ELam ?2 (EConst ?3)) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (ELet ?2 ([]) (EVar ?3)) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EConst ?2) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EConst ?2) (EAp (EVar ?3) ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EAp (EConst ?2) (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELam ([]) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELam ?2 (ELam ?3 (EConst ?4))) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELam ?2 (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELam ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ([]) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ([]) (EAp (EVar ?3) ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ?3 (ELam ?4 (EConst ?5))) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6))) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (ELet ?2 ?3 (EConst ?4)) (EAp (EVar ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EAp (EVar ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EAp (EAp (EVar ?3) ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EAp (EConst ?3) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (ELam ([]) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (ELet ?3 ([]) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELam ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELam ([]) (EAp (EVar ?2) (EConst ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELam ([]) (EAp (EConst ?2) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELam ([]) (ELam ([]) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EAp (EVar ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EAp (EAp (EVar ?3) ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (EAp (EConst ?3) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (ELam ([]) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELam ? (EConst ?1)) (ELet ?2 ([]) (ELet ?3 ([]) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EVar ?1)) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EVar ?1) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EAp (EConst ?2) (EConst ?3)) (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (ELam ([]) (EVar ?1)) ?2)) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (ELam ?1 (EConst ?2)) (EVar ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (ELam ?1 (EConst ?2)) (EAp (EVar ?3) ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELam ?2 (EConst ?3)) (ELam ?4 (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELam ?2 (EConst ?3)) (ELet ?4 ?5 (EConst ?6)))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELam ?2 (EConst ?3)) (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELam ?2 (EConst ?3)) (EConst ?4))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) ?5) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) ?6) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (ELam ?5 (EConst ?6)))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (ELet ?5 ?6 (EConst ?7)))) (EVar ?8)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (EConst ?5))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (ELet ?2 ?3 (EConst ?4)) (EConst ?5))) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EConst ?1) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EAp (EConst ?3) (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (ELam ?3 (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (ELam ?3 (EConst ?4)))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (ELet ?3 ?4 (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (ELet ?3 ?4 (EConst ?5)))) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EAp (EVar ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (EAp (EConst ?4) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (ELam ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EAp (EConst ?2) (EConst ?3))) (ELet ?4 ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELam ([]) (EVar ?1))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELam ([]) (EAp (EVar ?1) (EConst ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EAp (EConst ?3) (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EAp (EConst ?3) (EConst ?4)))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELam ([]) (ELam ([]) (EVar ?1)))) ?2) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELam ?3 (EConst ?4)))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELam ?3 (EConst ?4)))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELam ?3 (EConst ?4)))) (EAp (EAp (EVar ?5) ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELam ?3 (EConst ?4)))) (EAp (EConst ?5) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELam ?3 (EConst ?4)))) (ELam ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELam ?3 (EConst ?4)))) (ELet ?5 ([]) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELet False ([]) (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (ELet True ([]) (EConst ?3)))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EVar ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EVar ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EAp (EVar ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EAp (EAp (EVar ?4) ?5) ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EAp (EConst ?4) (EVar ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (ELam ([]) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (ELam ?4 (EConst ?5)) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (ELet ?4 ([]) (EVar ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (ELet ?4 ?5 (EConst ?6)) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EConst ?4) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (EAp (EConst ?4) (EAp (EVar ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELam ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELet ?4 ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELam ?2 (EConst ?3))) (ELet ?4 ([]) (EAp (EVar ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELet ?1 ([]) (EVar ?2))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EAp (EConst ?4) (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EAp (EConst ?4) (EConst ?5)))) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) ?3) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (EVar ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (EAp (EVar ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (EAp (EAp (EVar ?6) ?7) ?8)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (EAp (EConst ?6) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (ELam ([]) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELam ?4 (EConst ?5)))) (ELet ?6 ([]) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ([]) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) ?4) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EVar ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EAp (EVar ?7) ?8)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EAp (EAp (EVar ?7) ?8) ?9)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (EAp (EConst ?7) (EVar ?8))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (ELam ([]) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (ELet ?4 ?5 (EConst ?6)))) (ELet ?7 ([]) (EVar ?8))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EVar ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EVar ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EVar ?5) ?6) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EAp (EVar ?5) ?6) ?7) ?8)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EAp (EConst ?5) (EVar ?6)) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELam ([]) (EVar ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELam ?5 (EConst ?6)) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELet ?5 ([]) (EVar ?6)) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (ELet ?5 ?6 (EConst ?7)) (EVar ?8))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (EAp (EConst ?5) (EAp (EVar ?6) ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELam ([]) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (ELet ?2 ?3 (EConst ?4))) (ELet ?5 ([]) (EAp (EVar ?6) ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EVar ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EAp (EVar ?3) ?4) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EAp (EConst ?3) (EVar ?4)) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELam ([]) (EVar ?3)) ?4) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELam ?3 (EConst ?4)) (EVar ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELet ?3 ([]) (EVar ?4)) ?5) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6)) ?7)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EAp (EVar ?4) ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EAp (EConst ?3) (EConst ?4)) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ([]) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ?3 (ELam ?4 (EConst ?5))) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ?3 (EConst ?4)) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELam ?3 (EConst ?4)) (EAp (EVar ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ([]) (EAp (EVar ?4) ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (ELam ?5 (EConst ?6))) (EVar ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (ELet ?5 ?6 (EConst ?7))) (EVar ?8))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (ELet ?3 ?4 (EConst ?5)) (EAp (EVar ?6) ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EAp (EVar ?4) ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (EAp (EConst ?4) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (ELam ([]) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (EAp (EConst ?3) (ELet ?4 ([]) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EVar ?3) (EConst ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (EAp (EConst ?3) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELam ([]) (ELam ([]) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EAp (EVar ?4) ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (EAp (EConst ?4) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (ELam ([]) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (ELet ? ?1 (EConst ?2)) (ELet ?3 ([]) (ELet ?4 ([]) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EVar ?1) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EVar ?1) ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EAp (EVar ?1) ?2) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EAp (EConst ?1) (EVar ?2)) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELam ([]) (EVar ?1)) ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELam ?1 (EConst ?2)) (EVar ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELam ?1 (EConst ?2)) (EAp (EVar ?3) ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELam ?1 (EConst ?2)) (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELet ?1 ([]) (EVar ?2)) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4)) ?5)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5)) ?6)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (ELet ?1 ?2 (EConst ?3)) (EConst ?4)) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (EAp (EVar ?2) ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3))) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELam ([]) (EVar ?2))) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELam ?2 (EConst ?3))) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3))) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (ELet ?2 ?3 (EConst ?4))) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EAp (EConst ?1) (EConst ?2)) (EAp (EVar ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ([]) (EVar ?1)) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ([]) (EAp (EVar ?1) (EConst ?2))) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ([]) (EAp (EConst ?1) (EVar ?2))) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EAp (EConst ?2) (EConst ?3))) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ([]) (ELam ([]) (EVar ?1))) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (ELam ?2 (EConst ?3))) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (ELam ?2 (EConst ?3))) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EAp (EVar ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EAp (EAp (EVar ?3) ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EAp (EConst ?3) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (ELam ([]) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (ELet ?3 ([]) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ([]) (EVar ?2)) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ([]) (EAp (EVar ?2) ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3))) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EAp (EConst ?3) (EConst ?4))) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ([]) (ELam ([]) (EVar ?2))) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELam ?3 (EConst ?4))) (EVar ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELam ?3 (EConst ?4))) (EAp (EVar ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3))) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5))) (EVar ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (ELet ?3 ?4 (EConst ?5))) (EAp (EVar ?6) ?7))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EVar ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EVar ?4) ?5))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EAp (EVar ?4) ?5) ?6))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (EAp (EConst ?4) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (ELam ([]) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (ELet ?1 ?2 (EConst ?3)) (ELet ?4 ([]) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (EVar ?2) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (EAp (EVar ?2) ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (EAp (EConst ?2) (EVar ?3)) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELam ([]) (EVar ?2)) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELam ?2 (EConst ?3)) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELet ?2 ([]) (EVar ?3)) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (EAp (EConst ?2) (EAp (EVar ?3) ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (ELam ([]) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (EAp (EConst ?1) (ELet ?2 ([]) (EAp (EVar ?3) ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam (: (: ?1 ?2) ([])) (EVar ([])))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam (: ([]) ([])) (EVar (: ?1 ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) (ELam ?2 (EConst ?3))))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EAp (EVar ?1) (EConst ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EAp (ELam ?1 (EConst ?2)) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (EAp (EConst ?1) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (ELam ([]) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (ELet False ([]) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELam ([]) (ELet True ([]) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (EVar ?2) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (EAp (EVar ?2) ?3) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (EAp (EConst ?2) (EVar ?3)) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELam ([]) (EVar ?2)) ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELam ?2 (EConst ?3)) (EVar ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELet ?2 ([]) (EVar ?3)) ?4))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (ELet ?2 ?3 (EConst ?4)) (EVar ?5)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (EAp (EConst ?2) (EAp (EVar ?3) ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (ELam ([]) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (EAp (EConst ?) (ELet ?1 ([]) (ELet ?2 ([]) (EAp (EVar ?3) ?4)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp (EVar ?) ?1) of (,) _ x -> x of AAp x _ -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp (EAp (EVar ?) ?1) ?2) of (,) _ x -> x of AAp x _ -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp (EAp (EConst ?) (EVar ?1)) ?2) of (,) _ x -> x of AAp x _ -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp (ELam ([]) (EVar ?)) ?1) of (,) _ x -> x of AAp x _ -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp (ELet ? ([]) (EVar ?1)) ?2) of (,) _ x -> x of AAp x _ -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp ? (EVar ?1)) of (,) _ x -> x of AAp _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp ? (EAp (EVar ?1) ?2)) of (,) _ x -> x of AAp _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp ? (EAp (EConst ?1) (EVar ?2))) of (,) _ x -> x of AAp _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp ? (ELam ([]) (EVar ?1))) of (,) _ x -> x of AAp _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (EAp ? (ELet ?1 ([]) (EVar ?2))) of (,) _ x -> x of AAp _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EVar ?)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: ? ?1) ([])) (EVar ([]))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: ([]) ([])) (EVar (: ? ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: 'a' ?) ([])) (EVar (: '\NUL' ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: '0' ?) ([])) (EVar (: '\NUL' ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: '\NUL' ?) ([])) (EVar (: 'a' ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: '0' ?) ([])) (EVar (: 'a' ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: '\NUL' ?) ([])) (EVar (: '0' ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: 'a' ?) ([])) (EVar (: '0' ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: ([]) (: ([]) ([]))) (EVar (: ? ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ([])) (EVar ([])))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ([])) (EVar (: ? ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar (: ? ?1)) (EVar ([])))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (EAp (ELam ?1 (EConst ?2)) (EConst ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (EAp (EConst ?1) (ELam ?2 (EConst ?3))))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (EAp (EConst ?1) (EConst ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (ELam ?1 (EAp (EConst ?2) (EConst ?3))))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (ELam ?1 (ELam ?2 (EConst ?3))))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (ELam ?1 (EConst ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (ELet False ([]) (EConst ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (ELet True ([]) (EConst ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EVar ?) (EConst ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: ? ?1) ([])) (EAp (EVar ([])) (EConst ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: ([]) ([])) (EAp (EVar (: ? ?1)) (EConst ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EVar ?) (ELam ?1 (EConst ?2))) (EConst ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EVar ?) (EConst ?1)) (ELam ?2 (EConst ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EVar ?) (EConst ?1)) (EConst ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (ELam ? (EConst ?1)) (EVar ?2)) (EConst ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (ELam ? (EConst ?1)) (EConst ?2)) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) (ELam ?2 (EConst ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EConst ?) (EVar ?1)) (EConst ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EConst ?) (ELam ?1 (EConst ?2))) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EAp (EConst ?) (EConst ?1)) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ? (EAp (ELam ?1 (EVar ?2)) (EAp (ELet False ?3 ?4) ?5))) of (,) x _ -> x ==> ! <allocated too much memory!>
  case addLevels (ELam ([]) (EAp (ELam ([]) (EVar ?)) (ELam ?1 (EConst ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ([]) (EVar ?)) (EConst ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (EAp (EConst ?1) (EConst ?2))) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (ELam ?1 (EConst ?2))) (EVar ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (EConst ?1)) (EVar ?2))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (EConst ?1)) (EAp (EVar ?2) (EConst ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (EConst ?1)) (EAp (EConst ?2) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELam ? (EConst ?1)) (ELam ([]) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELet False ([]) (EVar ?)) (EConst ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELet False ([]) (EConst ?)) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELet True ([]) (EVar ?)) (EConst ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (ELet True ([]) (EConst ?)) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EVar ?1))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: ? ?1) ([])) (EAp (EConst ?2) (EVar ([])))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: ([]) ([])) (EAp (EConst ?) (EVar (: ?1 ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) (ELam ?2 (EConst ?3))))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EAp (EVar ?1) (EConst ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EAp (ELam ?1 (EConst ?2)) (EVar ?3)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (EAp (EConst ?1) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (ELam ([]) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (ELet False ([]) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (EAp (EConst ?) (ELet True ([]) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: (: ? ?1) ([])) (ELam ([]) (EVar ([])))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam (: ([]) ([])) (ELam ([]) (EVar (: ? ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam (: (: ? ?1) ([])) (EVar ([])))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam (: ([]) ([])) (EVar (: ? ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EAp (EVar ?) (ELam ?1 (EConst ?2))))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EAp (EVar ?) (EConst ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EAp (ELam ? (EConst ?1)) (EVar ?2)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (EAp (EConst ?) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (ELam ([]) (EVar ?)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (ELet False ([]) (EVar ?)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELam ([]) (ELet True ([]) (EVar ?)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet False ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet False ([]) (EAp (EVar ?) (EConst ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet False ([]) (EAp (EConst ?) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet False ([]) (ELam ([]) (EVar ?)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet True ([]) (EVar ?))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet True ([]) (EAp (EVar ?) (EConst ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet True ([]) (EAp (EConst ?) (EVar ?1)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELam ([]) (ELet True ([]) (ELam ([]) (EVar ?)))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam ([]) (EVar ?)) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam (: (: ? ?1) ([])) (EVar ([]))) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam (: ([]) ([])) (EVar (: ? ?1))) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam ([]) (EAp (EVar ?) ?1)) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam ([]) (EAp (EConst ?) (EVar ?1))) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam ([]) (ELam ([]) (EVar ?))) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case case case addLevels (ELam ([]) (ELet ? ([]) (EVar ?1))) of (,) _ x -> x of ALam _ x -> x of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EVar ?1)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet False (: ((,) ([]) (EVar ?)) ?1) (EVar ([]))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EVar ([]))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? (: ((,) ([]) ?1) ([])) (EVar (: ?2 ?3))) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EVar ?1) ?2)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? (: ((,) (: ?1 ?2) ?3) ([])) (EAp (EVar ([])) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? (: ((,) ([]) ?1) ([])) (EAp (EVar (: ?2 ?3)) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EAp (EVar ?1) ?2) ?3)) of (,) x _ -> x ==> ! Prelude.head: empty list
  case addLevels (ELet ? ([]) (EAp (EAp (EAp (EVar ?1) ?2) ?3) ?4)) of (,) x _ -> x ==> ! Prelude.head: empty list
Main:
 Results:
Print:
 Results:
  case case case (case i_append ((,,)) (EAp) ? ?1 ?2 of (,,) x _ _ -> x) (ELet ?3 ?4 (ELet ?5 ?6 ?7)) of EAp _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x ==> ! <allocated too much memory!>
  case case case case (case i_append (:) (ELam) ? ?1 of x : _ -> x) (ELam ?2 (EAp ?3 (ELet ?4 ?5 ?6))) of ELam _ x -> x of ELam _ x -> x of EAp _ x -> x of ELet x _ _ -> x ==> ! <allocated too much memory!>
  case case case pprintExpr (EAp (EAp (EVar (: '\NUL' ([]))) (EAp (ELam ? ?1) ?2)) ?3) of _ : x -> x of _ : x -> x of _ : x -> x ==> ! <allocated too much memory!>
  case case case case (case i_append ((,)) (ELet) ? ?1 of (,) x _ -> x) ?2 (EAp (ELet ?3 ?4 (EVar (: ?5 ?6))) ?7) of ELet _ _ x -> x of EAp x _ -> x of ELet _ _ x -> x of EVar x -> x ==> ! <allocated too much memory!>
  case case case case (case i_append ((,,)) (EAp) ? ?1 ?2 of (,,) x _ _ -> x) (EAp (ELam (: ?3 ?4) ?5) ?6) of EAp _ x -> x of EAp x _ -> x of ELam x _ -> x of x : _ -> x ==> ! <allocated too much memory!>
Test:
 Results:
  case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp x _ -> x of EVar x -> x of x : _ -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam x _ -> x of _ : x -> x of x : _ -> x of _ : x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp x _ -> x of EAp x _ -> x of EConst x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) x _ -> x of x : _ -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp _ x -> x of EAp _ x -> x of EVar x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp x _ -> x of EAp x _ -> x of EConst x -> x of CFun x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp x _ -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of EAp _ x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam x _ -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of _ : x -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of EAp _ x -> x of EAp _ x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of _ : x -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of EAp _ x -> x of EAp x _ -> x of EAp x _ -> x of EConst x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp _ x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam x _ -> x of _ : x -> x of x : _ -> x of _ : x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp _ x -> x of EAp x _ -> x ==> ! <allocated too much memory!>
  case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of _ : x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of EAp x _ -> x of EAp _ x -> x of EAp x _ -> x of EAp x _ -> x of EConst x -> x of CFun x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of EAp x _ -> x of EAp _ x -> x of EVar x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam x _ -> x of _ : x -> x of x : _ -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of _ : x -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of EAp _ x -> x of EAp _ x -> x of EVar x -> x ==> ! <allocated too much memory!>
  case case case case case case case case case case case case case program of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam _ x -> x of ELet _ _ x -> x of ELet _ _ x -> x of ELet _ x _ -> x of x : _ -> x of (,) _ x -> x of ELam x _ -> x of _ : x -> x of x : _ -> x of _ : x -> x ==> ! <allocated too much memory!>
Utilities:
 Results:
  assLookup ? ([]) ?1 ==> ! Prelude.head: empty list
  assLookup ? ([]) ?1 ==> ! Prelude.head: empty list
  assLookup ? ([]) ?1 ==> ! Prelude.head: empty list
  assLookup ? ([]) ?1 ==> ! Prelude.head: empty list
  assLookup ? ([]) ?1 ==> ! Prelude.head: empty list
  assLookup ? ([]) ?1 ==> ! Prelude.head: empty list
Writing: LambdaLift.hs.html
Writing: Main.hs.html
Writing: Print.hs.html
Writing: Test.hs.html
Writing: Utilities.hs.html
Writing: hpc_index.html
Writing: hpc_index_fun.html
Writing: hpc_index_alt.html
Writing: hpc_index_exp.html
["LambdaLift.hs","Main.hs","Print.hs","Test.hs","Utilities.hs"]