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

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

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

(2) NO