(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(a(x1))) → a(b(b(x1)))
b(a(b(x1))) → a(b(a(x1)))
Q is empty.
(1) QTRS Reverse (EQUIVALENT transformation)
We applied the QTRS Reverse Processor [REVERSE].
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(a(x))) → b(b(a(x)))
b(a(b(x))) → a(b(a(x)))
Q is empty.
(3) NonTerminationProof (EQUIVALENT transformation)
We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.
Found the self-embedding DerivationStructure:
b a b b b a → b a b b b a
b a b b b a →
b a b b b aby OverlapClosure OC 2
b a b b b → b a b a a
by OverlapClosure OC 3b a b b b → b b a b a
by OverlapClosure OC 3b a b b b → a a a b a
by OverlapClosure OC 2b a b → a b a
by original rule (OC 1)
b a b b → a a b a
by OverlapClosure OC 2b a b → a b a
by original rule (OC 1)
b a b → a b a
by original rule (OC 1)
a a a → b b a
by original rule (OC 1)
b a b → a b a
by original rule (OC 1)
a a a → b b a
by original rule (OC 1)
(4) NO