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

(0) Obligation:

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

B(x) → W(M(M(M(V(x)))))
M(x) → x
M(V(a(x))) → V(Xa(x))
M(V(b(x))) → V(Xb(x))
Xa(a(x)) → a(Xa(x))
Xa(b(x)) → b(Xa(x))
Xb(a(x)) → a(Xb(x))
Xb(b(x)) → b(Xb(x))
Xa(E(x)) → a(E(x))
Xb(E(x)) → b(E(x))
W(V(x)) → R(L(x))
L(a(x)) → Ya(L(x))
L(b(x)) → Yb(L(x))
L(a(b(b(a(x))))) → D(b(a(a(b(x)))))
L(b(a(b(x)))) → D(a(b(b(b(x)))))
Ya(D(x)) → D(a(x))
Yb(D(x)) → D(b(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 b a a b EB b a a b E

B b a a b EB b a a b E
by OverlapClosure OC 3
B b a a b ER D b a a b E
by OverlapClosure OC 3
B b a a b ER L a b b a E
by OverlapClosure OC 2
B b a a b ER L a b b Xa E
by OverlapClosure OC 3
B b a a b ER L a b Xa b E
by OverlapClosure OC 2
B b a a bR L a b Xa Xb
by OverlapClosure OC 3
B b a a bR L a Xa b Xb
by OverlapClosure OC 2
B b a aR L a Xa Xb
by OverlapClosure OC 3
B b a aR L Xa a Xb
by OverlapClosure OC 2
B b aR L Xa Xb
by OverlapClosure OC 3
B b aW V Xa Xb
by OverlapClosure OC 3
B b aW M V a Xb
by OverlapClosure OC 2
B bW M V Xb
by OverlapClosure OC 2
BW M M V
by OverlapClosure OC 3
BW M M M V
by original rule (OC 1)
M
by original rule (OC 1)
M V bV Xb
by original rule (OC 1)
Xb aa Xb
by original rule (OC 1)
M V aV Xa
by original rule (OC 1)
W VR L
by original rule (OC 1)
Xb aa Xb
by original rule (OC 1)
Xa aa Xa
by original rule (OC 1)
Xb bb Xb
by original rule (OC 1)
Xa bb Xa
by original rule (OC 1)
Xb Eb E
by original rule (OC 1)
Xa bb Xa
by original rule (OC 1)
Xa Ea E
by original rule (OC 1)
L a b b aD b a a b
by original rule (OC 1)
R DB
by original rule (OC 1)

(2) NO