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

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

0 QTRS
↳1 NonTerminationProof (⇒, 851 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))
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(b(b(x)))) → D(a(a(b(x))))
L(b(a(a(x)))) → D(a(a(b(x))))
L(a(a(x))) → D(b(a(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:
B a a b E → B a a b E

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

(2) NO