Left Termination proof of /tmp/tmpRbKjsG/search

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

0 Prolog

↳1 PrologToDTProblemTransformerProof (⇐)

↳2 TRIPLES

↳3 TriplesToPiDPProof (⇐)

↳4 PiDP

↳5 DependencyGraphProof (⇔)

↳6 AND

    ↳7 PiDP

        ↳8 UsableRulesProof (⇔)

        ↳9 PiDP

        ↳10 PiDPToQDPProof (⇔)

        ↳11 QDP

        ↳12 QDPSizeChangeProof (⇔)

        ↳13 YES

    ↳14 PiDP

        ↳15 PiDPToQDPProof (⇐)

        ↳16 QDP

        ↳17 QDPSizeChangeProof (⇔)

        ↳18 YES

(0) Obligation:

Clauses:

search_tree(void).
search_tree(T) :- search_tree(T, X1, X2).
search_tree(tree(X, void, void), X, X).
search_tree(tree(X, void, Right), X, Max) :- ','(search_tree(Right, Min, Max), less(X, Min)).
search_tree(tree(X, Left, void), Min, X) :- ','(search_tree(Left, Min, Max), less(Max, X)).
search_tree(tree(X, Left, Right), Min1, Max2) :- ','(search_tree(Left, Min1, Max1), ','(less(Max1, X), ','(search_tree(Right, Min2, Max2), less(X, Min2)))).
less(0, s(X3)).
less(s(X), s(Y)) :- less(X, Y).

Queries:

