Runtime Complexity proof of /tmp/tmp5LBNWJ/num2.pl

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

0 Prolog

↳1 PrologToCdtProblemTransformerProof (UPPER BOUND (ID), 63 ms)

↳2 CdtProblem

    ↳3 SIsEmptyProof (⇔, 0 ms)

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

↳5 PrologToCdtProblemTransformerProof (UPPER BOUND (ID), 58 ms)

↳6 CdtProblem

(0) Obligation:

Clauses:

num(0).
num(X) :- ','(no(zero(0)), ','(p(X, Y), num(Y))).
p(0, 0).
p(s(X), X).
zero(0).
no(X) :- ','(X, ','(!, failure(a))).
no(X1).
failure(b).

Query: num(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: num(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
4 [label="4: num(T1), SCOPE: 1, CLAUSE: 0 | num(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: true | num(0), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: num(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nnum(T1) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: num(0), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: ','(no(zero(0)), ','(p(0, X6), num(X6)))\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: ','(no(zero(0)), ','(p(0, X6), num(X6))), SCOPE: 2, CLAUSE: 5 | ','(no(zero(0)), ','(p(0, X6), num(X6))), SCOPE: 2, CLAUSE: 6\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: ','(','(call(zero(0)), ','(!_2, failure(a))), ','(p(0, X6), num(X6))) | ','(no(zero(0)), ','(p(0, X6), num(X6))), SCOPE: 2, CLAUSE: 6\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: ','(zero(0), ','(','(!_2, failure(a)), ','(p(0, X6), num(X6)))) | ?_3 | ','(no(zero(0)), ','(p(0, X6), num(X6))), SCOPE: 2, CLAUSE: 6\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: ','(zero(0), ','(','(!_2, failure(a)), ','(p(0, X6), num(X6)))), SCOPE: 4, CLAUSE: 4 | ?_4 | ?_3 | ','(no(zero(0)), ','(p(0, X6), num(X6))), SCOPE: 2, CLAUSE: 6\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: ','(','(!_2, failure(a)), ','(p(0, X6), num(X6))) | ?_4 | ?_3 | ','(no(zero(0)), ','(p(0, X6), num(X6))), SCOPE: 2, CLAUSE: 6\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: ','(failure(a), ','(p(0, X6), num(X6)))\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: ','(failure(a), ','(p(0, X6), num(X6))), SCOPE: 5, CLAUSE: 7\n\nX6 is free", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: ','(no(zero(0)), ','(p(T4, X14), num(X14)))\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: ','(no(zero(0)), ','(p(T4, X14), num(X14))), SCOPE: 6, CLAUSE: 5 | ','(no(zero(0)), ','(p(T4, X14), num(X14))), SCOPE: 6, CLAUSE: 6\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: ','(','(call(zero(0)), ','(!_6, failure(a))), ','(p(T4, X14), num(X14))) | ','(no(zero(0)), ','(p(T4, X14), num(X14))), SCOPE: 6, CLAUSE: 6\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: ','(zero(0), ','(','(!_6, failure(a)), ','(p(T4, X14), num(X14)))) | ?_7 | ','(no(zero(0)), ','(p(T4, X14), num(X14))), SCOPE: 6, CLAUSE: 6\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: ','(zero(0), ','(','(!_6, failure(a)), ','(p(T4, X14), num(X14)))), SCOPE: 8, CLAUSE: 4 | ?_8 | ?_7 | ','(no(zero(0)), ','(p(T4, X14), num(X14))), SCOPE: 6, CLAUSE: 6\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: ','(','(!_6, failure(a)), ','(p(T4, X14), num(X14))) | ?_8 | ?_7 | ','(no(zero(0)), ','(p(T4, X14), num(X14))), SCOPE: 6, CLAUSE: 6\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: ','(failure(a), ','(p(T4, X14), num(X14)))\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: ','(failure(a), ','(p(T4, X14), num(X14))), SCOPE: 9, CLAUSE: 7\n\nT4 is ground\nX14 is free\nnum(T4) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
2 -> 47 [arrowhead = none ];
47 -> 4;

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

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

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

51 [label="ONLY EVAL with clause\nnum(X13) :- ','(no(zero(0)), ','(p(X13, X14), num(X14))).\nand substitutionT1 -> T4,\nX13 -> T4", fontsize=14, style = filled, fillcolor = lightblue];
9 -> 51 [arrowhead = none ];
51 -> 31;

52 [label="ONLY EVAL with clause\nnum(X5) :- ','(no(zero(0)), ','(p(X5, X6), num(X6))).\nand substitutionX5 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
10 -> 52 [arrowhead = none ];
52 -> 13;

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

54 [label="ONLY EVAL with clause\nno(X9) :- ','(call(X9), ','(!_2, failure(a))).\nand substitutionX9 -> zero(0)", fontsize=14, style = filled, fillcolor = lightblue];
16 -> 54 [arrowhead = none ];
54 -> 18;

55 [label="CALL", fontsize=14, style = filled, fillcolor = lightcyan];
18 -> 55 [arrowhead = none ];
55 -> 19;

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

57 [label="ONLY EVAL with clause\nzero(0).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
21 -> 57 [arrowhead = none ];
57 -> 22;

58 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
22 -> 58 [arrowhead = none ];
58 -> 23;

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

60 [label="BACKTRACK\nfor clause: failure(b)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
27 -> 60 [arrowhead = none ];
60 -> 28;

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

62 [label="ONLY EVAL with clause\nno(X17) :- ','(call(X17), ','(!_6, failure(a))).\nand substitutionX17 -> zero(0)", fontsize=14, style = filled, fillcolor = lightblue];
39 -> 62 [arrowhead = none ];
62 -> 40;

63 [label="CALL", fontsize=14, style = filled, fillcolor = lightcyan];
40 -> 63 [arrowhead = none ];
63 -> 41;

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

65 [label="ONLY EVAL with clause\nzero(0).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
42 -> 65 [arrowhead = none ];
65 -> 43;

66 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
43 -> 66 [arrowhead = none ];
66 -> 44;

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

68 [label="BACKTRACK\nfor clause: failure(b)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
45 -> 68 [arrowhead = none ];
68 -> 46;

}

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

f2_in(0) → 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: num(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
3 [label="3: num(T1), SCOPE: 1, CLAUSE: 0 | num(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: true | num(0), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: num(T1), SCOPE: 1, CLAUSE: 1\n\nT1 is ground\nnum(T1) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: num(0), SCOPE: 1, CLAUSE: 1\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: ','(no(zero(0)), ','(p(0, X4), num(X4)))\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: ','(no(zero(0)), ','(p(0, X4), num(X4))), SCOPE: 2, CLAUSE: 5 | ','(no(zero(0)), ','(p(0, X4), num(X4))), SCOPE: 2, CLAUSE: 6\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: ','(','(call(zero(0)), ','(!_2, failure(a))), ','(p(0, X4), num(X4))) | ','(no(zero(0)), ','(p(0, X4), num(X4))), SCOPE: 2, CLAUSE: 6\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(zero(0), ','(','(!_2, failure(a)), ','(p(0, X4), num(X4)))) | ?_3 | ','(no(zero(0)), ','(p(0, X4), num(X4))), SCOPE: 2, CLAUSE: 6\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: ','(zero(0), ','(','(!_2, failure(a)), ','(p(0, X4), num(X4)))), SCOPE: 4, CLAUSE: 4 | ?_4 | ?_3 | ','(no(zero(0)), ','(p(0, X4), num(X4))), SCOPE: 2, CLAUSE: 6\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: ','(','(!_2, failure(a)), ','(p(0, X4), num(X4))) | ?_4 | ?_3 | ','(no(zero(0)), ','(p(0, X4), num(X4))), SCOPE: 2, CLAUSE: 6\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: ','(failure(a), ','(p(0, X4), num(X4)))\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: ','(failure(a), ','(p(0, X4), num(X4))), SCOPE: 5, CLAUSE: 7\n\nX4 is free", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: ','(no(zero(0)), ','(p(T3, X10), num(X10)))\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: ','(no(zero(0)), ','(p(T3, X10), num(X10))), SCOPE: 6, CLAUSE: 5 | ','(no(zero(0)), ','(p(T3, X10), num(X10))), SCOPE: 6, CLAUSE: 6\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: ','(','(call(zero(0)), ','(!_6, failure(a))), ','(p(T3, X10), num(X10))) | ','(no(zero(0)), ','(p(T3, X10), num(X10))), SCOPE: 6, CLAUSE: 6\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: ','(zero(0), ','(','(!_6, failure(a)), ','(p(T3, X10), num(X10)))) | ?_7 | ','(no(zero(0)), ','(p(T3, X10), num(X10))), SCOPE: 6, CLAUSE: 6\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: ','(zero(0), ','(','(!_6, failure(a)), ','(p(T3, X10), num(X10)))), SCOPE: 8, CLAUSE: 4 | ?_8 | ?_7 | ','(no(zero(0)), ','(p(T3, X10), num(X10))), SCOPE: 6, CLAUSE: 6\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: ','(','(!_6, failure(a)), ','(p(T3, X10), num(X10))) | ?_8 | ?_7 | ','(no(zero(0)), ','(p(T3, X10), num(X10))), SCOPE: 6, CLAUSE: 6\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: ','(failure(a), ','(p(T3, X10), num(X10)))\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: ','(failure(a), ','(p(T3, X10), num(X10))), SCOPE: 9, CLAUSE: 7\n\nT3 is ground\nX10 is free\nnum(T3) !=? num(0)", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 39 [arrowhead = none ];
39 -> 3;

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

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

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

43 [label="ONLY EVAL with clause\nnum(X9) :- ','(no(zero(0)), ','(p(X9, X10), num(X10))).\nand substitutionT1 -> T3,\nX9 -> T3", fontsize=14, style = filled, fillcolor = lightblue];
7 -> 43 [arrowhead = none ];
43 -> 29;

44 [label="ONLY EVAL with clause\nnum(X3) :- ','(no(zero(0)), ','(p(X3, X4), num(X4))).\nand substitutionX3 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
8 -> 44 [arrowhead = none ];
44 -> 11;

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

46 [label="ONLY EVAL with clause\nno(X7) :- ','(call(X7), ','(!_2, failure(a))).\nand substitutionX7 -> zero(0)", fontsize=14, style = filled, fillcolor = lightblue];
12 -> 46 [arrowhead = none ];
46 -> 14;

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

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

49 [label="ONLY EVAL with clause\nzero(0).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 49 [arrowhead = none ];
49 -> 20;

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

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

52 [label="BACKTRACK\nfor clause: failure(b)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
25 -> 52 [arrowhead = none ];
52 -> 26;

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

54 [label="ONLY EVAL with clause\nno(X13) :- ','(call(X13), ','(!_6, failure(a))).\nand substitutionX13 -> zero(0)", fontsize=14, style = filled, fillcolor = lightblue];
30 -> 54 [arrowhead = none ];
54 -> 32;

55 [label="CALL", fontsize=14, style = filled, fillcolor = lightcyan];
32 -> 55 [arrowhead = none ];
55 -> 33;

56 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
33 -> 56 [arrowhead = none ];
56 -> 34;

57 [label="ONLY EVAL with clause\nzero(0).\nand substitution", fontsize=14, style = filled, fillcolor = lightblue];
34 -> 57 [arrowhead = none ];
57 -> 35;

58 [label="CUT", fontsize=14, style = filled, fillcolor = lightgreen];
35 -> 58 [arrowhead = none ];
58 -> 36;

59 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
36 -> 59 [arrowhead = none ];
59 -> 37;

60 [label="BACKTRACK\nfor clause: failure(b)because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
37 -> 60 [arrowhead = none ];
60 -> 38;

}

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

f1_in(0) → f1_out1

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

f1_in

Defined Pair Symbols:none

Compound Symbols:none