Runtime Complexity proof of /tmp/tmpXk2126/map.pl

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

0 Prolog

↳1 LPReorderTransformerProof (⇔, 0 ms)

↳2 Prolog

↳3 PrologToCdtProblemTransformerProof (UPPER BOUND (ID), 73 ms)

↳4 CdtProblem

    ↳5 CdtGraphRemoveTrailingTuplepartsProof (BOTH BOUNDS(ID, ID), 0 ms)

    ↳6 CdtProblem

    ↳7 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))), 143 ms)

    ↳8 CdtProblem

    ↳9 SIsEmptyProof (⇔, 0 ms)

    ↳10 BOUNDS(O(1), O(1))

↳11 PrologToCdtProblemTransformerProof (UPPER BOUND (ID), 47 ms)

↳12 CdtProblem

    ↳13 CdtGraphRemoveTrailingTuplepartsProof (BOTH BOUNDS(ID, ID), 0 ms)

    ↳14 CdtProblem

    ↳15 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))), 88 ms)

    ↳16 CdtProblem

(0) Obligation:

Clauses:

p(val_i, val_j).
map(.(X, Xs), .(Y, Ys)) :- ','(p(X, Y), map(Xs, Ys)).
map([], []).

Query: map(g,a)

(1) LPReorderTransformerProof (EQUIVALENT transformation)

Reordered facts before rules in definite LP [PROLOG].

(2) Obligation:

Clauses:

p(val_i, val_j).
map([], []).
map(.(X, Xs), .(Y, Ys)) :- ','(p(X, Y), map(Xs, Ys)).

Query: map(g,a)

