Certification Problem
Input (TPDB SRS_Standard/ICFP_2010/213218)
The rewrite relation of the following TRS is considered.
|
0(1(2(x1))) |
→ |
0(2(1(1(x1)))) |
(1) |
|
2(3(1(x1))) |
→ |
3(4(2(1(x1)))) |
(2) |
|
0(1(2(0(x1)))) |
→ |
0(0(2(1(1(x1))))) |
(3) |
|
0(1(2(0(x1)))) |
→ |
0(2(1(1(0(x1))))) |
(4) |
|
0(1(2(1(x1)))) |
→ |
0(2(1(1(1(x1))))) |
(5) |
|
0(1(2(4(x1)))) |
→ |
4(0(2(1(1(x1))))) |
(6) |
|
0(1(2(5(x1)))) |
→ |
0(2(5(1(1(x1))))) |
(7) |
|
0(1(2(5(x1)))) |
→ |
0(4(2(1(5(x1))))) |
(8) |
|
0(1(3(1(x1)))) |
→ |
0(0(3(1(1(x1))))) |
(9) |
|
0(1(3(1(x1)))) |
→ |
3(0(2(1(1(1(x1)))))) |
(10) |
|
0(1(4(1(x1)))) |
→ |
4(0(1(1(1(x1))))) |
(11) |
|
0(1(4(5(x1)))) |
→ |
0(4(1(1(5(x1))))) |
(12) |
|
0(2(0(1(x1)))) |
→ |
0(0(2(4(1(x1))))) |
(13) |
|
0(5(3(1(x1)))) |
→ |
5(0(3(1(1(1(x1)))))) |
(14) |
|
0(5(3(2(x1)))) |
→ |
0(3(4(2(5(x1))))) |
(15) |
|
2(3(2(0(x1)))) |
→ |
2(2(1(3(0(x1))))) |
(16) |
|
2(4(5(2(x1)))) |
→ |
2(1(4(2(5(x1))))) |
(17) |
|
3(0(1(2(x1)))) |
→ |
3(4(0(2(1(x1))))) |
(18) |
|
4(4(3(2(x1)))) |
→ |
4(3(4(2(1(x1))))) |
(19) |
|
4(5(3(1(x1)))) |
→ |
3(5(4(4(1(x1))))) |
(20) |
|
4(5(3(1(x1)))) |
→ |
4(3(1(5(1(x1))))) |
(21) |
|
4(5(3(2(x1)))) |
→ |
3(4(2(5(4(x1))))) |
(22) |
|
4(5(3(2(x1)))) |
→ |
3(5(4(2(1(x1))))) |
(23) |
|
0(1(0(2(2(x1))))) |
→ |
0(0(2(1(4(2(x1)))))) |
(24) |
|
0(1(0(3(1(x1))))) |
→ |
0(3(4(0(1(1(x1)))))) |
(25) |
|
0(1(4(5(1(x1))))) |
→ |
4(0(2(5(1(1(x1)))))) |
(26) |
|
0(1(5(0(1(x1))))) |
→ |
0(0(1(5(5(1(x1)))))) |
(27) |
|
0(2(3(1(3(x1))))) |
→ |
0(3(4(2(1(3(x1)))))) |
(28) |
|
0(4(1(5(2(x1))))) |
→ |
0(4(2(5(1(1(x1)))))) |
(29) |
|
0(5(1(3(2(x1))))) |
→ |
3(0(2(1(1(5(x1)))))) |
(30) |
|
0(5(2(0(4(x1))))) |
→ |
0(4(2(5(0(4(x1)))))) |
(31) |
|
0(5(3(1(5(x1))))) |
→ |
5(0(3(4(1(5(x1)))))) |
(32) |
|
0(5(3(2(5(x1))))) |
→ |
0(4(3(5(2(5(x1)))))) |
(33) |
|
2(0(1(3(1(x1))))) |
→ |
1(1(4(3(0(2(x1)))))) |
(34) |
|
2(0(1(3(5(x1))))) |
→ |
2(5(1(1(0(3(x1)))))) |
(35) |
|
2(0(1(5(3(x1))))) |
→ |
2(1(1(3(0(5(x1)))))) |
(36) |
|
2(3(1(0(1(x1))))) |
→ |
0(3(2(1(1(5(x1)))))) |
(37) |
|
2(3(1(4(1(x1))))) |
→ |
3(4(2(5(1(1(x1)))))) |
(38) |
|
2(3(5(1(2(x1))))) |
→ |
2(3(2(1(5(1(x1)))))) |
(39) |
|
3(0(1(2(0(x1))))) |
→ |
3(4(0(2(1(0(x1)))))) |
(40) |
|
3(2(0(1(0(x1))))) |
→ |
3(2(1(5(0(0(x1)))))) |
(41) |
|
3(2(3(5(1(x1))))) |
→ |
3(3(4(2(1(5(x1)))))) |
(42) |
|
3(5(3(1(3(x1))))) |
→ |
3(5(4(3(1(3(x1)))))) |
(43) |
|
4(0(3(3(1(x1))))) |
→ |
0(3(4(3(1(1(x1)))))) |
(44) |
|
4(4(3(2(5(x1))))) |
→ |
3(4(2(4(1(5(x1)))))) |
(45) |
|
4(5(0(5(2(x1))))) |
→ |
0(4(2(1(5(5(x1)))))) |
(46) |
|
4(5(2(3(1(x1))))) |
→ |
5(3(4(3(2(1(x1)))))) |
(47) |
|
4(5(2(5(2(x1))))) |
→ |
4(2(5(5(2(1(x1)))))) |
(48) |
|
4(5(3(5(1(x1))))) |
→ |
4(5(5(4(3(1(x1)))))) |
(49) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by NaTT @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
There are 151 ruless (increase limit for explicit display).
1.1 Dependency Graph Processor
The dependency pairs are split into 2
components.