(0) Obligation:
Clauses:
p(X) :- ','(no(letter(X)), q(X)).
q(x) :- p(X1).
letter(x).
no(X) :- ','(X, ','(!, failure(a))).
no(X2).
failure(b).
Query: p(a)
(1) PrologToCdtProblemTransformerProof (UPPER BOUND (ID) transformation)
Built complexity over-approximating cdt problems from derivation graph.
(2) 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
(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.
(6) 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