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

Termination w.r.t. Q of the given QTRS could be disproven:

0 QTRS
↳1 NonTerminationProof (⇒, 717 ms)
↳2 NO

(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))
M(V(L(x))) → V(XL(x))
M(V(X(x))) → V(XX(x))
Xb(b(x)) → b(Xb(x))
Xb(a(x)) → a(Xb(x))
Xb(L(x)) → L(Xb(x))
Xb(X(x)) → X(Xb(x))
Xa(b(x)) → b(Xa(x))
Xa(a(x)) → a(Xa(x))
Xa(L(x)) → L(Xa(x))
Xa(X(x)) → X(Xa(x))
XL(b(x)) → b(XL(x))
XL(a(x)) → a(XL(x))
XL(L(x)) → L(XL(x))
XL(X(x)) → X(XL(x))
XX(b(x)) → b(XX(x))
XX(a(x)) → a(XX(x))
XX(L(x)) → L(XX(x))
XX(X(x)) → X(XX(x))
Xb(E(x)) → b(E(x))
Xa(E(x)) → a(E(x))
XL(E(x)) → L(E(x))
XX(E(x)) → X(E(x))
W(V(x)) → R(ZL(x))
ZL(b(x)) → Yb(ZL(x))
ZL(a(x)) → Ya(ZL(x))
ZL(L(x)) → YL(ZL(x))
ZL(X(x)) → YX(ZL(x))
ZL(b(a(L(x)))) → D(L(a(L(X(b(a(b(b(x)))))))))
ZL(b(L(x))) → D(L(b(x)))
Yb(D(x)) → D(b(x))
Ya(D(x)) → D(a(x))
YL(D(x)) → D(L(x))
YX(D(x)) → D(X(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:
B L b E → B L b E

B L b E → B L b E
by OverlapClosure OC 3
B L b E → R D L b E
by OverlapClosure OC 3
B L b E → R ZL b L E
by OverlapClosure OC 2
B L b → R ZL b XL
by OverlapClosure OC 2
B L → R ZL XL
by OverlapClosure OC 3
B L → W V XL
by OverlapClosure OC 2
B → W M V
by OverlapClosure OC 3
B → W M M V
by original rule (OC 1)
M →
by original rule (OC 1)
M V L → V XL
by original rule (OC 1)
W V → R ZL
by original rule (OC 1)
XL b → b XL
by original rule (OC 1)
XL E → L E
by original rule (OC 1)
ZL b L → D L b
by original rule (OC 1)
R D → B
by original rule (OC 1)

(2) NO