NO Termination w.r.t. Q proof of Strategy_removed_AG01_4.18.ari

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

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

(0) Obligation:

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

a(b(a(b(x)))) → b(a(b(a(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:
a b a b a b → b a b a b a b a a b

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

(2) NO