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

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

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

(0) Obligation:

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

Begin(b(x)) → Wait(Right1(x))
Begin(B(x)) → Wait(Right2(x))
Begin(B(c(b(c(x))))) → Wait(Right3(x))
Begin(c(b(c(x)))) → Wait(Right4(x))
Begin(b(c(x))) → Wait(Right5(x))
Begin(c(x)) → Wait(Right6(x))
Begin(B(x)) → Wait(Right7(x))
Right1(b(End(x))) → Left(B(End(x)))
Right2(B(End(x))) → Left(b(End(x)))
Right3(c(End(x))) → Left(B(c(b(c(B(c(b(End(x)))))))))
Right4(c(B(End(x)))) → Left(B(c(b(c(B(c(b(End(x)))))))))
Right5(c(B(c(End(x))))) → Left(B(c(b(c(B(c(b(End(x)))))))))
Right6(c(B(c(b(End(x)))))) → Left(B(c(b(c(B(c(b(End(x)))))))))
Right7(b(End(x))) → Left(End(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))
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))
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))
Ab(Left(x)) → Left(b(x))
AB(Left(x)) → Left(B(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
b(b(x)) → B(x)
B(B(x)) → b(x)
c(B(c(b(c(x))))) → B(c(b(c(B(c(b(x)))))))
b(B(x)) → 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 c b c B c b End → Wait Left c b c B c b End

Wait Left c b c B c b End → Wait Left c b c B c b End
by OverlapClosure OC 2
Wait Left c → Wait Right6
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin c → Wait Right6
by original rule (OC 1)
Right6 b c B c b End → Left c b c B c b End
by OverlapClosure OC 3
Right6 b c B c b End → Ab Left B c b c B c b End
by OverlapClosure OC 2
Right6 b → Ab Right6
by original rule (OC 1)
Right6 c B c b End → Left B c b c B c b End
by original rule (OC 1)
Ab Left B → Left
by OverlapClosure OC 2
Ab Left → Left b
by original rule (OC 1)
b B →
by original rule (OC 1)

(2) NO