Left Termination proof of /tmp/tmpNenEic/mergesort

Left Termination of the query pattern mergesort_in_2(g, a) w.r.t. the given Prolog program could successfully be proven:

0 Prolog

↳1 PrologToDTProblemTransformerProof (⇐)

↳2 TRIPLES

↳3 TriplesToPiDPProof (⇐)

↳4 PiDP

↳5 DependencyGraphProof (⇔)

↳6 AND

    ↳7 PiDP

        ↳8 UsableRulesProof (⇔)

        ↳9 PiDP

        ↳10 PiDPToQDPProof (⇔)

        ↳11 QDP

        ↳12 QDPSizeChangeProof (⇔)

        ↳13 YES

    ↳14 PiDP

        ↳15 UsableRulesProof (⇔)

        ↳16 PiDP

        ↳17 PiDPToQDPProof (⇔)

        ↳18 QDP

        ↳19 QDPSizeChangeProof (⇔)

        ↳20 YES

    ↳21 PiDP

        ↳22 UsableRulesProof (⇔)

        ↳23 PiDP

        ↳24 PiDPToQDPProof (⇐)

        ↳25 QDP

        ↳26 MRRProof (⇔)

        ↳27 QDP

        ↳28 DependencyGraphProof (⇔)

        ↳29 QDP

        ↳30 UsableRulesProof (⇔)

        ↳31 QDP

        ↳32 QReductionProof (⇔)

        ↳33 QDP

        ↳34 QDPSizeChangeProof (⇔)

        ↳35 YES

    ↳36 PiDP

        ↳37 UsableRulesProof (⇔)

        ↳38 PiDP

        ↳39 PiDPToQDPProof (⇐)

        ↳40 QDP

        ↳41 QDPSizeChangeProof (⇔)

        ↳42 YES

    ↳43 PiDP

        ↳44 UsableRulesProof (⇔)

        ↳45 PiDP

        ↳46 PiDPToQDPProof (⇐)

        ↳47 QDP

        ↳48 QDPOrderProof (⇔)

        ↳49 QDP

        ↳50 DependencyGraphProof (⇔)

        ↳51 TRUE

(0) Obligation:

Clauses:

mergesort([], []).
mergesort(.(X, []), .(X, [])).
mergesort(.(X, .(Y, L1)), L2) :- ','(split2(.(X, .(Y, L1)), L3, L4), ','(mergesort(L3, L5), ','(mergesort(L4, L6), merge(L5, L6, L2)))).
split(L1, L2, L3) :- split0(L1, L2, L3).
split(L1, L2, L3) :- split1(L1, L2, L3).
split(L1, L2, L3) :- split2(L1, L2, L3).
split0([], [], []).
split1(.(X, []), .(X, []), []).
split2(.(X, .(Y, L1)), .(X, L2), .(Y, L3)) :- split(L1, L2, L3).
merge([], L1, L1).
merge(L1, [], L1).
merge(.(X, L1), .(Y, L2), .(X, L3)) :- ','(le(X, Y), merge(L1, .(Y, L2), L3)).
merge(.(X, L1), .(Y, L2), .(Y, L3)) :- ','(gt(X, Y), merge(.(X, L1), L2, L3)).
gt(s(X), s(Y)) :- gt(X, Y).
gt(s(X), 0).
le(s(X), s(Y)) :- le(X, Y).
le(0, s(Y)).
le(0, 0).

Queries:

