Is the decidability of strong sequentiality for orthogonal term rewriting systems NP-complete?

The source page states the original problem together with its recorded qualifications and progress updates as follows.

Is the decidability of strong sequentiality for orthogonal term rewriting systems NP-complete? See [Middeldorp, 1991].