search_tree(g).

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: search_tree(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: search_tree(T1), SCOPE: 1, CLAUSE: 0 | search_tree(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: true | search_tree(void), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: search_tree(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nsearch_tree(T1) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: search_tree(void), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: search_tree(void, X6, X7)\n\nX6 is free\nX7 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 2 | search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 3 | search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 4 | search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 5\n\nX6 is free\nX7 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 3 | search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 4 | search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 5\n\nX6 is free\nX7 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 4 | search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 5\n\nX6 is free\nX7 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: search_tree(void, X6, X7), SCOPE: 2, CLAUSE: 5\n\nX6 is free\nX7 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: search_tree(T3, X22, X23)\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 2 | search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 3 | search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 4 | search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 5\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 2\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 3 | search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 4 | search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 5\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 3\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 4 | search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 5\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: ','(search_tree(T18, X51, X52), less(T17, X51))\n\nT17 is ground\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: search_tree(T18, X51, X52)\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: less(T17, T21)\n\nT17 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 2 | search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 3 | search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 4 | search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 5\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 2\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 3 | search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 4 | search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 5\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 3\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 4 | search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 5\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: ','(search_tree(T39, X87, X88), less(T38, X87))\n\nT38 is ground\nT39 is ground\nX88 is free; \nX87 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 4\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: search_tree(T18, X51, X52), SCOPE: 4, CLAUSE: 5\n\nT18 is ground\nX52 is free; \nX51 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: ','(search_tree(T51, X116, X115), less(X115, T50))\n\nT50 is ground\nT51 is ground\nX116 is free; \nX115 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: search_tree(T51, X116, X115)\n\nT51 is ground\nX116 is free; \nX115 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: less(T55, T50)\n\nT50 is ground\nT55 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: ','(search_tree(T67, X149, X147), ','(less(X147, T66), ','(search_tree(T68, X148, X150), less(T66, X148))))\n\nT66 is ground\nT67 is ground\nT68 is ground\nX149 is free; \nX150 is free; \nX147 is free; \nX148 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: search_tree(T67, X149, X147)\n\nT67 is ground\nX149 is free; \nX147 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: ','(less(T72, T66), ','(search_tree(T68, X148, X150), less(T66, X148)))\n\nT66 is ground\nT68 is ground\nT72 is ground\nX150 is free; \nX148 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: less(T72, T66)\n\nT66 is ground\nT72 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: ','(search_tree(T68, X148, X150), less(T66, X148))\n\nT66 is ground\nT68 is ground\nX150 is free; \nX148 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: less(T17, T21), SCOPE: 5, CLAUSE: 6 | less(T17, T21), SCOPE: 5, CLAUSE: 7\n\nT17 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: less(T17, T21), SCOPE: 5, CLAUSE: 6\n\nT17 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: less(T17, T21), SCOPE: 5, CLAUSE: 7\n\nT17 is ground\nT21 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="52: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
53 [label="53: less(T92, T93)\n\nT92 is ground\nT93 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 4\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: search_tree(T3, X22, X23), SCOPE: 3, CLAUSE: 5\n\nT3 is ground\nX22 is free; \nX23 is free; \nsearch_tree(T3) !=? search_tree(void)", fontsize=16, style=filled, fillcolor=lightyellow];
57 [label="57: ','(search_tree(T105, X206, X205), less(X205, T104))\n\nT104 is ground\nT105 is ground\nX206 is free; \nX205 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="59: ','(search_tree(T115, X235, X233), ','(less(X233, T114), ','(search_tree(T116, X234, X236), less(T114, X234))))\n\nT114 is ground\nT115 is ground\nT116 is ground\nX235 is free; \nX236 is free; \nX233 is free; \nX234 is free; ", 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\nsearch_tree(void).\nand substitution\nT1 -> void", 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="ONLY EVAL with clause\nsearch_tree(X21) :- search_tree(X21, X22, X23).\nand substitution\nT1 -> T3\nX21 -> T3", fontsize=14, style = filled, fillcolor = white];
4 -> 65 [arrowhead = none ];
65 -> 12;

66 [label="ONLY EVAL with clause\nsearch_tree(X5) :- search_tree(X5, X6, X7).\nand substitution\nX5 -> void", fontsize=14, style = filled, fillcolor = white];
5 -> 66 [arrowhead = none ];
66 -> 6;

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

68 [label="BACKTRACK\nfor clause: search_tree(tree(X, void, void), X, X)because of non-unification", fontsize=14, style = filled, fillcolor = white];
7 -> 68 [arrowhead = none ];
68 -> 8;

69 [label="BACKTRACK\nfor clause: search_tree(tree(X, void, Right), X, Max) :- ','(search_tree(Right, Min, Max), less(X, Min))because of non-unification", fontsize=14, style = filled, fillcolor = white];
8 -> 69 [arrowhead = none ];
69 -> 9;

70 [label="BACKTRACK\nfor clause: search_tree(tree(X, Left, void), Min, X) :- ','(search_tree(Left, Min, Max), less(Max, X))because of non-unification", fontsize=14, style = filled, fillcolor = white];
9 -> 70 [arrowhead = none ];
70 -> 10;

71 [label="BACKTRACK\nfor clause: search_tree(tree(X, Left, Right), Min1, Max2) :- ','(search_tree(Left, Min1, Max1), ','(less(Max1, X), ','(search_tree(Right, Min2, Max2), less(X, Min2))))because of non-unification", fontsize=14, style = filled, fillcolor = white];
10 -> 71 [arrowhead = none ];
71 -> 11;

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

73 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
13 -> 73 [arrowhead = none ];
73 -> 14;

74 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
13 -> 74 [arrowhead = none ];
74 -> 15;

75 [label="EVAL with clause\nsearch_tree(tree(X28, void, void), X28, X28).\nand substitution\nX28 -> T8\nT3 -> tree(T8, void, void)\nX22 -> T8\nX23 -> T8", fontsize=14, style = filled, fillcolor = lightblue];
14 -> 75 [arrowhead = none ];
75 -> 16;

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

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

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

79 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
16 -> 79 [arrowhead = none ];
79 -> 18;

80 [label="EVAL with clause\nsearch_tree(tree(X48, void, X49), X48, X50) :- ','(search_tree(X49, X51, X50), less(X48, X51)).\nand substitution\nX48 -> T17\nX49 -> T18\nT3 -> tree(T17, void, T18)\nX22 -> T17\nX23 -> X52\nX50 -> X52", fontsize=14, style = filled, fillcolor = lightblue];
19 -> 80 [arrowhead = none ];
80 -> 21;

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

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

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

84 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
21 -> 84 [arrowhead = none ];
84 -> 23;

85 [label="SPLIT 2\nnew knowledge:\nT21 is ground\nT22 is ground\nreplacements:\nX51 -> T21\nX52 -> T22", fontsize=14, style = filled, fillcolor = violet];
21 -> 85 [arrowhead = none ];
85 -> 24;

86 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
23 -> 86 [arrowhead = none ];
86 -> 25;

87 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
24 -> 87 [arrowhead = none ];
87 -> 47;

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

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

90 [label="EVAL with clause\nsearch_tree(tree(X64, void, void), X64, X64).\nand substitution\nX64 -> T29\nT18 -> tree(T29, void, void)\nX51 -> T29\nX52 -> T29", fontsize=14, style = filled, fillcolor = lightblue];
26 -> 90 [arrowhead = none ];
90 -> 28;

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

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

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

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

95 [label="EVAL with clause\nsearch_tree(tree(X84, void, X85), X84, X86) :- ','(search_tree(X85, X87, X86), less(X84, X87)).\nand substitution\nX84 -> T38\nX85 -> T39\nT18 -> tree(T38, void, T39)\nX51 -> T38\nX52 -> X88\nX86 -> X88", fontsize=14, style = filled, fillcolor = lightblue];
31 -> 95 [arrowhead = none ];
95 -> 33;

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

97 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
32 -> 97 [arrowhead = none ];
97 -> 35;

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

99 [label="INSTANCE with matching:\nT18 -> T39\nX51 -> X87\nX52 -> X88\nT17 -> T38", fontsize=14, style = filled, fillcolor = lightgrey];
33 -> 99 [arrowhead = none , style=dashed];
99 -> 21[style=dashed];

100 [label="EVAL with clause\nsearch_tree(tree(X112, X113, void), X114, X112) :- ','(search_tree(X113, X114, X115), less(X115, X112)).\nand substitution\nX112 -> T50\nX113 -> T51\nT18 -> tree(T50, T51, void)\nX51 -> X116\nX114 -> X116\nX52 -> T50", fontsize=14, style = filled, fillcolor = lightblue];
35 -> 100 [arrowhead = none ];
100 -> 37;

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

102 [label="EVAL with clause\nsearch_tree(tree(X142, X143, X144), X145, X146) :- ','(search_tree(X143, X145, X147), ','(less(X147, X142), ','(search_tree(X144, X148, X146), less(X142, X148)))).\nand substitution\nX142 -> T66\nX143 -> T67\nX144 -> T68\nT18 -> tree(T66, T67, T68)\nX51 -> X149\nX145 -> X149\nX52 -> X150\nX146 -> X150", fontsize=14, style = filled, fillcolor = lightblue];
36 -> 102 [arrowhead = none ];
102 -> 41;

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

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

105 [label="SPLIT 2\nnew knowledge:\nT54 is ground\nT55 is ground\nreplacements:\nX116 -> T54\nX115 -> T55", fontsize=14, style = filled, fillcolor = violet];
37 -> 105 [arrowhead = none ];
105 -> 40;

106 [label="INSTANCE with matching:\nT18 -> T51\nX51 -> X116\nX52 -> X115", fontsize=14, style = filled, fillcolor = lightgrey];
39 -> 106 [arrowhead = none , style=dashed];
106 -> 23[style=dashed];

107 [label="INSTANCE with matching:\nT17 -> T55\nT21 -> T50", fontsize=14, style = filled, fillcolor = lightgrey];
40 -> 107 [arrowhead = none , style=dashed];
107 -> 24[style=dashed];

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

109 [label="SPLIT 2\nnew knowledge:\nT71 is ground\nT72 is ground\nreplacements:\nX149 -> T71\nX147 -> T72", fontsize=14, style = filled, fillcolor = violet];
41 -> 109 [arrowhead = none ];
109 -> 44;

110 [label="INSTANCE with matching:\nT18 -> T67\nX51 -> X149\nX52 -> X147", fontsize=14, style = filled, fillcolor = lightgrey];
43 -> 110 [arrowhead = none , style=dashed];
110 -> 23[style=dashed];

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

112 [label="SPLIT 2", fontsize=14, style = filled, fillcolor = violet];
44 -> 112 [arrowhead = none ];
112 -> 46;

113 [label="INSTANCE with matching:\nT17 -> T72\nT21 -> T66", fontsize=14, style = filled, fillcolor = lightgrey];
45 -> 113 [arrowhead = none , style=dashed];
113 -> 24[style=dashed];

114 [label="INSTANCE with matching:\nT18 -> T68\nX51 -> X148\nX52 -> X150\nT17 -> T66", fontsize=14, style = filled, fillcolor = lightgrey];
46 -> 114 [arrowhead = none , style=dashed];
114 -> 21[style=dashed];

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

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

117 [label="EVAL with clause\nless(0, s(X172)).\nand substitution\nT17 -> 0\nX172 -> T87\nT21 -> s(T87)", fontsize=14, style = filled, fillcolor = lightblue];
48 -> 117 [arrowhead = none ];
117 -> 50;

118 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightblue];
48 -> 118 [arrowhead = none ];
118 -> 51;

119 [label="EVAL with clause\nless(s(X178), s(X179)) :- less(X178, X179).\nand substitution\nX178 -> T92\nT17 -> s(T92)\nX179 -> T93\nT21 -> s(T93)", fontsize=14, style = filled, fillcolor = lightblue];
49 -> 119 [arrowhead = none ];
119 -> 53;

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

121 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
50 -> 121 [arrowhead = none ];
121 -> 52;

122 [label="INSTANCE with matching:\nT17 -> T92\nT21 -> T93", fontsize=14, style = filled, fillcolor = lightgrey];
53 -> 122 [arrowhead = none , style=dashed];
122 -> 24[style=dashed];

123 [label="EVAL with clause\nsearch_tree(tree(X202, X203, void), X204, X202) :- ','(search_tree(X203, X204, X205), less(X205, X202)).\nand substitution\nX202 -> T104\nX203 -> T105\nT3 -> tree(T104, T105, void)\nX22 -> X206\nX204 -> X206\nX23 -> T104", fontsize=14, style = filled, fillcolor = lightblue];
55 -> 123 [arrowhead = none ];
123 -> 57;

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

125 [label="EVAL with clause\nsearch_tree(tree(X228, X229, X230), X231, X232) :- ','(search_tree(X229, X231, X233), ','(less(X233, X228), ','(search_tree(X230, X234, X232), less(X228, X234)))).\nand substitution\nX228 -> T114\nX229 -> T115\nX230 -> T116\nT3 -> tree(T114, T115, T116)\nX22 -> X235\nX231 -> X235\nX23 -> X236\nX232 -> X236", fontsize=14, style = filled, fillcolor = lightblue];
56 -> 125 [arrowhead = none ];
125 -> 59;

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

127 [label="INSTANCE with matching:\nT51 -> T105\nX116 -> X206\nX115 -> X205\nT50 -> T104", fontsize=14, style = filled, fillcolor = lightgrey];
57 -> 127 [arrowhead = none , style=dashed];
127 -> 37[style=dashed];

128 [label="INSTANCE with matching:\nT67 -> T115\nX149 -> X235\nX147 -> X233\nT66 -> T114\nT68 -> T116\nX148 -> X234\nX150 -> X236", fontsize=14, style = filled, fillcolor = lightgrey];
59 -> 128 [arrowhead = none , style=dashed];
128 -> 41[style=dashed];

}

(2) Obligation:

Triples:

p21(T18, X51, X52, T17) :- search_tree23(T18, X51, X52).
p21(T18, T21, T22, T17) :- ','(search_treec23(T18, T21, T22), less24(T17, T21)).
search_tree23(tree(T38, void, T39), T38, X88) :- p21(T39, X87, X88, T38).
search_tree23(tree(T50, T51, void), X116, T50) :- p37(T51, X116, X115, T50).
search_tree23(tree(T66, T67, T68), X149, X150) :- p41(T67, X149, X147, T66, T68, X148, X150).
less24(s(T92), s(T93)) :- less24(T92, T93).
p37(T51, X116, X115, T50) :- search_tree23(T51, X116, X115).
p37(T51, T54, T55, T50) :- ','(search_treec23(T51, T54, T55), less24(T55, T50)).
p41(T67, X149, X147, T66, T68, X148, X150) :- search_tree23(T67, X149, X147).
p41(T67, T71, T72, T66, T68, X148, X150) :- ','(search_treec23(T67, T71, T72), less24(T72, T66)).
p41(T67, T71, T72, T66, T68, X148, X150) :- ','(search_treec23(T67, T71, T72), ','(lessc24(T72, T66), p21(T68, X148, X150, T66))).
search_tree1(tree(T17, void, T18)) :- p21(T18, X51, X52, T17).
search_tree1(tree(T104, T105, void)) :- p37(T105, X206, X205, T104).
search_tree1(tree(T114, T115, T116)) :- p41(T115, X235, X233, T114, T116, X234, X236).

Clauses:

qc21(T18, T21, T22, T17) :- ','(search_treec23(T18, T21, T22), lessc24(T17, T21)).
search_treec23(tree(T29, void, void), T29, T29).
search_treec23(tree(T38, void, T39), T38, X88) :- qc21(T39, X87, X88, T38).
search_treec23(tree(T50, T51, void), X116, T50) :- qc37(T51, X116, X115, T50).
search_treec23(tree(T66, T67, T68), X149, X150) :- qc41(T67, X149, X147, T66, T68, X148, X150).
lessc24(0, s(T87)).
lessc24(s(T92), s(T93)) :- lessc24(T92, T93).
qc37(T51, T54, T55, T50) :- ','(search_treec23(T51, T54, T55), lessc24(T55, T50)).
qc41(T67, T71, T72, T66, T68, X148, X150) :- ','(search_treec23(T67, T71, T72), ','(lessc24(T72, T66), qc21(T68, X148, X150, T66))).

Afs:

search_tree1(x1) = search_tree1(x1)

(3) TriplesToPiDPProof (SOUND transformation)

We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
search_tree1_in: (b)
p21_in: (b,f,f,b)
search_tree23_in: (b,f,f)
search_treec23_in: (b,f,f)
qc21_in: (b,f,f,b)
qc37_in: (b,f,f,b)
qc41_in: (b,f,f,b,b,f,f)
lessc24_in: (b,b)
less24_in: (b,b)
p37_in: (b,f,f,b)
p41_in: (b,f,f,b,b,f,f)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

SEARCH_TREE1_IN_G(tree(T17, void, T18)) → U16_G(T17, T18, p21_in_gaag(T18, X51, X52, T17))
SEARCH_TREE1_IN_G(tree(T17, void, T18)) → P21_IN_GAAG(T18, X51, X52, T17)
P21_IN_GAAG(T18, X51, X52, T17) → U1_GAAG(T18, X51, X52, T17, search_tree23_in_gaa(T18, X51, X52))
P21_IN_GAAG(T18, X51, X52, T17) → SEARCH_TREE23_IN_GAA(T18, X51, X52)
SEARCH_TREE23_IN_GAA(tree(T38, void, T39), T38, X88) → U4_GAA(T38, T39, X88, p21_in_gaag(T39, X87, X88, T38))
SEARCH_TREE23_IN_GAA(tree(T38, void, T39), T38, X88) → P21_IN_GAAG(T39, X87, X88, T38)
P21_IN_GAAG(T18, T21, T22, T17) → U2_GAAG(T18, T21, T22, T17, search_treec23_in_gaa(T18, T21, T22))
U2_GAAG(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → U3_GAAG(T18, T21, T22, T17, less24_in_gg(T17, T21))
U2_GAAG(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → LESS24_IN_GG(T17, T21)
LESS24_IN_GG(s(T92), s(T93)) → U7_GG(T92, T93, less24_in_gg(T92, T93))
LESS24_IN_GG(s(T92), s(T93)) → LESS24_IN_GG(T92, T93)
SEARCH_TREE23_IN_GAA(tree(T50, T51, void), X116, T50) → U5_GAA(T50, T51, X116, p37_in_gaag(T51, X116, X115, T50))
SEARCH_TREE23_IN_GAA(tree(T50, T51, void), X116, T50) → P37_IN_GAAG(T51, X116, X115, T50)
P37_IN_GAAG(T51, X116, X115, T50) → U8_GAAG(T51, X116, X115, T50, search_tree23_in_gaa(T51, X116, X115))
P37_IN_GAAG(T51, X116, X115, T50) → SEARCH_TREE23_IN_GAA(T51, X116, X115)
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68), X149, X150) → U6_GAA(T66, T67, T68, X149, X150, p41_in_gaaggaa(T67, X149, X147, T66, T68, X148, X150))
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68), X149, X150) → P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150)
P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150) → U11_GAAGGAA(T67, X149, X147, T66, T68, X148, X150, search_tree23_in_gaa(T67, X149, X147))
P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150) → SEARCH_TREE23_IN_GAA(T67, X149, X147)
P41_IN_GAAGGAA(T67, T71, T72, T66, T68, X148, X150) → U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U13_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, less24_in_gg(T72, T66))
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → LESS24_IN_GG(T72, T66)
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → U15_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, p21_in_gaag(T68, X148, X150, T66))
U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → P21_IN_GAAG(T68, X148, X150, T66)
P37_IN_GAAG(T51, T54, T55, T50) → U9_GAAG(T51, T54, T55, T50, search_treec23_in_gaa(T51, T54, T55))
U9_GAAG(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → U10_GAAG(T51, T54, T55, T50, less24_in_gg(T55, T50))
U9_GAAG(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → LESS24_IN_GG(T55, T50)
SEARCH_TREE1_IN_G(tree(T104, T105, void)) → U17_G(T104, T105, p37_in_gaag(T105, X206, X205, T104))
SEARCH_TREE1_IN_G(tree(T104, T105, void)) → P37_IN_GAAG(T105, X206, X205, T104)
SEARCH_TREE1_IN_G(tree(T114, T115, T116)) → U18_G(T114, T115, T116, p41_in_gaaggaa(T115, X235, X233, T114, T116, X234, X236))
SEARCH_TREE1_IN_G(tree(T114, T115, T116)) → P41_IN_GAAGGAA(T115, X235, X233, T114, T116, X234, X236)

The TRS R consists of the following rules:

search_treec23_in_gaa(tree(T29, void, void), T29, T29) → search_treec23_out_gaa(tree(T29, void, void), T29, T29)
search_treec23_in_gaa(tree(T38, void, T39), T38, X88) → U22_gaa(T38, T39, X88, qc21_in_gaag(T39, X87, X88, T38))
qc21_in_gaag(T18, T21, T22, T17) → U20_gaag(T18, T21, T22, T17, search_treec23_in_gaa(T18, T21, T22))
search_treec23_in_gaa(tree(T50, T51, void), X116, T50) → U23_gaa(T50, T51, X116, qc37_in_gaag(T51, X116, X115, T50))
qc37_in_gaag(T51, T54, T55, T50) → U26_gaag(T51, T54, T55, T50, search_treec23_in_gaa(T51, T54, T55))
search_treec23_in_gaa(tree(T66, T67, T68), X149, X150) → U24_gaa(T66, T67, T68, X149, X150, qc41_in_gaaggaa(T67, X149, X147, T66, T68, X148, X150))
qc41_in_gaaggaa(T67, T71, T72, T66, T68, X148, X150) → U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
lessc24_in_gg(0, s(T87)) → lessc24_out_gg(0, s(T87))
lessc24_in_gg(s(T92), s(T93)) → U25_gg(T92, T93, lessc24_in_gg(T92, T93))
U25_gg(T92, T93, lessc24_out_gg(T92, T93)) → lessc24_out_gg(s(T92), s(T93))
U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_in_gaag(T68, X148, X150, T66))
U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_out_gaag(T68, X148, X150, T66)) → qc41_out_gaaggaa(T67, T71, T72, T66, T68, X148, X150)
U24_gaa(T66, T67, T68, X149, X150, qc41_out_gaaggaa(T67, X149, X147, T66, T68, X148, X150)) → search_treec23_out_gaa(tree(T66, T67, T68), X149, X150)
U26_gaag(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → U27_gaag(T51, T54, T55, T50, lessc24_in_gg(T55, T50))
U27_gaag(T51, T54, T55, T50, lessc24_out_gg(T55, T50)) → qc37_out_gaag(T51, T54, T55, T50)
U23_gaa(T50, T51, X116, qc37_out_gaag(T51, X116, X115, T50)) → search_treec23_out_gaa(tree(T50, T51, void), X116, T50)
U20_gaag(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → U21_gaag(T18, T21, T22, T17, lessc24_in_gg(T17, T21))
U21_gaag(T18, T21, T22, T17, lessc24_out_gg(T17, T21)) → qc21_out_gaag(T18, T21, T22, T17)
U22_gaa(T38, T39, X88, qc21_out_gaag(T39, X87, X88, T38)) → search_treec23_out_gaa(tree(T38, void, T39), T38, X88)

The argument filtering Pi contains the following mapping:
tree(x1, x2, x3) = tree(x1, x2, x3)
void = void
p21_in_gaag(x1, x2, x3, x4) = p21_in_gaag(x1, x4)
search_tree23_in_gaa(x1, x2, x3) = search_tree23_in_gaa(x1)
search_treec23_in_gaa(x1, x2, x3) = search_treec23_in_gaa(x1)
search_treec23_out_gaa(x1, x2, x3) = search_treec23_out_gaa(x1, x2, x3)
U22_gaa(x1, x2, x3, x4) = U22_gaa(x1, x2, x4)
qc21_in_gaag(x1, x2, x3, x4) = qc21_in_gaag(x1, x4)
U20_gaag(x1, x2, x3, x4, x5) = U20_gaag(x1, x4, x5)
U23_gaa(x1, x2, x3, x4) = U23_gaa(x1, x2, x4)
qc37_in_gaag(x1, x2, x3, x4) = qc37_in_gaag(x1, x4)
U26_gaag(x1, x2, x3, x4, x5) = U26_gaag(x1, x4, x5)
U24_gaa(x1, x2, x3, x4, x5, x6) = U24_gaa(x1, x2, x3, x6)
qc41_in_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = qc41_in_gaaggaa(x1, x4, x5)
U28_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U28_gaaggaa(x1, x4, x5, x8)
U29_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U29_gaaggaa(x1, x2, x3, x4, x5, x8)
lessc24_in_gg(x1, x2) = lessc24_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
lessc24_out_gg(x1, x2) = lessc24_out_gg(x1, x2)
U25_gg(x1, x2, x3) = U25_gg(x1, x2, x3)
U30_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U30_gaaggaa(x1, x2, x3, x4, x5, x8)
qc21_out_gaag(x1, x2, x3, x4) = qc21_out_gaag(x1, x2, x3, x4)
qc41_out_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = qc41_out_gaaggaa(x1, x2, x3, x4, x5, x6, x7)
U27_gaag(x1, x2, x3, x4, x5) = U27_gaag(x1, x2, x3, x4, x5)
qc37_out_gaag(x1, x2, x3, x4) = qc37_out_gaag(x1, x2, x3, x4)
U21_gaag(x1, x2, x3, x4, x5) = U21_gaag(x1, x2, x3, x4, x5)
less24_in_gg(x1, x2) = less24_in_gg(x1, x2)
p37_in_gaag(x1, x2, x3, x4) = p37_in_gaag(x1, x4)
p41_in_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = p41_in_gaaggaa(x1, x4, x5)
SEARCH_TREE1_IN_G(x1) = SEARCH_TREE1_IN_G(x1)
U16_G(x1, x2, x3) = U16_G(x1, x2, x3)
P21_IN_GAAG(x1, x2, x3, x4) = P21_IN_GAAG(x1, x4)
U1_GAAG(x1, x2, x3, x4, x5) = U1_GAAG(x1, x4, x5)
SEARCH_TREE23_IN_GAA(x1, x2, x3) = SEARCH_TREE23_IN_GAA(x1)
U4_GAA(x1, x2, x3, x4) = U4_GAA(x1, x2, x4)
U2_GAAG(x1, x2, x3, x4, x5) = U2_GAAG(x1, x4, x5)
U3_GAAG(x1, x2, x3, x4, x5) = U3_GAAG(x1, x2, x4, x5)
LESS24_IN_GG(x1, x2) = LESS24_IN_GG(x1, x2)
U7_GG(x1, x2, x3) = U7_GG(x1, x2, x3)
U5_GAA(x1, x2, x3, x4) = U5_GAA(x1, x2, x4)
P37_IN_GAAG(x1, x2, x3, x4) = P37_IN_GAAG(x1, x4)
U8_GAAG(x1, x2, x3, x4, x5) = U8_GAAG(x1, x4, x5)
U6_GAA(x1, x2, x3, x4, x5, x6) = U6_GAA(x1, x2, x3, x6)
P41_IN_GAAGGAA(x1, x2, x3, x4, x5, x6, x7) = P41_IN_GAAGGAA(x1, x4, x5)
U11_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U11_GAAGGAA(x1, x4, x5, x8)
U12_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U12_GAAGGAA(x1, x4, x5, x8)
U13_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U13_GAAGGAA(x1, x2, x4, x5, x8)
U14_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U14_GAAGGAA(x1, x2, x4, x5, x8)
U15_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U15_GAAGGAA(x1, x2, x4, x5, x8)
U9_GAAG(x1, x2, x3, x4, x5) = U9_GAAG(x1, x4, x5)
U10_GAAG(x1, x2, x3, x4, x5) = U10_GAAG(x1, x2, x4, x5)
U17_G(x1, x2, x3) = U17_G(x1, x2, x3)
U18_G(x1, x2, x3, x4) = U18_G(x1, x2, x3, x4)

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

Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES

(4) Obligation:

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

SEARCH_TREE1_IN_G(tree(T17, void, T18)) → U16_G(T17, T18, p21_in_gaag(T18, X51, X52, T17))
SEARCH_TREE1_IN_G(tree(T17, void, T18)) → P21_IN_GAAG(T18, X51, X52, T17)
P21_IN_GAAG(T18, X51, X52, T17) → U1_GAAG(T18, X51, X52, T17, search_tree23_in_gaa(T18, X51, X52))
P21_IN_GAAG(T18, X51, X52, T17) → SEARCH_TREE23_IN_GAA(T18, X51, X52)
SEARCH_TREE23_IN_GAA(tree(T38, void, T39), T38, X88) → U4_GAA(T38, T39, X88, p21_in_gaag(T39, X87, X88, T38))
SEARCH_TREE23_IN_GAA(tree(T38, void, T39), T38, X88) → P21_IN_GAAG(T39, X87, X88, T38)
P21_IN_GAAG(T18, T21, T22, T17) → U2_GAAG(T18, T21, T22, T17, search_treec23_in_gaa(T18, T21, T22))
U2_GAAG(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → U3_GAAG(T18, T21, T22, T17, less24_in_gg(T17, T21))
U2_GAAG(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → LESS24_IN_GG(T17, T21)
LESS24_IN_GG(s(T92), s(T93)) → U7_GG(T92, T93, less24_in_gg(T92, T93))
LESS24_IN_GG(s(T92), s(T93)) → LESS24_IN_GG(T92, T93)
SEARCH_TREE23_IN_GAA(tree(T50, T51, void), X116, T50) → U5_GAA(T50, T51, X116, p37_in_gaag(T51, X116, X115, T50))
SEARCH_TREE23_IN_GAA(tree(T50, T51, void), X116, T50) → P37_IN_GAAG(T51, X116, X115, T50)
P37_IN_GAAG(T51, X116, X115, T50) → U8_GAAG(T51, X116, X115, T50, search_tree23_in_gaa(T51, X116, X115))
P37_IN_GAAG(T51, X116, X115, T50) → SEARCH_TREE23_IN_GAA(T51, X116, X115)
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68), X149, X150) → U6_GAA(T66, T67, T68, X149, X150, p41_in_gaaggaa(T67, X149, X147, T66, T68, X148, X150))
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68), X149, X150) → P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150)
P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150) → U11_GAAGGAA(T67, X149, X147, T66, T68, X148, X150, search_tree23_in_gaa(T67, X149, X147))
P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150) → SEARCH_TREE23_IN_GAA(T67, X149, X147)
P41_IN_GAAGGAA(T67, T71, T72, T66, T68, X148, X150) → U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U13_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, less24_in_gg(T72, T66))
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → LESS24_IN_GG(T72, T66)
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → U15_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, p21_in_gaag(T68, X148, X150, T66))
U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → P21_IN_GAAG(T68, X148, X150, T66)
P37_IN_GAAG(T51, T54, T55, T50) → U9_GAAG(T51, T54, T55, T50, search_treec23_in_gaa(T51, T54, T55))
U9_GAAG(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → U10_GAAG(T51, T54, T55, T50, less24_in_gg(T55, T50))
U9_GAAG(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → LESS24_IN_GG(T55, T50)
SEARCH_TREE1_IN_G(tree(T104, T105, void)) → U17_G(T104, T105, p37_in_gaag(T105, X206, X205, T104))
SEARCH_TREE1_IN_G(tree(T104, T105, void)) → P37_IN_GAAG(T105, X206, X205, T104)
SEARCH_TREE1_IN_G(tree(T114, T115, T116)) → U18_G(T114, T115, T116, p41_in_gaaggaa(T115, X235, X233, T114, T116, X234, X236))
SEARCH_TREE1_IN_G(tree(T114, T115, T116)) → P41_IN_GAAGGAA(T115, X235, X233, T114, T116, X234, X236)

The TRS R consists of the following rules:

search_treec23_in_gaa(tree(T29, void, void), T29, T29) → search_treec23_out_gaa(tree(T29, void, void), T29, T29)
search_treec23_in_gaa(tree(T38, void, T39), T38, X88) → U22_gaa(T38, T39, X88, qc21_in_gaag(T39, X87, X88, T38))
qc21_in_gaag(T18, T21, T22, T17) → U20_gaag(T18, T21, T22, T17, search_treec23_in_gaa(T18, T21, T22))
search_treec23_in_gaa(tree(T50, T51, void), X116, T50) → U23_gaa(T50, T51, X116, qc37_in_gaag(T51, X116, X115, T50))
qc37_in_gaag(T51, T54, T55, T50) → U26_gaag(T51, T54, T55, T50, search_treec23_in_gaa(T51, T54, T55))
search_treec23_in_gaa(tree(T66, T67, T68), X149, X150) → U24_gaa(T66, T67, T68, X149, X150, qc41_in_gaaggaa(T67, X149, X147, T66, T68, X148, X150))
qc41_in_gaaggaa(T67, T71, T72, T66, T68, X148, X150) → U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
lessc24_in_gg(0, s(T87)) → lessc24_out_gg(0, s(T87))
lessc24_in_gg(s(T92), s(T93)) → U25_gg(T92, T93, lessc24_in_gg(T92, T93))
U25_gg(T92, T93, lessc24_out_gg(T92, T93)) → lessc24_out_gg(s(T92), s(T93))
U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_in_gaag(T68, X148, X150, T66))
U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_out_gaag(T68, X148, X150, T66)) → qc41_out_gaaggaa(T67, T71, T72, T66, T68, X148, X150)
U24_gaa(T66, T67, T68, X149, X150, qc41_out_gaaggaa(T67, X149, X147, T66, T68, X148, X150)) → search_treec23_out_gaa(tree(T66, T67, T68), X149, X150)
U26_gaag(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → U27_gaag(T51, T54, T55, T50, lessc24_in_gg(T55, T50))
U27_gaag(T51, T54, T55, T50, lessc24_out_gg(T55, T50)) → qc37_out_gaag(T51, T54, T55, T50)
U23_gaa(T50, T51, X116, qc37_out_gaag(T51, X116, X115, T50)) → search_treec23_out_gaa(tree(T50, T51, void), X116, T50)
U20_gaag(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → U21_gaag(T18, T21, T22, T17, lessc24_in_gg(T17, T21))
U21_gaag(T18, T21, T22, T17, lessc24_out_gg(T17, T21)) → qc21_out_gaag(T18, T21, T22, T17)
U22_gaa(T38, T39, X88, qc21_out_gaag(T39, X87, X88, T38)) → search_treec23_out_gaa(tree(T38, void, T39), T38, X88)

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 22 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

LESS24_IN_GG(s(T92), s(T93)) → LESS24_IN_GG(T92, T93)

The TRS R consists of the following rules:

search_treec23_in_gaa(tree(T29, void, void), T29, T29) → search_treec23_out_gaa(tree(T29, void, void), T29, T29)
search_treec23_in_gaa(tree(T38, void, T39), T38, X88) → U22_gaa(T38, T39, X88, qc21_in_gaag(T39, X87, X88, T38))
qc21_in_gaag(T18, T21, T22, T17) → U20_gaag(T18, T21, T22, T17, search_treec23_in_gaa(T18, T21, T22))
search_treec23_in_gaa(tree(T50, T51, void), X116, T50) → U23_gaa(T50, T51, X116, qc37_in_gaag(T51, X116, X115, T50))
qc37_in_gaag(T51, T54, T55, T50) → U26_gaag(T51, T54, T55, T50, search_treec23_in_gaa(T51, T54, T55))
search_treec23_in_gaa(tree(T66, T67, T68), X149, X150) → U24_gaa(T66, T67, T68, X149, X150, qc41_in_gaaggaa(T67, X149, X147, T66, T68, X148, X150))
qc41_in_gaaggaa(T67, T71, T72, T66, T68, X148, X150) → U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
lessc24_in_gg(0, s(T87)) → lessc24_out_gg(0, s(T87))
lessc24_in_gg(s(T92), s(T93)) → U25_gg(T92, T93, lessc24_in_gg(T92, T93))
U25_gg(T92, T93, lessc24_out_gg(T92, T93)) → lessc24_out_gg(s(T92), s(T93))
U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_in_gaag(T68, X148, X150, T66))
U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_out_gaag(T68, X148, X150, T66)) → qc41_out_gaaggaa(T67, T71, T72, T66, T68, X148, X150)
U24_gaa(T66, T67, T68, X149, X150, qc41_out_gaaggaa(T67, X149, X147, T66, T68, X148, X150)) → search_treec23_out_gaa(tree(T66, T67, T68), X149, X150)
U26_gaag(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → U27_gaag(T51, T54, T55, T50, lessc24_in_gg(T55, T50))
U27_gaag(T51, T54, T55, T50, lessc24_out_gg(T55, T50)) → qc37_out_gaag(T51, T54, T55, T50)
U23_gaa(T50, T51, X116, qc37_out_gaag(T51, X116, X115, T50)) → search_treec23_out_gaa(tree(T50, T51, void), X116, T50)
U20_gaag(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → U21_gaag(T18, T21, T22, T17, lessc24_in_gg(T17, T21))
U21_gaag(T18, T21, T22, T17, lessc24_out_gg(T17, T21)) → qc21_out_gaag(T18, T21, T22, T17)
U22_gaa(T38, T39, X88, qc21_out_gaag(T39, X87, X88, T38)) → search_treec23_out_gaa(tree(T38, void, T39), T38, X88)

The argument filtering Pi contains the following mapping:
tree(x1, x2, x3) = tree(x1, x2, x3)
void = void
search_treec23_in_gaa(x1, x2, x3) = search_treec23_in_gaa(x1)
search_treec23_out_gaa(x1, x2, x3) = search_treec23_out_gaa(x1, x2, x3)
U22_gaa(x1, x2, x3, x4) = U22_gaa(x1, x2, x4)
qc21_in_gaag(x1, x2, x3, x4) = qc21_in_gaag(x1, x4)
U20_gaag(x1, x2, x3, x4, x5) = U20_gaag(x1, x4, x5)
U23_gaa(x1, x2, x3, x4) = U23_gaa(x1, x2, x4)
qc37_in_gaag(x1, x2, x3, x4) = qc37_in_gaag(x1, x4)
U26_gaag(x1, x2, x3, x4, x5) = U26_gaag(x1, x4, x5)
U24_gaa(x1, x2, x3, x4, x5, x6) = U24_gaa(x1, x2, x3, x6)
qc41_in_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = qc41_in_gaaggaa(x1, x4, x5)
U28_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U28_gaaggaa(x1, x4, x5, x8)
U29_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U29_gaaggaa(x1, x2, x3, x4, x5, x8)
lessc24_in_gg(x1, x2) = lessc24_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
lessc24_out_gg(x1, x2) = lessc24_out_gg(x1, x2)
U25_gg(x1, x2, x3) = U25_gg(x1, x2, x3)
U30_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U30_gaaggaa(x1, x2, x3, x4, x5, x8)
qc21_out_gaag(x1, x2, x3, x4) = qc21_out_gaag(x1, x2, x3, x4)
qc41_out_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = qc41_out_gaaggaa(x1, x2, x3, x4, x5, x6, x7)
U27_gaag(x1, x2, x3, x4, x5) = U27_gaag(x1, x2, x3, x4, x5)
qc37_out_gaag(x1, x2, x3, x4) = qc37_out_gaag(x1, x2, x3, x4)
U21_gaag(x1, x2, x3, x4, x5) = U21_gaag(x1, x2, x3, x4, x5)
LESS24_IN_GG(x1, x2) = LESS24_IN_GG(x1, x2)

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

(8) UsableRulesProof (EQUIVALENT transformation)

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

(9) Obligation:

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

LESS24_IN_GG(s(T92), s(T93)) → LESS24_IN_GG(T92, T93)

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

(10) PiDPToQDPProof (EQUIVALENT transformation)

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

(11) Obligation:

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

LESS24_IN_GG(s(T92), s(T93)) → LESS24_IN_GG(T92, T93)

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

(12) QDPSizeChangeProof (EQUIVALENT transformation)

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

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

LESS24_IN_GG(s(T92), s(T93)) → LESS24_IN_GG(T92, T93)
The graph contains the following edges 1 > 1, 2 > 2

(13) YES

(14) Obligation:

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

P21_IN_GAAG(T18, X51, X52, T17) → SEARCH_TREE23_IN_GAA(T18, X51, X52)
SEARCH_TREE23_IN_GAA(tree(T38, void, T39), T38, X88) → P21_IN_GAAG(T39, X87, X88, T38)
SEARCH_TREE23_IN_GAA(tree(T50, T51, void), X116, T50) → P37_IN_GAAG(T51, X116, X115, T50)
P37_IN_GAAG(T51, X116, X115, T50) → SEARCH_TREE23_IN_GAA(T51, X116, X115)
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68), X149, X150) → P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150)
P41_IN_GAAGGAA(T67, X149, X147, T66, T68, X148, X150) → SEARCH_TREE23_IN_GAA(T67, X149, X147)
P41_IN_GAAGGAA(T67, T71, T72, T66, T68, X148, X150) → U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U12_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
U14_GAAGGAA(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → P21_IN_GAAG(T68, X148, X150, T66)

The TRS R consists of the following rules:

search_treec23_in_gaa(tree(T29, void, void), T29, T29) → search_treec23_out_gaa(tree(T29, void, void), T29, T29)
search_treec23_in_gaa(tree(T38, void, T39), T38, X88) → U22_gaa(T38, T39, X88, qc21_in_gaag(T39, X87, X88, T38))
qc21_in_gaag(T18, T21, T22, T17) → U20_gaag(T18, T21, T22, T17, search_treec23_in_gaa(T18, T21, T22))
search_treec23_in_gaa(tree(T50, T51, void), X116, T50) → U23_gaa(T50, T51, X116, qc37_in_gaag(T51, X116, X115, T50))
qc37_in_gaag(T51, T54, T55, T50) → U26_gaag(T51, T54, T55, T50, search_treec23_in_gaa(T51, T54, T55))
search_treec23_in_gaa(tree(T66, T67, T68), X149, X150) → U24_gaa(T66, T67, T68, X149, X150, qc41_in_gaaggaa(T67, X149, X147, T66, T68, X148, X150))
qc41_in_gaaggaa(T67, T71, T72, T66, T68, X148, X150) → U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_in_gaa(T67, T71, T72))
U28_gaaggaa(T67, T71, T72, T66, T68, X148, X150, search_treec23_out_gaa(T67, T71, T72)) → U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_in_gg(T72, T66))
lessc24_in_gg(0, s(T87)) → lessc24_out_gg(0, s(T87))
lessc24_in_gg(s(T92), s(T93)) → U25_gg(T92, T93, lessc24_in_gg(T92, T93))
U25_gg(T92, T93, lessc24_out_gg(T92, T93)) → lessc24_out_gg(s(T92), s(T93))
U29_gaaggaa(T67, T71, T72, T66, T68, X148, X150, lessc24_out_gg(T72, T66)) → U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_in_gaag(T68, X148, X150, T66))
U30_gaaggaa(T67, T71, T72, T66, T68, X148, X150, qc21_out_gaag(T68, X148, X150, T66)) → qc41_out_gaaggaa(T67, T71, T72, T66, T68, X148, X150)
U24_gaa(T66, T67, T68, X149, X150, qc41_out_gaaggaa(T67, X149, X147, T66, T68, X148, X150)) → search_treec23_out_gaa(tree(T66, T67, T68), X149, X150)
U26_gaag(T51, T54, T55, T50, search_treec23_out_gaa(T51, T54, T55)) → U27_gaag(T51, T54, T55, T50, lessc24_in_gg(T55, T50))
U27_gaag(T51, T54, T55, T50, lessc24_out_gg(T55, T50)) → qc37_out_gaag(T51, T54, T55, T50)
U23_gaa(T50, T51, X116, qc37_out_gaag(T51, X116, X115, T50)) → search_treec23_out_gaa(tree(T50, T51, void), X116, T50)
U20_gaag(T18, T21, T22, T17, search_treec23_out_gaa(T18, T21, T22)) → U21_gaag(T18, T21, T22, T17, lessc24_in_gg(T17, T21))
U21_gaag(T18, T21, T22, T17, lessc24_out_gg(T17, T21)) → qc21_out_gaag(T18, T21, T22, T17)
U22_gaa(T38, T39, X88, qc21_out_gaag(T39, X87, X88, T38)) → search_treec23_out_gaa(tree(T38, void, T39), T38, X88)

