Left Termination proof of /tmp/tmpH3GnAd/inorder.pl

Left Termination of the query pattern inorder_in_2(g, a) w.r.t. the given Prolog program could not be shown:

0 Prolog

↳1 PrologToPrologProblemTransformerProof (⇐)

↳2 Prolog

    ↳3 PrologToPiTRSProof (⇐)

        ↳4 PiTRS

        ↳5 DependencyPairsProof (⇔)

        ↳6 PiDP

        ↳7 DependencyGraphProof (⇔)

        ↳8 AND

            ↳9 PiDP

                ↳10 UsableRulesProof (⇔)

                ↳11 PiDP

                ↳12 PiDPToQDPProof (⇐)

                ↳13 QDP

                ↳14 NonTerminationProof (⇔)

                ↳15 NO

            ↳16 PiDP

                ↳17 UsableRulesProof (⇔)

                ↳18 PiDP

                ↳19 PiDPToQDPProof (⇐)

                ↳20 QDP

                ↳21 NonTerminationProof (⇔)

                ↳22 NO

            ↳23 PiDP

                ↳24 UsableRulesProof (⇔)

                ↳25 PiDP

                ↳26 PiDPToQDPProof (⇐)

                ↳27 QDP

                ↳28 QDPSizeChangeProof (⇔)

                ↳29 YES

    ↳30 PrologToPiTRSProof (⇐)

        ↳31 PiTRS

        ↳32 DependencyPairsProof (⇔)

        ↳33 PiDP

        ↳34 DependencyGraphProof (⇔)

        ↳35 AND

            ↳36 PiDP

                ↳37 UsableRulesProof (⇔)

                ↳38 PiDP

                ↳39 PiDPToQDPProof (⇐)

                ↳40 QDP

                ↳41 NonTerminationProof (⇔)

                ↳42 NO

            ↳43 PiDP

                ↳44 UsableRulesProof (⇔)

                ↳45 PiDP

                ↳46 PiDPToQDPProof (⇐)

                ↳47 QDP

                ↳48 NonTerminationProof (⇔)

                ↳49 NO

            ↳50 PiDP

                ↳51 UsableRulesProof (⇔)

                ↳52 PiDP

                ↳53 PiDPToQDPProof (⇐)

                ↳54 QDP

                ↳55 QDPSizeChangeProof (⇔)

                ↳56 YES

(0) Obligation:

Clauses:

inorder(nil, []).
inorder(tree(L, V, R), I) :- ','(inorder(L, LI), ','(inorder(R, RI), append(LI, .(V, RI), I))).
append([], X, X).
append(.(X, Xs), Ys, .(X, Zs)) :- append(Xs, Ys, Zs).

Queries:

