YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

Begin(a(b(c(c(b(x0))))))	→	Wait(Right1(x0))
Begin(b(c(c(b(x0)))))	→	Wait(Right2(x0))
Begin(c(c(b(x0))))	→	Wait(Right3(x0))
Begin(c(b(x0)))	→	Wait(Right4(x0))
Begin(b(x0))	→	Wait(Right5(x0))
Right1(b(End(x0)))	→	Left(a(b(b(c(c(b(a(End(x0)))))))))
Right2(b(a(End(x0))))	→	Left(a(b(b(c(c(b(a(End(x0)))))))))
Right3(b(a(b(End(x0)))))	→	Left(a(b(b(c(c(b(a(End(x0)))))))))
Right4(b(a(b(c(End(x0))))))	→	Left(a(b(b(c(c(b(a(End(x0)))))))))
Right5(b(a(b(c(c(End(x0)))))))	→	Left(a(b(b(c(c(b(a(End(x0)))))))))
Right1(b(x0))	→	Ab(Right1(x0))
Right2(b(x0))	→	Ab(Right2(x0))
Right3(b(x0))	→	Ab(Right3(x0))
Right4(b(x0))	→	Ab(Right4(x0))
Right5(b(x0))	→	Ab(Right5(x0))
Right1(a(x0))	→	Aa(Right1(x0))
Right2(a(x0))	→	Aa(Right2(x0))
Right3(a(x0))	→	Aa(Right3(x0))
Right4(a(x0))	→	Aa(Right4(x0))
Right5(a(x0))	→	Aa(Right5(x0))
Right1(c(x0))	→	Ac(Right1(x0))
Right2(c(x0))	→	Ac(Right2(x0))
Right3(c(x0))	→	Ac(Right3(x0))
Right4(c(x0))	→	Ac(Right4(x0))
Right5(c(x0))	→	Ac(Right5(x0))
Ab(Left(x0))	→	Left(b(x0))
Aa(Left(x0))	→	Left(a(x0))
Ac(Left(x0))	→	Left(c(x0))
Wait(Left(x0))	→	Begin(x0)
b(a(b(c(c(b(x0))))))	→	a(b(b(c(c(b(a(x0)))))))

Proof

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS

b(c(c(b(a(Begin(x0))))))	→	Right1(Wait(x0))
b(c(c(b(Begin(x0)))))	→	Right2(Wait(x0))
b(c(c(Begin(x0))))	→	Right3(Wait(x0))
b(c(Begin(x0)))	→	Right4(Wait(x0))
b(Begin(x0))	→	Right5(Wait(x0))
End(b(Right1(x0)))	→	End(a(b(c(c(b(b(a(Left(x0)))))))))
End(a(b(Right2(x0))))	→	End(a(b(c(c(b(b(a(Left(x0)))))))))
End(b(a(b(Right3(x0)))))	→	End(a(b(c(c(b(b(a(Left(x0)))))))))
End(c(b(a(b(Right4(x0))))))	→	End(a(b(c(c(b(b(a(Left(x0)))))))))
End(c(c(b(a(b(Right5(x0)))))))	→	End(a(b(c(c(b(b(a(Left(x0)))))))))
b(Right1(x0))	→	Right1(Ab(x0))
b(Right2(x0))	→	Right2(Ab(x0))
b(Right3(x0))	→	Right3(Ab(x0))
b(Right4(x0))	→	Right4(Ab(x0))
b(Right5(x0))	→	Right5(Ab(x0))
a(Right1(x0))	→	Right1(Aa(x0))
a(Right2(x0))	→	Right2(Aa(x0))
a(Right3(x0))	→	Right3(Aa(x0))
a(Right4(x0))	→	Right4(Aa(x0))
a(Right5(x0))	→	Right5(Aa(x0))
c(Right1(x0))	→	Right1(Ac(x0))
c(Right2(x0))	→	Right2(Ac(x0))
c(Right3(x0))	→	Right3(Ac(x0))
c(Right4(x0))	→	Right4(Ac(x0))
c(Right5(x0))	→	Right5(Ac(x0))
Left(Ab(x0))	→	b(Left(x0))
Left(Aa(x0))	→	a(Left(x0))
Left(Ac(x0))	→	c(Left(x0))
Left(Wait(x0))	→	Begin(x0)
b(c(c(b(a(b(x0))))))	→	a(b(c(c(b(b(a(x0)))))))

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

