Availability::- use_module(library(clpBNR)).
 splitsolve(X:numeric_List) is nondet
Succeeds if a solution can be found for all values in X where the resultant domain of any value if narrower than the limit specified by the default precision (number of digits as defined by the environment flag clpBNR_default_precision); otherwise fails. This is done by splitting any intervals in order of their widths until all domains are smaller than the required limit. Other solutions can be generated on backtracking.

Normally solve/1 is a better choice but this predicate can be used when solve/1 cannot find a suitable non-solution value to use to split an interval (or intervals). This predicate is also less computationally expensive, but may result in many solutions being produced for a single wider interval. (This is why solve/1 splits on non-solutions.)

See also
- solve/1