NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Bouchare_06/07-shift.srs

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

B(x) → W(M(M(V(x))))
M(x) → x
M(V(b(x))) → V(Xb(x))
M(V(a(x))) → V(Xa(x))
Xb(b(x)) → b(Xb(x))
Xb(a(x)) → a(Xb(x))
Xa(b(x)) → b(Xa(x))
Xa(a(x)) → a(Xa(x))
Xb(E(x)) → b(E(x))
Xa(E(x)) → a(E(x))
W(V(x)) → R(L(x))
L(b(x)) → Yb(L(x))
L(a(x)) → Ya(L(x))
L(b(a(x))) → D(b(b(x)))
L(b(a(b(x)))) → D(b(a(a(x))))
L(a(a(a(x)))) → D(a(b(b(x))))
Yb(D(x)) → D(b(x))
Ya(D(x)) → D(a(x))
R(D(x)) → B(x)

Q is empty.

(1) NonTerminationProof (COMPLETE transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:
W V b a b EW V b a b E

W V b a b EW V b a b E
by OverlapClosure OC 3
W V b a b EW M V b a b E
by OverlapClosure OC 2
W V b a bW M V b a Xb
by OverlapClosure OC 2
W V b a bW M V b Xb a
by OverlapClosure OC 3
W V b a bW M V Xb b a
by OverlapClosure OC 3
W V b a bB b b a
by OverlapClosure OC 3
W V b a bR D b a a
by OverlapClosure OC 2
W VR L
by original rule (OC 1)
L b a bD b a a
by original rule (OC 1)
R D b aB b b
by OverlapClosure OC 2
R DW V
by OverlapClosure OC 3
R DW M V
by OverlapClosure OC 2
R DB
by original rule (OC 1)
BW M V
by OverlapClosure OC 3
BW M M V
by original rule (OC 1)
M
by original rule (OC 1)
M
by original rule (OC 1)
W V b aB b b
by OverlapClosure OC 3
W V b aR D b b
by OverlapClosure OC 2
W VR L
by original rule (OC 1)
L b aD b b
by original rule (OC 1)
R DB
by original rule (OC 1)
B bW M V Xb
by OverlapClosure OC 2
BW M M V
by original rule (OC 1)
M V bV Xb
by original rule (OC 1)
Xb bb Xb
by original rule (OC 1)
Xb aa Xb
by original rule (OC 1)
Xb Eb E
by original rule (OC 1)
M
by original rule (OC 1)

(2) NO