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

(0) Obligation:

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

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

b c a a c c a c cc c c c a c c a a c c a b c a a c c a c c b a
by OverlapClosure OC 2
b c a a c c a cc c c c a c c a a c c a b c a a c c a b
by OverlapClosure OC 2
b c a a c c ac c c c a c c a a c c a b c a a b
by OverlapClosure OC 3
b c a a c c ac c c c a c c a a b c c a a b
by OverlapClosure OC 2
b c a a cc c c c a c c a a b b
by OverlapClosure OC 3
b c a a cc c c c a b c a b
by OverlapClosure OC 3
b c a a cc c b c c a b
by OverlapClosure OC 2
b cc c b a
by OverlapClosure OC 3
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
a a a cc c a b
by OverlapClosure OC 2
a a a cc c a a a a
by OverlapClosure OC 2
a a ab
by original rule (OC 1)
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
b cc c a b
by OverlapClosure OC 2
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
b c ac c a a b
by OverlapClosure OC 2
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
b c ac c a a b
by OverlapClosure OC 2
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
b cc c a b
by OverlapClosure OC 2
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
b cc c a b
by OverlapClosure OC 2
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)
b cc c b a
by OverlapClosure OC 3
b cc c a a a a
by original rule (OC 1)
a a ab
by original rule (OC 1)

(2) NO