YES

1 decompositions
 #1 -----------
   1: +(x1,x2) -> +(x2,x1)
   3: *(+(x6,x7),x8) -> +(*(x7,x8),*(x6,x8))

@Commutation Lemma

@Development Closedness
--- R
   1: +(x1,x2) -> +(x2,x1)

--- S
   1: +(x1,x2) -> +(x2,x1)
   3: *(+(x6,x7),x8) -> +(*(x7,x8),*(x6,x8))

@Development Closedness
--- R
   3: *(+(x6,x7),x8) -> +(*(x7,x8),*(x6,x8))

--- S
   1: +(x1,x2) -> +(x2,x1)
   3: *(+(x6,x7),x8) -> +(*(x7,x8),*(x6,x8))


NOTE: input TRS is reduced

original is
   1: +(x1,x2) -> +(x2,x1)
   2: *(+(x3,x4),x5) -> +(*(x3,x5),*(x4,x5))
   3: *(+(x6,x7),x8) -> +(*(x7,x8),*(x6,x8))

reduced to
   1: +(x1,x2) -> +(x2,x1)
   3: *(+(x6,x7),x8) -> +(*(x7,x8),*(x6,x8))