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

(0) Obligation:

Clauses:

gtsolve(X, Y) :- ','(generate(X, Y), test(Y)).

Query: gtsolve(g,a)

(1) NoRecursionProof (EQUIVALENT transformation)

The program does not contain any calls to recursive predicates [PROLOG].

(2) BOUNDS(O(1), O(1))