Ratschan has recently proposed a general framework for first-order formulas whose atoms are numerical constraints. It extends the notion of consistency to logical terms, but little is done with respect to the splitting operation. In this paper, we explore the potential of splitting heuristics that exploit the logical structure of disjunctive numerical constraint problems in order to simplify the problem along the search. First experiments on CNF formulas show that interesting solving time gains can be achieved by choosing the right splitting points.