The commutativity problem is decidable for effective prevarieties (paper §3, the meta-theorem). By the finite axiomatisation, $sem r$ is commutative exactly when it satisfies the swap and the rotate equations. Each of those is a finite family of equalities between presentations (the alphabet is finite), and each equality is decided by the prevariety's $decEq$. A single boolean procedure therefore decides commutativity.