End^#(b(Right1(x0)))	→	Left^#(x0)
End^#(b(Right1(x0)))	→	a^#(Left(x0))
End^#(b(Right1(x0)))	→	b^#(a(Left(x0)))
End^#(b(Right1(x0)))	→	b^#(b(a(Left(x0))))
End^#(b(Right1(x0)))	→	c^#(b(b(a(Left(x0)))))
End^#(b(Right1(x0)))	→	c^#(c(b(b(a(Left(x0))))))
End^#(b(Right1(x0)))	→	b^#(c(c(b(b(a(Left(x0)))))))
End^#(b(Right1(x0)))	→	a^#(b(c(c(b(b(a(Left(x0))))))))
End^#(b(Right1(x0)))	→	End^#(a(b(c(c(b(b(a(Left(x0)))))))))
End^#(a(b(Right2(x0))))	→	Left^#(x0)
End^#(a(b(Right2(x0))))	→	a^#(Left(x0))
End^#(a(b(Right2(x0))))	→	b^#(a(Left(x0)))
End^#(a(b(Right2(x0))))	→	b^#(b(a(Left(x0))))
End^#(a(b(Right2(x0))))	→	c^#(b(b(a(Left(x0)))))
End^#(a(b(Right2(x0))))	→	c^#(c(b(b(a(Left(x0))))))
End^#(a(b(Right2(x0))))	→	b^#(c(c(b(b(a(Left(x0)))))))
End^#(a(b(Right2(x0))))	→	a^#(b(c(c(b(b(a(Left(x0))))))))
End^#(a(b(Right2(x0))))	→	End^#(a(b(c(c(b(b(a(Left(x0)))))))))
End^#(b(a(b(Right3(x0)))))	→	Left^#(x0)
End^#(b(a(b(Right3(x0)))))	→	a^#(Left(x0))
End^#(b(a(b(Right3(x0)))))	→	b^#(a(Left(x0)))
End^#(b(a(b(Right3(x0)))))	→	b^#(b(a(Left(x0))))
End^#(b(a(b(Right3(x0)))))	→	c^#(b(b(a(Left(x0)))))
End^#(b(a(b(Right3(x0)))))	→	c^#(c(b(b(a(Left(x0))))))
End^#(b(a(b(Right3(x0)))))	→	b^#(c(c(b(b(a(Left(x0)))))))
End^#(b(a(b(Right3(x0)))))	→	a^#(b(c(c(b(b(a(Left(x0))))))))
End^#(b(a(b(Right3(x0)))))	→	End^#(a(b(c(c(b(b(a(Left(x0)))))))))
End^#(c(b(a(b(Right4(x0))))))	→	Left^#(x0)
End^#(c(b(a(b(Right4(x0))))))	→	a^#(Left(x0))
End^#(c(b(a(b(Right4(x0))))))	→	b^#(a(Left(x0)))
End^#(c(b(a(b(Right4(x0))))))	→	b^#(b(a(Left(x0))))
End^#(c(b(a(b(Right4(x0))))))	→	c^#(b(b(a(Left(x0)))))
End^#(c(b(a(b(Right4(x0))))))	→	c^#(c(b(b(a(Left(x0))))))
End^#(c(b(a(b(Right4(x0))))))	→	b^#(c(c(b(b(a(Left(x0)))))))
End^#(c(b(a(b(Right4(x0))))))	→	a^#(b(c(c(b(b(a(Left(x0))))))))
End^#(c(b(a(b(Right4(x0))))))	→	End^#(a(b(c(c(b(b(a(Left(x0)))))))))
End^#(c(c(b(a(b(Right5(x0)))))))	→	Left^#(x0)
End^#(c(c(b(a(b(Right5(x0)))))))	→	a^#(Left(x0))
End^#(c(c(b(a(b(Right5(x0)))))))	→	b^#(a(Left(x0)))
End^#(c(c(b(a(b(Right5(x0)))))))	→	b^#(b(a(Left(x0))))
End^#(c(c(b(a(b(Right5(x0)))))))	→	c^#(b(b(a(Left(x0)))))
End^#(c(c(b(a(b(Right5(x0)))))))	→	c^#(c(b(b(a(Left(x0))))))
End^#(c(c(b(a(b(Right5(x0)))))))	→	b^#(c(c(b(b(a(Left(x0)))))))
End^#(c(c(b(a(b(Right5(x0)))))))	→	a^#(b(c(c(b(b(a(Left(x0))))))))
End^#(c(c(b(a(b(Right5(x0)))))))	→	End^#(a(b(c(c(b(b(a(Left(x0)))))))))
Left^#(Ab(x0))	→	Left^#(x0)
Left^#(Ab(x0))	→	b^#(Left(x0))
Left^#(Aa(x0))	→	Left^#(x0)
Left^#(Aa(x0))	→	a^#(Left(x0))
Left^#(Ac(x0))	→	Left^#(x0)
Left^#(Ac(x0))	→	c^#(Left(x0))
b^#(c(c(b(a(b(x0))))))	→	a^#(x0)
b^#(c(c(b(a(b(x0))))))	→	b^#(a(x0))
b^#(c(c(b(a(b(x0))))))	→	b^#(b(a(x0)))
b^#(c(c(b(a(b(x0))))))	→	c^#(b(b(a(x0))))
b^#(c(c(b(a(b(x0))))))	→	c^#(c(b(b(a(x0)))))
b^#(c(c(b(a(b(x0))))))	→	b^#(c(c(b(b(a(x0))))))
b^#(c(c(b(a(b(x0))))))	→	a^#(b(c(c(b(b(a(x0)))))))

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

