(0) Obligation:
Clauses:
at(X, fido) :- ','(at(X, mary), near(X)).
at(ta, mary).
at(jm, mary).
near(jm).
Query: at(a,a)
(1) LPReorderTransformerProof (EQUIVALENT transformation)
Reordered facts before rules in definite LP [PROLOG].
(2) Obligation:
Clauses:
at(ta, mary).
at(jm, mary).
near(jm).
at(X, fido) :- ','(at(X, mary), near(X)).
Query: at(a,a)
(3) PrologToCdtProblemTransformerProof (UPPER BOUND (ID) transformation)
Built complexity over-approximating cdt problems from derivation graph.
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
f2_in → f2_out1(ta, mary)
f2_in → f2_out1(jm, mary)
f2_in → f2_out1(jm, fido)
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
f2_in
Defined Pair Symbols:none
Compound Symbols:none
(5) SIsEmptyProof (EQUIVALENT transformation)
The set S is empty
(6) BOUNDS(O(1), O(1))