(3) 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: map(T1, T2)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: map(T1, T2), SCOPE: 1, CLAUSE: 1 | map(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: true | map([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: map(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nmap(T1, T2) !=? map([], [])", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: map([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: ','(p(T11, T15), map(T12, T16))\n\nT11 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(p(T11, T15), map(T12, T16)), SCOPE: 2, CLAUSE: 0\n\nT11 is ground\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: map(T12, T17)\n\nT12 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 18 [arrowhead = none ];
18 -> 4;

19 [label="EVAL with clause\nmap([], []).\nand substitutionT1 -> [],\nT2 -> []", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 19 [arrowhead = none ];
19 -> 6;

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

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

22 [label="EVAL with clause\nmap(.(X13, X14), .(X15, X16)) :- ','(p(X13, X15), map(X14, X16)).\nand substitutionX13 -> T11,\nX14 -> T12,\nT1 -> .(T11, T12),\nX15 -> T15,\nX16 -> T16,\nT2 -> .(T15, T16),\nT13 -> T15,\nT14 -> T16", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 22 [arrowhead = none ];
22 -> 13;

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

24 [label="BACKTRACK\nfor clause: map(.(X, Xs), .(Y, Ys)) :- ','(p(X, Y), map(Xs, Ys))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 24 [arrowhead = none ];
24 -> 11;

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

26 [label="EVAL with clause\np(val_i, val_j).\nand substitutionT11 -> val_i,\nT15 -> val_j,\nT16 -> T17", fontsize=14, style = filled, fillcolor = lightblue];
15 -> 26 [arrowhead = none ];
26 -> 16;

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

28 [label="INSTANCE with matching:\nT1 -> T12\nT2 -> T17", fontsize=14, style = filled, fillcolor = lightgrey];
16 -> 28 [arrowhead = none , style=dashed];
28 -> 1[style=dashed];

}

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

F1_IN(.(val_i, z0)) → c1(U1'(f1_in(z0), .(val_i, z0)), F1_IN(z0))

S tuples:

F1_IN(.(val_i, z0)) → c1(U1'(f1_in(z0), .(val_i, z0)), F1_IN(z0))

K tuples:none
Defined Rule Symbols:

f1_in, U1

Defined Pair Symbols:

F1_IN

Compound Symbols:

c1

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

Removed 1 trailing tuple parts

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

F1_IN(.(val_i, z0)) → c1(F1_IN(z0))

S tuples:

F1_IN(.(val_i, z0)) → c1(F1_IN(z0))

K tuples:none
Defined Rule Symbols:

f1_in, U1

Defined Pair Symbols:

F1_IN

Compound Symbols:

c1

(7) 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(.(val_i, z0)) → c1(F1_IN(z0))

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

F1_IN(.(val_i, z0)) → c1(F1_IN(z0))

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

POL(.(x₁, x₂)) = [1] + x₂
POL(F1_IN(x₁)) = x₁
POL(c1(x₁)) = x₁
POL(val_i) = 0

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

F1_IN(.(val_i, z0)) → c1(F1_IN(z0))

S tuples:none
K tuples:

F1_IN(.(val_i, z0)) → c1(F1_IN(z0))

Defined Rule Symbols:

f1_in, U1

Defined Pair Symbols:

F1_IN

Compound Symbols:

c1

(9) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(10) BOUNDS(O(1), O(1))

(11) 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: map(T1, T2)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: map(T1, T2), SCOPE: 1, CLAUSE: 1 | map(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: true | map([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: map(T1, T2), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nmap(T1, T2) !=? map([], [])", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: map([], T2), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: ','(p(T7, T11), map(T8, T12))\n\nT7 is ground\nT8 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: ','(p(T7, T11), map(T8, T12)), SCOPE: 2, CLAUSE: 0\n\nT7 is ground\nT8 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: map(T8, T13)\n\nT8 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 23 [arrowhead = none ];
23 -> 3;

24 [label="EVAL with clause\nmap([], []).\nand substitutionT1 -> [],\nT2 -> []", fontsize=14, style = filled, fillcolor = lightblue];
3 -> 24 [arrowhead = none ];
24 -> 5;

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

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

27 [label="EVAL with clause\nmap(.(X9, X10), .(X11, X12)) :- ','(p(X9, X11), map(X10, X12)).\nand substitutionX9 -> T7,\nX10 -> T8,\nT1 -> .(T7, T8),\nX11 -> T11,\nX12 -> T12,\nT2 -> .(T11, T12),\nT9 -> T11,\nT10 -> T12", fontsize=14, style = filled, fillcolor = lightblue];
8 -> 27 [arrowhead = none ];
27 -> 18;

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

29 [label="BACKTRACK\nfor clause: map(.(X, Xs), .(Y, Ys)) :- ','(p(X, Y), map(Xs, Ys))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
10 -> 29 [arrowhead = none ];
29 -> 12;

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

31 [label="EVAL with clause\np(val_i, val_j).\nand substitutionT7 -> val_i,\nT11 -> val_j,\nT12 -> T13", fontsize=14, style = filled, fillcolor = lightblue];
20 -> 31 [arrowhead = none ];
31 -> 21;

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

33 [label="INSTANCE with matching:\nT1 -> T8\nT2 -> T13", fontsize=14, style = filled, fillcolor = lightgrey];
21 -> 33 [arrowhead = none , style=dashed];
33 -> 2[style=dashed];

}

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

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

S tuples:

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

K tuples:none
Defined Rule Symbols:

f2_in, U1

Defined Pair Symbols:

F2_IN

Compound Symbols:

c1

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

Removed 1 trailing tuple parts

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

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

S tuples:

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

K tuples:none
Defined Rule Symbols:

f2_in, U1

Defined Pair Symbols:

F2_IN

Compound Symbols:

c1

(15) 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(.(val_i, z0)) → c1(F2_IN(z0))

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

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

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₁
POL(val_i) = 0

(16) Obligation:

Complexity Dependency Tuples Problem
Rules:

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

Tuples:

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

S tuples:none
K tuples:

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

Defined Rule Symbols:

f2_in, U1

Defined Pair Symbols:

F2_IN

Compound Symbols:

c1