Do not add constraints of the form s <= 'a <= t, for monomorphic alpha's, just check that the constraint holds for all substitution and replace it with a universal Sat or Unsat. This prevent the algorithm from introducing dummy substitutions later on of the form 'a <- 'a which interact badly with type cleaning (replacing covariant/contra-variant occurences by Empty/Any).