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

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

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

(0) Obligation:

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

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

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

(2) NO