Every solution of a constraint is a solution of one of its irredundant solved forms.
the number of irredundant solved forms is always finite, whereas the number of solutions typically is not: X:a ∧ Y :b is in solved form, but each solution must contain an additional node with arbitrary label that combines X and Y into a tree (e.g.