🚀 go-pugleaf

Both of the required predicates can be defined using one predicate
	succeeds(X)
that succeeds if X does, without binding variables and leaving choice
points (if X has some side effects, I doubt you can define it without
assert). The xor(A, B) can be defined as

	xor(A, _) :- succeeds(A), !, A.
	xor(_, B) :- B.

and the other one

	P :- A, succeeds(B), !, B, C, D.

Not to forget the definition of succeeds/1:

	succeeds(X) :- not(not(X)).

or alternatively

	succeeds(X) :- replace_vars(X, Y), Y, !.

where replace_vars(X, Y) makes a copy of X with fresh variables.

This has, of course the disadvantage that the predicate is called twice,
first in succeeds(X) and then the proper call, the problem is
similar to writing setof/3 in pure Prolog - you can make it but
it is not very efficient.

--Micha