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

(0) Obligation:

Clauses:

list([]).
list(.(X1, Ts)) :- list(Ts).

Query: list(g)

(1) 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: list(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: list(T1), SCOPE: 1, CLAUSE: 0 | list(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: true | list([]), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: list(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nlist(T1) !=? list([])", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: list([]), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: list(T7)\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 17 [arrowhead = none ];
17 -> 4;

18 [label="EVAL with clause\nlist([]).\nand substitutionT1 -> []", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 18 [arrowhead = none ];
18 -> 5;

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

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

21 [label="EVAL with clause\nlist(.(X8, X9)) :- list(X9).\nand substitutionX8 -> T6,\nX9 -> T7,\nT1 -> .(T6, T7)", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 21 [arrowhead = none ];
21 -> 14;

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

23 [label="BACKTRACK\nfor clause: list(.(X1, Ts)) :- list(Ts)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 23 [arrowhead = none ];
23 -> 12;

24 [label="INSTANCE with matching:\nT1 -> T7", fontsize=14, style = filled, fillcolor = lightgrey];
14 -> 24 [arrowhead = none , style=dashed];
24 -> 2[style=dashed];

}

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([]) → f2_out1
f2_in(.(z0, z1)) → U1(f2_in(z1), .(z0, z1))
U1(f2_out1, .(z0, z1)) → f2_out1

Tuples:

F2_IN(.(z0, z1)) → c1(U1'(f2_in(z1), .(z0, z1)), F2_IN(z1))

S tuples:

F2_IN(.(z0, z1)) → c1(U1'(f2_in(z1), .(z0, z1)), F2_IN(z1))

K tuples:none
Defined Rule Symbols:

f2_in, U1

Defined Pair Symbols:

F2_IN

Compound Symbols:

c1

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

Removed 1 trailing tuple parts

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([]) → f2_out1
f2_in(.(z0, z1)) → U1(f2_in(z1), .(z0, z1))
U1(f2_out1, .(z0, z1)) → f2_out1

Tuples:

F2_IN(.(z0, z1)) → c1(F2_IN(z1))

S tuples:

F2_IN(.(z0, z1)) → c1(F2_IN(z1))

K tuples:none
Defined Rule Symbols:

f2_in, U1

Defined Pair Symbols:

F2_IN

Compound Symbols:

c1

(5) 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.

F2_IN(.(z0, z1)) → c1(F2_IN(z1))

We considered the (Usable) Rules:none
And the Tuples:

F2_IN(.(z0, z1)) → c1(F2_IN(z1))

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

POL(.(x₁, x₂)) = [1] + x₂   
POL(F2_IN(x₁)) = x₁   
POL(c1(x₁)) = x₁   

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in([]) → f2_out1
f2_in(.(z0, z1)) → U1(f2_in(z1), .(z0, z1))
U1(f2_out1, .(z0, z1)) → f2_out1

Tuples:

F2_IN(.(z0, z1)) → c1(F2_IN(z1))

S tuples:none
K tuples:

F2_IN(.(z0, z1)) → c1(F2_IN(z1))

Defined Rule Symbols:

f2_in, U1

Defined Pair Symbols:

F2_IN

Compound Symbols:

c1

(7) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(8) BOUNDS(O(1), O(1))

(9) 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: list(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: list(T1), SCOPE: 1, CLAUSE: 0 | list(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: true | list([]), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: list(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nlist(T1) !=? list([])", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: list([]), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: list(T5)\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: list(T5), SCOPE: 2, CLAUSE: 0 | list(T5), SCOPE: 2, CLAUSE: 1\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: true | list([]), SCOPE: 2, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: list(T5), SCOPE: 2, CLAUSE: 1\n\nT5 is ground\nlist(T5) !=? list([])", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: list([]), SCOPE: 2, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: list(T11)\n\nT11 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 24 [arrowhead = none ];
24 -> 3;

25 [label="EVAL with clause\nlist([]).\nand substitutionT1 -> []", fontsize=14, style = filled, fillcolor = lightblue];
3 -> 25 [arrowhead = none ];
25 -> 6;

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

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

28 [label="EVAL with clause\nlist(.(X6, X7)) :- list(X7).\nand substitutionX6 -> T4,\nX7 -> T5,\nT1 -> .(T4, T5)", fontsize=14, style = filled, fillcolor = lightblue];
8 -> 28 [arrowhead = none ];
28 -> 13;

29 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
8 -> 29 [arrowhead = none ];
29 -> 15;

30 [label="BACKTRACK\nfor clause: list(.(X1, Ts)) :- list(Ts)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
10 -> 30 [arrowhead = none ];
30 -> 11;

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

32 [label="EVAL with clause\nlist([]).\nand substitutionT5 -> []", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 32 [arrowhead = none ];
32 -> 18;

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

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

35 [label="EVAL with clause\nlist(.(X14, X15)) :- list(X15).\nand substitutionX14 -> T10,\nX15 -> T11,\nT5 -> .(T10, T11)", fontsize=14, style = filled, fillcolor = lightblue];
19 -> 35 [arrowhead = none ];
35 -> 22;

36 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
19 -> 36 [arrowhead = none ];
36 -> 23;

37 [label="BACKTRACK\nfor clause: list(.(X1, Ts)) :- list(Ts)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
20 -> 37 [arrowhead = none ];
37 -> 21;

38 [label="INSTANCE with matching:\nT1 -> T11", fontsize=14, style = filled, fillcolor = lightgrey];
22 -> 38 [arrowhead = none , style=dashed];
38 -> 1[style=dashed];

}

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in([]) → f1_out1
f1_in(.(z0, [])) → f1_out1
f1_in(.(z0, .(z1, z2))) → U1(f1_in(z2), .(z0, .(z1, z2)))
U1(f1_out1, .(z0, .(z1, z2))) → f1_out1

Tuples:

F1_IN(.(z0, .(z1, z2))) → c2(U1'(f1_in(z2), .(z0, .(z1, z2))), F1_IN(z2))

S tuples:

F1_IN(.(z0, .(z1, z2))) → c2(U1'(f1_in(z2), .(z0, .(z1, z2))), F1_IN(z2))

K tuples:none
Defined Rule Symbols:

f1_in, U1

Defined Pair Symbols:

F1_IN

Compound Symbols:

c2

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

Removed 1 trailing tuple parts

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in([]) → f1_out1
f1_in(.(z0, [])) → f1_out1
f1_in(.(z0, .(z1, z2))) → U1(f1_in(z2), .(z0, .(z1, z2)))
U1(f1_out1, .(z0, .(z1, z2))) → f1_out1

Tuples:

F1_IN(.(z0, .(z1, z2))) → c2(F1_IN(z2))

S tuples:

F1_IN(.(z0, .(z1, z2))) → c2(F1_IN(z2))

K tuples:none
Defined Rule Symbols:

f1_in, U1

Defined Pair Symbols:

F1_IN

Compound Symbols:

c2

(13) 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.

F1_IN(.(z0, .(z1, z2))) → c2(F1_IN(z2))

We considered the (Usable) Rules:none
And the Tuples:

F1_IN(.(z0, .(z1, z2))) → c2(F1_IN(z2))

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

POL(.(x₁, x₂)) = [1] + x₂   
POL(F1_IN(x₁)) = [2]x₁   
POL(c2(x₁)) = x₁   

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in([]) → f1_out1
f1_in(.(z0, [])) → f1_out1
f1_in(.(z0, .(z1, z2))) → U1(f1_in(z2), .(z0, .(z1, z2)))
U1(f1_out1, .(z0, .(z1, z2))) → f1_out1

Tuples:

F1_IN(.(z0, .(z1, z2))) → c2(F1_IN(z2))

S tuples:none
K tuples:

F1_IN(.(z0, .(z1, z2))) → c2(F1_IN(z2))

Defined Rule Symbols:

f1_in, U1

Defined Pair Symbols:

F1_IN

Compound Symbols:

c2