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

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

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

(0) Obligation:

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

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

a a b b b b → b b b b b a a a b b b b b a a a a a
by OverlapClosure OC 2
a a b b → b b b b b a a a a a
by original rule (OC 1)
a a b b → b b b b b a a a a a
by original rule (OC 1)

(2) NO