Why does a reduction from a P-problem to an NP-complete problem not show that P=NP?
Part 1 shows how to solve BoxDepth using MaxClique.

Part 2 shows how to solve BoxDepth directly.

None of the parts says anything about solving MaxClique.