End^#(a(b(Right2(x0))))

→

End^#(a(b(c(c(b(b(a(Left(x0)))))))))

1.1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1 over the naturals

[Right1(x₁)]

0	0	0
0	0	0
0	0	0

· x₁ +

0	0	0
0	0	0
0	0	0

[Right4(x₁)]

0	0	0
0	0	0
0	0	0

· x₁ +

0	0	0
0	0	0
0	0	0

[c(x₁)]

1	0	1
0	1	0
0	0	1

· x₁ +

0	0	0
1	0	0
0	0	0

[Begin(x₁)]

0	1	1
0	0	1
0	1	1

· x₁ +

1	0	0
1	0	0
0	0	0

[End^#(x₁)]

0	1	0
0	0	0
0	0	0

· x₁ +

0	0	0
0	0	0
0	0	0

[Wait(x₁)]

0	0	1
0	1	1
0	1	1

· x₁ +

1	0	0
0	0	0
1	0	0

[b(x₁)]

1	0	0
0	0	1
0	1	0

· x₁ +

0	0	0
0	0	0
0	0	0

[Right3(x₁)]

0	0	0
0	0	0
0	0	0

· x₁ +

1	0	0
0	0	0
0	0	0

[Ac(x₁)]

1	0	0
0	1	0
0	1	1

· x₁ +

1	0	0
0	0	0
0	0	0

[Ab(x₁)]

0	1	0
1	0	0
0	0	1

· x₁ +

0	0	0
0	0	0
0	0	0

[Left(x₁)]

0	0	1
1	0	0
0	1	0

· x₁ +

0	0	0
0	0	0
0	0	0

[Right5(x₁)]

0	0	0
0	0	0
0	0	0

· x₁ +

0	0	0
0	0	0
0	0	0

[Aa(x₁)]

0	0	1
0	0	0
0	0	1

· x₁ +

0	0	0
0	0	0
0	0	0

[Right2(x₁)]

0	0	1
1	0	0
0	1	0

· x₁ +

1	0	0
0	0	0
0	0	0

[a(x₁)]

1	0	0
1	0	0
0	0	0

· x₁ +

0	0	0
0	0	0
0	0	0

together with the usable rules

Left(Ab(x0))	→	b(Left(x0))
Left(Aa(x0))	→	a(Left(x0))
Left(Ac(x0))	→	c(Left(x0))
Left(Wait(x0))	→	Begin(x0)
b(c(c(b(a(Begin(x0))))))	→	Right1(Wait(x0))
b(c(c(b(Begin(x0)))))	→	Right2(Wait(x0))
b(c(c(Begin(x0))))	→	Right3(Wait(x0))
b(c(Begin(x0)))	→	Right4(Wait(x0))
b(Begin(x0))	→	Right5(Wait(x0))
b(Right1(x0))	→	Right1(Ab(x0))
b(Right2(x0))	→	Right2(Ab(x0))
b(Right3(x0))	→	Right3(Ab(x0))
b(Right4(x0))	→	Right4(Ab(x0))
b(Right5(x0))	→	Right5(Ab(x0))
b(c(c(b(a(b(x0))))))	→	a(b(c(c(b(b(a(x0)))))))
a(Right1(x0))	→	Right1(Aa(x0))
a(Right2(x0))	→	Right2(Aa(x0))
a(Right3(x0))	→	Right3(Aa(x0))
a(Right4(x0))	→	Right4(Aa(x0))
a(Right5(x0))	→	Right5(Aa(x0))
c(Right1(x0))	→	Right1(Ac(x0))
c(Right2(x0))	→	Right2(Ac(x0))
c(Right3(x0))	→	Right3(Ac(x0))
c(Right4(x0))	→	Right4(Ac(x0))
c(Right5(x0))	→	Right5(Ac(x0))

(w.r.t. the implicit argument filter of the reduction pair), all pairs could be removed.

1.1.1.1.1 P is empty

There are no pairs anymore.