Runtime Complexity of the query pattern
append3(g,g,g,a)
w.r.t. the given Prolog program could be shown to be BOUNDS(O(1), O(n^1)).

(0) Obligation:

Clauses:

append([], L, L).
append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3).
append3(A, B, C, D) :- ','(append(A, B, E), append(E, C, D)).

Query: append3(g,g,g,a)

(1) PrologToCdtProblemTransformerProof (UPPER BOUND (ID) transformation)

Built complexity over-approximating cdt problems from derivation graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: append3(T1, T2, T3, T4)\n\nT1 is ground\nT2 is ground\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: append3(T1, T2, T3, T4), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nT2 is ground\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: ','(append(T16, T17, X16), append(X16, T18, T20))\n\nT16 is ground\nT17 is ground\nT18 is ground\nX16 is free", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: append(T16, T17, X16)\n\nT16 is ground\nT17 is ground\nX16 is free", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: append(T23, T18, T20)\n\nT18 is ground\nT23 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: append(T16, T17, X16), SCOPE: 2, CLAUSE: 0 | append(T16, T17, X16), SCOPE: 2, CLAUSE: 1\n\nT16 is ground\nT17 is ground\nX16 is free", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: true | append([], T28, X16), SCOPE: 2, CLAUSE: 1\n\nT28 is ground\nX16 is free", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: append(T16, T17, X16), SCOPE: 2, CLAUSE: 1\n\nT16 is ground\nT17 is ground\nX16 is free\nX23 is free\nappend(T16, T17, X16) !=? append([], X23, X23)", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: append([], T28, X16), SCOPE: 2, CLAUSE: 1\n\nT28 is ground\nX16 is free", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: append(T36, T37, X42)\n\nT36 is ground\nT37 is ground\nX42 is free", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: append(T23, T18, T20), SCOPE: 3, CLAUSE: 0 | append(T23, T18, T20), SCOPE: 3, CLAUSE: 1\n\nT18 is ground\nT23 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: true | append([], T44, T20), SCOPE: 3, CLAUSE: 1\n\nT44 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: append(T23, T18, T20), SCOPE: 3, CLAUSE: 1\n\nT18 is ground\nT23 is ground\nX49 is free\nappend(T23, T18, T20) !=? append([], X49, X49)", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: append([], T44, T20), SCOPE: 3, CLAUSE: 1\n\nT44 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: append(T54, T55, T57)\n\nT54 is ground\nT55 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 40 [arrowhead = none ];
40 -> 3;

41 [label="ONLY EVAL with clause\nappend3(X12, X13, X14, X15) :- ','(append(X12, X13, X16), append(X16, X14, X15)).\nand substitutionT1 -> T16,\nX12 -> T16,\nT2 -> T17,\nX13 -> T17,\nT3 -> T18,\nX14 -> T18,\nT4 -> T20,\nX15 -> T20,\nT19 -> T20", fontsize=14, style = filled, fillcolor = lightblue];
3 -> 41 [arrowhead = none ];
41 -> 6;

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

43 [label="SPLIT 2\nnew knowledge:\nT16 is ground\nT17 is ground\nT23 is ground\nreplacements:X16 -> T23", fontsize=14, style = filled, fillcolor = violet];
6 -> 43 [arrowhead = none ];
43 -> 11;

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

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

46 [label="EVAL with clause\nappend([], X23, X23).\nand substitutionT16 -> [],\nT17 -> T28,\nX23 -> T28,\nX16 -> T28", fontsize=14, style = filled, fillcolor = lightblue];
13 -> 46 [arrowhead = none ];
46 -> 15;

47 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
13 -> 47 [arrowhead = none ];
47 -> 17;

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

