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-134.srs-torpacyc2out-split.srs

(0) Obligation:

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

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

Wait Left a b b EndWait Left a b b End
by OverlapClosure OC 3
Wait Left a b b EndWait Left a a b b End
by OverlapClosure OC 2
Wait LeftBegin
by original rule (OC 1)
Begin a b b EndWait Left a a b b End
by OverlapClosure OC 2
Begin aWait Right2
by original rule (OC 1)
Right2 b b EndLeft a a b b End
by OverlapClosure OC 3
Right2 b b EndLeft a a b c c End
by OverlapClosure OC 3
Right2 b b EndLeft b a c End
by OverlapClosure OC 3
Right2 b b EndAb Left a c End
by OverlapClosure OC 2
Right2 bAb Right2
by original rule (OC 1)
Right2 b EndLeft a c End
by OverlapClosure OC 3
Right2 b EndLeft a a b c End
by original rule (OC 1)
a b
by original rule (OC 1)
Ab LeftLeft b
by original rule (OC 1)
b aa a b c
by original rule (OC 1)
c cb
by original rule (OC 1)
a
by original rule (OC 1)

(2) NO