Left Termination of the query pattern
gtsolve(g,a)
w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

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

Query: gtsolve(g,a)

(1) PrologToTRSTransformerProof (SOUND transformation)

Transformed Prolog program to TRS.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: gtsolve(T1, T2)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
6 [label="6: gtsolve(T1, T2), SCOPE: 1, CLAUSE: 0\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: ','(generate(T8, T10), test(T10))\n\nT8 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 11 [arrowhead = none ];
11 -> 6;

12 [label="ONLY EVAL with clause\ngtsolve(X5, X6) :- ','(generate(X5, X6), test(X6)).\nand substitutionT1 -> T8,\nX5 -> T8,\nT2 -> T10,\nX6 -> T10,\nT9 -> T10", fontsize=14, style = filled, fillcolor = lightblue];
6 -> 12 [arrowhead = none ];
12 -> 9;

13 [label="UNDEFINED ERROR", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 13 [arrowhead = none ];
13 -> 10;

}

(2) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) YES