inorder(g,a).

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: inorder(T1, T2)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: inorder(T1, T2), SCOPE: 1, CLAUSE: 0 | inorder(T1, T2), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: true | inorder(nil, T2), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: inorder(T1, T2), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\ninorder(T1, T2) !=? inorder(nil, [])", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: inorder(nil, T2), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: ','(inorder(T7, X13), ','(inorder(T9, X14), append(X13, .(T8, X14), T11)))\n\nT7 is ground\nT8 is ground\nT9 is ground\nX13 is free; \nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: ','(inorder(T7, X13), ','(inorder(T9, X14), append(X13, .(T8, X14), T11))), SCOPE: 2, CLAUSE: 0 | ','(inorder(T7, X13), ','(inorder(T9, X14), append(X13, .(T8, X14), T11))), SCOPE: 2, CLAUSE: 1\n\nT7 is ground\nT8 is ground\nT9 is ground\nX13 is free; \nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: ','(inorder(T7, X13), ','(inorder(T9, X14), append(X13, .(T8, X14), T11))), SCOPE: 2, CLAUSE: 0\n\nT7 is ground\nT8 is ground\nT9 is ground\nX13 is free; \nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: ','(inorder(T7, X13), ','(inorder(T9, X14), append(X13, .(T8, X14), T11))), SCOPE: 2, CLAUSE: 1\n\nT7 is ground\nT8 is ground\nT9 is ground\nX13 is free; \nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: ','(inorder(T9, X14), append([], .(T8, X14), T11))\n\nT8 is ground\nT9 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: inorder(T9, X14)\n\nT9 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: append([], .(T8, T12), T11)\n\nT8 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: inorder(T9, X14), SCOPE: 3, CLAUSE: 0 | inorder(T9, X14), SCOPE: 3, CLAUSE: 1\n\nT9 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: inorder(T9, X14), SCOPE: 3, CLAUSE: 0\n\nT9 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: inorder(T9, X14), SCOPE: 3, CLAUSE: 1\n\nT9 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: ','(inorder(T19, X35), ','(inorder(T21, X36), append(X35, .(T20, X36), X37)))\n\nT19 is ground\nT20 is ground\nT21 is ground\nX37 is free; \nX35 is free; \nX36 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: inorder(T19, X35)\n\nT19 is ground\nX35 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: ','(inorder(T21, X36), append(T22, .(T20, X36), X37))\n\nT20 is ground\nT21 is ground\nT22 is ground\nX37 is free; \nX36 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: inorder(T21, X36)\n\nT21 is ground\nX36 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: append(T22, .(T20, T23), X37)\n\nT20 is ground\nT22 is ground\nT23 is ground\nX37 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: append(T22, .(T20, T23), X37), SCOPE: 4, CLAUSE: 2 | append(T22, .(T20, T23), X37), SCOPE: 4, CLAUSE: 3\n\nT20 is ground\nT22 is ground\nT23 is ground\nX37 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: append(T22, .(T20, T23), X37), SCOPE: 4, CLAUSE: 2\n\nT20 is ground\nT22 is ground\nT23 is ground\nX37 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: append(T22, .(T20, T23), X37), SCOPE: 4, CLAUSE: 3\n\nT20 is ground\nT22 is ground\nT23 is ground\nX37 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: append(T47, .(T48, T49), X64)\n\nT47 is ground\nT48 is ground\nT49 is ground\nX64 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: append([], .(T8, T12), T11), SCOPE: 5, CLAUSE: 2 | append([], .(T8, T12), T11), SCOPE: 5, CLAUSE: 3\n\nT8 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: append([], .(T8, T12), T11), SCOPE: 5, CLAUSE: 2\n\nT8 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: append([], .(T8, T12), T11), SCOPE: 5, CLAUSE: 3\n\nT8 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: ','(inorder(T74, X99), ','(inorder(T76, X100), ','(append(X99, .(T75, X100), X101), ','(inorder(T9, X14), append(X101, .(T8, X14), T11)))))\n\nT8 is ground\nT9 is ground\nT74 is ground\nT75 is ground\nT76 is ground\nX14 is free; \nX101 is free; \nX99 is free; \nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: inorder(T74, X99)\n\nT74 is ground\nX99 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: ','(inorder(T76, X100), ','(append(T77, .(T75, X100), X101), ','(inorder(T9, X14), append(X101, .(T8, X14), T11))))\n\nT8 is ground\nT9 is ground\nT75 is ground\nT76 is ground\nT77 is ground\nX14 is free; \nX101 is free; \nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: inorder(T76, X100)\n\nT76 is ground\nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: ','(append(T77, .(T75, T78), X101), ','(inorder(T9, X14), append(X101, .(T8, X14), T11)))\n\nT8 is ground\nT9 is ground\nT75 is ground\nT77 is ground\nT78 is ground\nX14 is free; \nX101 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: append(T77, .(T75, T78), X101)\n\nT75 is ground\nT77 is ground\nT78 is ground\nX101 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: ','(inorder(T9, X14), append(T83, .(T8, X14), T11))\n\nT8 is ground\nT9 is ground\nT83 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: inorder(T9, X14)\n\nT9 is ground\nX14 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="52: append(T83, .(T8, T88), T11)\n\nT8 is ground\nT83 is ground\nT88 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
53 [label="53: append(T83, .(T8, T88), T11), SCOPE: 6, CLAUSE: 2 | append(T83, .(T8, T88), T11), SCOPE: 6, CLAUSE: 3\n\nT8 is ground\nT83 is ground\nT88 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: append(T83, .(T8, T88), T11), SCOPE: 6, CLAUSE: 2\n\nT8 is ground\nT83 is ground\nT88 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: append(T83, .(T8, T88), T11), SCOPE: 6, CLAUSE: 3\n\nT8 is ground\nT83 is ground\nT88 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
57 [label="57: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="59: append(T114, .(T115, T116), T118)\n\nT114 is ground\nT115 is ground\nT116 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
60 [label="60: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
61 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 61 [arrowhead = none ];
61 -> 2;

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

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

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

65 [label="EVAL with clause\ninorder(tree(X9, X10, X11), X12) :- ','(inorder(X9, X13), ','(inorder(X11, X14), append(X13, .(X10, X14), X12))).\nand substitution\nX9 -> T7\nX10 -> T8\nX11 -> T9\nT1 -> tree(T7, T8, T9)\nT2 -> T11\nX12 -> T11\nT10 -> T11", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 65 [arrowhead = none ];
65 -> 7;

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

67 [label="BACKTRACK\nfor clause: inorder(tree(L, V, R), I) :- ','(inorder(L, LI), ','(inorder(R, RI), append(LI, .(V, RI), I)))because of non-unification", fontsize=14, style = filled, fillcolor = white];
5 -> 67 [arrowhead = none ];
67 -> 6;

68 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
7 -> 68 [arrowhead = none ];
68 -> 9;

69 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
9 -> 69 [arrowhead = none ];
69 -> 10;

70 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
9 -> 70 [arrowhead = none ];
70 -> 11;

71 [label="EVAL with clause\ninorder(nil, []).\nand substitution\nT7 -> nil\nX13 -> []", fontsize=14, style = filled, fillcolor = lightblue];
10 -> 71 [arrowhead = none ];
71 -> 12;

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

73 [label="EVAL with clause\ninorder(tree(X95, X96, X97), X98) :- ','(inorder(X95, X99), ','(inorder(X97, X100), append(X99, .(X96, X100), X98))).\nand substitution\nX95 -> T74\nX96 -> T75\nX97 -> T76\nT7 -> tree(T74, T75, T76)\nX13 -> X101\nX98 -> X101", fontsize=14, style = filled, fillcolor = lightblue];
11 -> 73 [arrowhead = none ];
73 -> 43;

74 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
11 -> 74 [arrowhead = none ];
74 -> 44;

75 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
12 -> 75 [arrowhead = none ];
75 -> 14;

76 [label="SPLIT 2\nnew knowledge:\nT12 is ground\nreplacements:\nX14 -> T12", fontsize=14, style = filled, fillcolor = violet];
12 -> 76 [arrowhead = none ];
76 -> 15;

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

78 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
15 -> 78 [arrowhead = none ];
78 -> 36;

79 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
16 -> 79 [arrowhead = none ];
79 -> 17;

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

81 [label="EVAL with clause\ninorder(nil, []).\nand substitution\nT9 -> nil\nX14 -> []", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 81 [arrowhead = none ];
81 -> 19;

82 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 82 [arrowhead = none ];
82 -> 20;

83 [label="EVAL with clause\ninorder(tree(X31, X32, X33), X34) :- ','(inorder(X31, X35), ','(inorder(X33, X36), append(X35, .(X32, X36), X34))).\nand substitution\nX31 -> T19\nX32 -> T20\nX33 -> T21\nT9 -> tree(T19, T20, T21)\nX14 -> X37\nX34 -> X37", fontsize=14, style = filled, fillcolor = lightblue];
18 -> 83 [arrowhead = none ];
83 -> 22;

84 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
18 -> 84 [arrowhead = none ];
84 -> 23;

85 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
19 -> 85 [arrowhead = none ];
85 -> 21;

86 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
22 -> 86 [arrowhead = none ];
86 -> 24;

87 [label="SPLIT 2\nnew knowledge:\nT22 is ground\nreplacements:\nX35 -> T22", fontsize=14, style = filled, fillcolor = violet];
22 -> 87 [arrowhead = none ];
87 -> 25;

88 [label="INSTANCE with matching:\nT9 -> T19\nX14 -> X35", fontsize=14, style = filled, fillcolor = lightgrey];
24 -> 88 [arrowhead = none , style=dashed];
88 -> 14[style=dashed];

89 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
25 -> 89 [arrowhead = none ];
89 -> 26;

90 [label="SPLIT 2\nnew knowledge:\nT23 is ground\nreplacements:\nX36 -> T23", fontsize=14, style = filled, fillcolor = violet];
25 -> 90 [arrowhead = none ];
90 -> 27;

91 [label="INSTANCE with matching:\nT9 -> T21\nX14 -> X36", fontsize=14, style = filled, fillcolor = lightgrey];
26 -> 91 [arrowhead = none , style=dashed];
91 -> 14[style=dashed];

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

93 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
28 -> 93 [arrowhead = none ];
93 -> 29;

94 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
28 -> 94 [arrowhead = none ];
94 -> 30;

95 [label="EVAL with clause\nappend([], X48, X48).\nand substitution\nT22 -> []\nT20 -> T36\nT23 -> T37\nX48 -> .(T36, T37)\nX37 -> .(T36, T37)", fontsize=14, style = filled, fillcolor = lightblue];
29 -> 95 [arrowhead = none ];
95 -> 31;

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

97 [label="EVAL with clause\nappend(.(X60, X61), X62, .(X60, X63)) :- append(X61, X62, X63).\nand substitution\nX60 -> T46\nX61 -> T47\nT22 -> .(T46, T47)\nT20 -> T48\nT23 -> T49\nX62 -> .(T48, T49)\nX63 -> X64\nX37 -> .(T46, X64)", fontsize=14, style = filled, fillcolor = lightblue];
30 -> 97 [arrowhead = none ];
97 -> 34;

98 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
30 -> 98 [arrowhead = none ];
98 -> 35;

99 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
31 -> 99 [arrowhead = none ];
99 -> 33;

100 [label="INSTANCE with matching:\nT22 -> T47\nT20 -> T48\nT23 -> T49\nX37 -> X64", fontsize=14, style = filled, fillcolor = lightgrey];
34 -> 100 [arrowhead = none , style=dashed];
100 -> 27[style=dashed];

101 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
36 -> 101 [arrowhead = none ];
101 -> 37;

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

103 [label="EVAL with clause\nappend([], X77, X77).\nand substitution\nT8 -> T66\nT12 -> T67\nX77 -> .(T66, T67)\nT11 -> .(T66, T67)", fontsize=14, style = filled, fillcolor = lightblue];
37 -> 103 [arrowhead = none ];
103 -> 39;

104 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
37 -> 104 [arrowhead = none ];
104 -> 40;

105 [label="BACKTRACK\nfor clause: append(.(X, Xs), Ys, .(X, Zs)) :- append(Xs, Ys, Zs)because of non-unification", fontsize=14, style = filled, fillcolor = white];
38 -> 105 [arrowhead = none ];
105 -> 42;

106 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
39 -> 106 [arrowhead = none ];
106 -> 41;

107 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
43 -> 107 [arrowhead = none ];
107 -> 45;

108 [label="SPLIT 2\nnew knowledge:\nT77 is ground\nreplacements:\nX99 -> T77", fontsize=14, style = filled, fillcolor = violet];
43 -> 108 [arrowhead = none ];
108 -> 46;

109 [label="INSTANCE with matching:\nT9 -> T74\nX14 -> X99", fontsize=14, style = filled, fillcolor = lightgrey];
45 -> 109 [arrowhead = none , style=dashed];
109 -> 14[style=dashed];

110 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
46 -> 110 [arrowhead = none ];
110 -> 47;

111 [label="SPLIT 2\nnew knowledge:\nT78 is ground\nreplacements:\nX100 -> T78", fontsize=14, style = filled, fillcolor = violet];
46 -> 111 [arrowhead = none ];
111 -> 48;

112 [label="INSTANCE with matching:\nT9 -> T76\nX14 -> X100", fontsize=14, style = filled, fillcolor = lightgrey];
47 -> 112 [arrowhead = none , style=dashed];
112 -> 14[style=dashed];

113 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
48 -> 113 [arrowhead = none ];
113 -> 49;

114 [label="SPLIT 2\nnew knowledge:\nT83 is ground\nreplacements:\nX101 -> T83", fontsize=14, style = filled, fillcolor = violet];
48 -> 114 [arrowhead = none ];
114 -> 50;

115 [label="INSTANCE with matching:\nT22 -> T77\nT20 -> T75\nT23 -> T78\nX37 -> X101", fontsize=14, style = filled, fillcolor = lightgrey];
49 -> 115 [arrowhead = none , style=dashed];
115 -> 27[style=dashed];

116 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
50 -> 116 [arrowhead = none ];
116 -> 51;

117 [label="SPLIT 2\nnew knowledge:\nT88 is ground\nreplacements:\nX14 -> T88", fontsize=14, style = filled, fillcolor = violet];
50 -> 117 [arrowhead = none ];
117 -> 52;

118 [label="INSTANCE", fontsize=14, style = filled, fillcolor = lightgrey];
51 -> 118 [arrowhead = none , style=dashed];
118 -> 14[style=dashed];

119 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
52 -> 119 [arrowhead = none ];
119 -> 53;

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

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

122 [label="EVAL with clause\nappend([], X116, X116).\nand substitution\nT83 -> []\nT8 -> T101\nT88 -> T102\nX116 -> .(T101, T102)\nT11 -> .(T101, T102)", fontsize=14, style = filled, fillcolor = lightblue];
54 -> 122 [arrowhead = none ];
122 -> 56;

123 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
54 -> 123 [arrowhead = none ];
123 -> 57;

124 [label="EVAL with clause\nappend(.(X126, X127), X128, .(X126, X129)) :- append(X127, X128, X129).\nand substitution\nX126 -> T113\nX127 -> T114\nT83 -> .(T113, T114)\nT8 -> T115\nT88 -> T116\nX128 -> .(T115, T116)\nX129 -> T118\nT11 -> .(T113, T118)\nT117 -> T118", fontsize=14, style = filled, fillcolor = lightblue];
55 -> 124 [arrowhead = none ];
124 -> 59;

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

126 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
56 -> 126 [arrowhead = none ];
126 -> 58;

127 [label="INSTANCE with matching:\nT83 -> T114\nT8 -> T115\nT88 -> T116\nT11 -> T118", fontsize=14, style = filled, fillcolor = lightgrey];
59 -> 127 [arrowhead = none , style=dashed];
127 -> 52[style=dashed];

}

(2) Obligation:

Clauses:

inorder14(nil, []).
inorder14(tree(T19, T20, T21), X37) :- inorder14(T19, X35).
inorder14(tree(T19, T20, T21), X37) :- ','(inorder14(T19, T22), inorder14(T21, X36)).
inorder14(tree(T19, T20, T21), X37) :- ','(inorder14(T19, T22), ','(inorder14(T21, T23), append27(T22, T20, T23, X37))).
append27([], T36, T37, .(T36, T37)).
append27(.(T46, T47), T48, T49, .(T46, X64)) :- append27(T47, T48, T49, X64).
append52([], T101, T102, .(T101, T102)).
append52(.(T113, T114), T115, T116, .(T113, T118)) :- append52(T114, T115, T116, T118).
inorder1(nil, []).
inorder1(tree(nil, T8, T9), T11) :- inorder14(T9, X14).
inorder1(tree(nil, T66, T9), .(T66, T67)) :- inorder14(T9, T67).
inorder1(tree(tree(T74, T75, T76), T8, T9), T11) :- inorder14(T74, X99).
inorder1(tree(tree(T74, T75, T76), T8, T9), T11) :- ','(inorder14(T74, T77), inorder14(T76, X100)).
inorder1(tree(tree(T74, T75, T76), T8, T9), T11) :- ','(inorder14(T74, T77), ','(inorder14(T76, T78), append27(T77, T75, T78, X101))).
inorder1(tree(tree(T74, T75, T76), T8, T9), T11) :- ','(inorder14(T74, T77), ','(inorder14(T76, T78), ','(append27(T77, T75, T78, T83), inorder14(T9, X14)))).
inorder1(tree(tree(T74, T75, T76), T8, T9), T11) :- ','(inorder14(T74, T77), ','(inorder14(T76, T78), ','(append27(T77, T75, T78, T83), ','(inorder14(T9, T88), append52(T83, T8, T88, T11))))).

Queries:

inorder1(g,a).

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
inorder1_in: (b,f)
inorder14_in: (b,f)
append27_in: (f,b,f,f)
append52_in: (f,b,f,f)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

INORDER1_IN_GA(tree(nil, T8, T9), T11) → U8_GA(T8, T9, T11, inorder14_in_ga(T9, X14))
INORDER1_IN_GA(tree(nil, T8, T9), T11) → INORDER14_IN_GA(T9, X14)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U1_GA(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_GA(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_GA(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_GA(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → APPEND27_IN_AGAA(T22, T20, T23, X37)
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → U6_AGAA(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → U9_GA(T66, T9, T67, inorder14_in_ga(T9, T67))
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → INORDER14_IN_GA(T9, T67)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U10_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → INORDER14_IN_GA(T74, X99)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U11_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → INORDER14_IN_GA(T76, X100)
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → APPEND27_IN_AGAA(T77, T75, T78, X101)
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → INORDER14_IN_GA(T9, X14)
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_GA(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → APPEND52_IN_AGAA(T83, T8, T88, T11)
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → U7_AGAA(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

The argument filtering Pi contains the following mapping:
inorder1_in_ga(x1, x2) = inorder1_in_ga(x1)
nil = nil
inorder1_out_ga(x1, x2) = inorder1_out_ga(x1)
tree(x1, x2, x3) = tree(x1, x2, x3)
U8_ga(x1, x2, x3, x4) = U8_ga(x1, x2, x4)
inorder14_in_ga(x1, x2) = inorder14_in_ga(x1)
inorder14_out_ga(x1, x2) = inorder14_out_ga(x1)
U1_ga(x1, x2, x3, x4, x5) = U1_ga(x1, x2, x3, x5)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x1, x2, x3, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x1, x2, x3, x5)
U4_ga(x1, x2, x3, x4, x5, x6) = U4_ga(x1, x2, x3, x6)
U5_ga(x1, x2, x3, x4, x5) = U5_ga(x1, x2, x3, x5)
append27_in_agaa(x1, x2, x3, x4) = append27_in_agaa(x2)
append27_out_agaa(x1, x2, x3, x4) = append27_out_agaa(x1, x2)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x3, x6)
.(x1, x2) = .(x2)
U9_ga(x1, x2, x3, x4) = U9_ga(x1, x2, x4)
U10_ga(x1, x2, x3, x4, x5, x6, x7) = U10_ga(x1, x2, x3, x4, x5, x7)
U11_ga(x1, x2, x3, x4, x5, x6, x7) = U11_ga(x1, x2, x3, x4, x5, x7)
U12_ga(x1, x2, x3, x4, x5, x6, x7) = U12_ga(x1, x2, x3, x4, x5, x7)
U13_ga(x1, x2, x3, x4, x5, x6, x7, x8) = U13_ga(x1, x2, x3, x4, x5, x8)
U14_ga(x1, x2, x3, x4, x5, x6, x7) = U14_ga(x1, x2, x3, x4, x5, x7)
U15_ga(x1, x2, x3, x4, x5, x6, x7) = U15_ga(x1, x2, x3, x4, x5, x7)
U16_ga(x1, x2, x3, x4, x5, x6, x7) = U16_ga(x1, x2, x3, x4, x5, x7)
U17_ga(x1, x2, x3, x4, x5, x6, x7, x8) = U17_ga(x1, x2, x3, x4, x5, x8)
U18_ga(x1, x2, x3, x4, x5, x6, x7) = U18_ga(x1, x2, x3, x4, x5, x7)
append52_in_agaa(x1, x2, x3, x4) = append52_in_agaa(x2)
append52_out_agaa(x1, x2, x3, x4) = append52_out_agaa(x1, x2)
U7_agaa(x1, x2, x3, x4, x5, x6) = U7_agaa(x3, x6)
INORDER1_IN_GA(x1, x2) = INORDER1_IN_GA(x1)
U8_GA(x1, x2, x3, x4) = U8_GA(x1, x2, x4)
INORDER14_IN_GA(x1, x2) = INORDER14_IN_GA(x1)
U1_GA(x1, x2, x3, x4, x5) = U1_GA(x1, x2, x3, x5)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x1, x2, x3, x5)
U3_GA(x1, x2, x3, x4, x5) = U3_GA(x1, x2, x3, x5)
U4_GA(x1, x2, x3, x4, x5, x6) = U4_GA(x1, x2, x3, x6)
U5_GA(x1, x2, x3, x4, x5) = U5_GA(x1, x2, x3, x5)
APPEND27_IN_AGAA(x1, x2, x3, x4) = APPEND27_IN_AGAA(x2)
U6_AGAA(x1, x2, x3, x4, x5, x6) = U6_AGAA(x3, x6)
U9_GA(x1, x2, x3, x4) = U9_GA(x1, x2, x4)
U10_GA(x1, x2, x3, x4, x5, x6, x7) = U10_GA(x1, x2, x3, x4, x5, x7)
U11_GA(x1, x2, x3, x4, x5, x6, x7) = U11_GA(x1, x2, x3, x4, x5, x7)
U12_GA(x1, x2, x3, x4, x5, x6, x7) = U12_GA(x1, x2, x3, x4, x5, x7)
U13_GA(x1, x2, x3, x4, x5, x6, x7, x8) = U13_GA(x1, x2, x3, x4, x5, x8)
U14_GA(x1, x2, x3, x4, x5, x6, x7) = U14_GA(x1, x2, x3, x4, x5, x7)
U15_GA(x1, x2, x3, x4, x5, x6, x7) = U15_GA(x1, x2, x3, x4, x5, x7)
U16_GA(x1, x2, x3, x4, x5, x6, x7) = U16_GA(x1, x2, x3, x4, x5, x7)
U17_GA(x1, x2, x3, x4, x5, x6, x7, x8) = U17_GA(x1, x2, x3, x4, x5, x8)
U18_GA(x1, x2, x3, x4, x5, x6, x7) = U18_GA(x1, x2, x3, x4, x5, x7)
APPEND52_IN_AGAA(x1, x2, x3, x4) = APPEND52_IN_AGAA(x2)
U7_AGAA(x1, x2, x3, x4, x5, x6) = U7_AGAA(x3, x6)

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

(6) Obligation:

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

INORDER1_IN_GA(tree(nil, T8, T9), T11) → U8_GA(T8, T9, T11, inorder14_in_ga(T9, X14))
INORDER1_IN_GA(tree(nil, T8, T9), T11) → INORDER14_IN_GA(T9, X14)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U1_GA(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_GA(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_GA(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_GA(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → APPEND27_IN_AGAA(T22, T20, T23, X37)
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → U6_AGAA(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → U9_GA(T66, T9, T67, inorder14_in_ga(T9, T67))
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → INORDER14_IN_GA(T9, T67)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U10_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → INORDER14_IN_GA(T74, X99)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U11_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → INORDER14_IN_GA(T76, X100)
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → APPEND27_IN_AGAA(T77, T75, T78, X101)
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → INORDER14_IN_GA(T9, X14)
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_GA(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → APPEND52_IN_AGAA(T83, T8, T88, T11)
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → U7_AGAA(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 3 SCCs with 25 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

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

APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(10) UsableRulesProof (EQUIVALENT transformation)

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

(11) Obligation:

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

APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

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

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

(12) PiDPToQDPProof (SOUND transformation)

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

(13) Obligation:

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

APPEND52_IN_AGAA(T115) → APPEND52_IN_AGAA(T115)

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

(14) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

s = APPEND52_IN_AGAA(T115) evaluates to t =APPEND52_IN_AGAA(T115)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [ ]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from APPEND52_IN_AGAA(T115) to APPEND52_IN_AGAA(T115).

(15) NO

(16) Obligation:

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

APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(17) UsableRulesProof (EQUIVALENT transformation)

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

(18) Obligation:

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

APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)

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

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

(19) PiDPToQDPProof (SOUND transformation)

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

(20) Obligation:

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

APPEND27_IN_AGAA(T48) → APPEND27_IN_AGAA(T48)

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

(21) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

s = APPEND27_IN_AGAA(T48) evaluates to t =APPEND27_IN_AGAA(T48)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [ ]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from APPEND27_IN_AGAA(T48) to APPEND27_IN_AGAA(T48).

(22) NO

(23) Obligation:

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

INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(24) UsableRulesProof (EQUIVALENT transformation)

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

(25) Obligation:

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

INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)

The TRS R consists of the following rules:

inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))

The argument filtering Pi contains the following mapping:
nil = nil
tree(x1, x2, x3) = tree(x1, x2, x3)
inorder14_in_ga(x1, x2) = inorder14_in_ga(x1)
inorder14_out_ga(x1, x2) = inorder14_out_ga(x1)
U1_ga(x1, x2, x3, x4, x5) = U1_ga(x1, x2, x3, x5)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x1, x2, x3, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x1, x2, x3, x5)
U4_ga(x1, x2, x3, x4, x5, x6) = U4_ga(x1, x2, x3, x6)
U5_ga(x1, x2, x3, x4, x5) = U5_ga(x1, x2, x3, x5)
append27_in_agaa(x1, x2, x3, x4) = append27_in_agaa(x2)
append27_out_agaa(x1, x2, x3, x4) = append27_out_agaa(x1, x2)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x3, x6)
.(x1, x2) = .(x2)
INORDER14_IN_GA(x1, x2) = INORDER14_IN_GA(x1)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x1, x2, x3, x5)

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

(26) PiDPToQDPProof (SOUND transformation)

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

(27) Obligation:

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

INORDER14_IN_GA(tree(T19, T20, T21)) → U2_GA(T19, T20, T21, inorder14_in_ga(T19))
U2_GA(T19, T20, T21, inorder14_out_ga(T19)) → INORDER14_IN_GA(T21)
INORDER14_IN_GA(tree(T19, T20, T21)) → INORDER14_IN_GA(T19)

The TRS R consists of the following rules:

inorder14_in_ga(nil) → inorder14_out_ga(nil)
inorder14_in_ga(tree(T19, T20, T21)) → U1_ga(T19, T20, T21, inorder14_in_ga(T19))
inorder14_in_ga(tree(T19, T20, T21)) → U2_ga(T19, T20, T21, inorder14_in_ga(T19))
U1_ga(T19, T20, T21, inorder14_out_ga(T19)) → inorder14_out_ga(tree(T19, T20, T21))
U2_ga(T19, T20, T21, inorder14_out_ga(T19)) → U3_ga(T19, T20, T21, inorder14_in_ga(T21))
U2_ga(T19, T20, T21, inorder14_out_ga(T19)) → U4_ga(T19, T20, T21, inorder14_in_ga(T21))
U3_ga(T19, T20, T21, inorder14_out_ga(T21)) → inorder14_out_ga(tree(T19, T20, T21))
U4_ga(T19, T20, T21, inorder14_out_ga(T21)) → U5_ga(T19, T20, T21, append27_in_agaa(T20))
U5_ga(T19, T20, T21, append27_out_agaa(T22, T20)) → inorder14_out_ga(tree(T19, T20, T21))
append27_in_agaa(T36) → append27_out_agaa([], T36)
append27_in_agaa(T48) → U6_agaa(T48, append27_in_agaa(T48))
U6_agaa(T48, append27_out_agaa(T47, T48)) → append27_out_agaa(.(T47), T48)

The set Q consists of the following terms:

inorder14_in_ga(x0)
U1_ga(x0, x1, x2, x3)
U2_ga(x0, x1, x2, x3)
U3_ga(x0, x1, x2, x3)
U4_ga(x0, x1, x2, x3)
U5_ga(x0, x1, x2, x3)
append27_in_agaa(x0)
U6_agaa(x0, x1)

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

(28) 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:

U2_GA(T19, T20, T21, inorder14_out_ga(T19)) → INORDER14_IN_GA(T21)
The graph contains the following edges 3 >= 1
INORDER14_IN_GA(tree(T19, T20, T21)) → INORDER14_IN_GA(T19)
The graph contains the following edges 1 > 1
INORDER14_IN_GA(tree(T19, T20, T21)) → U2_GA(T19, T20, T21, inorder14_in_ga(T19))
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3

(29) YES

(30) PrologToPiTRSProof (SOUND transformation)

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(31) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(32) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

INORDER1_IN_GA(tree(nil, T8, T9), T11) → U8_GA(T8, T9, T11, inorder14_in_ga(T9, X14))
INORDER1_IN_GA(tree(nil, T8, T9), T11) → INORDER14_IN_GA(T9, X14)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U1_GA(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_GA(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_GA(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_GA(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → APPEND27_IN_AGAA(T22, T20, T23, X37)
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → U6_AGAA(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → U9_GA(T66, T9, T67, inorder14_in_ga(T9, T67))
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → INORDER14_IN_GA(T9, T67)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U10_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → INORDER14_IN_GA(T74, X99)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U11_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → INORDER14_IN_GA(T76, X100)
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → APPEND27_IN_AGAA(T77, T75, T78, X101)
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → INORDER14_IN_GA(T9, X14)
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_GA(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → APPEND52_IN_AGAA(T83, T8, T88, T11)
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → U7_AGAA(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

The argument filtering Pi contains the following mapping:
inorder1_in_ga(x1, x2) = inorder1_in_ga(x1)
nil = nil
inorder1_out_ga(x1, x2) = inorder1_out_ga
tree(x1, x2, x3) = tree(x1, x2, x3)
U8_ga(x1, x2, x3, x4) = U8_ga(x4)
inorder14_in_ga(x1, x2) = inorder14_in_ga(x1)
inorder14_out_ga(x1, x2) = inorder14_out_ga
U1_ga(x1, x2, x3, x4, x5) = U1_ga(x5)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x2, x3, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x5)
U4_ga(x1, x2, x3, x4, x5, x6) = U4_ga(x2, x6)
U5_ga(x1, x2, x3, x4, x5) = U5_ga(x5)
append27_in_agaa(x1, x2, x3, x4) = append27_in_agaa(x2)
append27_out_agaa(x1, x2, x3, x4) = append27_out_agaa(x1)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x6)
.(x1, x2) = .(x2)
U9_ga(x1, x2, x3, x4) = U9_ga(x4)
U10_ga(x1, x2, x3, x4, x5, x6, x7) = U10_ga(x7)
U11_ga(x1, x2, x3, x4, x5, x6, x7) = U11_ga(x2, x3, x4, x5, x7)
U12_ga(x1, x2, x3, x4, x5, x6, x7) = U12_ga(x7)
U13_ga(x1, x2, x3, x4, x5, x6, x7, x8) = U13_ga(x2, x4, x5, x8)
U14_ga(x1, x2, x3, x4, x5, x6, x7) = U14_ga(x7)
U15_ga(x1, x2, x3, x4, x5, x6, x7) = U15_ga(x4, x5, x7)
U16_ga(x1, x2, x3, x4, x5, x6, x7) = U16_ga(x7)
U17_ga(x1, x2, x3, x4, x5, x6, x7, x8) = U17_ga(x4, x8)
U18_ga(x1, x2, x3, x4, x5, x6, x7) = U18_ga(x7)
append52_in_agaa(x1, x2, x3, x4) = append52_in_agaa(x2)
append52_out_agaa(x1, x2, x3, x4) = append52_out_agaa(x1)
U7_agaa(x1, x2, x3, x4, x5, x6) = U7_agaa(x6)
INORDER1_IN_GA(x1, x2) = INORDER1_IN_GA(x1)
U8_GA(x1, x2, x3, x4) = U8_GA(x4)
INORDER14_IN_GA(x1, x2) = INORDER14_IN_GA(x1)
U1_GA(x1, x2, x3, x4, x5) = U1_GA(x5)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x2, x3, x5)
U3_GA(x1, x2, x3, x4, x5) = U3_GA(x5)
U4_GA(x1, x2, x3, x4, x5, x6) = U4_GA(x2, x6)
U5_GA(x1, x2, x3, x4, x5) = U5_GA(x5)
APPEND27_IN_AGAA(x1, x2, x3, x4) = APPEND27_IN_AGAA(x2)
U6_AGAA(x1, x2, x3, x4, x5, x6) = U6_AGAA(x6)
U9_GA(x1, x2, x3, x4) = U9_GA(x4)
U10_GA(x1, x2, x3, x4, x5, x6, x7) = U10_GA(x7)
U11_GA(x1, x2, x3, x4, x5, x6, x7) = U11_GA(x2, x3, x4, x5, x7)
U12_GA(x1, x2, x3, x4, x5, x6, x7) = U12_GA(x7)
U13_GA(x1, x2, x3, x4, x5, x6, x7, x8) = U13_GA(x2, x4, x5, x8)
U14_GA(x1, x2, x3, x4, x5, x6, x7) = U14_GA(x7)
U15_GA(x1, x2, x3, x4, x5, x6, x7) = U15_GA(x4, x5, x7)
U16_GA(x1, x2, x3, x4, x5, x6, x7) = U16_GA(x7)
U17_GA(x1, x2, x3, x4, x5, x6, x7, x8) = U17_GA(x4, x8)
U18_GA(x1, x2, x3, x4, x5, x6, x7) = U18_GA(x7)
APPEND52_IN_AGAA(x1, x2, x3, x4) = APPEND52_IN_AGAA(x2)
U7_AGAA(x1, x2, x3, x4, x5, x6) = U7_AGAA(x6)

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

(33) Obligation:

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

INORDER1_IN_GA(tree(nil, T8, T9), T11) → U8_GA(T8, T9, T11, inorder14_in_ga(T9, X14))
INORDER1_IN_GA(tree(nil, T8, T9), T11) → INORDER14_IN_GA(T9, X14)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U1_GA(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_GA(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_GA(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_GA(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
U4_GA(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → APPEND27_IN_AGAA(T22, T20, T23, X37)
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → U6_AGAA(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → U9_GA(T66, T9, T67, inorder14_in_ga(T9, T67))
INORDER1_IN_GA(tree(nil, T66, T9), .(T66, T67)) → INORDER14_IN_GA(T9, T67)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U10_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → INORDER14_IN_GA(T74, X99)
INORDER1_IN_GA(tree(tree(T74, T75, T76), T8, T9), T11) → U11_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → INORDER14_IN_GA(T76, X100)
U11_GA(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → APPEND27_IN_AGAA(T77, T75, T78, X101)
U13_GA(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_GA(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_GA(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → INORDER14_IN_GA(T9, X14)
U15_GA(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_GA(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
U17_GA(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → APPEND52_IN_AGAA(T83, T8, T88, T11)
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → U7_AGAA(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(34) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 3 SCCs with 25 less nodes.

(35) Complex Obligation (AND)

(36) Obligation:

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

APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(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:

APPEND52_IN_AGAA(.(T113, T114), T115, T116, .(T113, T118)) → APPEND52_IN_AGAA(T114, T115, T116, T118)

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

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:

APPEND52_IN_AGAA(T115) → APPEND52_IN_AGAA(T115)

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

(41) NonTerminationProof (EQUIVALENT transformation)

Matcher: [ ]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from APPEND52_IN_AGAA(T115) to APPEND52_IN_AGAA(T115).

(42) NO

(43) Obligation:

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

APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(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:

APPEND27_IN_AGAA(.(T46, T47), T48, T49, .(T46, X64)) → APPEND27_IN_AGAA(T47, T48, T49, X64)

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

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:

APPEND27_IN_AGAA(T48) → APPEND27_IN_AGAA(T48)

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

(48) NonTerminationProof (EQUIVALENT transformation)

Matcher: [ ]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from APPEND27_IN_AGAA(T48) to APPEND27_IN_AGAA(T48).

(49) NO

(50) Obligation:

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

INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)

The TRS R consists of the following rules:

inorder1_in_ga(nil, []) → inorder1_out_ga(nil, [])
inorder1_in_ga(tree(nil, T8, T9), T11) → U8_ga(T8, T9, T11, inorder14_in_ga(T9, X14))
inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U8_ga(T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(nil, T8, T9), T11)
inorder1_in_ga(tree(nil, T66, T9), .(T66, T67)) → U9_ga(T66, T9, T67, inorder14_in_ga(T9, T67))
U9_ga(T66, T9, T67, inorder14_out_ga(T9, T67)) → inorder1_out_ga(tree(nil, T66, T9), .(T66, T67))
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U10_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, X99))
U10_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, X99)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
inorder1_in_ga(tree(tree(T74, T75, T76), T8, T9), T11) → U11_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T74, T77))
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U12_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T76, X100))
U12_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T76, X100)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U11_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T74, T77)) → U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_in_ga(T76, T78))
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U14_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, X101))
U14_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, X101)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U13_ga(T74, T75, T76, T8, T9, T11, T77, inorder14_out_ga(T76, T78)) → U15_ga(T74, T75, T76, T8, T9, T11, append27_in_agaa(T77, T75, T78, T83))
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U16_ga(T74, T75, T76, T8, T9, T11, inorder14_in_ga(T9, X14))
U16_ga(T74, T75, T76, T8, T9, T11, inorder14_out_ga(T9, X14)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)
U15_ga(T74, T75, T76, T8, T9, T11, append27_out_agaa(T77, T75, T78, T83)) → U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_in_ga(T9, T88))
U17_ga(T74, T75, T76, T8, T9, T11, T83, inorder14_out_ga(T9, T88)) → U18_ga(T74, T75, T76, T8, T9, T11, append52_in_agaa(T83, T8, T88, T11))
append52_in_agaa([], T101, T102, .(T101, T102)) → append52_out_agaa([], T101, T102, .(T101, T102))
append52_in_agaa(.(T113, T114), T115, T116, .(T113, T118)) → U7_agaa(T113, T114, T115, T116, T118, append52_in_agaa(T114, T115, T116, T118))
U7_agaa(T113, T114, T115, T116, T118, append52_out_agaa(T114, T115, T116, T118)) → append52_out_agaa(.(T113, T114), T115, T116, .(T113, T118))
U18_ga(T74, T75, T76, T8, T9, T11, append52_out_agaa(T83, T8, T88, T11)) → inorder1_out_ga(tree(tree(T74, T75, T76), T8, T9), T11)

(51) UsableRulesProof (EQUIVALENT transformation)

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

(52) Obligation:

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

INORDER14_IN_GA(tree(T19, T20, T21), X37) → U2_GA(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U2_GA(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → INORDER14_IN_GA(T21, X36)
INORDER14_IN_GA(tree(T19, T20, T21), X37) → INORDER14_IN_GA(T19, X35)

The TRS R consists of the following rules:

inorder14_in_ga(nil, []) → inorder14_out_ga(nil, [])
inorder14_in_ga(tree(T19, T20, T21), X37) → U1_ga(T19, T20, T21, X37, inorder14_in_ga(T19, X35))
inorder14_in_ga(tree(T19, T20, T21), X37) → U2_ga(T19, T20, T21, X37, inorder14_in_ga(T19, T22))
U1_ga(T19, T20, T21, X37, inorder14_out_ga(T19, X35)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U3_ga(T19, T20, T21, X37, inorder14_in_ga(T21, X36))
U2_ga(T19, T20, T21, X37, inorder14_out_ga(T19, T22)) → U4_ga(T19, T20, T21, X37, T22, inorder14_in_ga(T21, T23))
U3_ga(T19, T20, T21, X37, inorder14_out_ga(T21, X36)) → inorder14_out_ga(tree(T19, T20, T21), X37)
U4_ga(T19, T20, T21, X37, T22, inorder14_out_ga(T21, T23)) → U5_ga(T19, T20, T21, X37, append27_in_agaa(T22, T20, T23, X37))
U5_ga(T19, T20, T21, X37, append27_out_agaa(T22, T20, T23, X37)) → inorder14_out_ga(tree(T19, T20, T21), X37)
append27_in_agaa([], T36, T37, .(T36, T37)) → append27_out_agaa([], T36, T37, .(T36, T37))
append27_in_agaa(.(T46, T47), T48, T49, .(T46, X64)) → U6_agaa(T46, T47, T48, T49, X64, append27_in_agaa(T47, T48, T49, X64))
U6_agaa(T46, T47, T48, T49, X64, append27_out_agaa(T47, T48, T49, X64)) → append27_out_agaa(.(T46, T47), T48, T49, .(T46, X64))

The argument filtering Pi contains the following mapping:
nil = nil
tree(x1, x2, x3) = tree(x1, x2, x3)
inorder14_in_ga(x1, x2) = inorder14_in_ga(x1)
inorder14_out_ga(x1, x2) = inorder14_out_ga
U1_ga(x1, x2, x3, x4, x5) = U1_ga(x5)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x2, x3, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x5)
U4_ga(x1, x2, x3, x4, x5, x6) = U4_ga(x2, x6)
U5_ga(x1, x2, x3, x4, x5) = U5_ga(x5)
append27_in_agaa(x1, x2, x3, x4) = append27_in_agaa(x2)
append27_out_agaa(x1, x2, x3, x4) = append27_out_agaa(x1)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x6)
.(x1, x2) = .(x2)
INORDER14_IN_GA(x1, x2) = INORDER14_IN_GA(x1)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x2, x3, x5)

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

(53) PiDPToQDPProof (SOUND transformation)

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

(54) Obligation:

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

INORDER14_IN_GA(tree(T19, T20, T21)) → U2_GA(T20, T21, inorder14_in_ga(T19))
U2_GA(T20, T21, inorder14_out_ga) → INORDER14_IN_GA(T21)
INORDER14_IN_GA(tree(T19, T20, T21)) → INORDER14_IN_GA(T19)

The TRS R consists of the following rules:

inorder14_in_ga(nil) → inorder14_out_ga
inorder14_in_ga(tree(T19, T20, T21)) → U1_ga(inorder14_in_ga(T19))
inorder14_in_ga(tree(T19, T20, T21)) → U2_ga(T20, T21, inorder14_in_ga(T19))
U1_ga(inorder14_out_ga) → inorder14_out_ga
U2_ga(T20, T21, inorder14_out_ga) → U3_ga(inorder14_in_ga(T21))
U2_ga(T20, T21, inorder14_out_ga) → U4_ga(T20, inorder14_in_ga(T21))
U3_ga(inorder14_out_ga) → inorder14_out_ga
U4_ga(T20, inorder14_out_ga) → U5_ga(append27_in_agaa(T20))
U5_ga(append27_out_agaa(T22)) → inorder14_out_ga
append27_in_agaa(T36) → append27_out_agaa([])
append27_in_agaa(T48) → U6_agaa(append27_in_agaa(T48))
U6_agaa(append27_out_agaa(T47)) → append27_out_agaa(.(T47))

The set Q consists of the following terms:

inorder14_in_ga(x0)
U1_ga(x0)
U2_ga(x0, x1, x2)
U3_ga(x0)
U4_ga(x0, x1)
U5_ga(x0)
append27_in_agaa(x0)
U6_agaa(x0)

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

(55) 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:

U2_GA(T20, T21, inorder14_out_ga) → INORDER14_IN_GA(T21)
The graph contains the following edges 2 >= 1
INORDER14_IN_GA(tree(T19, T20, T21)) → INORDER14_IN_GA(T19)
The graph contains the following edges 1 > 1
INORDER14_IN_GA(tree(T19, T20, T21)) → U2_GA(T20, T21, inorder14_in_ga(T19))
The graph contains the following edges 1 > 1, 1 > 2

(0) Obligation:

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

(2) Obligation:

(3) PrologToPiTRSProof (SOUND transformation)

(4) Obligation:

(5) DependencyPairsProof (EQUIVALENT transformation)

(6) Obligation:

(7) DependencyGraphProof (EQUIVALENT transformation)

(8) Complex Obligation (AND)

(9) Obligation:

(10) UsableRulesProof (EQUIVALENT transformation)

(11) Obligation:

(12) PiDPToQDPProof (SOUND transformation)

(13) Obligation:

(14) NonTerminationProof (EQUIVALENT transformation)

(15) NO

(16) Obligation:

(17) UsableRulesProof (EQUIVALENT transformation)

(18) Obligation:

(19) PiDPToQDPProof (SOUND transformation)

(20) Obligation:

(21) NonTerminationProof (EQUIVALENT transformation)

(22) NO

(23) Obligation:

(24) UsableRulesProof (EQUIVALENT transformation)

(25) Obligation:

(26) PiDPToQDPProof (SOUND transformation)

(27) Obligation:

(28) QDPSizeChangeProof (EQUIVALENT transformation)

(29) YES

(30) PrologToPiTRSProof (SOUND transformation)

(31) Obligation:

(32) DependencyPairsProof (EQUIVALENT transformation)

(33) Obligation:

(34) DependencyGraphProof (EQUIVALENT transformation)

(35) Complex Obligation (AND)

(36) Obligation:

(37) UsableRulesProof (EQUIVALENT transformation)

(38) Obligation:

(39) PiDPToQDPProof (SOUND transformation)

(40) Obligation:

(41) NonTerminationProof (EQUIVALENT transformation)

(42) NO

(43) Obligation:

(44) UsableRulesProof (EQUIVALENT transformation)

(45) Obligation:

(46) PiDPToQDPProof (SOUND transformation)

(47) Obligation:

(48) NonTerminationProof (EQUIVALENT transformation)

(49) NO

(50) Obligation:

(51) UsableRulesProof (EQUIVALENT transformation)

(52) Obligation:

(53) PiDPToQDPProof (SOUND transformation)

(54) Obligation:

(55) QDPSizeChangeProof (EQUIVALENT transformation)

(56) YES