"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 case lambdaLift (EAp (ELam ([]) (EAp (EConst ?) (EVar ?1))) (EVar ?2)) of _ : x -> x of _ : x -> x ==> ! <allocated too much memory!>
Main:
 Results:
Print:
 Results:
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 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!>
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
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"]