(0) Obligation:
Clauses:
fold(X, [], X).
fold(X, Y, Z) :- ','(no(empty(Y)), ','(head(Y, H), ','(tail(Y, T), ','(myop(X, H, V), fold(V, T, Z))))).
myop(a, b, c).
head([], X1).
head(.(H, X2), H).
tail([], []).
tail(.(X3, T), T).
empty([]).
no(X) :- ','(X, ','(!, failure(a))).
no(X4).
failure(b).
Query: fold(g,g,a)
(1) PrologToCdtProblemTransformerProof (UPPER BOUND (ID) transformation)
Built complexity over-approximating cdt problems from derivation graph.
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
f1_in(z0, []) → f1_out1(z0)
f1_in(a, .(b, [])) → f1_out1(c)
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))