Graph theory, maximum flow at minimum cost
while [ 1 ]; do; ./generator —big-superposition > d && ./lem-in —p < d | grep ‘lines’; done > lem-in_output