  Weakly well-designed SPARQL patterns is a recent generalisation of
well-designed patterns, which preserve good computational properties but also
capture almost all patterns that appear in practice. Subsumption is one of
static analysis problems for SPARQL, along with equivalence and containment. In
this paper we show that subsumption is undecidable for weakly well-designed
patterns, which is in stark contrast to well-designed patterns, and to
equivalence and containment.
