Runtime Complexity proof of /tmp/tmp3BQIrT/short2.pl

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

0 Prolog

↳1 BuiltinConflictTransformerProof (BOTH BOUNDS(ID, ID), 0 ms)

↳2 Prolog

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

↳4 CdtProblem

    ↳5 SIsEmptyProof (⇔, 0 ms)

    ↳6 BOUNDS(O(1), O(1))

↳7 PrologToCdtProblemTransformerProof (UPPER BOUND (ID), 56 ms)

↳8 CdtProblem

(0) Obligation:

Clauses:

p(X, X, 1) :- !.
p(X, Y, Z) :- ','(=(Z, 1), ','(=(Y, X), p(X, Y, Z))).
=(X, X).

Query: p(a,a,a)

(1) BuiltinConflictTransformerProof (BOTH BOUNDS(ID, ID) transformation)

Renamed defined predicates conflicting with built-in predicates [PROLOG].

(2) Obligation:

Clauses:

p(X, X, 1) :- !.
p(X, Y, Z) :- ','(user_defined_=(Z, 1), ','(user_defined_=(Y, X), p(X, Y, Z))).
user_defined_=(X, X).

Query: p(a,a,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: p(T1, T2, T3)\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: p(T1, T2, T3), SCOPE: 1, CLAUSE: 0 | p(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: !_1 | p(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: p(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nX3 is free\np(T1, T2, T3) !=? p(X3, X3, 1)", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(user_defined_=(T20, 1), ','(user_defined_=(T21, T22), p(T22, T21, T20)))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: ','(user_defined_=(T20, 1), ','(user_defined_=(T21, T22), p(T22, T21, T20))), SCOPE: 2, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: ','(user_defined_=(T27, T28), p(T28, T27, 1))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: ','(user_defined_=(T27, T28), p(T28, T27, 1)), SCOPE: 3, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: p(T33, T33, 1)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: p(T33, T33, 1), SCOPE: 4, CLAUSE: 0 | p(T33, T33, 1), SCOPE: 4, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: !_4 | p(T33, T33, 1), SCOPE: 4, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 34 [arrowhead = none ];
34 -> 3;

35 [label="EVAL with clause\np(X3, X3, 1) :- !_1.\nand substitutionT1 -> T6,\nX3 -> T6,\nT2 -> T6,\nT3 -> 1", fontsize=14, style = filled, fillcolor = lightblue];
3 -> 35 [arrowhead = none ];
35 -> 5;

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

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

38 [label="ONLY EVAL with clause\np(X11, X12, X13) :- ','(user_defined_=(X13, 1), ','(user_defined_=(X12, X11), p(X11, X12, X13))).\nand substitutionT1 -> T22,\nX11 -> T22,\nT2 -> T21,\nX12 -> T21,\nT3 -> T20,\nX13 -> T20,\nT19 -> T20,\nT18 -> T21,\nT17 -> T22", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 38 [arrowhead = none ];
38 -> 15;

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

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

41 [label="EVAL with clause\nuser_defined_=(X17, X17).\nand substitutionT20 -> 1,\nX17 -> 1,\nT26 -> 1,\nT21 -> T27,\nT22 -> T28", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 41 [arrowhead = none ];
41 -> 20;

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

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

44 [label="EVAL with clause\nuser_defined_=(X21, X21).\nand substitutionT27 -> T33,\nX21 -> T33,\nT28 -> T33,\nT32 -> T33", fontsize=14, style = filled, fillcolor = lightblue];
23 -> 44 [arrowhead = none ];
44 -> 25;

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

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

47 [label="ONLY EVAL with clause\np(X25, X25, 1) :- !_4.\nand substitutionT33 -> T37,\nX25 -> T37", fontsize=14, style = filled, fillcolor = lightblue];
28 -> 47 [arrowhead = none ];
47 -> 29;

48 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
29 -> 48 [arrowhead = none ];
48 -> 31;

49 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
31 -> 49 [arrowhead = none ];
49 -> 33;

}

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in → f1_out1(1)

Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

f1_in

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(6) BOUNDS(O(1), O(1))

(7) 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: p(T1, T2, T3)\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: p(T1, T2, T3), SCOPE: 1, CLAUSE: 0 | p(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: !_1 | p(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: p(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nX2 is free\np(T1, T2, T3) !=? p(X2, X2, 1)", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: ','(user_defined_=(T12, 1), ','(user_defined_=(T13, T14), p(T14, T13, T12)))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: ','(user_defined_=(T12, 1), ','(user_defined_=(T13, T14), p(T14, T13, T12))), SCOPE: 2, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: ','(user_defined_=(T18, T19), p(T19, T18, 1))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: ','(user_defined_=(T18, T19), p(T19, T18, 1)), SCOPE: 3, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: p(T24, T24, 1)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: p(T24, T24, 1), SCOPE: 4, CLAUSE: 0 | p(T24, T24, 1), SCOPE: 4, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: !_4 | p(T24, T24, 1), SCOPE: 4, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 35 [arrowhead = none ];
35 -> 4;

36 [label="EVAL with clause\np(X2, X2, 1) :- !_1.\nand substitutionT1 -> T5,\nX2 -> T5,\nT2 -> T5,\nT3 -> 1", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 36 [arrowhead = none ];
36 -> 6;

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

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

39 [label="ONLY EVAL with clause\np(X6, X7, X8) :- ','(user_defined_=(X8, 1), ','(user_defined_=(X7, X6), p(X6, X7, X8))).\nand substitutionT1 -> T14,\nX6 -> T14,\nT2 -> T13,\nX7 -> T13,\nT3 -> T12,\nX8 -> T12,\nT11 -> T12,\nT10 -> T13,\nT9 -> T14", fontsize=14, style = filled, fillcolor = lightblue];
8 -> 39 [arrowhead = none ];
39 -> 13;

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

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

42 [label="EVAL with clause\nuser_defined_=(X11, X11).\nand substitutionT12 -> 1,\nX11 -> 1,\nT17 -> 1,\nT13 -> T18,\nT14 -> T19", fontsize=14, style = filled, fillcolor = lightblue];
14 -> 42 [arrowhead = none ];
42 -> 16;

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

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

45 [label="EVAL with clause\nuser_defined_=(X15, X15).\nand substitutionT18 -> T24,\nX15 -> T24,\nT19 -> T24,\nT23 -> T24", fontsize=14, style = filled, fillcolor = lightblue];
19 -> 45 [arrowhead = none ];
45 -> 22;

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

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

48 [label="ONLY EVAL with clause\np(X19, X19, 1) :- !_4.\nand substitutionT24 -> T28,\nX19 -> T28", fontsize=14, style = filled, fillcolor = lightblue];
27 -> 48 [arrowhead = none ];
48 -> 30;

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

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

}

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in → f2_out1(1)

Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

f2_in

Defined Pair Symbols:none

Compound Symbols:none