mergesort(g,a).

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: mergesort(T1, T2)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: mergesort(T1, T2), SCOPE: 1, CLAUSE: 0 | mergesort(T1, T2), SCOPE: 1, CLAUSE: 1 | mergesort(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: true | mergesort([], T2), SCOPE: 1, CLAUSE: 1 | mergesort([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: mergesort(T1, T2), SCOPE: 1, CLAUSE: 1 | mergesort(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nmergesort(T1, T2) !=? mergesort([], [])", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: mergesort([], T2), SCOPE: 1, CLAUSE: 1 | mergesort([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: mergesort([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: true | mergesort(.(T4, []), T2), SCOPE: 1, CLAUSE: 2\n\nT4 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: mergesort(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nmergesort(T1, T2) !=? mergesort([], [])\nmergesort(T1, T2) !=? mergesort(.(X7, []), .(X7, []))", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: mergesort(.(T4, []), T2), SCOPE: 1, CLAUSE: 2\n\nT4 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: ','(split2(.(T10, .(T11, T12)), X21, X22), ','(mergesort(X21, X23), ','(mergesort(X22, X24), merge(X23, X24, T14))))\n\nT10 is ground\nT11 is ground\nT12 is ground\nX21 is free; \nX22 is free; \nX23 is free; \nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: ','(split2(.(T10, .(T11, T12)), X21, X22), ','(mergesort(X21, X23), ','(mergesort(X22, X24), merge(X23, X24, T14)))), SCOPE: 2, CLAUSE: 8\n\nT10 is ground\nT11 is ground\nT12 is ground\nX21 is free; \nX22 is free; \nX23 is free; \nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(split(T24, X53, X54), ','(mergesort(.(T22, X53), X23), ','(mergesort(.(T23, X54), X24), merge(X23, X24, T14))))\n\nT22 is ground\nT23 is ground\nT24 is ground\nX23 is free; \nX24 is free; \nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: split(T24, X53, X54)\n\nT24 is ground\nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: ','(mergesort(.(T22, T26), X23), ','(mergesort(.(T23, T27), X24), merge(X23, X24, T14)))\n\nT22 is ground\nT23 is ground\nT26 is ground\nT27 is ground\nX23 is free; \nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: split(T24, X53, X54), SCOPE: 3, CLAUSE: 3 | split(T24, X53, X54), SCOPE: 3, CLAUSE: 4 | split(T24, X53, X54), SCOPE: 3, CLAUSE: 5\n\nT24 is ground\nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: split(T24, X53, X54), SCOPE: 3, CLAUSE: 3\n\nT24 is ground\nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: split(T24, X53, X54), SCOPE: 3, CLAUSE: 4 | split(T24, X53, X54), SCOPE: 3, CLAUSE: 5\n\nT24 is ground\nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: split0(T33, X88, X89)\n\nT33 is ground\nX88 is free; \nX89 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: split0(T33, X88, X89), SCOPE: 4, CLAUSE: 6\n\nT33 is ground\nX88 is free; \nX89 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: split(T24, X53, X54), SCOPE: 3, CLAUSE: 4\n\nT24 is ground\nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: split(T24, X53, X54), SCOPE: 3, CLAUSE: 5\n\nT24 is ground\nX53 is free; \nX54 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: split1(T38, X113, X114)\n\nT38 is ground\nX113 is free; \nX114 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: split1(T38, X113, X114), SCOPE: 5, CLAUSE: 7\n\nT38 is ground\nX113 is free; \nX114 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: split2(T47, X139, X140)\n\nT47 is ground\nX139 is free; \nX140 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: split2(T47, X139, X140), SCOPE: 6, CLAUSE: 8\n\nT47 is ground\nX139 is free; \nX140 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: split(T59, X167, X168)\n\nT59 is ground\nX167 is free; \nX168 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: mergesort(.(T22, T26), X23)\n\nT22 is ground\nT26 is ground\nX23 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: ','(mergesort(.(T23, T27), X24), merge(T63, X24, T14))\n\nT23 is ground\nT27 is ground\nT63 is ground\nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: mergesort(.(T23, T27), X24)\n\nT23 is ground\nT27 is ground\nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: merge(T63, T68, T14)\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 9 | merge(T63, T68, T14), SCOPE: 7, CLAUSE: 10 | merge(T63, T68, T14), SCOPE: 7, CLAUSE: 11 | merge(T63, T68, T14), SCOPE: 7, CLAUSE: 12\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 9\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 10 | merge(T63, T68, T14), SCOPE: 7, CLAUSE: 11 | merge(T63, T68, T14), SCOPE: 7, CLAUSE: 12\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 10\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 11 | merge(T63, T68, T14), SCOPE: 7, CLAUSE: 12\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="52: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 11\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
53 [label="53: merge(T63, T68, T14), SCOPE: 7, CLAUSE: 12\n\nT63 is ground\nT68 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: ','(le(T103, T105), merge(T104, .(T105, T106), T108))\n\nT103 is ground\nT104 is ground\nT105 is ground\nT106 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: le(T103, T105)\n\nT103 is ground\nT105 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
57 [label="57: merge(T104, .(T105, T106), T108)\n\nT104 is ground\nT105 is ground\nT106 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: le(T103, T105), SCOPE: 8, CLAUSE: 15 | le(T103, T105), SCOPE: 8, CLAUSE: 16 | le(T103, T105), SCOPE: 8, CLAUSE: 17\n\nT103 is ground\nT105 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="59: le(T103, T105), SCOPE: 8, CLAUSE: 15\n\nT103 is ground\nT105 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
60 [label="60: le(T103, T105), SCOPE: 8, CLAUSE: 16 | le(T103, T105), SCOPE: 8, CLAUSE: 17\n\nT103 is ground\nT105 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
61 [label="61: le(T121, T122)\n\nT121 is ground\nT122 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
62 [label="62: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
63 [label="63: le(T103, T105), SCOPE: 8, CLAUSE: 16\n\nT103 is ground\nT105 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
64 [label="64: le(T103, T105), SCOPE: 8, CLAUSE: 17\n\nT103 is ground\nT105 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
65 [label="65: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
66 [label="66: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
67 [label="67: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
68 [label="68: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
69 [label="69: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
70 [label="70: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
71 [label="71: ','(gt(T144, T146), merge(.(T144, T145), T147, T149))\n\nT144 is ground\nT145 is ground\nT146 is ground\nT147 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
72 [label="72: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
73 [label="73: gt(T144, T146)\n\nT144 is ground\nT146 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
74 [label="74: merge(.(T144, T145), T147, T149)\n\nT144 is ground\nT145 is ground\nT147 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
75 [label="75: gt(T144, T146), SCOPE: 9, CLAUSE: 13 | gt(T144, T146), SCOPE: 9, CLAUSE: 14\n\nT144 is ground\nT146 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
76 [label="76: gt(T144, T146), SCOPE: 9, CLAUSE: 13\n\nT144 is ground\nT146 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
77 [label="77: gt(T144, T146), SCOPE: 9, CLAUSE: 14\n\nT144 is ground\nT146 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
78 [label="78: gt(T162, T163)\n\nT162 is ground\nT163 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
79 [label="79: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
80 [label="80: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
81 [label="81: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
82 [label="82: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
83 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 83 [arrowhead = none ];
83 -> 2;

84 [label="EVAL with clause\nmergesort([], []).\nand substitution\nT1 -> []\nT2 -> []", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 84 [arrowhead = none ];
84 -> 3;

85 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 85 [arrowhead = none ];
85 -> 4;

86 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
3 -> 86 [arrowhead = none ];
86 -> 5;

87 [label="EVAL with clause\nmergesort(.(X7, []), .(X7, [])).\nand substitution\nX7 -> T4\nT1 -> .(T4, [])\nT2 -> .(T4, [])", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 87 [arrowhead = none ];
87 -> 8;

88 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 88 [arrowhead = none ];
88 -> 9;

89 [label="BACKTRACK\nfor clause: mergesort(.(X, []), .(X, []))because of non-unification", fontsize=14, style = filled, fillcolor = white];
5 -> 89 [arrowhead = none ];
89 -> 6;

90 [label="BACKTRACK\nfor clause: mergesort(.(X, .(Y, L1)), L2) :- ','(split2(.(X, .(Y, L1)), L3, L4), ','(mergesort(L3, L5), ','(mergesort(L4, L6), merge(L5, L6, L2))))because of non-unification", fontsize=14, style = filled, fillcolor = white];
6 -> 90 [arrowhead = none ];
90 -> 7;

91 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
8 -> 91 [arrowhead = none ];
91 -> 10;

92 [label="EVAL with clause\nmergesort(.(X17, .(X18, X19)), X20) :- ','(split2(.(X17, .(X18, X19)), X21, X22), ','(mergesort(X21, X23), ','(mergesort(X22, X24), merge(X23, X24, X20)))).\nand substitution\nX17 -> T10\nX18 -> T11\nX19 -> T12\nT1 -> .(T10, .(T11, T12))\nT2 -> T14\nX20 -> T14\nT13 -> T14", fontsize=14, style = filled, fillcolor = lightblue];
9 -> 92 [arrowhead = none ];
92 -> 12;

93 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
9 -> 93 [arrowhead = none ];
93 -> 13;

94 [label="BACKTRACK\nfor clause: mergesort(.(X, .(Y, L1)), L2) :- ','(split2(.(X, .(Y, L1)), L3, L4), ','(mergesort(L3, L5), ','(mergesort(L4, L6), merge(L5, L6, L2))))because of non-unification", fontsize=14, style = filled, fillcolor = white];
10 -> 94 [arrowhead = none ];
94 -> 11;

95 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
12 -> 95 [arrowhead = none ];
95 -> 14;

96 [label="ONLY EVAL with clause\nsplit2(.(X48, .(X49, X50)), .(X48, X51), .(X49, X52)) :- split(X50, X51, X52).\nand substitution\nT10 -> T22\nX48 -> T22\nT11 -> T23\nX49 -> T23\nT12 -> T24\nX50 -> T24\nX51 -> X53\nX21 -> .(T22, X53)\nX52 -> X54\nX22 -> .(T23, X54)", fontsize=14, style = filled, fillcolor = white];
14 -> 96 [arrowhead = none ];
96 -> 15;

97 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
15 -> 97 [arrowhead = none ];
97 -> 16;

98 [label="SPLIT 2\nnew knowledge:\nT26 is ground\nT27 is ground\nreplacements:\nX53 -> T26\nX54 -> T27", fontsize=14, style = filled, fillcolor = violet];
15 -> 98 [arrowhead = none ];
98 -> 17;

99 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
16 -> 99 [arrowhead = none ];
99 -> 18;

100 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
17 -> 100 [arrowhead = none ];
100 -> 37;

101 [label="SPLIT 2\nnew knowledge:\nT63 is ground\nreplacements:\nX23 -> T63", fontsize=14, style = filled, fillcolor = violet];
17 -> 101 [arrowhead = none ];
101 -> 38;

102 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
18 -> 102 [arrowhead = none ];
102 -> 19;

103 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
18 -> 103 [arrowhead = none ];
103 -> 20;

104 [label="ONLY EVAL with clause\nsplit(X85, X86, X87) :- split0(X85, X86, X87).\nand substitution\nT24 -> T33\nX85 -> T33\nX53 -> X88\nX86 -> X88\nX54 -> X89\nX87 -> X89", fontsize=14, style = filled, fillcolor = white];
19 -> 104 [arrowhead = none ];
104 -> 21;

105 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
20 -> 105 [arrowhead = none ];
105 -> 26;

106 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
20 -> 106 [arrowhead = none ];
106 -> 27;

107 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
21 -> 107 [arrowhead = none ];
107 -> 22;

108 [label="EVAL with clause\nsplit0([], [], []).\nand substitution\nT33 -> []\nX88 -> []\nX89 -> []", fontsize=14, style = filled, fillcolor = lightblue];
22 -> 108 [arrowhead = none ];
108 -> 23;

109 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
22 -> 109 [arrowhead = none ];
109 -> 24;

110 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
23 -> 110 [arrowhead = none ];
110 -> 25;

111 [label="ONLY EVAL with clause\nsplit(X110, X111, X112) :- split1(X110, X111, X112).\nand substitution\nT24 -> T38\nX110 -> T38\nX53 -> X113\nX111 -> X113\nX54 -> X114\nX112 -> X114", fontsize=14, style = filled, fillcolor = white];
26 -> 111 [arrowhead = none ];
111 -> 28;

112 [label="ONLY EVAL with clause\nsplit(X136, X137, X138) :- split2(X136, X137, X138).\nand substitution\nT24 -> T47\nX136 -> T47\nX53 -> X139\nX137 -> X139\nX54 -> X140\nX138 -> X140", fontsize=14, style = filled, fillcolor = white];
27 -> 112 [arrowhead = none ];
112 -> 33;

113 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
28 -> 113 [arrowhead = none ];
113 -> 29;

114 [label="EVAL with clause\nsplit1(.(X117, []), .(X117, []), []).\nand substitution\nX117 -> T41\nT38 -> .(T41, [])\nX113 -> .(T41, [])\nX114 -> []", fontsize=14, style = filled, fillcolor = lightblue];
29 -> 114 [arrowhead = none ];
114 -> 30;

115 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
29 -> 115 [arrowhead = none ];
115 -> 31;

116 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
30 -> 116 [arrowhead = none ];
116 -> 32;

117 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
33 -> 117 [arrowhead = none ];
117 -> 34;

118 [label="EVAL with clause\nsplit2(.(X162, .(X163, X164)), .(X162, X165), .(X163, X166)) :- split(X164, X165, X166).\nand substitution\nX162 -> T57\nX163 -> T58\nX164 -> T59\nT47 -> .(T57, .(T58, T59))\nX165 -> X167\nX139 -> .(T57, X167)\nX166 -> X168\nX140 -> .(T58, X168)", fontsize=14, style = filled, fillcolor = lightblue];
34 -> 118 [arrowhead = none ];
118 -> 35;

119 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
34 -> 119 [arrowhead = none ];
119 -> 36;

120 [label="INSTANCE with matching:\nT24 -> T59\nX53 -> X167\nX54 -> X168", fontsize=14, style = filled, fillcolor = lightgrey];
35 -> 120 [arrowhead = none , style=dashed];
120 -> 16[style=dashed];

121 [label="INSTANCE with matching:\nT1 -> .(T22, T26)\nT2 -> X23", fontsize=14, style = filled, fillcolor = lightgrey];
37 -> 121 [arrowhead = none , style=dashed];
121 -> 1[style=dashed];

122 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
38 -> 122 [arrowhead = none ];
122 -> 39;

123 [label="SPLIT 2\nnew knowledge:\nT68 is ground\nreplacements:\nX24 -> T68", fontsize=14, style = filled, fillcolor = violet];
38 -> 123 [arrowhead = none ];
123 -> 40;

124 [label="INSTANCE with matching:\nT1 -> .(T23, T27)\nT2 -> X24", fontsize=14, style = filled, fillcolor = lightgrey];
39 -> 124 [arrowhead = none , style=dashed];
124 -> 1[style=dashed];

125 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
40 -> 125 [arrowhead = none ];
125 -> 41;

126 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
41 -> 126 [arrowhead = none ];
126 -> 42;

127 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
41 -> 127 [arrowhead = none ];
127 -> 43;

128 [label="EVAL with clause\nmerge([], X193, X193).\nand substitution\nT63 -> []\nT68 -> T77\nX193 -> T77\nT14 -> T77", fontsize=14, style = filled, fillcolor = lightblue];
42 -> 128 [arrowhead = none ];
128 -> 44;

129 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
42 -> 129 [arrowhead = none ];
129 -> 45;

130 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
43 -> 130 [arrowhead = none ];
130 -> 47;

131 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
43 -> 131 [arrowhead = none ];
131 -> 48;

132 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
44 -> 132 [arrowhead = none ];
132 -> 46;

133 [label="EVAL with clause\nmerge(X199, [], X199).\nand substitution\nT63 -> T82\nX199 -> T82\nT68 -> []\nT14 -> T82", fontsize=14, style = filled, fillcolor = lightblue];
47 -> 133 [arrowhead = none ];
133 -> 49;

134 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
47 -> 134 [arrowhead = none ];
134 -> 50;

135 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
48 -> 135 [arrowhead = none ];
135 -> 52;

136 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
48 -> 136 [arrowhead = none ];
136 -> 53;

137 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
49 -> 137 [arrowhead = none ];
137 -> 51;

138 [label="EVAL with clause\nmerge(.(X221, X222), .(X223, X224), .(X221, X225)) :- ','(le(X221, X223), merge(X222, .(X223, X224), X225)).\nand substitution\nX221 -> T103\nX222 -> T104\nT63 -> .(T103, T104)\nX223 -> T105\nX224 -> T106\nT68 -> .(T105, T106)\nX225 -> T108\nT14 -> .(T103, T108)\nT107 -> T108", fontsize=14, style = filled, fillcolor = lightblue];
52 -> 138 [arrowhead = none ];
138 -> 54;

139 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
52 -> 139 [arrowhead = none ];
139 -> 55;

140 [label="EVAL with clause\nmerge(.(X267, X268), .(X269, X270), .(X269, X271)) :- ','(gt(X267, X269), merge(.(X267, X268), X270, X271)).\nand substitution\nX267 -> T144\nX268 -> T145\nT63 -> .(T144, T145)\nX269 -> T146\nX270 -> T147\nT68 -> .(T146, T147)\nX271 -> T149\nT14 -> .(T146, T149)\nT148 -> T149", fontsize=14, style = filled, fillcolor = lightblue];
53 -> 140 [arrowhead = none ];
140 -> 71;

141 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
53 -> 141 [arrowhead = none ];
141 -> 72;

142 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
54 -> 142 [arrowhead = none ];
142 -> 56;

143 [label="SPLIT 2", fontsize=14, style = filled, fillcolor = violet];
54 -> 143 [arrowhead = none ];
143 -> 57;

144 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
56 -> 144 [arrowhead = none ];
144 -> 58;

145 [label="INSTANCE with matching:\nT63 -> T104\nT68 -> .(T105, T106)\nT14 -> T108", fontsize=14, style = filled, fillcolor = lightgrey];
57 -> 145 [arrowhead = none , style=dashed];
145 -> 40[style=dashed];

146 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
58 -> 146 [arrowhead = none ];
146 -> 59;

147 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
58 -> 147 [arrowhead = none ];
147 -> 60;

148 [label="EVAL with clause\nle(s(X243), s(X244)) :- le(X243, X244).\nand substitution\nX243 -> T121\nT103 -> s(T121)\nX244 -> T122\nT105 -> s(T122)", fontsize=14, style = filled, fillcolor = lightblue];
59 -> 148 [arrowhead = none ];
148 -> 61;

149 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
59 -> 149 [arrowhead = none ];
149 -> 62;

150 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
60 -> 150 [arrowhead = none ];
150 -> 63;

151 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
60 -> 151 [arrowhead = none ];
151 -> 64;

152 [label="INSTANCE with matching:\nT103 -> T121\nT105 -> T122", fontsize=14, style = filled, fillcolor = lightgrey];
61 -> 152 [arrowhead = none , style=dashed];
152 -> 56[style=dashed];

153 [label="EVAL with clause\nle(0, s(X253)).\nand substitution\nT103 -> 0\nX253 -> T129\nT105 -> s(T129)", fontsize=14, style = filled, fillcolor = lightblue];
63 -> 153 [arrowhead = none ];
153 -> 65;

154 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
63 -> 154 [arrowhead = none ];
154 -> 66;

155 [label="EVAL with clause\nle(0, 0).\nand substitution\nT103 -> 0\nT105 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
64 -> 155 [arrowhead = none ];
155 -> 68;

156 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
64 -> 156 [arrowhead = none ];
156 -> 69;

157 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
65 -> 157 [arrowhead = none ];
157 -> 67;

158 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
68 -> 158 [arrowhead = none ];
158 -> 70;

159 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
71 -> 159 [arrowhead = none ];
159 -> 73;

160 [label="SPLIT 2", fontsize=14, style = filled, fillcolor = violet];
71 -> 160 [arrowhead = none ];
160 -> 74;

161 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
73 -> 161 [arrowhead = none ];
161 -> 75;

162 [label="INSTANCE with matching:\nT63 -> .(T144, T145)\nT68 -> T147\nT14 -> T149", fontsize=14, style = filled, fillcolor = lightgrey];
74 -> 162 [arrowhead = none , style=dashed];
162 -> 40[style=dashed];

163 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
75 -> 163 [arrowhead = none ];
163 -> 76;

164 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
75 -> 164 [arrowhead = none ];
164 -> 77;

165 [label="EVAL with clause\ngt(s(X289), s(X290)) :- gt(X289, X290).\nand substitution\nX289 -> T162\nT144 -> s(T162)\nX290 -> T163\nT146 -> s(T163)", fontsize=14, style = filled, fillcolor = lightblue];
76 -> 165 [arrowhead = none ];
165 -> 78;

166 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
76 -> 166 [arrowhead = none ];
166 -> 79;

167 [label="EVAL with clause\ngt(s(X297), 0).\nand substitution\nX297 -> T168\nT144 -> s(T168)\nT146 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
77 -> 167 [arrowhead = none ];
167 -> 80;

168 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
77 -> 168 [arrowhead = none ];
168 -> 81;

169 [label="INSTANCE with matching:\nT144 -> T162\nT146 -> T163", fontsize=14, style = filled, fillcolor = lightgrey];
78 -> 169 [arrowhead = none , style=dashed];
169 -> 73[style=dashed];

170 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
80 -> 170 [arrowhead = none ];
170 -> 82;

}

(2) Obligation:

Triples:

split16(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) :- split16(T59, X167, X168).
merge40(.(T103, T104), .(T105, T106), .(T103, T108)) :- le56(T103, T105).
merge40(.(T103, T104), .(T105, T106), .(T103, T108)) :- ','(lec56(T103, T105), merge40(T104, .(T105, T106), T108)).
merge40(.(T144, T145), .(T146, T147), .(T146, T149)) :- gt73(T144, T146).
merge40(.(T144, T145), .(T146, T147), .(T146, T149)) :- ','(gtc73(T144, T146), merge40(.(T144, T145), T147, T149)).
le56(s(T121), s(T122)) :- le56(T121, T122).
gt73(s(T162), s(T163)) :- gt73(T162, T163).
mergesort1(.(T22, .(T23, T24)), T14) :- split16(T24, X53, X54).
mergesort1(.(T22, .(T23, T24)), T14) :- ','(splitc16(T24, T26, T27), mergesort1(.(T22, T26), X23)).
mergesort1(.(T22, .(T23, T24)), T14) :- ','(splitc16(T24, T26, T27), ','(mergesortc1(.(T22, T26), T63), mergesort1(.(T23, T27), X24))).
mergesort1(.(T22, .(T23, T24)), T14) :- ','(splitc16(T24, T26, T27), ','(mergesortc1(.(T22, T26), T63), ','(mergesortc1(.(T23, T27), T68), merge40(T63, T68, T14)))).

Clauses:

splitc16([], [], []).
splitc16(.(T41, []), .(T41, []), []).
splitc16(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) :- splitc16(T59, X167, X168).
mergesortc1([], []).
mergesortc1(.(T4, []), .(T4, [])).
mergesortc1(.(T22, .(T23, T24)), T14) :- ','(splitc16(T24, T26, T27), ','(mergesortc1(.(T22, T26), T63), ','(mergesortc1(.(T23, T27), T68), mergec40(T63, T68, T14)))).
mergec40([], T77, T77).
mergec40(T82, [], T82).
mergec40(.(T103, T104), .(T105, T106), .(T103, T108)) :- ','(lec56(T103, T105), mergec40(T104, .(T105, T106), T108)).
mergec40(.(T144, T145), .(T146, T147), .(T146, T149)) :- ','(gtc73(T144, T146), mergec40(.(T144, T145), T147, T149)).
lec56(s(T121), s(T122)) :- lec56(T121, T122).
lec56(0, s(T129)).
lec56(0, 0).
gtc73(s(T162), s(T163)) :- gtc73(T162, T163).
gtc73(s(T168), 0).

Afs:

mergesort1(x1, x2) = mergesort1(x1)

(3) TriplesToPiDPProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
mergesort1_in: (b,f)
split16_in: (b,f,f)
splitc16_in: (b,f,f)
mergesortc1_in: (b,f)
mergec40_in: (b,b,f)
lec56_in: (b,b)
gtc73_in: (b,b)
merge40_in: (b,b,f)
le56_in: (b,b)
gt73_in: (b,b)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → U10_GA(T22, T23, T24, T14, split16_in_gaa(T24, X53, X54))
MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → SPLIT16_IN_GAA(T24, X53, X54)
SPLIT16_IN_GAA(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U1_GAA(T57, T58, T59, X167, X168, split16_in_gaa(T59, X167, X168))
SPLIT16_IN_GAA(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → SPLIT16_IN_GAA(T59, X167, X168)
MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → U11_GA(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U12_GA(T22, T23, T24, T14, mergesort1_in_ga(.(T22, T26), X23))
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → MERGESORT1_IN_GA(.(T22, T26), X23)
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U13_GA(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U14_GA(T22, T23, T24, T14, mergesort1_in_ga(.(T23, T27), X24))
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → MERGESORT1_IN_GA(.(T23, T27), X24)
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U15_GA(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U15_GA(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U16_GA(T22, T23, T24, T14, merge40_in_gga(T63, T68, T14))
U15_GA(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → MERGE40_IN_GGA(T63, T68, T14)
MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → U2_GGA(T103, T104, T105, T106, T108, le56_in_gg(T103, T105))
MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → LE56_IN_GG(T103, T105)
LE56_IN_GG(s(T121), s(T122)) → U8_GG(T121, T122, le56_in_gg(T121, T122))
LE56_IN_GG(s(T121), s(T122)) → LE56_IN_GG(T121, T122)
MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → U3_GGA(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
U3_GGA(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U4_GGA(T103, T104, T105, T106, T108, merge40_in_gga(T104, .(T105, T106), T108))
U3_GGA(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → MERGE40_IN_GGA(T104, .(T105, T106), T108)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → U5_GGA(T144, T145, T146, T147, T149, gt73_in_gg(T144, T146))
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → GT73_IN_GG(T144, T146)
GT73_IN_GG(s(T162), s(T163)) → U9_GG(T162, T163, gt73_in_gg(T162, T163))
GT73_IN_GG(s(T162), s(T163)) → GT73_IN_GG(T162, T163)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → U6_GGA(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
U6_GGA(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U7_GGA(T144, T145, T146, T147, T149, merge40_in_gga(.(T144, T145), T147, T149))
U6_GGA(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147, T149)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

The argument filtering Pi contains the following mapping:
mergesort1_in_ga(x1, x2) = mergesort1_in_ga(x1)
.(x1, x2) = .(x1, x2)
split16_in_gaa(x1, x2, x3) = split16_in_gaa(x1)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
merge40_in_gga(x1, x2, x3) = merge40_in_gga(x1, x2)
le56_in_gg(x1, x2) = le56_in_gg(x1, x2)
gt73_in_gg(x1, x2) = gt73_in_gg(x1, x2)
MERGESORT1_IN_GA(x1, x2) = MERGESORT1_IN_GA(x1)
U10_GA(x1, x2, x3, x4, x5) = U10_GA(x1, x2, x3, x5)
SPLIT16_IN_GAA(x1, x2, x3) = SPLIT16_IN_GAA(x1)
U1_GAA(x1, x2, x3, x4, x5, x6) = U1_GAA(x1, x2, x3, x6)
U11_GA(x1, x2, x3, x4, x5) = U11_GA(x1, x2, x3, x5)
U12_GA(x1, x2, x3, x4, x5) = U12_GA(x1, x2, x3, x5)
U13_GA(x1, x2, x3, x4, x5, x6) = U13_GA(x1, x2, x3, x5, x6)
U14_GA(x1, x2, x3, x4, x5) = U14_GA(x1, x2, x3, x5)
U15_GA(x1, x2, x3, x4, x5, x6) = U15_GA(x1, x2, x3, x5, x6)
U16_GA(x1, x2, x3, x4, x5) = U16_GA(x1, x2, x3, x5)
MERGE40_IN_GGA(x1, x2, x3) = MERGE40_IN_GGA(x1, x2)
U2_GGA(x1, x2, x3, x4, x5, x6) = U2_GGA(x1, x2, x3, x4, x6)
LE56_IN_GG(x1, x2) = LE56_IN_GG(x1, x2)
U8_GG(x1, x2, x3) = U8_GG(x1, x2, x3)
U3_GGA(x1, x2, x3, x4, x5, x6) = U3_GGA(x1, x2, x3, x4, x6)
U4_GGA(x1, x2, x3, x4, x5, x6) = U4_GGA(x1, x2, x3, x4, x6)
U5_GGA(x1, x2, x3, x4, x5, x6) = U5_GGA(x1, x2, x3, x4, x6)
GT73_IN_GG(x1, x2) = GT73_IN_GG(x1, x2)
U9_GG(x1, x2, x3) = U9_GG(x1, x2, x3)
U6_GGA(x1, x2, x3, x4, x5, x6) = U6_GGA(x1, x2, x3, x4, x6)
U7_GGA(x1, x2, x3, x4, x5, x6) = U7_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains

Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES

(4) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → U10_GA(T22, T23, T24, T14, split16_in_gaa(T24, X53, X54))
MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → SPLIT16_IN_GAA(T24, X53, X54)
SPLIT16_IN_GAA(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U1_GAA(T57, T58, T59, X167, X168, split16_in_gaa(T59, X167, X168))
SPLIT16_IN_GAA(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → SPLIT16_IN_GAA(T59, X167, X168)
MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → U11_GA(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U12_GA(T22, T23, T24, T14, mergesort1_in_ga(.(T22, T26), X23))
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → MERGESORT1_IN_GA(.(T22, T26), X23)
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U13_GA(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U14_GA(T22, T23, T24, T14, mergesort1_in_ga(.(T23, T27), X24))
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → MERGESORT1_IN_GA(.(T23, T27), X24)
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U15_GA(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U15_GA(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U16_GA(T22, T23, T24, T14, merge40_in_gga(T63, T68, T14))
U15_GA(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → MERGE40_IN_GGA(T63, T68, T14)
MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → U2_GGA(T103, T104, T105, T106, T108, le56_in_gg(T103, T105))
MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → LE56_IN_GG(T103, T105)
LE56_IN_GG(s(T121), s(T122)) → U8_GG(T121, T122, le56_in_gg(T121, T122))
LE56_IN_GG(s(T121), s(T122)) → LE56_IN_GG(T121, T122)
MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → U3_GGA(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
U3_GGA(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U4_GGA(T103, T104, T105, T106, T108, merge40_in_gga(T104, .(T105, T106), T108))
U3_GGA(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → MERGE40_IN_GGA(T104, .(T105, T106), T108)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → U5_GGA(T144, T145, T146, T147, T149, gt73_in_gg(T144, T146))
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → GT73_IN_GG(T144, T146)
GT73_IN_GG(s(T162), s(T163)) → U9_GG(T162, T163, gt73_in_gg(T162, T163))
GT73_IN_GG(s(T162), s(T163)) → GT73_IN_GG(T162, T163)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → U6_GGA(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
U6_GGA(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U7_GGA(T144, T145, T146, T147, T149, merge40_in_gga(.(T144, T145), T147, T149))
U6_GGA(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147, T149)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 5 SCCs with 16 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GT73_IN_GG(s(T162), s(T163)) → GT73_IN_GG(T162, T163)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
GT73_IN_GG(x1, x2) = GT73_IN_GG(x1, x2)

We have to consider all (P,R,Pi)-chains

(8) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GT73_IN_GG(s(T162), s(T163)) → GT73_IN_GG(T162, T163)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(10) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GT73_IN_GG(s(T162), s(T163)) → GT73_IN_GG(T162, T163)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

GT73_IN_GG(s(T162), s(T163)) → GT73_IN_GG(T162, T163)
The graph contains the following edges 1 > 1, 2 > 2

(13) YES

(14) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LE56_IN_GG(s(T121), s(T122)) → LE56_IN_GG(T121, T122)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
LE56_IN_GG(x1, x2) = LE56_IN_GG(x1, x2)

We have to consider all (P,R,Pi)-chains

(15) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LE56_IN_GG(s(T121), s(T122)) → LE56_IN_GG(T121, T122)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(17) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(18) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LE56_IN_GG(s(T121), s(T122)) → LE56_IN_GG(T121, T122)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(19) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LE56_IN_GG(s(T121), s(T122)) → LE56_IN_GG(T121, T122)
The graph contains the following edges 1 > 1, 2 > 2

(20) YES

(21) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → U3_GGA(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
U3_GGA(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → MERGE40_IN_GGA(T104, .(T105, T106), T108)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → U6_GGA(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
U6_GGA(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147, T149)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
MERGE40_IN_GGA(x1, x2, x3) = MERGE40_IN_GGA(x1, x2)
U3_GGA(x1, x2, x3, x4, x5, x6) = U3_GGA(x1, x2, x3, x4, x6)
U6_GGA(x1, x2, x3, x4, x5, x6) = U6_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains

(22) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(23) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGE40_IN_GGA(.(T103, T104), .(T105, T106), .(T103, T108)) → U3_GGA(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
U3_GGA(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → MERGE40_IN_GGA(T104, .(T105, T106), T108)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147), .(T146, T149)) → U6_GGA(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
U6_GGA(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147, T149)

The TRS R consists of the following rules:

lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
MERGE40_IN_GGA(x1, x2, x3) = MERGE40_IN_GGA(x1, x2)
U3_GGA(x1, x2, x3, x4, x5, x6) = U3_GGA(x1, x2, x3, x4, x6)
U6_GGA(x1, x2, x3, x4, x5, x6) = U6_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains

(24) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(25) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MERGE40_IN_GGA(.(T103, T104), .(T105, T106)) → U3_GGA(T103, T104, T105, T106, lec56_in_gg(T103, T105))
U3_GGA(T103, T104, T105, T106, lec56_out_gg(T103, T105)) → MERGE40_IN_GGA(T104, .(T105, T106))
MERGE40_IN_GGA(.(T144, T145), .(T146, T147)) → U6_GGA(T144, T145, T146, T147, gtc73_in_gg(T144, T146))
U6_GGA(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147)

The TRS R consists of the following rules:

lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

lec56_in_gg(x0, x1)
gtc73_in_gg(x0, x1)
U27_gg(x0, x1, x2)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(26) MRRProof (EQUIVALENT transformation)

By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

MERGE40_IN_GGA(.(T103, T104), .(T105, T106)) → U3_GGA(T103, T104, T105, T106, lec56_in_gg(T103, T105))

Strictly oriented rules of the TRS R:

gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)

Used ordering: Polynomial interpretation [POLO]:

POL(.(x₁, x₂)) = 1 + 2·x₁ + x₂
POL(0) = 0
POL(MERGE40_IN_GGA(x₁, x₂)) = 2·x₁ + 2·x₂
POL(U27_gg(x₁, x₂, x₃)) = 2·x₁ + 2·x₂ + x₃
POL(U28_gg(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(U3_GGA(x₁, x₂, x₃, x₄, x₅)) = 2 + x₁ + 2·x₂ + 2·x₃ + 2·x₄ + x₅
POL(U6_GGA(x₁, x₂, x₃, x₄, x₅)) = 2 + 2·x₁ + 2·x₂ + 2·x₃ + 2·x₄ + 2·x₅
POL(gtc73_in_gg(x₁, x₂)) = 1 + x₁ + x₂
POL(gtc73_out_gg(x₁, x₂)) = x₁ + x₂
POL(lec56_in_gg(x₁, x₂)) = 2·x₁ + 2·x₂
POL(lec56_out_gg(x₁, x₂)) = 2·x₁ + 2·x₂
POL(s(x₁)) = 2·x₁

(27) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GGA(T103, T104, T105, T106, lec56_out_gg(T103, T105)) → MERGE40_IN_GGA(T104, .(T105, T106))
MERGE40_IN_GGA(.(T144, T145), .(T146, T147)) → U6_GGA(T144, T145, T146, T147, gtc73_in_gg(T144, T146))
U6_GGA(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147)

The TRS R consists of the following rules:

lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

lec56_in_gg(x0, x1)
gtc73_in_gg(x0, x1)
U27_gg(x0, x1, x2)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(28) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(29) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U6_GGA(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147)) → U6_GGA(T144, T145, T146, T147, gtc73_in_gg(T144, T146))

The TRS R consists of the following rules:

lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

lec56_in_gg(x0, x1)
gtc73_in_gg(x0, x1)
U27_gg(x0, x1, x2)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(30) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(31) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U6_GGA(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147)) → U6_GGA(T144, T145, T146, T147, gtc73_in_gg(T144, T146))

The TRS R consists of the following rules:

gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

lec56_in_gg(x0, x1)
gtc73_in_gg(x0, x1)
U27_gg(x0, x1, x2)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(32) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

lec56_in_gg(x0, x1)
U27_gg(x0, x1, x2)

(33) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U6_GGA(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147)
MERGE40_IN_GGA(.(T144, T145), .(T146, T147)) → U6_GGA(T144, T145, T146, T147, gtc73_in_gg(T144, T146))

The TRS R consists of the following rules:

gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

gtc73_in_gg(x0, x1)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(34) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

MERGE40_IN_GGA(.(T144, T145), .(T146, T147)) → U6_GGA(T144, T145, T146, T147, gtc73_in_gg(T144, T146))
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4
U6_GGA(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → MERGE40_IN_GGA(.(T144, T145), T147)
The graph contains the following edges 4 >= 2

(35) YES

(36) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

SPLIT16_IN_GAA(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → SPLIT16_IN_GAA(T59, X167, X168)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
SPLIT16_IN_GAA(x1, x2, x3) = SPLIT16_IN_GAA(x1)

We have to consider all (P,R,Pi)-chains

(37) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(38) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

SPLIT16_IN_GAA(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → SPLIT16_IN_GAA(T59, X167, X168)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
SPLIT16_IN_GAA(x1, x2, x3) = SPLIT16_IN_GAA(x1)

We have to consider all (P,R,Pi)-chains

(39) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(40) Obligation:

Q DP problem:
The TRS P consists of the following rules:

SPLIT16_IN_GAA(.(T57, .(T58, T59))) → SPLIT16_IN_GAA(T59)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(41) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

SPLIT16_IN_GAA(.(T57, .(T58, T59))) → SPLIT16_IN_GAA(T59)
The graph contains the following edges 1 > 1

(42) YES

(43) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → U11_GA(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → MERGESORT1_IN_GA(.(T22, T26), X23)
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U13_GA(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → MERGESORT1_IN_GA(.(T23, T27), X24)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
mergesortc1_in_ga([], []) → mergesortc1_out_ga([], [])
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
MERGESORT1_IN_GA(x1, x2) = MERGESORT1_IN_GA(x1)
U11_GA(x1, x2, x3, x4, x5) = U11_GA(x1, x2, x3, x5)
U13_GA(x1, x2, x3, x4, x5, x6) = U13_GA(x1, x2, x3, x5, x6)

We have to consider all (P,R,Pi)-chains

(44) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(45) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGESORT1_IN_GA(.(T22, .(T23, T24)), T14) → U11_GA(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → MERGESORT1_IN_GA(.(T22, T26), X23)
U11_GA(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U13_GA(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U13_GA(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → MERGESORT1_IN_GA(.(T23, T27), X24)

The TRS R consists of the following rules:

splitc16_in_gaa([], [], []) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, []), .(T41, []), []) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168)) → U18_gaa(T57, T58, T59, X167, X168, splitc16_in_gaa(T59, X167, X168))
mergesortc1_in_ga(.(T4, []), .(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24)), T14) → U19_ga(T22, T23, T24, T14, splitc16_in_gaa(T24, T26, T27))
U18_gaa(T57, T58, T59, X167, X168, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
U19_ga(T22, T23, T24, T14, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T14, T27, mergesortc1_in_ga(.(T22, T26), T63))
U20_ga(T22, T23, T24, T14, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T14, T63, mergesortc1_in_ga(.(T23, T27), T68))
U21_ga(T22, T23, T24, T14, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, T14, mergec40_in_gga(T63, T68, T14))
U22_ga(T22, T23, T24, T14, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)
mergec40_in_gga([], T77, T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, [], T82) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106), .(T103, T108)) → U23_gga(T103, T104, T105, T106, T108, lec56_in_gg(T103, T105))
mergec40_in_gga(.(T144, T145), .(T146, T147), .(T146, T149)) → U25_gga(T144, T145, T146, T147, T149, gtc73_in_gg(T144, T146))
U23_gga(T103, T104, T105, T106, T108, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, T108, mergec40_in_gga(T104, .(T105, T106), T108))
U25_gga(T144, T145, T146, T147, T149, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, T149, mergec40_in_gga(.(T144, T145), T147, T149))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U24_gga(T103, T104, T105, T106, T108, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U26_gga(T144, T145, T146, T147, T149, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x1, x2)
splitc16_in_gaa(x1, x2, x3) = splitc16_in_gaa(x1)
[] = []
splitc16_out_gaa(x1, x2, x3) = splitc16_out_gaa(x1, x2, x3)
U18_gaa(x1, x2, x3, x4, x5, x6) = U18_gaa(x1, x2, x3, x6)
mergesortc1_in_ga(x1, x2) = mergesortc1_in_ga(x1)
mergesortc1_out_ga(x1, x2) = mergesortc1_out_ga(x1, x2)
U19_ga(x1, x2, x3, x4, x5) = U19_ga(x1, x2, x3, x5)
U20_ga(x1, x2, x3, x4, x5, x6) = U20_ga(x1, x2, x3, x5, x6)
U21_ga(x1, x2, x3, x4, x5, x6) = U21_ga(x1, x2, x3, x5, x6)
U22_ga(x1, x2, x3, x4, x5) = U22_ga(x1, x2, x3, x5)
mergec40_in_gga(x1, x2, x3) = mergec40_in_gga(x1, x2)
mergec40_out_gga(x1, x2, x3) = mergec40_out_gga(x1, x2, x3)
U23_gga(x1, x2, x3, x4, x5, x6) = U23_gga(x1, x2, x3, x4, x6)
lec56_in_gg(x1, x2) = lec56_in_gg(x1, x2)
s(x1) = s(x1)
U27_gg(x1, x2, x3) = U27_gg(x1, x2, x3)
0 = 0
lec56_out_gg(x1, x2) = lec56_out_gg(x1, x2)
U24_gga(x1, x2, x3, x4, x5, x6) = U24_gga(x1, x2, x3, x4, x6)
U25_gga(x1, x2, x3, x4, x5, x6) = U25_gga(x1, x2, x3, x4, x6)
gtc73_in_gg(x1, x2) = gtc73_in_gg(x1, x2)
U28_gg(x1, x2, x3) = U28_gg(x1, x2, x3)
gtc73_out_gg(x1, x2) = gtc73_out_gg(x1, x2)
U26_gga(x1, x2, x3, x4, x5, x6) = U26_gga(x1, x2, x3, x4, x6)
MERGESORT1_IN_GA(x1, x2) = MERGESORT1_IN_GA(x1)
U11_GA(x1, x2, x3, x4, x5) = U11_GA(x1, x2, x3, x5)
U13_GA(x1, x2, x3, x4, x5, x6) = U13_GA(x1, x2, x3, x5, x6)

We have to consider all (P,R,Pi)-chains

(46) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(47) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MERGESORT1_IN_GA(.(T22, .(T23, T24))) → U11_GA(T22, T23, T24, splitc16_in_gaa(T24))
U11_GA(T22, T23, T24, splitc16_out_gaa(T24, T26, T27)) → MERGESORT1_IN_GA(.(T22, T26))
U11_GA(T22, T23, T24, splitc16_out_gaa(T24, T26, T27)) → U13_GA(T22, T23, T24, T27, mergesortc1_in_ga(.(T22, T26)))
U13_GA(T22, T23, T24, T27, mergesortc1_out_ga(.(T22, T26), T63)) → MERGESORT1_IN_GA(.(T23, T27))

The TRS R consists of the following rules:

splitc16_in_gaa([]) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, [])) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59))) → U18_gaa(T57, T58, T59, splitc16_in_gaa(T59))
mergesortc1_in_ga(.(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24))) → U19_ga(T22, T23, T24, splitc16_in_gaa(T24))
U18_gaa(T57, T58, T59, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
U19_ga(T22, T23, T24, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T27, mergesortc1_in_ga(.(T22, T26)))
U20_ga(T22, T23, T24, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T63, mergesortc1_in_ga(.(T23, T27)))
U21_ga(T22, T23, T24, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, mergec40_in_gga(T63, T68))
U22_ga(T22, T23, T24, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)
mergec40_in_gga([], T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, []) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106)) → U23_gga(T103, T104, T105, T106, lec56_in_gg(T103, T105))
mergec40_in_gga(.(T144, T145), .(T146, T147)) → U25_gga(T144, T145, T146, T147, gtc73_in_gg(T144, T146))
U23_gga(T103, T104, T105, T106, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, mergec40_in_gga(T104, .(T105, T106)))
U25_gga(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, mergec40_in_gga(.(T144, T145), T147))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U24_gga(T103, T104, T105, T106, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U26_gga(T144, T145, T146, T147, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

splitc16_in_gaa(x0)
mergesortc1_in_ga(x0)
U18_gaa(x0, x1, x2, x3)
U19_ga(x0, x1, x2, x3)
U20_ga(x0, x1, x2, x3, x4)
U21_ga(x0, x1, x2, x3, x4)
U22_ga(x0, x1, x2, x3)
mergec40_in_gga(x0, x1)
U23_gga(x0, x1, x2, x3, x4)
U25_gga(x0, x1, x2, x3, x4)
lec56_in_gg(x0, x1)
U24_gga(x0, x1, x2, x3, x4)
gtc73_in_gg(x0, x1)
U26_gga(x0, x1, x2, x3, x4)
U27_gg(x0, x1, x2)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11_GA(T22, T23, T24, splitc16_out_gaa(T24, T26, T27)) → MERGESORT1_IN_GA(.(T22, T26))
U13_GA(T22, T23, T24, T27, mergesortc1_out_ga(.(T22, T26), T63)) → MERGESORT1_IN_GA(.(T23, T27))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( U11_GA(x₁, ..., x₄) ) = 2x₁ + 2x₂ + 2x₄ + 2

POL( U13_GA(x₁, ..., x₅) ) = 2x₂ + 2x₄ + 2

POL( U19_ga(x₁, ..., x₄) ) = x₁ + x₂ + 2x₃ + x₄ + 2

POL( splitc16_in_gaa(x₁) ) = 2x₁

POL( [] ) = 2

POL( splitc16_out_gaa(x₁, ..., x₃) ) = x₂ + x₃

POL( .(x₁, x₂) ) = 2x₁ + 2x₂ + 1

POL( U18_gaa(x₁, ..., x₄) ) = 2x₁ + 2x₂ + x₃ + 2x₄ + 2

POL( mergesortc1_in_ga(x₁) ) = 2

POL( mergesortc1_out_ga(x₁, x₂) ) = 2x₂ + 1

POL( U20_ga(x₁, ..., x₅) ) = 2x₂ + 2x₄ + x₅ + 2

POL( U21_ga(x₁, ..., x₅) ) = x₁ + x₂ + 2

POL( U22_ga(x₁, ..., x₄) ) = 2x₁ + 2x₂ + 2x₃

POL( mergec40_in_gga(x₁, x₂) ) = max{0, 2x₁ - 1}

POL( mergec40_out_gga(x₁, ..., x₃) ) = max{0, 2x₂ + 2x₃ - 2}

POL( U23_gga(x₁, ..., x₅) ) = max{0, x₁ + 2x₂ + 2x₃ + 2x₅ - 2}

POL( lec56_in_gg(x₁, x₂) ) = max{0, 2x₁ - 2}

POL( U25_gga(x₁, ..., x₅) ) = x₃ + 2x₄ + 1

POL( gtc73_in_gg(x₁, x₂) ) = 2x₂ + 2

POL( s(x₁) ) = max{0, -2}

POL( U27_gg(x₁, ..., x₃) ) = max{0, x₁ + x₂ + x₃ - 2}

POL( 0 ) = 2

POL( lec56_out_gg(x₁, x₂) ) = max{0, 2x₁ + 2x₂ - 1}

POL( U24_gga(x₁, ..., x₅) ) = 2x₁ + x₂ + 2x₃ + x₄ + 2x₅ + 2

POL( U28_gg(x₁, ..., x₃) ) = x₁ + 2x₂ + 2

POL( gtc73_out_gg(x₁, x₂) ) = max{0, -1}

POL( U26_gga(x₁, ..., x₅) ) = 2x₁ + 2x₃ + 2

POL( MERGESORT1_IN_GA(x₁) ) = max{0, x₁ - 1}

The following usable rules [FROCOS05] were oriented:

splitc16_in_gaa([]) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, [])) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59))) → U18_gaa(T57, T58, T59, splitc16_in_gaa(T59))
U18_gaa(T57, T58, T59, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))

(49) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MERGESORT1_IN_GA(.(T22, .(T23, T24))) → U11_GA(T22, T23, T24, splitc16_in_gaa(T24))
U11_GA(T22, T23, T24, splitc16_out_gaa(T24, T26, T27)) → U13_GA(T22, T23, T24, T27, mergesortc1_in_ga(.(T22, T26)))

The TRS R consists of the following rules:

splitc16_in_gaa([]) → splitc16_out_gaa([], [], [])
splitc16_in_gaa(.(T41, [])) → splitc16_out_gaa(.(T41, []), .(T41, []), [])
splitc16_in_gaa(.(T57, .(T58, T59))) → U18_gaa(T57, T58, T59, splitc16_in_gaa(T59))
mergesortc1_in_ga(.(T4, [])) → mergesortc1_out_ga(.(T4, []), .(T4, []))
mergesortc1_in_ga(.(T22, .(T23, T24))) → U19_ga(T22, T23, T24, splitc16_in_gaa(T24))
U18_gaa(T57, T58, T59, splitc16_out_gaa(T59, X167, X168)) → splitc16_out_gaa(.(T57, .(T58, T59)), .(T57, X167), .(T58, X168))
U19_ga(T22, T23, T24, splitc16_out_gaa(T24, T26, T27)) → U20_ga(T22, T23, T24, T27, mergesortc1_in_ga(.(T22, T26)))
U20_ga(T22, T23, T24, T27, mergesortc1_out_ga(.(T22, T26), T63)) → U21_ga(T22, T23, T24, T63, mergesortc1_in_ga(.(T23, T27)))
U21_ga(T22, T23, T24, T63, mergesortc1_out_ga(.(T23, T27), T68)) → U22_ga(T22, T23, T24, mergec40_in_gga(T63, T68))
U22_ga(T22, T23, T24, mergec40_out_gga(T63, T68, T14)) → mergesortc1_out_ga(.(T22, .(T23, T24)), T14)
mergec40_in_gga([], T77) → mergec40_out_gga([], T77, T77)
mergec40_in_gga(T82, []) → mergec40_out_gga(T82, [], T82)
mergec40_in_gga(.(T103, T104), .(T105, T106)) → U23_gga(T103, T104, T105, T106, lec56_in_gg(T103, T105))
mergec40_in_gga(.(T144, T145), .(T146, T147)) → U25_gga(T144, T145, T146, T147, gtc73_in_gg(T144, T146))
U23_gga(T103, T104, T105, T106, lec56_out_gg(T103, T105)) → U24_gga(T103, T104, T105, T106, mergec40_in_gga(T104, .(T105, T106)))
U25_gga(T144, T145, T146, T147, gtc73_out_gg(T144, T146)) → U26_gga(T144, T145, T146, T147, mergec40_in_gga(.(T144, T145), T147))
lec56_in_gg(s(T121), s(T122)) → U27_gg(T121, T122, lec56_in_gg(T121, T122))
lec56_in_gg(0, s(T129)) → lec56_out_gg(0, s(T129))
lec56_in_gg(0, 0) → lec56_out_gg(0, 0)
U24_gga(T103, T104, T105, T106, mergec40_out_gga(T104, .(T105, T106), T108)) → mergec40_out_gga(.(T103, T104), .(T105, T106), .(T103, T108))
gtc73_in_gg(s(T162), s(T163)) → U28_gg(T162, T163, gtc73_in_gg(T162, T163))
gtc73_in_gg(s(T168), 0) → gtc73_out_gg(s(T168), 0)
U26_gga(T144, T145, T146, T147, mergec40_out_gga(.(T144, T145), T147, T149)) → mergec40_out_gga(.(T144, T145), .(T146, T147), .(T146, T149))
U27_gg(T121, T122, lec56_out_gg(T121, T122)) → lec56_out_gg(s(T121), s(T122))
U28_gg(T162, T163, gtc73_out_gg(T162, T163)) → gtc73_out_gg(s(T162), s(T163))

The set Q consists of the following terms:

splitc16_in_gaa(x0)
mergesortc1_in_ga(x0)
U18_gaa(x0, x1, x2, x3)
U19_ga(x0, x1, x2, x3)
U20_ga(x0, x1, x2, x3, x4)
U21_ga(x0, x1, x2, x3, x4)
U22_ga(x0, x1, x2, x3)
mergec40_in_gga(x0, x1)
U23_gga(x0, x1, x2, x3, x4)
U25_gga(x0, x1, x2, x3, x4)
lec56_in_gg(x0, x1)
U24_gga(x0, x1, x2, x3, x4)
gtc73_in_gg(x0, x1)
U26_gga(x0, x1, x2, x3, x4)
U27_gg(x0, x1, x2)
U28_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(50) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 2 less nodes.

(0) Obligation:

(1) PrologToDTProblemTransformerProof (SOUND transformation)

(2) Obligation:

(3) TriplesToPiDPProof (SOUND transformation)

(4) Obligation:

(5) DependencyGraphProof (EQUIVALENT transformation)

(6) Complex Obligation (AND)

(7) Obligation:

(8) UsableRulesProof (EQUIVALENT transformation)

(9) Obligation:

(10) PiDPToQDPProof (EQUIVALENT transformation)

(11) Obligation:

(12) QDPSizeChangeProof (EQUIVALENT transformation)

(13) YES

(14) Obligation:

(15) UsableRulesProof (EQUIVALENT transformation)

(16) Obligation:

(17) PiDPToQDPProof (EQUIVALENT transformation)

(18) Obligation:

(19) QDPSizeChangeProof (EQUIVALENT transformation)

(20) YES

(21) Obligation:

(22) UsableRulesProof (EQUIVALENT transformation)

(23) Obligation:

(24) PiDPToQDPProof (SOUND transformation)

(25) Obligation:

(26) MRRProof (EQUIVALENT transformation)

(27) Obligation:

(28) DependencyGraphProof (EQUIVALENT transformation)

(29) Obligation:

(30) UsableRulesProof (EQUIVALENT transformation)

(31) Obligation:

(32) QReductionProof (EQUIVALENT transformation)

(33) Obligation:

(34) QDPSizeChangeProof (EQUIVALENT transformation)

(35) YES

(36) Obligation:

(37) UsableRulesProof (EQUIVALENT transformation)

(38) Obligation:

(39) PiDPToQDPProof (SOUND transformation)

(40) Obligation:

(41) QDPSizeChangeProof (EQUIVALENT transformation)

(42) YES

(43) Obligation:

(44) UsableRulesProof (EQUIVALENT transformation)

(45) Obligation:

(46) PiDPToQDPProof (SOUND transformation)

(47) Obligation:

(48) QDPOrderProof (EQUIVALENT transformation)

(49) Obligation:

(50) DependencyGraphProof (EQUIVALENT transformation)

(51) TRUE