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

(0) Obligation:

Clauses:

p :- q(','(r, !)).
q(X) :- X.
r.
r :- r.

Query: p()

(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: p\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: p, SCOPE: 1, CLAUSE: 0\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: q(','(r, !))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: q(','(r, !)), SCOPE: 2, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: call(','(r, !))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(r, !_3)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: ','(r, !_3), SCOPE: 4, CLAUSE: 2 | ','(r, !_3), SCOPE: 4, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: !_3 | ','(r, !_3), SCOPE: 4, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 21 [arrowhead = none ];
21 -> 3;

22 [label="ONLY EVAL with clause\np :- q(','(r, !)).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
3 -> 22 [arrowhead = none ];
22 -> 6;

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

24 [label="ONLY EVAL with clause\nq(X3) :- call(X3).\nand substitutionX3 -> ','(r, !)", fontsize=14, style = filled, fillcolor = lightblue];
8 -> 24 [arrowhead = none ];
24 -> 14;

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

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

27 [label="ONLY EVAL with clause\nr.\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 27 [arrowhead = none ];
27 -> 18;

28 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
18 -> 28 [arrowhead = none ];
28 -> 19;

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

}

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in → f2_out1

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

f2_in

Defined Pair Symbols:none

Compound Symbols:none

(3) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(4) BOUNDS(O(1), O(1))

(5) 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\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: p, SCOPE: 1, CLAUSE: 0\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: q(','(r, !))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: q(','(r, !)), SCOPE: 2, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: call(','(r, !))\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: ','(r, !_3)\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: ','(r, !_3), SCOPE: 4, CLAUSE: 2 | ','(r, !_3), SCOPE: 4, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: !_3 | ','(r, !_3), SCOPE: 4, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: true\n\n", 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];
1 -> 17 [arrowhead = none ];
17 -> 4;

18 [label="ONLY EVAL with clause\np :- q(','(r, !)).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 18 [arrowhead = none ];
18 -> 5;

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

20 [label="ONLY EVAL with clause\nq(X3) :- call(X3).\nand substitutionX3 -> ','(r, !)", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 20 [arrowhead = none ];
20 -> 9;

21 [label="CALL", fontsize=14, style = filled, fillcolor = lightcyan];
9 -> 21 [arrowhead = none ];
21 -> 10;

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

23 [label="ONLY EVAL with clause\nr.\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
11 -> 23 [arrowhead = none ];
23 -> 12;

24 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
12 -> 24 [arrowhead = none ];
24 -> 13;

25 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
13 -> 25 [arrowhead = none ];
25 -> 16;

}

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in → f1_out1

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

f1_in

Defined Pair Symbols:none

Compound Symbols:none