49 [label="EVAL with clause\nappend(.(X38, X39), X40, .(X38, X41)) :- append(X39, X40, X41).\nand substitutionX38 -> T35,\nX39 -> T36,\nT16 -> .(T35, T36),\nT17 -> T37,\nX40 -> T37,\nX41 -> X42,\nX16 -> .(T35, X42)", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 49 [arrowhead = none ];
49 -> 24;

50 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
17 -> 50 [arrowhead = none ];
50 -> 26;

51 [label="BACKTRACK\nfor clause: append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
18 -> 51 [arrowhead = none ];
51 -> 20;

52 [label="INSTANCE with matching:\nT16 -> T36\nT17 -> T37\nX16 -> X42", fontsize=14, style = filled, fillcolor = lightgrey];
24 -> 52 [arrowhead = none , style=dashed];
52 -> 10[style=dashed];

53 [label="EVAL with clause\nappend([], X49, X49).\nand substitutionT23 -> [],\nT18 -> T44,\nX49 -> T44,\nT20 -> T44", fontsize=14, style = filled, fillcolor = lightblue];
28 -> 53 [arrowhead = none ];
53 -> 30;

54 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
28 -> 54 [arrowhead = none ];
54 -> 31;

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

56 [label="EVAL with clause\nappend(.(X62, X63), X64, .(X62, X65)) :- append(X63, X64, X65).\nand substitutionX62 -> T53,\nX63 -> T54,\nT23 -> .(T53, T54),\nT18 -> T55,\nX64 -> T55,\nX65 -> T57,\nT20 -> .(T53, T57),\nT56 -> T57", fontsize=14, style = filled, fillcolor = lightblue];
31 -> 56 [arrowhead = none ];
56 -> 36;

57 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
31 -> 57 [arrowhead = none ];
57 -> 39;

58 [label="BACKTRACK\nfor clause: append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
32 -> 58 [arrowhead = none ];
58 -> 33;

59 [label="INSTANCE with matching:\nT23 -> T54\nT18 -> T55\nT20 -> T57", fontsize=14, style = filled, fillcolor = lightgrey];
36 -> 59 [arrowhead = none , style=dashed];
59 -> 11[style=dashed];

}

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(z0, z1, z2) → U1(f6_in(z0, z1, z2), z0, z1, z2)
U1(f6_out1(z0, z1), z2, z3, z4) → f1_out1(z1)
f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))
f11_in([], z0) → f11_out1(z0)
f11_in(.(z0, z1), z2) → U3(f11_in(z1, z2), .(z0, z1), z2)
U3(f11_out1(z0), .(z1, z2), z3) → f11_out1(.(z1, z0))
f6_in(z0, z1, z2) → U4(f10_in(z0, z1), z0, z1, z2)
U4(f10_out1(z0), z1, z2, z3) → U5(f11_in(z0, z3), z1, z2, z3, z0)
U5(f11_out1(z0), z1, z2, z3, z4) → f6_out1(z4, z0)

Tuples:

F1_IN(z0, z1, z2) → c(U1'(f6_in(z0, z1, z2), z0, z1, z2), F6_IN(z0, z1, z2))
F10_IN(.(z0, z1), z2) → c3(U2'(f10_in(z1, z2), .(z0, z1), z2), F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(U3'(f11_in(z1, z2), .(z0, z1), z2), F11_IN(z1, z2))
F6_IN(z0, z1, z2) → c8(U4'(f10_in(z0, z1), z0, z1, z2), F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c9(U5'(f11_in(z0, z3), z1, z2, z3, z0), F11_IN(z0, z3))

S tuples:

F1_IN(z0, z1, z2) → c(U1'(f6_in(z0, z1, z2), z0, z1, z2), F6_IN(z0, z1, z2))
F10_IN(.(z0, z1), z2) → c3(U2'(f10_in(z1, z2), .(z0, z1), z2), F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(U3'(f11_in(z1, z2), .(z0, z1), z2), F11_IN(z1, z2))
F6_IN(z0, z1, z2) → c8(U4'(f10_in(z0, z1), z0, z1, z2), F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c9(U5'(f11_in(z0, z3), z1, z2, z3, z0), F11_IN(z0, z3))

K tuples:none
Defined Rule Symbols:

f1_in, U1, f10_in, U2, f11_in, U3, f6_in, U4, U5

Defined Pair Symbols:

F1_IN, F10_IN, F11_IN, F6_IN, U4'

Compound Symbols:

c, c3, c6, c8, c9

(3) CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID) transformation)

Split RHS of tuples not part of any SCC

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(z0, z1, z2) → U1(f6_in(z0, z1, z2), z0, z1, z2)
U1(f6_out1(z0, z1), z2, z3, z4) → f1_out1(z1)
f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))
f11_in([], z0) → f11_out1(z0)
f11_in(.(z0, z1), z2) → U3(f11_in(z1, z2), .(z0, z1), z2)
U3(f11_out1(z0), .(z1, z2), z3) → f11_out1(.(z1, z0))
f6_in(z0, z1, z2) → U4(f10_in(z0, z1), z0, z1, z2)
U4(f10_out1(z0), z1, z2, z3) → U5(f11_in(z0, z3), z1, z2, z3, z0)
U5(f11_out1(z0), z1, z2, z3, z4) → f6_out1(z4, z0)

Tuples:

