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

(0) Obligation:

Clauses:

isNat(s(X)) :- isNat(X).
isNat(0).
notEq(s(X), s(Y)) :- notEq(X, Y).
notEq(s(X), 0).
notEq(0, s(X)).
lt(s(X), s(Y)) :- lt(X, Y).
lt(0, s(Y)).
gt(s(X), s(Y)) :- gt(X, Y).
gt(s(X), 0).
le(s(X), s(Y)) :- le(X, Y).
le(0, s(Y)).
le(0, 0).
even(s(X)) :- odd(X).
even(0).
odd(s(X)) :- even(X).
odd(s(0)).
add(s(X), Y, s(Z)) :- add(X, Y, Z).
add(0, X, X).
mult(s(X), Y, R) :- ','(mult(X, Y, Z), add(Y, Z, R)).
mult(0, Y, 0).
factorial(s(X), R) :- ','(factorial(X, Y), mult(s(X), Y, R)).
factorial(0, s(0)).

Queries:

factorial(g,a).

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: factorial(T1, T2)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: factorial(T1, T2), SCOPE: 1, CLAUSE: 20 | factorial(T1, T2), SCOPE: 1, CLAUSE: 21\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: ','(factorial(T5, X5), mult(s(T5), X5, T7)) | factorial(s(T5), T2), SCOPE: 1, CLAUSE: 21\n\nT5 is ground\nX5 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: factorial(T1, T2), SCOPE: 1, CLAUSE: 21\n\nT1 is ground\nfactorial(T1, T2) !=? factorial(s(X3), X4)", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: ','(factorial(T5, X5), mult(s(T5), X5, T7)), SCOPE: 2, CLAUSE: 20 | ','(factorial(T5, X5), mult(s(T5), X5, T7)), SCOPE: 2, CLAUSE: 21 | ?_2 | factorial(s(T5), T2), SCOPE: 1, CLAUSE: 21\n\nT5 is ground\nX5 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: ','(factorial(T5, X5), mult(s(T5), X5, T7)), SCOPE: 2, CLAUSE: 20\n\nT5 is ground\nX5 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: ','(factorial(T5, X5), mult(s(T5), X5, T7)), SCOPE: 2, CLAUSE: 21 | ?_2 | factorial(s(T5), T2), SCOPE: 1, CLAUSE: 21\n\nT5 is ground\nX5 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: ','(factorial(T12, X24), ','(mult(s(T12), X24, X25), mult(s(s(T12)), X25, T7)))\n\nT12 is ground\nX25 is free; \nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: factorial(T12, X24)\n\nT12 is ground\nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: ','(mult(s(T12), T14, X25), mult(s(s(T12)), X25, T7))\n\nT12 is ground\nT14 is ground\nX25 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: factorial(T12, X24), SCOPE: 3, CLAUSE: 20 | factorial(T12, X24), SCOPE: 3, CLAUSE: 21\n\nT12 is ground\nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: factorial(T12, X24), SCOPE: 3, CLAUSE: 20\n\nT12 is ground\nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: factorial(T12, X24), SCOPE: 3, CLAUSE: 21\n\nT12 is ground\nX24 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(factorial(T20, X52), mult(s(T20), X52, X53))\n\nT20 is ground\nX53 is free; \nX52 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: factorial(T20, X52)\n\nT20 is ground\nX52 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: mult(s(T20), T22, X53)\n\nT20 is ground\nT22 is ground\nX53 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: mult(s(T20), T22, X53), SCOPE: 4, CLAUSE: 18 | mult(s(T20), T22, X53), SCOPE: 4, CLAUSE: 19\n\nT20 is ground\nT22 is ground\nX53 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: mult(s(T20), T22, X53), SCOPE: 4, CLAUSE: 18\n\nT20 is ground\nT22 is ground\nX53 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: mult(s(T20), T22, X53), SCOPE: 4, CLAUSE: 19\n\nT20 is ground\nT22 is ground\nX53 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: ','(mult(T38, T39, X100), add(T39, X100, X101))\n\nT38 is ground\nT39 is ground\nX101 is free; \nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: mult(T38, T39, X100)\n\nT38 is ground\nT39 is ground\nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: add(T39, T42, X101)\n\nT39 is ground\nT42 is ground\nX101 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: mult(T38, T39, X100), SCOPE: 5, CLAUSE: 18 | mult(T38, T39, X100), SCOPE: 5, CLAUSE: 19\n\nT38 is ground\nT39 is ground\nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: mult(T38, T39, X100), SCOPE: 5, CLAUSE: 18\n\nT38 is ground\nT39 is ground\nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: mult(T38, T39, X100), SCOPE: 5, CLAUSE: 19\n\nT38 is ground\nT39 is ground\nX100 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: ','(mult(T53, T54, X133), add(T54, X133, X134))\n\nT53 is ground\nT54 is ground\nX134 is free; \nX133 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: add(T39, T42, X101), SCOPE: 6, CLAUSE: 16 | add(T39, T42, X101), SCOPE: 6, CLAUSE: 17\n\nT39 is ground\nT42 is ground\nX101 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: add(T39, T42, X101), SCOPE: 6, CLAUSE: 16\n\nT39 is ground\nT42 is ground\nX101 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: add(T39, T42, X101), SCOPE: 6, CLAUSE: 17\n\nT39 is ground\nT42 is ground\nX101 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: add(T70, T71, X170)\n\nT70 is ground\nT71 is ground\nX170 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \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: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: mult(s(T12), T14, X25)\n\nT12 is ground\nT14 is ground\nX25 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: mult(s(s(T12)), T79, T7)\n\nT12 is ground\nT79 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: mult(s(s(T12)), T79, T7), SCOPE: 7, CLAUSE: 18 | mult(s(s(T12)), T79, T7), SCOPE: 7, CLAUSE: 19\n\nT12 is ground\nT79 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: mult(s(s(T12)), T79, T7), SCOPE: 7, CLAUSE: 18\n\nT12 is ground\nT79 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: mult(s(s(T12)), T79, T7), SCOPE: 7, CLAUSE: 19\n\nT12 is ground\nT79 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: ','(mult(s(T103), T104, X224), add(T104, X224, T106))\n\nT103 is ground\nT104 is ground\nX224 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: mult(s(T103), T104, X224)\n\nT103 is ground\nT104 is ground\nX224 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="52: add(T104, T109, T106)\n\nT104 is ground\nT109 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
53 [label="53: add(T104, T109, T106), SCOPE: 8, CLAUSE: 16 | add(T104, T109, T106), SCOPE: 8, CLAUSE: 17\n\nT104 is ground\nT109 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: add(T104, T109, T106), SCOPE: 8, CLAUSE: 16\n\nT104 is ground\nT109 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: add(T104, T109, T106), SCOPE: 8, CLAUSE: 17\n\nT104 is ground\nT109 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: add(T127, T128, T130)\n\nT127 is ground\nT128 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
57 [label="57: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="59: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
60 [label="60: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
61 [label="61: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
62 [label="62: ','(factorial(T5, X5), mult(s(T5), X5, T7)), SCOPE: 2, CLAUSE: 21\n\nT5 is ground\nX5 is free; ", fontsize=16, style=filled, fillcolor=lightyellow];
63 [label="63: ?_2 | factorial(s(T5), T2), SCOPE: 1, CLAUSE: 21\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
64 [label="64: mult(s(0), s(0), T7)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
65 [label="65: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
66 [label="66: mult(s(0), s(0), T7), SCOPE: 9, CLAUSE: 18 | mult(s(0), s(0), T7), SCOPE: 9, CLAUSE: 19\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
67 [label="67: mult(s(0), s(0), T7), SCOPE: 9, CLAUSE: 18\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
68 [label="68: mult(s(0), s(0), T7), SCOPE: 9, CLAUSE: 19\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
69 [label="69: ','(mult(0, s(0), X303), add(s(0), X303, T147))\n\nX303 is free", fontsize=16, style=filled, fillcolor=lightyellow];
70 [label="70: mult(0, s(0), X303)\n\nX303 is free", fontsize=16, style=filled, fillcolor=lightyellow];
71 [label="71: add(s(0), T149, T147)\n\nT149 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
72 [label="72: mult(0, s(0), X303), SCOPE: 10, CLAUSE: 18 | mult(0, s(0), X303), SCOPE: 10, CLAUSE: 19\n\nX303 is free", fontsize=16, style=filled, fillcolor=lightyellow];
73 [label="73: mult(0, s(0), X303), SCOPE: 10, CLAUSE: 19\n\nX303 is free", fontsize=16, style=filled, fillcolor=lightyellow];
74 [label="74: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
75 [label="75: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
76 [label="76: add(s(0), T149, T147), SCOPE: 11, CLAUSE: 16 | add(s(0), T149, T147), SCOPE: 11, CLAUSE: 17\n\nT149 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
77 [label="77: add(s(0), T149, T147), SCOPE: 11, CLAUSE: 16\n\nT149 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
78 [label="78: add(s(0), T149, T147), SCOPE: 11, CLAUSE: 17\n\nT149 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
79 [label="79: add(0, T160, T162)\n\nT160 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
80 [label="80: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
81 [label="81: add(0, T160, T162), SCOPE: 12, CLAUSE: 16 | add(0, T160, T162), SCOPE: 12, CLAUSE: 17\n\nT160 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
82 [label="82: add(0, T160, T162), SCOPE: 12, CLAUSE: 17\n\nT160 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
83 [label="83: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
84 [label="84: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
85 [label="85: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
86 [label="86: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
87 [label="87: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
88 [label="88: factorial(s(T5), T2), SCOPE: 1, CLAUSE: 21\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
89 [label="89: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
90 [label="90: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
91 [label="91: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
92 [label="92: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
93 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 93 [arrowhead = none ];
93 -> 2;

94 [label="EVAL with clause\nfactorial(s(X3), X4) :- ','(factorial(X3, X5), mult(s(X3), X5, X4)).\nand substitution\nX3 -> T5\nT1 -> s(T5)\nT2 -> T7\nX4 -> T7\nT6 -> T7", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 94 [arrowhead = none ];
94 -> 3;

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

96 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
3 -> 96 [arrowhead = none ];
96 -> 5;

97 [label="EVAL with clause\nfactorial(0, s(0)).\nand substitution\nT1 -> 0\nT2 -> s(0)", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 97 [arrowhead = none ];
97 -> 90;

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

99 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
5 -> 99 [arrowhead = none ];
99 -> 6;

100 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
5 -> 100 [arrowhead = none ];
100 -> 7;

101 [label="EVAL with clause\nfactorial(s(X22), X23) :- ','(factorial(X22, X24), mult(s(X22), X24, X23)).\nand substitution\nX22 -> T12\nT5 -> s(T12)\nX5 -> X25\nX23 -> X25", fontsize=14, style = filled, fillcolor = lightblue];
6 -> 101 [arrowhead = none ];
101 -> 8;

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

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

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

105 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
8 -> 105 [arrowhead = none ];
105 -> 10;

106 [label="SPLIT 2\nnew knowledge:\nT14 is ground\nreplacements:\nX24 -> T14", fontsize=14, style = filled, fillcolor = violet];
8 -> 106 [arrowhead = none ];
106 -> 11;

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

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

109 [label="SPLIT 2\nnew knowledge:\nT79 is ground\nreplacements:\nX25 -> T79", fontsize=14, style = filled, fillcolor = violet];
11 -> 109 [arrowhead = none ];
109 -> 46;

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

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

112 [label="EVAL with clause\nfactorial(s(X50), X51) :- ','(factorial(X50, X52), mult(s(X50), X52, X51)).\nand substitution\nX50 -> T20\nT12 -> s(T20)\nX24 -> X53\nX51 -> X53", fontsize=14, style = filled, fillcolor = lightblue];
13 -> 112 [arrowhead = none ];
112 -> 15;

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

114 [label="EVAL with clause\nfactorial(0, s(0)).\nand substitution\nT12 -> 0\nX24 -> s(0)", fontsize=14, style = filled, fillcolor = lightblue];
14 -> 114 [arrowhead = none ];
114 -> 42;

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

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

117 [label="SPLIT 2\nnew knowledge:\nT22 is ground\nreplacements:\nX52 -> T22", fontsize=14, style = filled, fillcolor = violet];
15 -> 117 [arrowhead = none ];
117 -> 18;

118 [label="INSTANCE with matching:\nT12 -> T20\nX24 -> X52", fontsize=14, style = filled, fillcolor = lightgrey];
17 -> 118 [arrowhead = none , style=dashed];
118 -> 10[style=dashed];

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

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

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

122 [label="ONLY EVAL with clause\nmult(s(X97), X98, X99) :- ','(mult(X97, X98, X100), add(X98, X100, X99)).\nand substitution\nT20 -> T38\nX97 -> T38\nT22 -> T39\nX98 -> T39\nX53 -> X101\nX99 -> X101", fontsize=14, style = filled, fillcolor = white];
20 -> 122 [arrowhead = none ];
122 -> 22;

123 [label="BACKTRACK\nfor clause: mult(0, Y, 0)because of non-unification", fontsize=14, style = filled, fillcolor = white];
21 -> 123 [arrowhead = none ];
123 -> 41;

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

125 [label="SPLIT 2\nnew knowledge:\nT42 is ground\nreplacements:\nX100 -> T42", fontsize=14, style = filled, fillcolor = violet];
22 -> 125 [arrowhead = none ];
125 -> 24;

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

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

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

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

130 [label="EVAL with clause\nmult(s(X130), X131, X132) :- ','(mult(X130, X131, X133), add(X131, X133, X132)).\nand substitution\nX130 -> T53\nT38 -> s(T53)\nT39 -> T54\nX131 -> T54\nX100 -> X134\nX132 -> X134", fontsize=14, style = filled, fillcolor = lightblue];
26 -> 130 [arrowhead = none ];
130 -> 28;

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

132 [label="EVAL with clause\nmult(0, X145, 0).\nand substitution\nT38 -> 0\nT39 -> T59\nX145 -> T59\nX100 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
27 -> 132 [arrowhead = none ];
132 -> 30;

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

134 [label="INSTANCE with matching:\nT38 -> T53\nT39 -> T54\nX100 -> X133\nX101 -> X134", fontsize=14, style = filled, fillcolor = lightgrey];
28 -> 134 [arrowhead = none , style=dashed];
134 -> 22[style=dashed];

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

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

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

138 [label="EVAL with clause\nadd(s(X167), X168, s(X169)) :- add(X167, X168, X169).\nand substitution\nX167 -> T70\nT39 -> s(T70)\nT42 -> T71\nX168 -> T71\nX169 -> X170\nX101 -> s(X170)", fontsize=14, style = filled, fillcolor = lightblue];
34 -> 138 [arrowhead = none ];
138 -> 36;

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

140 [label="EVAL with clause\nadd(0, X180, X180).\nand substitution\nT39 -> 0\nT42 -> T76\nX180 -> T76\nX101 -> T76", fontsize=14, style = filled, fillcolor = lightblue];
35 -> 140 [arrowhead = none ];
140 -> 38;

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

142 [label="INSTANCE with matching:\nT39 -> T70\nT42 -> T71\nX101 -> X170", fontsize=14, style = filled, fillcolor = lightgrey];
36 -> 142 [arrowhead = none , style=dashed];
142 -> 24[style=dashed];

143 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
38 -> 143 [arrowhead = none ];
143 -> 40;

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

145 [label="INSTANCE with matching:\nT20 -> T12\nT22 -> T14\nX53 -> X25", fontsize=14, style = filled, fillcolor = lightgrey];
45 -> 145 [arrowhead = none , style=dashed];
145 -> 18[style=dashed];

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

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

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

149 [label="ONLY EVAL with clause\nmult(s(X221), X222, X223) :- ','(mult(X221, X222, X224), add(X222, X224, X223)).\nand substitution\nT12 -> T103\nX221 -> s(T103)\nT79 -> T104\nX222 -> T104\nT7 -> T106\nX223 -> T106\nT105 -> T106", fontsize=14, style = filled, fillcolor = white];
48 -> 149 [arrowhead = none ];
149 -> 50;

150 [label="BACKTRACK\nfor clause: mult(0, Y, 0)because of non-unification", fontsize=14, style = filled, fillcolor = white];
49 -> 150 [arrowhead = none ];
150 -> 61;

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

152 [label="SPLIT 2\nnew knowledge:\nT109 is ground\nreplacements:\nX224 -> T109", fontsize=14, style = filled, fillcolor = violet];
50 -> 152 [arrowhead = none ];
152 -> 52;

153 [label="INSTANCE with matching:\nT12 -> T103\nT14 -> T104\nX25 -> X224", fontsize=14, style = filled, fillcolor = lightgrey];
51 -> 153 [arrowhead = none , style=dashed];
153 -> 45[style=dashed];

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

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

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

157 [label="EVAL with clause\nadd(s(X250), X251, s(X252)) :- add(X250, X251, X252).\nand substitution\nX250 -> T127\nT104 -> s(T127)\nT109 -> T128\nX251 -> T128\nX252 -> T130\nT106 -> s(T130)\nT129 -> T130", fontsize=14, style = filled, fillcolor = lightblue];
54 -> 157 [arrowhead = none ];
157 -> 56;

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

159 [label="EVAL with clause\nadd(0, X261, X261).\nand substitution\nT104 -> 0\nT109 -> T136\nX261 -> T136\nT106 -> T136", fontsize=14, style = filled, fillcolor = lightblue];
55 -> 159 [arrowhead = none ];
159 -> 58;

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

161 [label="INSTANCE with matching:\nT104 -> T127\nT109 -> T128\nT106 -> T130", fontsize=14, style = filled, fillcolor = lightgrey];
56 -> 161 [arrowhead = none , style=dashed];
161 -> 52[style=dashed];

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

163 [label="EVAL with clause\nfactorial(0, s(0)).\nand substitution\nT5 -> 0\nX5 -> s(0)", fontsize=14, style = filled, fillcolor = lightblue];
62 -> 163 [arrowhead = none ];
163 -> 64;

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

165 [label="FAILURE", fontsize=14, style = filled, fillcolor = lightgreen];
63 -> 165 [arrowhead = none ];
165 -> 88;

166 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
64 -> 166 [arrowhead = none ];
166 -> 66;

167 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
66 -> 167 [arrowhead = none ];
167 -> 67;

168 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
66 -> 168 [arrowhead = none ];
168 -> 68;

169 [label="ONLY EVAL with clause\nmult(s(X300), X301, X302) :- ','(mult(X300, X301, X303), add(X301, X303, X302)).\nand substitution\nX300 -> 0\nX301 -> s(0)\nT7 -> T147\nX302 -> T147\nT146 -> T147", fontsize=14, style = filled, fillcolor = white];
67 -> 169 [arrowhead = none ];
169 -> 69;

170 [label="BACKTRACK\nfor clause: mult(0, Y, 0)because of non-unification", fontsize=14, style = filled, fillcolor = white];
68 -> 170 [arrowhead = none ];
170 -> 87;

171 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
69 -> 171 [arrowhead = none ];
171 -> 70;

172 [label="SPLIT 2\nnew knowledge:\nT149 is ground\nreplacements:\nX303 -> T149", fontsize=14, style = filled, fillcolor = violet];
69 -> 172 [arrowhead = none ];
172 -> 71;

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

174 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
71 -> 174 [arrowhead = none ];
174 -> 76;

175 [label="BACKTRACK\nfor clause: mult(s(X), Y, R) :- ','(mult(X, Y, Z), add(Y, Z, R))because of non-unification", fontsize=14, style = filled, fillcolor = white];
72 -> 175 [arrowhead = none ];
175 -> 73;

176 [label="ONLY EVAL with clause\nmult(0, X323, 0).\nand substitution\nX323 -> s(0)\nX303 -> 0", fontsize=14, style = filled, fillcolor = white];
73 -> 176 [arrowhead = none ];
176 -> 74;

177 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
74 -> 177 [arrowhead = none ];
177 -> 75;

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

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

180 [label="EVAL with clause\nadd(s(X339), X340, s(X341)) :- add(X339, X340, X341).\nand substitution\nX339 -> 0\nT149 -> T160\nX340 -> T160\nX341 -> T162\nT147 -> s(T162)\nT161 -> T162", fontsize=14, style = filled, fillcolor = lightblue];
77 -> 180 [arrowhead = none ];
180 -> 79;

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

182 [label="BACKTRACK\nfor clause: add(0, X, X)because of non-unification", fontsize=14, style = filled, fillcolor = white];
78 -> 182 [arrowhead = none ];
182 -> 86;

183 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
79 -> 183 [arrowhead = none ];
183 -> 81;

184 [label="BACKTRACK\nfor clause: add(s(X), Y, s(Z)) :- add(X, Y, Z)because of non-unification", fontsize=14, style = filled, fillcolor = white];
81 -> 184 [arrowhead = none ];
184 -> 82;

185 [label="EVAL with clause\nadd(0, X355, X355).\nand substitution\nT160 -> T167\nX355 -> T167\nT162 -> T167", fontsize=14, style = filled, fillcolor = lightblue];
82 -> 185 [arrowhead = none ];
185 -> 83;

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

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

188 [label="BACKTRACK\nfor clause: factorial(0, s(0))because of non-unification", fontsize=14, style = filled, fillcolor = white];
88 -> 188 [arrowhead = none ];
188 -> 89;

189 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
90 -> 189 [arrowhead = none ];
189 -> 92;

}

(2) Obligation:

Triples:

factorial10(s(T20), X53) :- factorial10(T20, X52).
factorial10(s(T20), X53) :- ','(factorialc10(T20, T22), mult18(T20, T22, X53)).
p22(s(T53), T54, X134, X101) :- p22(T53, T54, X133, X134).
p22(T38, T39, T42, X101) :- ','(multc23(T38, T39, T42), add24(T39, T42, X101)).
add24(s(T70), T71, s(X170)) :- add24(T70, T71, X170).
mult18(T38, T39, X101) :- p22(T38, T39, X100, X101).
add52(s(T127), T128, s(T130)) :- add52(T127, T128, T130).
factorial1(s(s(T12)), T7) :- factorial10(T12, X24).
factorial1(s(s(T12)), T7) :- ','(factorialc10(T12, T14), mult18(T12, T14, X25)).
factorial1(s(s(T103)), T106) :- ','(factorialc10(T103, T14), ','(multc18(T103, T14, T104), mult18(T103, T104, X224))).
factorial1(s(s(T103)), T106) :- ','(factorialc10(T103, T14), ','(multc18(T103, T14, T104), ','(multc18(T103, T104, T109), add52(T104, T109, T106)))).

Clauses:

factorialc10(s(T20), X53) :- ','(factorialc10(T20, T22), multc18(T20, T22, X53)).
factorialc10(0, s(0)).
qc22(T38, T39, T42, X101) :- ','(multc23(T38, T39, T42), addc24(T39, T42, X101)).
addc24(s(T70), T71, s(X170)) :- addc24(T70, T71, X170).
addc24(0, T76, T76).
multc18(T38, T39, X101) :- qc22(T38, T39, X100, X101).
addc52(s(T127), T128, s(T130)) :- addc52(T127, T128, T130).
addc52(0, T136, T136).
multc23(s(T53), T54, X134) :- qc22(T53, T54, X133, X134).
multc23(0, T59, 0).
multc70(0).

Afs:

factorial1(x1, x2)  =  factorial1(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:
factorial1_in: (b,f)
factorial10_in: (b,f)
factorialc10_in: (b,f)
multc18_in: (b,b,f)
qc22_in: (b,b,f,f)
multc23_in: (b,b,f)
addc24_in: (b,b,f)
mult18_in: (b,b,f)
p22_in: (b,b,f,f)
add24_in: (b,b,f)
add52_in: (b,b,f)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

FACTORIAL1_IN_GA(s(s(T12)), T7) → U10_GA(T12, T7, factorial10_in_ga(T12, X24))
FACTORIAL1_IN_GA(s(s(T12)), T7) → FACTORIAL10_IN_GA(T12, X24)
FACTORIAL10_IN_GA(s(T20), X53) → U1_GA(T20, X53, factorial10_in_ga(T20, X52))
FACTORIAL10_IN_GA(s(T20), X53) → FACTORIAL10_IN_GA(T20, X52)
FACTORIAL10_IN_GA(s(T20), X53) → U2_GA(T20, X53, factorialc10_in_ga(T20, T22))
U2_GA(T20, X53, factorialc10_out_ga(T20, T22)) → U3_GA(T20, X53, mult18_in_gga(T20, T22, X53))
U2_GA(T20, X53, factorialc10_out_ga(T20, T22)) → MULT18_IN_GGA(T20, T22, X53)
MULT18_IN_GGA(T38, T39, X101) → U8_GGA(T38, T39, X101, p22_in_ggaa(T38, T39, X100, X101))
MULT18_IN_GGA(T38, T39, X101) → P22_IN_GGAA(T38, T39, X100, X101)
P22_IN_GGAA(s(T53), T54, X134, X101) → U4_GGAA(T53, T54, X134, X101, p22_in_ggaa(T53, T54, X133, X134))
P22_IN_GGAA(s(T53), T54, X134, X101) → P22_IN_GGAA(T53, T54, X133, X134)
P22_IN_GGAA(T38, T39, T42, X101) → U5_GGAA(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
U5_GGAA(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U6_GGAA(T38, T39, T42, X101, add24_in_gga(T39, T42, X101))
U5_GGAA(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → ADD24_IN_GGA(T39, T42, X101)
ADD24_IN_GGA(s(T70), T71, s(X170)) → U7_GGA(T70, T71, X170, add24_in_gga(T70, T71, X170))
ADD24_IN_GGA(s(T70), T71, s(X170)) → ADD24_IN_GGA(T70, T71, X170)
FACTORIAL1_IN_GA(s(s(T12)), T7) → U11_GA(T12, T7, factorialc10_in_ga(T12, T14))
U11_GA(T12, T7, factorialc10_out_ga(T12, T14)) → U12_GA(T12, T7, mult18_in_gga(T12, T14, X25))
U11_GA(T12, T7, factorialc10_out_ga(T12, T14)) → MULT18_IN_GGA(T12, T14, X25)
FACTORIAL1_IN_GA(s(s(T103)), T106) → U13_GA(T103, T106, factorialc10_in_ga(T103, T14))
U13_GA(T103, T106, factorialc10_out_ga(T103, T14)) → U14_GA(T103, T106, multc18_in_gga(T103, T14, T104))
U14_GA(T103, T106, multc18_out_gga(T103, T14, T104)) → U15_GA(T103, T106, mult18_in_gga(T103, T104, X224))
U14_GA(T103, T106, multc18_out_gga(T103, T14, T104)) → MULT18_IN_GGA(T103, T104, X224)
U14_GA(T103, T106, multc18_out_gga(T103, T14, T104)) → U16_GA(T103, T106, T104, multc18_in_gga(T103, T104, T109))
U16_GA(T103, T106, T104, multc18_out_gga(T103, T104, T109)) → U17_GA(T103, T106, add52_in_gga(T104, T109, T106))
U16_GA(T103, T106, T104, multc18_out_gga(T103, T104, T109)) → ADD52_IN_GGA(T104, T109, T106)
ADD52_IN_GGA(s(T127), T128, s(T130)) → U9_GGA(T127, T128, T130, add52_in_gga(T127, T128, T130))
ADD52_IN_GGA(s(T127), T128, s(T130)) → ADD52_IN_GGA(T127, T128, T130)

The TRS R consists of the following rules:

factorialc10_in_ga(s(T20), X53) → U19_ga(T20, X53, factorialc10_in_ga(T20, T22))
factorialc10_in_ga(0, s(0)) → factorialc10_out_ga(0, s(0))
U19_ga(T20, X53, factorialc10_out_ga(T20, T22)) → U20_ga(T20, X53, multc18_in_gga(T20, T22, X53))
multc18_in_gga(T38, T39, X101) → U24_gga(T38, T39, X101, qc22_in_ggaa(T38, T39, X100, X101))
qc22_in_ggaa(T38, T39, T42, X101) → U21_ggaa(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
multc23_in_gga(s(T53), T54, X134) → U26_gga(T53, T54, X134, qc22_in_ggaa(T53, T54, X133, X134))
U26_gga(T53, T54, X134, qc22_out_ggaa(T53, T54, X133, X134)) → multc23_out_gga(s(T53), T54, X134)
multc23_in_gga(0, T59, 0) → multc23_out_gga(0, T59, 0)
U21_ggaa(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U22_ggaa(T38, T39, T42, X101, addc24_in_gga(T39, T42, X101))
addc24_in_gga(s(T70), T71, s(X170)) → U23_gga(T70, T71, X170, addc24_in_gga(T70, T71, X170))
addc24_in_gga(0, T76, T76) → addc24_out_gga(0, T76, T76)
U23_gga(T70, T71, X170, addc24_out_gga(T70, T71, X170)) → addc24_out_gga(s(T70), T71, s(X170))
U22_ggaa(T38, T39, T42, X101, addc24_out_gga(T39, T42, X101)) → qc22_out_ggaa(T38, T39, T42, X101)
U24_gga(T38, T39, X101, qc22_out_ggaa(T38, T39, X100, X101)) → multc18_out_gga(T38, T39, X101)
U20_ga(T20, X53, multc18_out_gga(T20, T22, X53)) → factorialc10_out_ga(s(T20), X53)

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
factorial10_in_ga(x1, x2)  =  factorial10_in_ga(x1)
factorialc10_in_ga(x1, x2)  =  factorialc10_in_ga(x1)
U19_ga(x1, x2, x3)  =  U19_ga(x1, x3)
0  =  0
factorialc10_out_ga(x1, x2)  =  factorialc10_out_ga(x1, x2)
U20_ga(x1, x2, x3)  =  U20_ga(x1, x3)
multc18_in_gga(x1, x2, x3)  =  multc18_in_gga(x1, x2)
U24_gga(x1, x2, x3, x4)  =  U24_gga(x1, x2, x4)
qc22_in_ggaa(x1, x2, x3, x4)  =  qc22_in_ggaa(x1, x2)
U21_ggaa(x1, x2, x3, x4, x5)  =  U21_ggaa(x1, x2, x5)
multc23_in_gga(x1, x2, x3)  =  multc23_in_gga(x1, x2)
U26_gga(x1, x2, x3, x4)  =  U26_gga(x1, x2, x4)
qc22_out_ggaa(x1, x2, x3, x4)  =  qc22_out_ggaa(x1, x2, x3, x4)
multc23_out_gga(x1, x2, x3)  =  multc23_out_gga(x1, x2, x3)
U22_ggaa(x1, x2, x3, x4, x5)  =  U22_ggaa(x1, x2, x3, x5)
addc24_in_gga(x1, x2, x3)  =  addc24_in_gga(x1, x2)
U23_gga(x1, x2, x3, x4)  =  U23_gga(x1, x2, x4)
addc24_out_gga(x1, x2, x3)  =  addc24_out_gga(x1, x2, x3)
multc18_out_gga(x1, x2, x3)  =  multc18_out_gga(x1, x2, x3)
mult18_in_gga(x1, x2, x3)  =  mult18_in_gga(x1, x2)
p22_in_ggaa(x1, x2, x3, x4)  =  p22_in_ggaa(x1, x2)
add24_in_gga(x1, x2, x3)  =  add24_in_gga(x1, x2)
add52_in_gga(x1, x2, x3)  =  add52_in_gga(x1, x2)
FACTORIAL1_IN_GA(x1, x2)  =  FACTORIAL1_IN_GA(x1)
U10_GA(x1, x2, x3)  =  U10_GA(x1, x3)
FACTORIAL10_IN_GA(x1, x2)  =  FACTORIAL10_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x1, x3)
U2_GA(x1, x2, x3)  =  U2_GA(x1, x3)
U3_GA(x1, x2, x3)  =  U3_GA(x1, x3)
MULT18_IN_GGA(x1, x2, x3)  =  MULT18_IN_GGA(x1, x2)
U8_GGA(x1, x2, x3, x4)  =  U8_GGA(x1, x2, x4)
P22_IN_GGAA(x1, x2, x3, x4)  =  P22_IN_GGAA(x1, x2)
U4_GGAA(x1, x2, x3, x4, x5)  =  U4_GGAA(x1, x2, x5)
U5_GGAA(x1, x2, x3, x4, x5)  =  U5_GGAA(x1, x2, x5)
U6_GGAA(x1, x2, x3, x4, x5)  =  U6_GGAA(x1, x2, x5)
ADD24_IN_GGA(x1, x2, x3)  =  ADD24_IN_GGA(x1, x2)
U7_GGA(x1, x2, x3, x4)  =  U7_GGA(x1, x2, x4)
U11_GA(x1, x2, x3)  =  U11_GA(x1, x3)
U12_GA(x1, x2, x3)  =  U12_GA(x1, x3)
U13_GA(x1, x2, x3)  =  U13_GA(x1, x3)
U14_GA(x1, x2, x3)  =  U14_GA(x1, x3)
U15_GA(x1, x2, x3)  =  U15_GA(x1, x3)
U16_GA(x1, x2, x3, x4)  =  U16_GA(x1, x3, x4)
U17_GA(x1, x2, x3)  =  U17_GA(x1, x3)
ADD52_IN_GGA(x1, x2, x3)  =  ADD52_IN_GGA(x1, x2)
U9_GGA(x1, x2, x3, x4)  =  U9_GGA(x1, x2, 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:

FACTORIAL1_IN_GA(s(s(T12)), T7) → U10_GA(T12, T7, factorial10_in_ga(T12, X24))
FACTORIAL1_IN_GA(s(s(T12)), T7) → FACTORIAL10_IN_GA(T12, X24)
FACTORIAL10_IN_GA(s(T20), X53) → U1_GA(T20, X53, factorial10_in_ga(T20, X52))
FACTORIAL10_IN_GA(s(T20), X53) → FACTORIAL10_IN_GA(T20, X52)
FACTORIAL10_IN_GA(s(T20), X53) → U2_GA(T20, X53, factorialc10_in_ga(T20, T22))
U2_GA(T20, X53, factorialc10_out_ga(T20, T22)) → U3_GA(T20, X53, mult18_in_gga(T20, T22, X53))
U2_GA(T20, X53, factorialc10_out_ga(T20, T22)) → MULT18_IN_GGA(T20, T22, X53)
MULT18_IN_GGA(T38, T39, X101) → U8_GGA(T38, T39, X101, p22_in_ggaa(T38, T39, X100, X101))
MULT18_IN_GGA(T38, T39, X101) → P22_IN_GGAA(T38, T39, X100, X101)
P22_IN_GGAA(s(T53), T54, X134, X101) → U4_GGAA(T53, T54, X134, X101, p22_in_ggaa(T53, T54, X133, X134))
P22_IN_GGAA(s(T53), T54, X134, X101) → P22_IN_GGAA(T53, T54, X133, X134)
P22_IN_GGAA(T38, T39, T42, X101) → U5_GGAA(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
U5_GGAA(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U6_GGAA(T38, T39, T42, X101, add24_in_gga(T39, T42, X101))
U5_GGAA(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → ADD24_IN_GGA(T39, T42, X101)
ADD24_IN_GGA(s(T70), T71, s(X170)) → U7_GGA(T70, T71, X170, add24_in_gga(T70, T71, X170))
ADD24_IN_GGA(s(T70), T71, s(X170)) → ADD24_IN_GGA(T70, T71, X170)
FACTORIAL1_IN_GA(s(s(T12)), T7) → U11_GA(T12, T7, factorialc10_in_ga(T12, T14))
U11_GA(T12, T7, factorialc10_out_ga(T12, T14)) → U12_GA(T12, T7, mult18_in_gga(T12, T14, X25))
U11_GA(T12, T7, factorialc10_out_ga(T12, T14)) → MULT18_IN_GGA(T12, T14, X25)
FACTORIAL1_IN_GA(s(s(T103)), T106) → U13_GA(T103, T106, factorialc10_in_ga(T103, T14))
U13_GA(T103, T106, factorialc10_out_ga(T103, T14)) → U14_GA(T103, T106, multc18_in_gga(T103, T14, T104))
U14_GA(T103, T106, multc18_out_gga(T103, T14, T104)) → U15_GA(T103, T106, mult18_in_gga(T103, T104, X224))
U14_GA(T103, T106, multc18_out_gga(T103, T14, T104)) → MULT18_IN_GGA(T103, T104, X224)
U14_GA(T103, T106, multc18_out_gga(T103, T14, T104)) → U16_GA(T103, T106, T104, multc18_in_gga(T103, T104, T109))
U16_GA(T103, T106, T104, multc18_out_gga(T103, T104, T109)) → U17_GA(T103, T106, add52_in_gga(T104, T109, T106))
U16_GA(T103, T106, T104, multc18_out_gga(T103, T104, T109)) → ADD52_IN_GGA(T104, T109, T106)
ADD52_IN_GGA(s(T127), T128, s(T130)) → U9_GGA(T127, T128, T130, add52_in_gga(T127, T128, T130))
ADD52_IN_GGA(s(T127), T128, s(T130)) → ADD52_IN_GGA(T127, T128, T130)

The TRS R consists of the following rules:

factorialc10_in_ga(s(T20), X53) → U19_ga(T20, X53, factorialc10_in_ga(T20, T22))
factorialc10_in_ga(0, s(0)) → factorialc10_out_ga(0, s(0))
U19_ga(T20, X53, factorialc10_out_ga(T20, T22)) → U20_ga(T20, X53, multc18_in_gga(T20, T22, X53))
multc18_in_gga(T38, T39, X101) → U24_gga(T38, T39, X101, qc22_in_ggaa(T38, T39, X100, X101))
qc22_in_ggaa(T38, T39, T42, X101) → U21_ggaa(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
multc23_in_gga(s(T53), T54, X134) → U26_gga(T53, T54, X134, qc22_in_ggaa(T53, T54, X133, X134))
U26_gga(T53, T54, X134, qc22_out_ggaa(T53, T54, X133, X134)) → multc23_out_gga(s(T53), T54, X134)
multc23_in_gga(0, T59, 0) → multc23_out_gga(0, T59, 0)
U21_ggaa(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U22_ggaa(T38, T39, T42, X101, addc24_in_gga(T39, T42, X101))
addc24_in_gga(s(T70), T71, s(X170)) → U23_gga(T70, T71, X170, addc24_in_gga(T70, T71, X170))
addc24_in_gga(0, T76, T76) → addc24_out_gga(0, T76, T76)
U23_gga(T70, T71, X170, addc24_out_gga(T70, T71, X170)) → addc24_out_gga(s(T70), T71, s(X170))
U22_ggaa(T38, T39, T42, X101, addc24_out_gga(T39, T42, X101)) → qc22_out_ggaa(T38, T39, T42, X101)
U24_gga(T38, T39, X101, qc22_out_ggaa(T38, T39, X100, X101)) → multc18_out_gga(T38, T39, X101)
U20_ga(T20, X53, multc18_out_gga(T20, T22, X53)) → factorialc10_out_ga(s(T20), X53)

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
factorial10_in_ga(x1, x2)  =  factorial10_in_ga(x1)
factorialc10_in_ga(x1, x2)  =  factorialc10_in_ga(x1)
U19_ga(x1, x2, x3)  =  U19_ga(x1, x3)
0  =  0
factorialc10_out_ga(x1, x2)  =  factorialc10_out_ga(x1, x2)
U20_ga(x1, x2, x3)  =  U20_ga(x1, x3)
multc18_in_gga(x1, x2, x3)  =  multc18_in_gga(x1, x2)
U24_gga(x1, x2, x3, x4)  =  U24_gga(x1, x2, x4)
qc22_in_ggaa(x1, x2, x3, x4)  =  qc22_in_ggaa(x1, x2)
U21_ggaa(x1, x2, x3, x4, x5)  =  U21_ggaa(x1, x2, x5)
multc23_in_gga(x1, x2, x3)  =  multc23_in_gga(x1, x2)
U26_gga(x1, x2, x3, x4)  =  U26_gga(x1, x2, x4)
qc22_out_ggaa(x1, x2, x3, x4)  =  qc22_out_ggaa(x1, x2, x3, x4)
multc23_out_gga(x1, x2, x3)  =  multc23_out_gga(x1, x2, x3)
U22_ggaa(x1, x2, x3, x4, x5)  =  U22_ggaa(x1, x2, x3, x5)
addc24_in_gga(x1, x2, x3)  =  addc24_in_gga(x1, x2)
U23_gga(x1, x2, x3, x4)  =  U23_gga(x1, x2, x4)
addc24_out_gga(x1, x2, x3)  =  addc24_out_gga(x1, x2, x3)
multc18_out_gga(x1, x2, x3)  =  multc18_out_gga(x1, x2, x3)
mult18_in_gga(x1, x2, x3)  =  mult18_in_gga(x1, x2)
p22_in_ggaa(x1, x2, x3, x4)  =  p22_in_ggaa(x1, x2)
add24_in_gga(x1, x2, x3)  =  add24_in_gga(x1, x2)
add52_in_gga(x1, x2, x3)  =  add52_in_gga(x1, x2)
FACTORIAL1_IN_GA(x1, x2)  =  FACTORIAL1_IN_GA(x1)
U10_GA(x1, x2, x3)  =  U10_GA(x1, x3)
FACTORIAL10_IN_GA(x1, x2)  =  FACTORIAL10_IN_GA(x1)
U1_GA(x1, x2, x3)  =  U1_GA(x1, x3)
U2_GA(x1, x2, x3)  =  U2_GA(x1, x3)
U3_GA(x1, x2, x3)  =  U3_GA(x1, x3)
MULT18_IN_GGA(x1, x2, x3)  =  MULT18_IN_GGA(x1, x2)
U8_GGA(x1, x2, x3, x4)  =  U8_GGA(x1, x2, x4)
P22_IN_GGAA(x1, x2, x3, x4)  =  P22_IN_GGAA(x1, x2)
U4_GGAA(x1, x2, x3, x4, x5)  =  U4_GGAA(x1, x2, x5)
U5_GGAA(x1, x2, x3, x4, x5)  =  U5_GGAA(x1, x2, x5)
U6_GGAA(x1, x2, x3, x4, x5)  =  U6_GGAA(x1, x2, x5)
ADD24_IN_GGA(x1, x2, x3)  =  ADD24_IN_GGA(x1, x2)
U7_GGA(x1, x2, x3, x4)  =  U7_GGA(x1, x2, x4)
U11_GA(x1, x2, x3)  =  U11_GA(x1, x3)
U12_GA(x1, x2, x3)  =  U12_GA(x1, x3)
U13_GA(x1, x2, x3)  =  U13_GA(x1, x3)
U14_GA(x1, x2, x3)  =  U14_GA(x1, x3)
U15_GA(x1, x2, x3)  =  U15_GA(x1, x3)
U16_GA(x1, x2, x3, x4)  =  U16_GA(x1, x3, x4)
U17_GA(x1, x2, x3)  =  U17_GA(x1, x3)
ADD52_IN_GGA(x1, x2, x3)  =  ADD52_IN_GGA(x1, x2)
U9_GGA(x1, x2, x3, x4)  =  U9_GGA(x1, x2, x4)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 4 SCCs with 24 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

ADD52_IN_GGA(s(T127), T128, s(T130)) → ADD52_IN_GGA(T127, T128, T130)

The TRS R consists of the following rules:

factorialc10_in_ga(s(T20), X53) → U19_ga(T20, X53, factorialc10_in_ga(T20, T22))
factorialc10_in_ga(0, s(0)) → factorialc10_out_ga(0, s(0))
U19_ga(T20, X53, factorialc10_out_ga(T20, T22)) → U20_ga(T20, X53, multc18_in_gga(T20, T22, X53))
multc18_in_gga(T38, T39, X101) → U24_gga(T38, T39, X101, qc22_in_ggaa(T38, T39, X100, X101))
qc22_in_ggaa(T38, T39, T42, X101) → U21_ggaa(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
multc23_in_gga(s(T53), T54, X134) → U26_gga(T53, T54, X134, qc22_in_ggaa(T53, T54, X133, X134))
U26_gga(T53, T54, X134, qc22_out_ggaa(T53, T54, X133, X134)) → multc23_out_gga(s(T53), T54, X134)
multc23_in_gga(0, T59, 0) → multc23_out_gga(0, T59, 0)
U21_ggaa(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U22_ggaa(T38, T39, T42, X101, addc24_in_gga(T39, T42, X101))
addc24_in_gga(s(T70), T71, s(X170)) → U23_gga(T70, T71, X170, addc24_in_gga(T70, T71, X170))
addc24_in_gga(0, T76, T76) → addc24_out_gga(0, T76, T76)
U23_gga(T70, T71, X170, addc24_out_gga(T70, T71, X170)) → addc24_out_gga(s(T70), T71, s(X170))
U22_ggaa(T38, T39, T42, X101, addc24_out_gga(T39, T42, X101)) → qc22_out_ggaa(T38, T39, T42, X101)
U24_gga(T38, T39, X101, qc22_out_ggaa(T38, T39, X100, X101)) → multc18_out_gga(T38, T39, X101)
U20_ga(T20, X53, multc18_out_gga(T20, T22, X53)) → factorialc10_out_ga(s(T20), X53)

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
factorialc10_in_ga(x1, x2)  =  factorialc10_in_ga(x1)
U19_ga(x1, x2, x3)  =  U19_ga(x1, x3)
0  =  0
factorialc10_out_ga(x1, x2)  =  factorialc10_out_ga(x1, x2)
U20_ga(x1, x2, x3)  =  U20_ga(x1, x3)
multc18_in_gga(x1, x2, x3)  =  multc18_in_gga(x1, x2)
U24_gga(x1, x2, x3, x4)  =  U24_gga(x1, x2, x4)
qc22_in_ggaa(x1, x2, x3, x4)  =  qc22_in_ggaa(x1, x2)
U21_ggaa(x1, x2, x3, x4, x5)  =  U21_ggaa(x1, x2, x5)
multc23_in_gga(x1, x2, x3)  =  multc23_in_gga(x1, x2)
U26_gga(x1, x2, x3, x4)  =  U26_gga(x1, x2, x4)
qc22_out_ggaa(x1, x2, x3, x4)  =  qc22_out_ggaa(x1, x2, x3, x4)
multc23_out_gga(x1, x2, x3)  =  multc23_out_gga(x1, x2, x3)
U22_ggaa(x1, x2, x3, x4, x5)  =  U22_ggaa(x1, x2, x3, x5)
addc24_in_gga(x1, x2, x3)  =  addc24_in_gga(x1, x2)
U23_gga(x1, x2, x3, x4)  =  U23_gga(x1, x2, x4)
addc24_out_gga(x1, x2, x3)  =  addc24_out_gga(x1, x2, x3)
multc18_out_gga(x1, x2, x3)  =  multc18_out_gga(x1, x2, x3)
ADD52_IN_GGA(x1, x2, x3)  =  ADD52_IN_GGA(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:

ADD52_IN_GGA(s(T127), T128, s(T130)) → ADD52_IN_GGA(T127, T128, T130)

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

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

(10) PiDPToQDPProof (SOUND 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:

ADD52_IN_GGA(s(T127), T128) → ADD52_IN_GGA(T127, T128)

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:

• ADD52_IN_GGA(s(T127), T128) → ADD52_IN_GGA(T127, T128)
  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:

ADD24_IN_GGA(s(T70), T71, s(X170)) → ADD24_IN_GGA(T70, T71, X170)

The TRS R consists of the following rules:

factorialc10_in_ga(s(T20), X53) → U19_ga(T20, X53, factorialc10_in_ga(T20, T22))
factorialc10_in_ga(0, s(0)) → factorialc10_out_ga(0, s(0))
U19_ga(T20, X53, factorialc10_out_ga(T20, T22)) → U20_ga(T20, X53, multc18_in_gga(T20, T22, X53))
multc18_in_gga(T38, T39, X101) → U24_gga(T38, T39, X101, qc22_in_ggaa(T38, T39, X100, X101))
qc22_in_ggaa(T38, T39, T42, X101) → U21_ggaa(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
multc23_in_gga(s(T53), T54, X134) → U26_gga(T53, T54, X134, qc22_in_ggaa(T53, T54, X133, X134))
U26_gga(T53, T54, X134, qc22_out_ggaa(T53, T54, X133, X134)) → multc23_out_gga(s(T53), T54, X134)
multc23_in_gga(0, T59, 0) → multc23_out_gga(0, T59, 0)
U21_ggaa(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U22_ggaa(T38, T39, T42, X101, addc24_in_gga(T39, T42, X101))
addc24_in_gga(s(T70), T71, s(X170)) → U23_gga(T70, T71, X170, addc24_in_gga(T70, T71, X170))
addc24_in_gga(0, T76, T76) → addc24_out_gga(0, T76, T76)
U23_gga(T70, T71, X170, addc24_out_gga(T70, T71, X170)) → addc24_out_gga(s(T70), T71, s(X170))
U22_ggaa(T38, T39, T42, X101, addc24_out_gga(T39, T42, X101)) → qc22_out_ggaa(T38, T39, T42, X101)
U24_gga(T38, T39, X101, qc22_out_ggaa(T38, T39, X100, X101)) → multc18_out_gga(T38, T39, X101)
U20_ga(T20, X53, multc18_out_gga(T20, T22, X53)) → factorialc10_out_ga(s(T20), X53)

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
factorialc10_in_ga(x1, x2)  =  factorialc10_in_ga(x1)
U19_ga(x1, x2, x3)  =  U19_ga(x1, x3)
0  =  0
factorialc10_out_ga(x1, x2)  =  factorialc10_out_ga(x1, x2)
U20_ga(x1, x2, x3)  =  U20_ga(x1, x3)
multc18_in_gga(x1, x2, x3)  =  multc18_in_gga(x1, x2)
U24_gga(x1, x2, x3, x4)  =  U24_gga(x1, x2, x4)
qc22_in_ggaa(x1, x2, x3, x4)  =  qc22_in_ggaa(x1, x2)
U21_ggaa(x1, x2, x3, x4, x5)  =  U21_ggaa(x1, x2, x5)
multc23_in_gga(x1, x2, x3)  =  multc23_in_gga(x1, x2)
U26_gga(x1, x2, x3, x4)  =  U26_gga(x1, x2, x4)
qc22_out_ggaa(x1, x2, x3, x4)  =  qc22_out_ggaa(x1, x2, x3, x4)
multc23_out_gga(x1, x2, x3)  =  multc23_out_gga(x1, x2, x3)
U22_ggaa(x1, x2, x3, x4, x5)  =  U22_ggaa(x1, x2, x3, x5)
addc24_in_gga(x1, x2, x3)  =  addc24_in_gga(x1, x2)
U23_gga(x1, x2, x3, x4)  =  U23_gga(x1, x2, x4)
addc24_out_gga(x1, x2, x3)  =  addc24_out_gga(x1, x2, x3)
multc18_out_gga(x1, x2, x3)  =  multc18_out_gga(x1, x2, x3)
ADD24_IN_GGA(x1, x2, x3)  =  ADD24_IN_GGA(x1, x2)

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

(15) UsableRulesProof (EQUIVALENT transformation)

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

(16) Obligation:

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

ADD24_IN_GGA(s(T70), T71, s(X170)) → ADD24_IN_GGA(T70, T71, X170)

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

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

(17) PiDPToQDPProof (SOUND transformation)

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

(18) Obligation:

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

ADD24_IN_GGA(s(T70), T71) → ADD24_IN_GGA(T70, T71)

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

(19) QDPSizeChangeProof (EQUIVALENT transformation)

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

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

• ADD24_IN_GGA(s(T70), T71) → ADD24_IN_GGA(T70, T71)
  The graph contains the following edges 1 > 1, 2 >= 2

(20) YES

(21) Obligation:

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

P22_IN_GGAA(s(T53), T54, X134, X101) → P22_IN_GGAA(T53, T54, X133, X134)

The TRS R consists of the following rules:

factorialc10_in_ga(s(T20), X53) → U19_ga(T20, X53, factorialc10_in_ga(T20, T22))
factorialc10_in_ga(0, s(0)) → factorialc10_out_ga(0, s(0))
U19_ga(T20, X53, factorialc10_out_ga(T20, T22)) → U20_ga(T20, X53, multc18_in_gga(T20, T22, X53))
multc18_in_gga(T38, T39, X101) → U24_gga(T38, T39, X101, qc22_in_ggaa(T38, T39, X100, X101))
qc22_in_ggaa(T38, T39, T42, X101) → U21_ggaa(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
multc23_in_gga(s(T53), T54, X134) → U26_gga(T53, T54, X134, qc22_in_ggaa(T53, T54, X133, X134))
U26_gga(T53, T54, X134, qc22_out_ggaa(T53, T54, X133, X134)) → multc23_out_gga(s(T53), T54, X134)
multc23_in_gga(0, T59, 0) → multc23_out_gga(0, T59, 0)
U21_ggaa(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U22_ggaa(T38, T39, T42, X101, addc24_in_gga(T39, T42, X101))
addc24_in_gga(s(T70), T71, s(X170)) → U23_gga(T70, T71, X170, addc24_in_gga(T70, T71, X170))
addc24_in_gga(0, T76, T76) → addc24_out_gga(0, T76, T76)
U23_gga(T70, T71, X170, addc24_out_gga(T70, T71, X170)) → addc24_out_gga(s(T70), T71, s(X170))
U22_ggaa(T38, T39, T42, X101, addc24_out_gga(T39, T42, X101)) → qc22_out_ggaa(T38, T39, T42, X101)
U24_gga(T38, T39, X101, qc22_out_ggaa(T38, T39, X100, X101)) → multc18_out_gga(T38, T39, X101)
U20_ga(T20, X53, multc18_out_gga(T20, T22, X53)) → factorialc10_out_ga(s(T20), X53)

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
factorialc10_in_ga(x1, x2)  =  factorialc10_in_ga(x1)
U19_ga(x1, x2, x3)  =  U19_ga(x1, x3)
0  =  0
factorialc10_out_ga(x1, x2)  =  factorialc10_out_ga(x1, x2)
U20_ga(x1, x2, x3)  =  U20_ga(x1, x3)
multc18_in_gga(x1, x2, x3)  =  multc18_in_gga(x1, x2)
U24_gga(x1, x2, x3, x4)  =  U24_gga(x1, x2, x4)
qc22_in_ggaa(x1, x2, x3, x4)  =  qc22_in_ggaa(x1, x2)
U21_ggaa(x1, x2, x3, x4, x5)  =  U21_ggaa(x1, x2, x5)
multc23_in_gga(x1, x2, x3)  =  multc23_in_gga(x1, x2)
U26_gga(x1, x2, x3, x4)  =  U26_gga(x1, x2, x4)
qc22_out_ggaa(x1, x2, x3, x4)  =  qc22_out_ggaa(x1, x2, x3, x4)
multc23_out_gga(x1, x2, x3)  =  multc23_out_gga(x1, x2, x3)
U22_ggaa(x1, x2, x3, x4, x5)  =  U22_ggaa(x1, x2, x3, x5)
addc24_in_gga(x1, x2, x3)  =  addc24_in_gga(x1, x2)
U23_gga(x1, x2, x3, x4)  =  U23_gga(x1, x2, x4)
addc24_out_gga(x1, x2, x3)  =  addc24_out_gga(x1, x2, x3)
multc18_out_gga(x1, x2, x3)  =  multc18_out_gga(x1, x2, x3)
P22_IN_GGAA(x1, x2, x3, x4)  =  P22_IN_GGAA(x1, x2)

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

(22) UsableRulesProof (EQUIVALENT transformation)

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

(23) Obligation:

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

P22_IN_GGAA(s(T53), T54, X134, X101) → P22_IN_GGAA(T53, T54, X133, X134)

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

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

(24) PiDPToQDPProof (SOUND transformation)

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

(25) Obligation:

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

P22_IN_GGAA(s(T53), T54) → P22_IN_GGAA(T53, T54)

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

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

• P22_IN_GGAA(s(T53), T54) → P22_IN_GGAA(T53, T54)
  The graph contains the following edges 1 > 1, 2 >= 2

(27) YES

(28) Obligation:

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

FACTORIAL10_IN_GA(s(T20), X53) → FACTORIAL10_IN_GA(T20, X52)

The TRS R consists of the following rules:

factorialc10_in_ga(s(T20), X53) → U19_ga(T20, X53, factorialc10_in_ga(T20, T22))
factorialc10_in_ga(0, s(0)) → factorialc10_out_ga(0, s(0))
U19_ga(T20, X53, factorialc10_out_ga(T20, T22)) → U20_ga(T20, X53, multc18_in_gga(T20, T22, X53))
multc18_in_gga(T38, T39, X101) → U24_gga(T38, T39, X101, qc22_in_ggaa(T38, T39, X100, X101))
qc22_in_ggaa(T38, T39, T42, X101) → U21_ggaa(T38, T39, T42, X101, multc23_in_gga(T38, T39, T42))
multc23_in_gga(s(T53), T54, X134) → U26_gga(T53, T54, X134, qc22_in_ggaa(T53, T54, X133, X134))
U26_gga(T53, T54, X134, qc22_out_ggaa(T53, T54, X133, X134)) → multc23_out_gga(s(T53), T54, X134)
multc23_in_gga(0, T59, 0) → multc23_out_gga(0, T59, 0)
U21_ggaa(T38, T39, T42, X101, multc23_out_gga(T38, T39, T42)) → U22_ggaa(T38, T39, T42, X101, addc24_in_gga(T39, T42, X101))
addc24_in_gga(s(T70), T71, s(X170)) → U23_gga(T70, T71, X170, addc24_in_gga(T70, T71, X170))
addc24_in_gga(0, T76, T76) → addc24_out_gga(0, T76, T76)
U23_gga(T70, T71, X170, addc24_out_gga(T70, T71, X170)) → addc24_out_gga(s(T70), T71, s(X170))
U22_ggaa(T38, T39, T42, X101, addc24_out_gga(T39, T42, X101)) → qc22_out_ggaa(T38, T39, T42, X101)
U24_gga(T38, T39, X101, qc22_out_ggaa(T38, T39, X100, X101)) → multc18_out_gga(T38, T39, X101)
U20_ga(T20, X53, multc18_out_gga(T20, T22, X53)) → factorialc10_out_ga(s(T20), X53)

The argument filtering Pi contains the following mapping:
s(x1)  =  s(x1)
factorialc10_in_ga(x1, x2)  =  factorialc10_in_ga(x1)
U19_ga(x1, x2, x3)  =  U19_ga(x1, x3)
0  =  0
factorialc10_out_ga(x1, x2)  =  factorialc10_out_ga(x1, x2)
U20_ga(x1, x2, x3)  =  U20_ga(x1, x3)
multc18_in_gga(x1, x2, x3)  =  multc18_in_gga(x1, x2)
U24_gga(x1, x2, x3, x4)  =  U24_gga(x1, x2, x4)
qc22_in_ggaa(x1, x2, x3, x4)  =  qc22_in_ggaa(x1, x2)
U21_ggaa(x1, x2, x3, x4, x5)  =  U21_ggaa(x1, x2, x5)
multc23_in_gga(x1, x2, x3)  =  multc23_in_gga(x1, x2)
U26_gga(x1, x2, x3, x4)  =  U26_gga(x1, x2, x4)
qc22_out_ggaa(x1, x2, x3, x4)  =  qc22_out_ggaa(x1, x2, x3, x4)
multc23_out_gga(x1, x2, x3)  =  multc23_out_gga(x1, x2, x3)
U22_ggaa(x1, x2, x3, x4, x5)  =  U22_ggaa(x1, x2, x3, x5)
addc24_in_gga(x1, x2, x3)  =  addc24_in_gga(x1, x2)
U23_gga(x1, x2, x3, x4)  =  U23_gga(x1, x2, x4)
addc24_out_gga(x1, x2, x3)  =  addc24_out_gga(x1, x2, x3)
multc18_out_gga(x1, x2, x3)  =  multc18_out_gga(x1, x2, x3)
FACTORIAL10_IN_GA(x1, x2)  =  FACTORIAL10_IN_GA(x1)

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

(29) UsableRulesProof (EQUIVALENT transformation)

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

(30) Obligation:

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

FACTORIAL10_IN_GA(s(T20), X53) → FACTORIAL10_IN_GA(T20, X52)

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

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

(31) PiDPToQDPProof (SOUND transformation)

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

(32) Obligation:

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

FACTORIAL10_IN_GA(s(T20)) → FACTORIAL10_IN_GA(T20)

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

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

• FACTORIAL10_IN_GA(s(T20)) → FACTORIAL10_IN_GA(T20)
  The graph contains the following edges 1 > 1

(34) YES