(0) Obligation:
Clauses:
even(0) :- !.
even(N) :- ','(p(N, P), odd(P)).
odd(s(0)) :- !.
odd(s(N)) :- even(P).
p(0, 0).
p(s(X), X).
Query: even(g)
(1) PrologToCdtProblemTransformerProof (UPPER BOUND (ID) transformation)
Built complexity over-approximating cdt problems from derivation graph.
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
f1_in(0) → f1_out1
f1_in(s(s(0))) → f1_out1
f1_in(s(s(z0))) → f1_out1
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
f1_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.
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
f2_in(0) → f2_out1
f2_in(s(s(0))) → f2_out1
f2_in(s(s(z0))) → f2_out1
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
f2_in
Defined Pair Symbols:none
Compound Symbols:none