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

(0) Obligation:

Clauses:

p(X) :- ','(q(f(Y)), p(Y)).
q(g(Y)).

Query: p(a)

(1) LPReorderTransformerProof (EQUIVALENT transformation)

Reordered facts before rules in definite LP [PROLOG].

(2) Obligation:

Clauses:

q(g(Y)).
p(X) :- ','(q(f(Y)), p(Y)).

Query: p(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)\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: p(T1), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: ','(q(f(X8)), p(X8))\n\nX8 is free", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: ','(q(f(X8)), p(X8)), SCOPE: 2, CLAUSE: 0\n\nX8 is free", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 11 [arrowhead = none ];
11 -> 3;

12 [label="ONLY EVAL with clause\np(X7) :- ','(q(f(X8)), p(X8)).\nand substitutionT1 -> T4,\nX7 -> T4", fontsize=14, style = filled, fillcolor = lightblue];
3 -> 12 [arrowhead = none ];
12 -> 6;

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

14 [label="BACKTRACK\nfor clause: q(g(Y))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 14 [arrowhead = none ];
14 -> 10;

}

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:none

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)\n\n", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: p(T1), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: ','(q(f(X3)), p(X3))\n\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: ','(q(f(X3)), p(X3)), SCOPE: 2, CLAUSE: 0\n\nX3 is free", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 9 [arrowhead = none ];
9 -> 4;

10 [label="ONLY EVAL with clause\np(X2) :- ','(q(f(X3)), p(X3)).\nand substitutionT1 -> T3,\nX2 -> T3", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 10 [arrowhead = none ];
10 -> 5;

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

12 [label="BACKTRACK\nfor clause: q(g(Y))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
7 -> 12 [arrowhead = none ];
12 -> 8;

}

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:none

Compound Symbols:none