We extend miniKanren with a new fresh form that combines logic variable instantiation with unification. We show how combining these operations exposes information about the dependencies between logic variables that permits a variety of optimizations and heuristics. These optimizations include minimizing the introduction of new logic variables, eagerly exploiting ground terms, and reordering conjuncts according to the interdependencies between relations that share logic variables. We demonstrate improved performance in a collection of relational program synthesis tasks and describe possible avenues for further exploration within this architectural framework.