F10_IN(.(z0, z1), z2) → c3(U2'(f10_in(z1, z2), .(z0, z1), z2), F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(U3'(f11_in(z1, z2), .(z0, z1), z2), F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1(U1'(f6_in(z0, z1, z2), z0, z1, z2))
F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(U5'(f11_in(z0, z3), z1, z2, z3, z0))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))

S tuples:

F10_IN(.(z0, z1), z2) → c3(U2'(f10_in(z1, z2), .(z0, z1), z2), F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(U3'(f11_in(z1, z2), .(z0, z1), z2), F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1(U1'(f6_in(z0, z1, z2), z0, z1, z2))
F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(U5'(f11_in(z0, z3), z1, z2, z3, z0))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))

K tuples:none
Defined Rule Symbols:

f1_in, U1, f10_in, U2, f11_in, U3, f6_in, U4, U5

Defined Pair Symbols:

F10_IN, F11_IN, F1_IN, F6_IN, U4'

Compound Symbols:

c3, c6, c1

(5) CdtGraphRemoveTrailingTuplepartsProof (BOTH BOUNDS(ID, ID) transformation)

Removed 4 trailing tuple parts

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(z0, z1, z2) → U1(f6_in(z0, z1, z2), z0, z1, z2)
U1(f6_out1(z0, z1), z2, z3, z4) → f1_out1(z1)
f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))
f11_in([], z0) → f11_out1(z0)
f11_in(.(z0, z1), z2) → U3(f11_in(z1, z2), .(z0, z1), z2)
U3(f11_out1(z0), .(z1, z2), z3) → f11_out1(.(z1, z0))
f6_in(z0, z1, z2) → U4(f10_in(z0, z1), z0, z1, z2)
U4(f10_out1(z0), z1, z2, z3) → U5(f11_in(z0, z3), z1, z2, z3, z0)
U5(f11_out1(z0), z1, z2, z3, z4) → f6_out1(z4, z0)

Tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

S tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

K tuples:none
Defined Rule Symbols:

f1_in, U1, f10_in, U2, f11_in, U3, f6_in, U4, U5

Defined Pair Symbols:

F1_IN, F6_IN, U4', F10_IN, F11_IN

Compound Symbols:

c1, c3, c6, c1

(7) CdtKnowledgeProof (EQUIVALENT transformation)

The following tuples could be moved from S to K by knowledge propagation:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
U4'(f10_out1(z0), z1, z2, z3) → c1

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(z0, z1, z2) → U1(f6_in(z0, z1, z2), z0, z1, z2)
U1(f6_out1(z0, z1), z2, z3, z4) → f1_out1(z1)
f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))
f11_in([], z0) → f11_out1(z0)
f11_in(.(z0, z1), z2) → U3(f11_in(z1, z2), .(z0, z1), z2)
U3(f11_out1(z0), .(z1, z2), z3) → f11_out1(.(z1, z0))
f6_in(z0, z1, z2) → U4(f10_in(z0, z1), z0, z1, z2)
U4(f10_out1(z0), z1, z2, z3) → U5(f11_in(z0, z3), z1, z2, z3, z0)
U5(f11_out1(z0), z1, z2, z3, z4) → f6_out1(z4, z0)

Tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

S tuples:

F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))

K tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

Defined Rule Symbols:

f1_in, U1, f10_in, U2, f11_in, U3, f6_in, U4, U5

Defined Pair Symbols:

F1_IN, F6_IN, U4', F10_IN, F11_IN

Compound Symbols:

c1, c3, c6, c1

(9) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))

We considered the (Usable) Rules:

f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))

And the Tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(.(x₁, x₂)) = [2] + x₂   
POL(F10_IN(x₁, x₂)) = [2] + [2]x₁ + [2]x₂   
POL(F11_IN(x₁, x₂)) = 0   
POL(F1_IN(x₁, x₂, x₃)) = [2] + [2]x₁ + [2]x₂ + [2]x₃   
POL(F6_IN(x₁, x₂, x₃)) = [2] + [2]x₁ + [2]x₂ + x₃   
POL(U2(x₁, x₂, x₃)) = 0   
POL(U4'(x₁, x₂, x₃, x₄)) = [2]x₂ + [2]x₃ + x₄   
POL([]) = 0   
POL(c1) = 0   
POL(c1(x₁)) = x₁   
POL(c3(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(f10_in(x₁, x₂)) = 0   
POL(f10_out1(x₁)) = 0   

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(z0, z1, z2) → U1(f6_in(z0, z1, z2), z0, z1, z2)
U1(f6_out1(z0, z1), z2, z3, z4) → f1_out1(z1)
f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))
f11_in([], z0) → f11_out1(z0)
f11_in(.(z0, z1), z2) → U3(f11_in(z1, z2), .(z0, z1), z2)
U3(f11_out1(z0), .(z1, z2), z3) → f11_out1(.(z1, z0))
f6_in(z0, z1, z2) → U4(f10_in(z0, z1), z0, z1, z2)
U4(f10_out1(z0), z1, z2, z3) → U5(f11_in(z0, z3), z1, z2, z3, z0)
U5(f11_out1(z0), z1, z2, z3, z4) → f6_out1(z4, z0)

Tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

S tuples:

F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))

K tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))

Defined Rule Symbols:

f1_in, U1, f10_in, U2, f11_in, U3, f6_in, U4, U5

Defined Pair Symbols:

F1_IN, F6_IN, U4', F10_IN, F11_IN

Compound Symbols:

c1, c3, c6, c1

(11) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))

We considered the (Usable) Rules:

f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))

