bash-2.05a$ cat p40.data
4659775785220018543264560743076778192897
bash-2.05a$ xrunecpp -fp40.data
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                          %
%                           ECPP                           %
%                                                          %
%                  by Fran\c{c}ois MORAIN                  %
%                  morain@inria.inria.fr                   %
%                      Version V3.4.1                      %
%                                                          %
%           "3 is prime, 5 is prime, 7 is prime            %
%              so every odd number is prime"               %
%                                                          %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Working on 4659775785220018543264560743076778192897
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=7000
% N_0=4659775785220018543264560743076778192897
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% Cofactor after sieve is a probable prime
% D[[0]]=3
% A[[0]]=26421347057220475385
% B[[0]]=-77332648475190134489
% m[[0]]=4659775785220018543238139396019557717513
% Factor= 4099^1
% Factor= 7^1
% Factor= 3^1
% End of depth 0 at 0.040525 s

% Pmax=7000
% N_1=54133711883502579528550975220664247
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[1]]=1
% Factor= 967^1
% Factor= 139^1
% Factor= 2^3
% End of depth 1 at 0.050350 s

% Pmax=5000
% N_2=50342704838355087983073600787
% next D is 0
% Cofactor after sieve is a probable prime
% D[[2]]=-1
% Factor= 523^1
% Factor= 3^1
% Factor= 2^1
% End of depth 2 at 0.058413 s

% Pmax=5000
% N_3=16042926972069817712897897
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[3]]=1
% Factor= 3^1
% Factor= 2^1
% End of depth 3 at 0.066241 s

% Pmax=5000
% N_4=2673821162011636285482983
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 7
% Cofactor after sieve is a probable prime
% D[[4]]=7
% A[[4]]=2022201698488
% B[[4]]=971448472178
% m[[4]]=2673821162009614083784496
% Factor= 2^4
% End of depth 4 at 0.079836 s

% Pmax=5000
% N_5=167113822625600880236531
% next D is 0
% Cofactor after sieve is a probable prime
% D[[5]]=-1
% Factor= 5^1
% Factor= 2^1
% End of depth 5 at 0.086743 s

% Pmax=5000
% N_6=16711382262560088023653
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% Cofactor after sieve is a probable prime
% D[[6]]=3
% A[[6]]=64467592105
% B[[6]]=-144556169727
% m[[6]]=16711382262495620431549
% Factor= 877^1
% End of depth 6 at 0.100373 s

% Pmax=5000
% N_7=19055167916186568337
% next D is 0
% Cofactor after sieve is a probable prime
% D[[7]]=-1
% Factor= 3^1
% Factor= 2^4
% End of depth 7 at 0.106917 s

% Pmax=5000
% N_8=396982664920553507
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[8]]=1
% Factor= 509^1
% Factor= 103^1
% Factor= 3^3
% Factor= 2^2
% End of depth 8 at 0.113629 s

% Pmax=5000
% N_9=70112068513
% next D is 0
% Cofactor after sieve is a probable prime
% D[[9]]=-1
% Factor= 3^1
% Factor= 2^5
% End of depth 9 at 0.120509 s

% Pmax=5000
% N_10=730334047
% next D is 0
% Factorization completed using sieve only
% D[[10]]=-1
% Factor= 701^1
% Factor= 37^1
% Factor= 19^2
% Factor= 13^1
% Factor= 3^1
% Factor= 2^1
% Cofactor is 1
% End of depth 10 at 0.117522 s

% Pmax=5000
% N_11=701
% next D is 0
% Factorization completed using sieve only
% D[[11]]=-1
% Factor= 7^1
% Factor= 5^2
% Factor= 2^2
% Cofactor is 1

% Time for building is 0.102079 s

% Starting phase 2: proving
% Starting proving job for step 0
% Entering the D=3 business
% E found
% Suggested twist(3)=1
% N_0 is prime
% Time for proof[0] is 0.052081 s

% Starting proving job for step 1
% N_1 is prime
% Time for proof[1] is 0.016076 s

% Starting proving job for step 2
% N_2 is prime
% Time for proof[2] is 0.000934 s

% Starting proving job for step 3
% N_3 is prime
% Time for proof[3] is 0.009720 s

% Starting proving job for step 4
% File /home/his/ECPP/Ecpp/Data/Weber/h1g1.cwdx does not exist
% tpber=0.000094s
% j has been computed
% E found
% Suggested twist(7)=-1
% N_4 is prime
% Time for proof[4] is 0.016344 s

% Starting proving job for step 5
% N_5 is prime
% Time for proof[5] is 0.000741 s

% Starting proving job for step 6
% Entering the D=3 business
% E found
% Suggested twist(3)=1
% N_6 is prime
% Time for proof[6] is 0.013139 s

% Starting proving job for step 7
% N_7 is prime
% Time for proof[7] is 0.000679 s

% Starting proving job for step 8
% N_8 is prime
% Time for proof[8] is 0.005517 s

% Starting proving job for step 9
% N_9 is prime
% Time for proof[9] is 0.001163 s

% Starting proving job for step 10
% Using complete factorization theorem
% b=1
% Nonresidue is 5
% b=1
% Nonresidue is 6
% b=1
% Nonresidue is 7
% b=1
% Nonresidue is 10
% b=1
% Nonresidue is 11
% N_10 is prime
% Time for proof[10] is 0.002892 s

% Starting proving job for step 11
% Using complete factorization theorem
% N_11 is prime
% Time for proof[11] is 0.000996 s
% Time for building is 0.102079 s
% Time for proving  is 0.129180 s
% Total time is        0.231426 s
This number is prime
% Time for this number is 0.240858s

% ==> Total time for the computations is 0.241643s
bash-2.05a$