The argument filtering Pi contains the following mapping:
tree(x1, x2, x3) = tree(x1, x2, x3)
void = void
search_treec23_in_gaa(x1, x2, x3) = search_treec23_in_gaa(x1)
search_treec23_out_gaa(x1, x2, x3) = search_treec23_out_gaa(x1, x2, x3)
U22_gaa(x1, x2, x3, x4) = U22_gaa(x1, x2, x4)
qc21_in_gaag(x1, x2, x3, x4) = qc21_in_gaag(x1, x4)
U20_gaag(x1, x2, x3, x4, x5) = U20_gaag(x1, x4, x5)
U23_gaa(x1, x2, x3, x4) = U23_gaa(x1, x2, x4)
qc37_in_gaag(x1, x2, x3, x4) = qc37_in_gaag(x1, x4)
U26_gaag(x1, x2, x3, x4, x5) = U26_gaag(x1, x4, x5)
U24_gaa(x1, x2, x3, x4, x5, x6) = U24_gaa(x1, x2, x3, x6)
qc41_in_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = qc41_in_gaaggaa(x1, x4, x5)
U28_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U28_gaaggaa(x1, x4, x5, x8)
U29_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U29_gaaggaa(x1, x2, x3, x4, x5, x8)
lessc24_in_gg(x1, x2) = lessc24_in_gg(x1, x2)
0 = 0
s(x1) = s(x1)
lessc24_out_gg(x1, x2) = lessc24_out_gg(x1, x2)
U25_gg(x1, x2, x3) = U25_gg(x1, x2, x3)
U30_gaaggaa(x1, x2, x3, x4, x5, x6, x7, x8) = U30_gaaggaa(x1, x2, x3, x4, x5, x8)
qc21_out_gaag(x1, x2, x3, x4) = qc21_out_gaag(x1, x2, x3, x4)
qc41_out_gaaggaa(x1, x2, x3, x4, x5, x6, x7) = qc41_out_gaaggaa(x1, x2, x3, x4, x5, x6, x7)
U27_gaag(x1, x2, x3, x4, x5) = U27_gaag(x1, x2, x3, x4, x5)
qc37_out_gaag(x1, x2, x3, x4) = qc37_out_gaag(x1, x2, x3, x4)
U21_gaag(x1, x2, x3, x4, x5) = U21_gaag(x1, x2, x3, x4, x5)
P21_IN_GAAG(x1, x2, x3, x4) = P21_IN_GAAG(x1, x4)
SEARCH_TREE23_IN_GAA(x1, x2, x3) = SEARCH_TREE23_IN_GAA(x1)
P37_IN_GAAG(x1, x2, x3, x4) = P37_IN_GAAG(x1, x4)
P41_IN_GAAGGAA(x1, x2, x3, x4, x5, x6, x7) = P41_IN_GAAGGAA(x1, x4, x5)
U12_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U12_GAAGGAA(x1, x4, x5, x8)
U14_GAAGGAA(x1, x2, x3, x4, x5, x6, x7, x8) = U14_GAAGGAA(x1, x2, x4, x5, x8)

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

