NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Secret_05_SRS/torpa4.srs-torpacyc2out-split.srs

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

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

(0) Obligation:

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

Begin(b(c(a(x)))) → Wait(Right1(x))
Begin(c(a(x))) → Wait(Right2(x))
Begin(a(x)) → Wait(Right3(x))
Begin(f(f(x))) → Wait(Right4(x))
Begin(f(x)) → Wait(Right5(x))
Begin(g(x)) → Wait(Right6(x))
Begin(a(c(x))) → Wait(Right7(x))
Begin(c(x)) → Wait(Right8(x))
Right1(a(End(x))) → Left(b(a(c(b(a(b(End(x))))))))
Right2(a(b(End(x)))) → Left(b(a(c(b(a(b(End(x))))))))
Right3(a(b(c(End(x))))) → Left(b(a(c(b(a(b(End(x))))))))
Right4(a(End(x))) → Left(g(End(x)))
Right5(a(f(End(x)))) → Left(g(End(x)))
Right6(b(End(x))) → Left(g(b(End(x))))
Right7(c(End(x))) → Left(b(c(a(b(c(End(x)))))))
Right8(c(a(End(x)))) → Left(b(c(a(b(c(End(x)))))))
Right1(a(x)) → Aa(Right1(x))
Right2(a(x)) → Aa(Right2(x))
Right3(a(x)) → Aa(Right3(x))
Right4(a(x)) → Aa(Right4(x))
Right5(a(x)) → Aa(Right5(x))
Right6(a(x)) → Aa(Right6(x))
Right7(a(x)) → Aa(Right7(x))
Right8(a(x)) → Aa(Right8(x))
Right1(b(x)) → Ab(Right1(x))
Right2(b(x)) → Ab(Right2(x))
Right3(b(x)) → Ab(Right3(x))
Right4(b(x)) → Ab(Right4(x))
Right5(b(x)) → Ab(Right5(x))
Right6(b(x)) → Ab(Right6(x))
Right7(b(x)) → Ab(Right7(x))
Right8(b(x)) → Ab(Right8(x))
Right1(c(x)) → Ac(Right1(x))
Right2(c(x)) → Ac(Right2(x))
Right3(c(x)) → Ac(Right3(x))
Right4(c(x)) → Ac(Right4(x))
Right5(c(x)) → Ac(Right5(x))
Right6(c(x)) → Ac(Right6(x))
Right7(c(x)) → Ac(Right7(x))
Right8(c(x)) → Ac(Right8(x))
Right1(f(x)) → Af(Right1(x))
Right2(f(x)) → Af(Right2(x))
Right3(f(x)) → Af(Right3(x))
Right4(f(x)) → Af(Right4(x))
Right5(f(x)) → Af(Right5(x))
Right6(f(x)) → Af(Right6(x))
Right7(f(x)) → Af(Right7(x))
Right8(f(x)) → Af(Right8(x))
Right1(g(x)) → Ag(Right1(x))
Right2(g(x)) → Ag(Right2(x))
Right3(g(x)) → Ag(Right3(x))
Right4(g(x)) → Ag(Right4(x))
Right5(g(x)) → Ag(Right5(x))
Right6(g(x)) → Ag(Right6(x))
Right7(g(x)) → Ag(Right7(x))
Right8(g(x)) → Ag(Right8(x))
Aa(Left(x)) → Left(a(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
Af(Left(x)) → Left(f(x))
Ag(Left(x)) → Left(g(x))
Wait(Left(x)) → Begin(x)
a(b(c(a(x)))) → b(a(c(b(a(b(x))))))
a(f(f(x))) → g(x)
b(g(x)) → g(b(x))
c(x) → f(f(x))
c(a(c(x))) → b(c(a(b(c(x)))))
g(x) → c(a(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 g b End → Wait Left g b End

Wait Left g b End → Wait Left g b End
by OverlapClosure OC 2
Wait Left g → Wait Right6
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin g → Wait Right6
by original rule (OC 1)
Right6 b End → Left g b End
by original rule (OC 1)

(2) NO