NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-508.srs-torpacyc2out-split.srs

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

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

(0) Obligation:

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

Begin(a(x)) → Wait(Right1(x))
Begin(b(x)) → Wait(Right2(x))
Begin(c(x)) → Wait(Right3(x))
Right1(a(End(x))) → Left(b(c(End(x))))
Right2(a(End(x))) → Left(c(a(End(x))))
Right3(c(End(x))) → Left(a(b(End(x))))
Right1(a(x)) → Aa(Right1(x))
Right2(a(x)) → Aa(Right2(x))
Right3(a(x)) → Aa(Right3(x))
Right1(b(x)) → Ab(Right1(x))
Right2(b(x)) → Ab(Right2(x))
Right3(b(x)) → Ab(Right3(x))
Right1(c(x)) → Ac(Right1(x))
Right2(c(x)) → Ac(Right2(x))
Right3(c(x)) → Ac(Right3(x))
Aa(Left(x)) → Left(a(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
a(a(x)) → b(c(x))
a(b(x)) → c(a(x))
c(c(x)) → a(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:
Begin c b c End → Begin c b c End

Begin c b c End → Begin c b c End
by OverlapClosure OC 3
Begin c b c End → Begin c a a End
by OverlapClosure OC 3
Begin c b c End → Begin a b a End
by OverlapClosure OC 3
Begin c b c End → Begin c c a End
by OverlapClosure OC 3
Begin c b c End → Wait Left c c a End
by OverlapClosure OC 3
Begin c b c End → Wait Ac Left c a End
by OverlapClosure OC 2
Begin c b c End → Wait Ac Right2 a End
by OverlapClosure OC 3
Begin c b c End → Wait Right2 c a End
by OverlapClosure OC 3
Begin c b c End → Wait Right2 a b End
by OverlapClosure OC 3
Begin c b c End → Begin b a b End
by OverlapClosure OC 3
Begin c b c End → Wait Left b a b End
by OverlapClosure OC 2
Begin c → Wait Right3
by original rule (OC 1)
Right3 b c End → Left b a b End
by OverlapClosure OC 3
Right3 b c End → Ab Left a b End
by OverlapClosure OC 2
Right3 b → Ab Right3
by original rule (OC 1)
Right3 c End → Left a b End
by original rule (OC 1)
Ab Left → Left b
by original rule (OC 1)
Wait Left → Begin
by original rule (OC 1)
Begin b → Wait Right2
by original rule (OC 1)
a b → c a
by original rule (OC 1)
Right2 c → Ac Right2
by original rule (OC 1)
Right2 a End → Left c a End
by original rule (OC 1)
Ac Left → Left c
by original rule (OC 1)
Wait Left → Begin
by original rule (OC 1)
c c → a b
by original rule (OC 1)
a b → c a
by original rule (OC 1)
a a → b c
by original rule (OC 1)

(2) NO