(15) PiDPToQDPProof (SOUND transformation)

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

(16) Obligation:

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

P21_IN_GAAG(T18, T17) → SEARCH_TREE23_IN_GAA(T18)
SEARCH_TREE23_IN_GAA(tree(T38, void, T39)) → P21_IN_GAAG(T39, T38)
SEARCH_TREE23_IN_GAA(tree(T50, T51, void)) → P37_IN_GAAG(T51, T50)
P37_IN_GAAG(T51, T50) → SEARCH_TREE23_IN_GAA(T51)
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68)) → P41_IN_GAAGGAA(T67, T66, T68)
P41_IN_GAAGGAA(T67, T66, T68) → SEARCH_TREE23_IN_GAA(T67)
P41_IN_GAAGGAA(T67, T66, T68) → U12_GAAGGAA(T67, T66, T68, search_treec23_in_gaa(T67))
U12_GAAGGAA(T67, T66, T68, search_treec23_out_gaa(T67, T71, T72)) → U14_GAAGGAA(T67, T71, T66, T68, lessc24_in_gg(T72, T66))
U14_GAAGGAA(T67, T71, T66, T68, lessc24_out_gg(T72, T66)) → P21_IN_GAAG(T68, T66)

The TRS R consists of the following rules:

search_treec23_in_gaa(tree(T29, void, void)) → search_treec23_out_gaa(tree(T29, void, void), T29, T29)
search_treec23_in_gaa(tree(T38, void, T39)) → U22_gaa(T38, T39, qc21_in_gaag(T39, T38))
qc21_in_gaag(T18, T17) → U20_gaag(T18, T17, search_treec23_in_gaa(T18))
search_treec23_in_gaa(tree(T50, T51, void)) → U23_gaa(T50, T51, qc37_in_gaag(T51, T50))
qc37_in_gaag(T51, T50) → U26_gaag(T51, T50, search_treec23_in_gaa(T51))
search_treec23_in_gaa(tree(T66, T67, T68)) → U24_gaa(T66, T67, T68, qc41_in_gaaggaa(T67, T66, T68))
qc41_in_gaaggaa(T67, T66, T68) → U28_gaaggaa(T67, T66, T68, search_treec23_in_gaa(T67))
U28_gaaggaa(T67, T66, T68, search_treec23_out_gaa(T67, T71, T72)) → U29_gaaggaa(T67, T71, T72, T66, T68, lessc24_in_gg(T72, T66))
lessc24_in_gg(0, s(T87)) → lessc24_out_gg(0, s(T87))
lessc24_in_gg(s(T92), s(T93)) → U25_gg(T92, T93, lessc24_in_gg(T92, T93))
U25_gg(T92, T93, lessc24_out_gg(T92, T93)) → lessc24_out_gg(s(T92), s(T93))
U29_gaaggaa(T67, T71, T72, T66, T68, lessc24_out_gg(T72, T66)) → U30_gaaggaa(T67, T71, T72, T66, T68, qc21_in_gaag(T68, T66))
U30_gaaggaa(T67, T71, T72, T66, T68, qc21_out_gaag(T68, X148, X150, T66)) → qc41_out_gaaggaa(T67, T71, T72, T66, T68, X148, X150)
U24_gaa(T66, T67, T68, qc41_out_gaaggaa(T67, X149, X147, T66, T68, X148, X150)) → search_treec23_out_gaa(tree(T66, T67, T68), X149, X150)
U26_gaag(T51, T50, search_treec23_out_gaa(T51, T54, T55)) → U27_gaag(T51, T54, T55, T50, lessc24_in_gg(T55, T50))
U27_gaag(T51, T54, T55, T50, lessc24_out_gg(T55, T50)) → qc37_out_gaag(T51, T54, T55, T50)
U23_gaa(T50, T51, qc37_out_gaag(T51, X116, X115, T50)) → search_treec23_out_gaa(tree(T50, T51, void), X116, T50)
U20_gaag(T18, T17, search_treec23_out_gaa(T18, T21, T22)) → U21_gaag(T18, T21, T22, T17, lessc24_in_gg(T17, T21))
U21_gaag(T18, T21, T22, T17, lessc24_out_gg(T17, T21)) → qc21_out_gaag(T18, T21, T22, T17)
U22_gaa(T38, T39, qc21_out_gaag(T39, X87, X88, T38)) → search_treec23_out_gaa(tree(T38, void, T39), T38, X88)

