Nice puzzle, tried really hard to do what Galtor did below but couldn't fit it either. Then realized the solution. 10 / 642 / 0, no optimization for power

The power can be saved to 597 when the left PGA transfers the following boolean values to the right PGA:

out1 = (2x > y + z)
out2 = (2x == y + z)

It is possible to optmize it for power.
My solution: 597 power.

Makes me feel silly now. That was a perfect hint.

Galtor: two PGAs.

I'm sure I'm missing something simple, but the board prevents me from using either all three inputs or all three outputs from the PGA. I could use a logic gate on the output side to take two of the outputs and make the third, but there's not enough room to wire that up either. So, while I can get the logic programmed on the PGA fairly simply, I haven't figured out how to wire up the board and get it to work. Can anyone who finished this offer a suggestion/hint?

Truth table:
xyz LMD
000 000
100 011
010 101
110 011
001 101
101 011
011 101
111 000

Made up the truth table in Excel then made that, instead of the actual function. 10/615/0