(1) NonTerminationProof (COMPLETE transformation)
We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.
Found the self-embedding DerivationStructure:
rewrite b c a end → rewrite b c a end
rewrite b c a end →
rewrite b c a endby OverlapClosure OC 3
rewrite b c a end → rotate finish2 b c a end
by OverlapClosure OC 3rewrite b c a end → rotate Db finish2 c a end
by OverlapClosure OC 3rewrite b c a end → rotate Db cut finish c a end
by OverlapClosure OC 3rewrite b c a end → rotate Db cut Cc finish a end
by OverlapClosure OC 3rewrite b c a end → rotate Db cut Cc Ca finish end
by OverlapClosure OC 2rewrite b c a → rotate Db cut Cc Ca goright wait
by OverlapClosure OC 3rewrite b c a → rotate Db cut goright Ac Aa wait
by OverlapClosure OC 3rewrite b c a → rotate cut moveleft Bb Ac Aa wait
by OverlapClosure OC 3rewrite b c a → rotate cut Cc moveleft Bb Aa wait
by OverlapClosure OC 2rewrite b c a → rotate cut Cc guess a b
by OverlapClosure OC 3rewrite b c a → begin c a b
by original rule (OC 1)
begin c → rotate cut Cc guess
by original rule (OC 1)
guess a b → moveleft Bb Aa wait
by OverlapClosure OC 3guess a b → Ca moveleft Bb wait
by OverlapClosure OC 2guess a → Ca guess
by original rule (OC 1)
guess b → moveleft Bb wait
by original rule (OC 1)
Ca moveleft Bb → moveleft Bb Aa
by original rule (OC 1)
Cc moveleft Bb → moveleft Bb Ac
by original rule (OC 1)
cut moveleft Bb → Db cut goright
by original rule (OC 1)
goright Ac Aa → Cc Ca goright
by OverlapClosure OC 2goright Ac → Cc goright
by original rule (OC 1)
goright Aa → Ca goright
by original rule (OC 1)
goright wait end → finish end
by original rule (OC 1)
Ca finish → finish a
by original rule (OC 1)
Cc finish → finish c
by original rule (OC 1)
cut finish → finish2
by original rule (OC 1)
Db finish2 → finish2 b
by original rule (OC 1)
rotate finish2 → rewrite
by original rule (OC 1)