And the Tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(.(x₁, x₂)) = [2] + x₂   
POL(F10_IN(x₁, x₂)) = [1] + x₂   
POL(F11_IN(x₁, x₂)) = [1] + x₁   
POL(F1_IN(x₁, x₂, x₃)) = [3] + [3]x₁ + [2]x₂ + x₃   
POL(F6_IN(x₁, x₂, x₃)) = [2] + [3]x₁ + [2]x₂   
POL(U2(x₁, x₂, x₃)) = [2] + x₁   
POL(U4'(x₁, x₂, x₃, x₄)) = [1] + x₁   
POL([]) = [1]   
POL(c1) = 0   
POL(c1(x₁)) = x₁   
POL(c3(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(f10_in(x₁, x₂)) = [1] + [2]x₁ + x₂   
POL(f10_out1(x₁)) = x₁   

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(z0, z1, z2) → U1(f6_in(z0, z1, z2), z0, z1, z2)
U1(f6_out1(z0, z1), z2, z3, z4) → f1_out1(z1)
f10_in([], z0) → f10_out1(z0)
f10_in(.(z0, z1), z2) → U2(f10_in(z1, z2), .(z0, z1), z2)
U2(f10_out1(z0), .(z1, z2), z3) → f10_out1(.(z1, z0))
f11_in([], z0) → f11_out1(z0)
f11_in(.(z0, z1), z2) → U3(f11_in(z1, z2), .(z0, z1), z2)
U3(f11_out1(z0), .(z1, z2), z3) → f11_out1(.(z1, z0))
f6_in(z0, z1, z2) → U4(f10_in(z0, z1), z0, z1, z2)
U4(f10_out1(z0), z1, z2, z3) → U5(f11_in(z0, z3), z1, z2, z3, z0)
U5(f11_out1(z0), z1, z2, z3, z4) → f6_out1(z4, z0)

Tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1

S tuples:none
K tuples:

F1_IN(z0, z1, z2) → c1(F6_IN(z0, z1, z2))
F6_IN(z0, z1, z2) → c1(U4'(f10_in(z0, z1), z0, z1, z2))
F6_IN(z0, z1, z2) → c1(F10_IN(z0, z1))
U4'(f10_out1(z0), z1, z2, z3) → c1(F11_IN(z0, z3))
F1_IN(z0, z1, z2) → c1
U4'(f10_out1(z0), z1, z2, z3) → c1
F10_IN(.(z0, z1), z2) → c3(F10_IN(z1, z2))
F11_IN(.(z0, z1), z2) → c6(F11_IN(z1, z2))

Defined Rule Symbols:

f1_in, U1, f10_in, U2, f11_in, U3, f6_in, U4, U5

Defined Pair Symbols:

F1_IN, F6_IN, U4', F10_IN, F11_IN

Compound Symbols:

c1, c3, c6, c1

(13) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(14) BOUNDS(O(1), O(1))

(15) PrologToCdtProblemTransformerProof (UPPER BOUND (ID) transformation)

Built complexity over-approximating cdt problems from derivation graph.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
2 [label="2: append3(T1, T2, T3, T4)\n\nT1 is ground\nT2 is ground\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: append3(T1, T2, T3, T4), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nT2 is ground\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: ','(append(T9, T10, X9), append(X9, T11, T13))\n\nT9 is ground\nT10 is ground\nT11 is ground\nX9 is free", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: ','(append(T9, T10, X9), append(X9, T11, T13)), SCOPE: 2, CLAUSE: 0 | ','(append(T9, T10, X9), append(X9, T11, T13)), SCOPE: 2, CLAUSE: 1\n\nT9 is ground\nT10 is ground\nT11 is ground\nX9 is free", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: append(T16, T11, T13) | ','(append([], T16, X9), append(X9, T11, T13)), SCOPE: 2, CLAUSE: 1\n\nT11 is ground\nT16 is ground\nX9 is free", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: ','(append(T9, T10, X9), append(X9, T11, T13)), SCOPE: 2, CLAUSE: 1\n\nT9 is ground\nT10 is ground\nT11 is ground\nX9 is free\nX12 is free\nappend(T9, T10, X9) !=? append([], X12, X12)", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: append(T16, T11, T13)\n\nT11 is ground\nT16 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: ','(append([], T16, X9), append(X9, T11, T13)), SCOPE: 2, CLAUSE: 1\n\nT11 is ground\nT16 is ground\nX9 is free", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: append(T16, T11, T13), SCOPE: 3, CLAUSE: 0 | append(T16, T11, T13), SCOPE: 3, CLAUSE: 1\n\nT11 is ground\nT16 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: true | append([], T23, T13), SCOPE: 3, CLAUSE: 1\n\nT23 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: append(T16, T11, T13), SCOPE: 3, CLAUSE: 1\n\nT11 is ground\nT16 is ground\nX19 is free\nappend(T16, T11, T13) !=? append([], X19, X19)", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: append([], T23, T13), SCOPE: 3, CLAUSE: 1\n\nT23 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: append(T33, T34, T36)\n\nT33 is ground\nT34 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: ','(append(T46, T47, X56), append(.(T45, X56), T11, T13))\n\nT11 is ground\nT45 is ground\nT46 is ground\nT47 is ground\nX56 is free", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: append(T46, T47, X56)\n\nT46 is ground\nT47 is ground\nX56 is free", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: append(.(T45, T50), T11, T13)\n\nT11 is ground\nT45 is ground\nT50 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: append(T46, T47, X56), SCOPE: 4, CLAUSE: 0 | append(T46, T47, X56), SCOPE: 4, CLAUSE: 1\n\nT46 is ground\nT47 is ground\nX56 is free", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: true | append([], T55, X56), SCOPE: 4, CLAUSE: 1\n\nT55 is ground\nX56 is free", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: append(T46, T47, X56), SCOPE: 4, CLAUSE: 1\n\nT46 is ground\nT47 is ground\nX56 is free\nX63 is free\nappend(T46, T47, X56) !=? append([], X63, X63)", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: append([], T55, X56), SCOPE: 4, CLAUSE: 1\n\nT55 is ground\nX56 is free", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: append(T63, T64, X82)\n\nT63 is ground\nT64 is ground\nX82 is free", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 47 [arrowhead = none ];
47 -> 4;

48 [label="ONLY EVAL with clause\nappend3(X5, X6, X7, X8) :- ','(append(X5, X6, X9), append(X9, X7, X8)).\nand substitutionT1 -> T9,\nX5 -> T9,\nT2 -> T10,\nX6 -> T10,\nT3 -> T11,\nX7 -> T11,\nT4 -> T13,\nX8 -> T13,\nT12 -> T13", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 48 [arrowhead = none ];
48 -> 5;

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

50 [label="EVAL with clause\nappend([], X12, X12).\nand substitutionT9 -> [],\nT10 -> T16,\nX12 -> T16,\nX9 -> T16", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 50 [arrowhead = none ];
50 -> 8;

51 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
7 -> 51 [arrowhead = none ];
51 -> 9;

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

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

54 [label="EVAL with clause\nappend(.(X52, X53), X54, .(X52, X55)) :- append(X53, X54, X55).\nand substitutionX52 -> T45,\nX53 -> T46,\nT9 -> .(T45, T46),\nT10 -> T47,\nX54 -> T47,\nX55 -> X56,\nX9 -> .(T45, X56)", fontsize=14, style = filled, fillcolor = lightblue];
9 -> 54 [arrowhead = none ];
54 -> 34;

55 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 55 [arrowhead = none ];
55 -> 35;

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

57 [label="BACKTRACK\nfor clause: append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
14 -> 57 [arrowhead = none ];
57 -> 29;

58 [label="EVAL with clause\nappend([], X19, X19).\nand substitutionT16 -> [],\nT11 -> T23,\nX19 -> T23,\nT13 -> T23", fontsize=14, style = filled, fillcolor = lightblue];
16 -> 58 [arrowhead = none ];
58 -> 19;

59 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
16 -> 59 [arrowhead = none ];
59 -> 21;

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

61 [label="EVAL with clause\nappend(.(X32, X33), X34, .(X32, X35)) :- append(X33, X34, X35).\nand substitutionX32 -> T32,\nX33 -> T33,\nT16 -> .(T32, T33),\nT11 -> T34,\nX34 -> T34,\nX35 -> T36,\nT13 -> .(T32, T36),\nT35 -> T36", fontsize=14, style = filled, fillcolor = lightblue];
21 -> 61 [arrowhead = none ];
61 -> 25;

62 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
21 -> 62 [arrowhead = none ];
62 -> 27;

63 [label="BACKTRACK\nfor clause: append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
22 -> 63 [arrowhead = none ];
63 -> 23;

64 [label="INSTANCE with matching:\nT16 -> T33\nT11 -> T34\nT13 -> T36", fontsize=14, style = filled, fillcolor = lightgrey];
25 -> 64 [arrowhead = none , style=dashed];
64 -> 12[style=dashed];

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

66 [label="SPLIT 2\nnew knowledge:\nT46 is ground\nT47 is ground\nT50 is ground\nreplacements:X56 -> T50", fontsize=14, style = filled, fillcolor = violet];
34 -> 66 [arrowhead = none ];
66 -> 38;

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

68 [label="INSTANCE with matching:\nT16 -> .(T45, T50)", fontsize=14, style = filled, fillcolor = lightgrey];
38 -> 68 [arrowhead = none , style=dashed];
68 -> 12[style=dashed];

69 [label="EVAL with clause\nappend([], X63, X63).\nand substitutionT46 -> [],\nT47 -> T55,\nX63 -> T55,\nX56 -> T55", fontsize=14, style = filled, fillcolor = lightblue];
40 -> 69 [arrowhead = none ];
69 -> 41;

70 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
40 -> 70 [arrowhead = none ];
70 -> 42;

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

72 [label="EVAL with clause\nappend(.(X78, X79), X80, .(X78, X81)) :- append(X79, X80, X81).\nand substitutionX78 -> T62,\nX79 -> T63,\nT46 -> .(T62, T63),\nT47 -> T64,\nX80 -> T64,\nX81 -> X82,\nX56 -> .(T62, X82)", fontsize=14, style = filled, fillcolor = lightblue];
42 -> 72 [arrowhead = none ];
72 -> 45;

73 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
42 -> 73 [arrowhead = none ];
73 -> 46;

74 [label="BACKTRACK\nfor clause: append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
43 -> 74 [arrowhead = none ];
74 -> 44;

75 [label="INSTANCE with matching:\nT46 -> T63\nT47 -> T64\nX56 -> X82", fontsize=14, style = filled, fillcolor = lightgrey];
45 -> 75 [arrowhead = none , style=dashed];
75 -> 37[style=dashed];

}

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([], z0, z1) → U1(f8_in(z0, z1), [], z0, z1)
f2_in(.(z0, z1), z2, z3) → U2(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3)
U1(f8_out1(z0), [], z1, z2) → f2_out1(z0)
U1(f8_out2(z0, z1), [], z2, z3) → f2_out1(z1)
U2(f34_out1(z0, z1), .(z2, z3), z4, z5) → f2_out1(z1)
f12_in([], z0) → f12_out1(z0)
f12_in(.(z0, z1), z2) → U3(f12_in(z1, z2), .(z0, z1), z2)
U3(f12_out1(z0), .(z1, z2), z3) → f12_out1(.(z1, z0))
f37_in([], z0) → f37_out1(z0)
f37_in(.(z0, z1), z2) → U4(f37_in(z1, z2), .(z0, z1), z2)
U4(f37_out1(z0), .(z1, z2), z3) → f37_out1(.(z1, z0))
f34_in(z0, z1, z2, z3) → U5(f37_in(z0, z1), z0, z1, z2, z3)
U5(f37_out1(z0), z1, z2, z3, z4) → U6(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0)
U6(f12_out1(z0), z1, z2, z3, z4, z5) → f34_out1(z5, z0)
f8_in(z0, z1) → U7(f12_in(z0, z1), f14_in(z0, z1), z0, z1)
U7(f12_out1(z0), z1, z2, z3) → f8_out1(z0)
U7(z0, f14_out1(z1, z2), z3, z4) → f8_out2(z1, z2)

Tuples:

F2_IN([], z0, z1) → c(U1'(f8_in(z0, z1), [], z0, z1), F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c1(U2'(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3), F34_IN(z1, z2, z0, z3))
F12_IN(.(z0, z1), z2) → c6(U3'(f12_in(z1, z2), .(z0, z1), z2), F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(U4'(f37_in(z1, z2), .(z0, z1), z2), F37_IN(z1, z2))
F34_IN(z0, z1, z2, z3) → c11(U5'(f37_in(z0, z1), z0, z1, z2, z3), F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c12(U6'(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0), F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c14(U7'(f12_in(z0, z1), f14_in(z0, z1), z0, z1), F12_IN(z0, z1))

S tuples:

F2_IN([], z0, z1) → c(U1'(f8_in(z0, z1), [], z0, z1), F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c1(U2'(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3), F34_IN(z1, z2, z0, z3))
F12_IN(.(z0, z1), z2) → c6(U3'(f12_in(z1, z2), .(z0, z1), z2), F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(U4'(f37_in(z1, z2), .(z0, z1), z2), F37_IN(z1, z2))
F34_IN(z0, z1, z2, z3) → c11(U5'(f37_in(z0, z1), z0, z1, z2, z3), F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c12(U6'(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0), F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c14(U7'(f12_in(z0, z1), f14_in(z0, z1), z0, z1), F12_IN(z0, z1))

K tuples:none
Defined Rule Symbols:

f2_in, U1, U2, f12_in, U3, f37_in, U4, f34_in, U5, U6, f8_in, U7

Defined Pair Symbols:

F2_IN, F12_IN, F37_IN, F34_IN, U5', F8_IN

Compound Symbols:

c, c1, c6, c9, c11, c12, c14

(17) CdtGraphSplitRhsProof (BOTH BOUNDS(ID, ID) transformation)

Split RHS of tuples not part of any SCC

(18) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([], z0, z1) → U1(f8_in(z0, z1), [], z0, z1)
f2_in(.(z0, z1), z2, z3) → U2(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3)
U1(f8_out1(z0), [], z1, z2) → f2_out1(z0)
U1(f8_out2(z0, z1), [], z2, z3) → f2_out1(z1)
U2(f34_out1(z0, z1), .(z2, z3), z4, z5) → f2_out1(z1)
f12_in([], z0) → f12_out1(z0)
f12_in(.(z0, z1), z2) → U3(f12_in(z1, z2), .(z0, z1), z2)
U3(f12_out1(z0), .(z1, z2), z3) → f12_out1(.(z1, z0))
f37_in([], z0) → f37_out1(z0)
f37_in(.(z0, z1), z2) → U4(f37_in(z1, z2), .(z0, z1), z2)
U4(f37_out1(z0), .(z1, z2), z3) → f37_out1(.(z1, z0))
f34_in(z0, z1, z2, z3) → U5(f37_in(z0, z1), z0, z1, z2, z3)
U5(f37_out1(z0), z1, z2, z3, z4) → U6(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0)
U6(f12_out1(z0), z1, z2, z3, z4, z5) → f34_out1(z5, z0)
f8_in(z0, z1) → U7(f12_in(z0, z1), f14_in(z0, z1), z0, z1)
U7(f12_out1(z0), z1, z2, z3) → f8_out1(z0)
U7(z0, f14_out1(z1, z2), z3, z4) → f8_out2(z1, z2)

Tuples:

F12_IN(.(z0, z1), z2) → c6(U3'(f12_in(z1, z2), .(z0, z1), z2), F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(U4'(f37_in(z1, z2), .(z0, z1), z2), F37_IN(z1, z2))
F2_IN([], z0, z1) → c2(U1'(f8_in(z0, z1), [], z0, z1))
F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(U2'(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(U6'(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(U7'(f12_in(z0, z1), f14_in(z0, z1), z0, z1))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))

S tuples:

F12_IN(.(z0, z1), z2) → c6(U3'(f12_in(z1, z2), .(z0, z1), z2), F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(U4'(f37_in(z1, z2), .(z0, z1), z2), F37_IN(z1, z2))
F2_IN([], z0, z1) → c2(U1'(f8_in(z0, z1), [], z0, z1))
F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(U2'(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(U6'(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(U7'(f12_in(z0, z1), f14_in(z0, z1), z0, z1))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))

K tuples:none
Defined Rule Symbols:

f2_in, U1, U2, f12_in, U3, f37_in, U4, f34_in, U5, U6, f8_in, U7

Defined Pair Symbols:

F12_IN, F37_IN, F2_IN, F34_IN, U5', F8_IN

Compound Symbols:

c6, c9, c2

(19) CdtGraphRemoveTrailingTuplepartsProof (BOTH BOUNDS(ID, ID) transformation)

Removed 6 trailing tuple parts

(20) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([], z0, z1) → U1(f8_in(z0, z1), [], z0, z1)
f2_in(.(z0, z1), z2, z3) → U2(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3)
U1(f8_out1(z0), [], z1, z2) → f2_out1(z0)
U1(f8_out2(z0, z1), [], z2, z3) → f2_out1(z1)
U2(f34_out1(z0, z1), .(z2, z3), z4, z5) → f2_out1(z1)
f12_in([], z0) → f12_out1(z0)
f12_in(.(z0, z1), z2) → U3(f12_in(z1, z2), .(z0, z1), z2)
U3(f12_out1(z0), .(z1, z2), z3) → f12_out1(.(z1, z0))
f37_in([], z0) → f37_out1(z0)
f37_in(.(z0, z1), z2) → U4(f37_in(z1, z2), .(z0, z1), z2)
U4(f37_out1(z0), .(z1, z2), z3) → f37_out1(.(z1, z0))
f34_in(z0, z1, z2, z3) → U5(f37_in(z0, z1), z0, z1, z2, z3)
U5(f37_out1(z0), z1, z2, z3, z4) → U6(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0)
U6(f12_out1(z0), z1, z2, z3, z4, z5) → f34_out1(z5, z0)
f8_in(z0, z1) → U7(f12_in(z0, z1), f14_in(z0, z1), z0, z1)
U7(f12_out1(z0), z1, z2, z3) → f8_out1(z0)
U7(z0, f14_out1(z1, z2), z3, z4) → f8_out2(z1, z2)

Tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2

S tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2

K tuples:none
Defined Rule Symbols:

f2_in, U1, U2, f12_in, U3, f37_in, U4, f34_in, U5, U6, f8_in, U7

Defined Pair Symbols:

F2_IN, F34_IN, U5', F8_IN, F12_IN, F37_IN

Compound Symbols:

c2, c6, c9, c2

(21) CdtKnowledgeProof (EQUIVALENT transformation)

The following tuples could be moved from S to K by knowledge propagation:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F8_IN(z0, z1) → c2
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2

(22) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([], z0, z1) → U1(f8_in(z0, z1), [], z0, z1)
f2_in(.(z0, z1), z2, z3) → U2(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3)
U1(f8_out1(z0), [], z1, z2) → f2_out1(z0)
U1(f8_out2(z0, z1), [], z2, z3) → f2_out1(z1)
U2(f34_out1(z0, z1), .(z2, z3), z4, z5) → f2_out1(z1)
f12_in([], z0) → f12_out1(z0)
f12_in(.(z0, z1), z2) → U3(f12_in(z1, z2), .(z0, z1), z2)
U3(f12_out1(z0), .(z1, z2), z3) → f12_out1(.(z1, z0))
f37_in([], z0) → f37_out1(z0)
f37_in(.(z0, z1), z2) → U4(f37_in(z1, z2), .(z0, z1), z2)
U4(f37_out1(z0), .(z1, z2), z3) → f37_out1(.(z1, z0))
f34_in(z0, z1, z2, z3) → U5(f37_in(z0, z1), z0, z1, z2, z3)
U5(f37_out1(z0), z1, z2, z3, z4) → U6(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0)
U6(f12_out1(z0), z1, z2, z3, z4, z5) → f34_out1(z5, z0)
f8_in(z0, z1) → U7(f12_in(z0, z1), f14_in(z0, z1), z0, z1)
U7(f12_out1(z0), z1, z2, z3) → f8_out1(z0)
U7(z0, f14_out1(z1, z2), z3, z4) → f8_out2(z1, z2)

Tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2

S tuples:

F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))

K tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2

Defined Rule Symbols:

f2_in, U1, U2, f12_in, U3, f37_in, U4, f34_in, U5, U6, f8_in, U7

Defined Pair Symbols:

F2_IN, F34_IN, U5', F8_IN, F12_IN, F37_IN

Compound Symbols:

c2, c6, c9, c2

(23) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))

We considered the (Usable) Rules:

f37_in([], z0) → f37_out1(z0)
f37_in(.(z0, z1), z2) → U4(f37_in(z1, z2), .(z0, z1), z2)
U4(f37_out1(z0), .(z1, z2), z3) → f37_out1(.(z1, z0))

And the Tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(.(x₁, x₂)) = [2] + x₂   
POL(F12_IN(x₁, x₂)) = [1] + x₂   
POL(F2_IN(x₁, x₂, x₃)) = [2]x₁ + [3]x₂ + [3]x₃   
POL(F34_IN(x₁, x₂, x₃, x₄)) = [2] + [2]x₁ + [3]x₂ + [2]x₄   
POL(F37_IN(x₁, x₂)) = [1] + x₁ + [2]x₂   
POL(F8_IN(x₁, x₂)) = [2] + x₁ + [2]x₂   
POL(U4(x₁, x₂, x₃)) = [2] + x₃   
POL(U5'(x₁, x₂, x₃, x₄, x₅)) = [1] + [2]x₂ + x₅   
POL([]) = [2]   
POL(c2) = 0   
POL(c2(x₁)) = x₁   
POL(c6(x₁)) = x₁   
POL(c9(x₁)) = x₁   
POL(f37_in(x₁, x₂)) = [3] + x₁ + [2]x₂   
POL(f37_out1(x₁)) = [2]   

(24) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([], z0, z1) → U1(f8_in(z0, z1), [], z0, z1)
f2_in(.(z0, z1), z2, z3) → U2(f34_in(z1, z2, z0, z3), .(z0, z1), z2, z3)
U1(f8_out1(z0), [], z1, z2) → f2_out1(z0)
U1(f8_out2(z0, z1), [], z2, z3) → f2_out1(z1)
U2(f34_out1(z0, z1), .(z2, z3), z4, z5) → f2_out1(z1)
f12_in([], z0) → f12_out1(z0)
f12_in(.(z0, z1), z2) → U3(f12_in(z1, z2), .(z0, z1), z2)
U3(f12_out1(z0), .(z1, z2), z3) → f12_out1(.(z1, z0))
f37_in([], z0) → f37_out1(z0)
f37_in(.(z0, z1), z2) → U4(f37_in(z1, z2), .(z0, z1), z2)
U4(f37_out1(z0), .(z1, z2), z3) → f37_out1(.(z1, z0))
f34_in(z0, z1, z2, z3) → U5(f37_in(z0, z1), z0, z1, z2, z3)
U5(f37_out1(z0), z1, z2, z3, z4) → U6(f12_in(.(z3, z0), z4), z1, z2, z3, z4, z0)
U6(f12_out1(z0), z1, z2, z3, z4, z5) → f34_out1(z5, z0)
f8_in(z0, z1) → U7(f12_in(z0, z1), f14_in(z0, z1), z0, z1)
U7(f12_out1(z0), z1, z2, z3) → f8_out1(z0)
U7(z0, f14_out1(z1, z2), z3, z4) → f8_out2(z1, z2)

Tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2

S tuples:

F12_IN(.(z0, z1), z2) → c6(F12_IN(z1, z2))

K tuples:

F2_IN([], z0, z1) → c2(F8_IN(z0, z1))
F2_IN(.(z0, z1), z2, z3) → c2(F34_IN(z1, z2, z0, z3))
F34_IN(z0, z1, z2, z3) → c2(U5'(f37_in(z0, z1), z0, z1, z2, z3))
F34_IN(z0, z1, z2, z3) → c2(F37_IN(z0, z1))
U5'(f37_out1(z0), z1, z2, z3, z4) → c2(F12_IN(.(z3, z0), z4))
F8_IN(z0, z1) → c2(F12_IN(z0, z1))
F2_IN([], z0, z1) → c2
F2_IN(.(z0, z1), z2, z3) → c2
U5'(f37_out1(z0), z1, z2, z3, z4) → c2
F8_IN(z0, z1) → c2
F37_IN(.(z0, z1), z2) → c9(F37_IN(z1, z2))

Defined Rule Symbols:

f2_in, U1, U2, f12_in, U3, f37_in, U4, f34_in, U5, U6, f8_in, U7

Defined Pair Symbols:

F2_IN, F34_IN, U5', F8_IN, F12_IN, F37_IN

Compound Symbols:

c2, c6, c9, c2