Complete Name: System synthesis problem with utilization distribution and routing optimization

Input Predicates: tile/1, router/1, edge/2, computationalTask/4, belongs/2, send/2, receive/2.

Output Predicates: bind/2, reached/3.

Problem Description: The system synthesis problem consists of computing a binding and a routing.
A binding contains for each computational task exactly one tile it is executed on.
Each computational task is given an utilization level, for the tile it is bound to (U in computationalTask(T,U,P,E).
The maximum utilization of each tile must not exceed 1000.
A routing consists of a path from the resource the sender is bound to to the resource of the receiving task.
Utilization distribution is optimized by minimizing the maximal utilization of each tile.
Due to performance issues only 10 optimization steps are considered here (equal slices of the distance between
the optimal mean utilization and the maximal utilization)
The routing is optimized by first minimizing the number of routed messages and then the length of the routed messages.

Note: belongs/2 of the input predicates is not used in this encoding and computationalTask/4 is mapped to task/2.
This is because the instances should also be able to be used in other system synthesis problems.