  We study the satisfiability of ordering constraint satisfaction problems
(CSPs) above average. We prove the conjecture of Gutin, van Iersel, Mnich, and
Yeo that the satisfiability above average of ordering CSPs of arity $k$ is
fixed-parameter tractable for every $k$. Previously, this was only known for
$k=2$ and $k=3$. We also generalize this result to more general classes of
CSPs, including CSPs with predicates defined by linear inequalities.
  To obtain our results, we prove a new Bonami-type inequality for the
Efron-Stein decomposition. The inequality applies to functions defined on
arbitrary product probability spaces. In contrast to other variants of the
Bonami Inequality, it does not depend on the mass of the smallest atom in the
probability space. We believe that this inequality is of independent interest.
