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

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

0 QTRS
↳1 NonTerminationProof (⇒, 561 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(a(x))) → V(Xa(x))
M(V(b(x))) → V(Xb(x))
M(V(c(x))) → V(Xc(x))
M(V(d(x))) → V(Xd(x))
Xa(a(x)) → a(Xa(x))
Xa(b(x)) → b(Xa(x))
Xa(c(x)) → c(Xa(x))
Xa(d(x)) → d(Xa(x))
Xb(a(x)) → a(Xb(x))
Xb(b(x)) → b(Xb(x))
Xb(c(x)) → c(Xb(x))
Xb(d(x)) → d(Xb(x))
Xc(a(x)) → a(Xc(x))
Xc(b(x)) → b(Xc(x))
Xc(c(x)) → c(Xc(x))
Xc(d(x)) → d(Xc(x))
Xd(a(x)) → a(Xd(x))
Xd(b(x)) → b(Xd(x))
Xd(c(x)) → c(Xd(x))
Xd(d(x)) → d(Xd(x))
Xa(E(x)) → a(E(x))
Xb(E(x)) → b(E(x))
Xc(E(x)) → c(E(x))
Xd(E(x)) → d(E(x))
W(V(x)) → R(L(x))
L(a(x)) → Ya(L(x))
L(b(x)) → Yb(L(x))
L(c(x)) → Yc(L(x))
L(d(x)) → Yd(L(x))
L(a(a(x))) → D(b(b(b(x))))
L(b(x)) → D(c(c(d(x))))
L(c(x)) → D(d(d(d(x))))
L(b(c(x))) → D(c(b(x)))
L(b(c(d(x)))) → D(a(x))
Ya(D(x)) → D(a(x))
Yb(D(x)) → D(b(x))
Yc(D(x)) → D(c(x))
Yd(D(x)) → D(d(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 c E → W V b c E

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

(2) NO