在prolog中求一个数的所有素因式的问题

% 定义一个谓词，用于判断一个数是否为素数
is_prime(2).
is_prime(3).
is_prime(N) :-
    integer(N),
    N > 3,
    N mod 2 =\= 0,
    \+ has_factor(N, 3).

% 定义一个谓词，用于判断一个数是否有因子
has_factor(N, Factor) :-
    N mod Factor =:= 0.
has_factor(N, Factor) :-
    Factor * Factor < N,
    Next_factor is Factor + 2,
    has_factor(N, Next_factor).

% 定义一个谓词，用于求一个数的所有素因子
prime_factors(N, Factors) :-
    prime_factors(N, 2, Factors).

prime_factors(1, _, []).
prime_factors(N, Factor, [Factor|Factors]) :-
    N mod Factor =:= 0,
    Next_N is N // Factor,
    prime_factors(Next_N, Factor, Factors).
prime_factors(N, Factor, Factors) :-
    N mod Factor =\= 0,
    Next_factor is Factor + 1,
    prime_factors(N, Next_factor, Factors).

?- prime_factors(60, Factors).
Factors = [2, 2, 3, 5] ;
false.

?- prime_factors(100, Factors).
Factors = [2, 2, 5, 5] ;
false.

?- prime_factors(17, Factors).
Factors = [17] ;
false.