style="font-variant:small-caps;">wasp</span>]{}to find solutions for all instances with the [PUP]{}-E1 encoding. This is an important feature of our approach. It allows a programmer to easily model a problem using a declarative language, like ASP-Core, and then to scale performance of the solver using heuristics defined in a procedural way.

Combined Configuration Problem
------------------------------

Similarly to the [PUP]{}, this problem was derived from a number of real-world problems including railway interlocking systems, safety automation, resource distribution, etc. The [CCP]{}is an abstract problem that demonstrates an important case occurring in practice of Siemens when a complex problem can be represented as a set of subproblems [@DBLP:conf/lpnmr/GebserRS15].

A [CCP]{}instance is defined by a directed acyclic graph $G=(V,E)$ representing a track layout (see Figure \[fig:ccp\]). Each vertex has a type, e.g. $b$ and $p$, with an associated size, e.g. 1 and 3. Furthermore, an instance includes two disjoint paths $P_1$ and $P_2$, shown in red and green, as well as several sets of border elements, e.g. $\mathit{BE}_1=\{b_1,b_2,b_3\}$ and $\mathit{BE}_2=\{b_2,b_4,b_5\}$. Finally, it defines parameters specifying a maximal number of border elements per safety area $M$, a number of colors $C$, a number of available bins $B$ per color and capacity of a bin $K$. The goal 