The set Q consists of the following terms:

search_treec23_in_gaa(x0)
qc21_in_gaag(x0, x1)
qc37_in_gaag(x0, x1)
qc41_in_gaaggaa(x0, x1, x2)
U28_gaaggaa(x0, x1, x2, x3)
lessc24_in_gg(x0, x1)
U25_gg(x0, x1, x2)
U29_gaaggaa(x0, x1, x2, x3, x4, x5)
U30_gaaggaa(x0, x1, x2, x3, x4, x5)
U24_gaa(x0, x1, x2, x3)
U26_gaag(x0, x1, x2)
U27_gaag(x0, x1, x2, x3, x4)
U23_gaa(x0, x1, x2)
U20_gaag(x0, x1, x2)
U21_gaag(x0, x1, x2, x3, x4)
U22_gaa(x0, x1, x2)

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

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

SEARCH_TREE23_IN_GAA(tree(T38, void, T39)) → P21_IN_GAAG(T39, T38)
The graph contains the following edges 1 > 1, 1 > 2
U14_GAAGGAA(T67, T71, T66, T68, lessc24_out_gg(T72, T66)) → P21_IN_GAAG(T68, T66)
The graph contains the following edges 4 >= 1, 3 >= 2, 5 > 2
P21_IN_GAAG(T18, T17) → SEARCH_TREE23_IN_GAA(T18)
The graph contains the following edges 1 >= 1
P37_IN_GAAG(T51, T50) → SEARCH_TREE23_IN_GAA(T51)
The graph contains the following edges 1 >= 1
P41_IN_GAAGGAA(T67, T66, T68) → SEARCH_TREE23_IN_GAA(T67)
The graph contains the following edges 1 >= 1
SEARCH_TREE23_IN_GAA(tree(T50, T51, void)) → P37_IN_GAAG(T51, T50)
The graph contains the following edges 1 > 1, 1 > 2
SEARCH_TREE23_IN_GAA(tree(T66, T67, T68)) → P41_IN_GAAGGAA(T67, T66, T68)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3
P41_IN_GAAGGAA(T67, T66, T68) → U12_GAAGGAA(T67, T66, T68, search_treec23_in_gaa(T67))
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3
U12_GAAGGAA(T67, T66, T68, search_treec23_out_gaa(T67, T71, T72)) → U14_GAAGGAA(T67, T71, T66, T68, lessc24_in_gg(T72, T66))
The graph contains the following edges 1 >= 1, 4 > 1, 4 > 2, 2 >= 3, 3 >= 4

(0) Obligation:

(1) PrologToDTProblemTransformerProof (SOUND transformation)

(2) Obligation:

(3) TriplesToPiDPProof (SOUND transformation)

(4) Obligation:

(5) DependencyGraphProof (EQUIVALENT transformation)

(6) Complex Obligation (AND)

(7) Obligation:

(8) UsableRulesProof (EQUIVALENT transformation)

(9) Obligation:

(10) PiDPToQDPProof (EQUIVALENT transformation)

(11) Obligation:

(12) QDPSizeChangeProof (EQUIVALENT transformation)

(13) YES

(14) Obligation:

(15) PiDPToQDPProof (SOUND transformation)

(16) Obligation:

(17) QDPSizeChangeProof (EQUIVALENT transformation)

(18) YES