Golf the Subset-Sum Problem Task
Given a list of space-delimited integers as input, output all unique non-empty subsets of these numbers that each subset sums to 0.

Test Case
Input:  8 −7 5 −3 −2
Output: -3 -2 5

Winning Criterion
This is code-golf, so the shortest code in bytes wins!
Brachylog (2), 9 characters

{⊇.+0∧}ᵘb


Try it online!

{⊇.+0∧}ᵘb
 ⊇           subset
   +0        that sums to 0
  .  ∧       output the subset
{     }ᵘ     take all unique solutions
        b    except the first (which is the empty solution)