y^2=x^3+0x+(-26)
k(3 1)=(275201 nil)
time=442.542268[s]
------------------
k(3 1)=(5077996099475296520607229707693782436499422628117364 14173051534824191123577256403525737576974913914902603)
time=401.59626[s]
y^2=x^3+10x+(-56)
k(3 1)=(83171590411112553847135641943210672224572616976307944 71740982425888532741377787477292740935124321927279697)
time=401.170629[s]
y^2=x^3+11x+(-59)
k(3 1)=(5408213876131915536748613718791083702726614031020690 51283912864549370458964439127943740571065494392338427)
time=401.377398[s]
y^2=x^3+12x+(-62)
k(3 1)=(64643168381924820495415437619995069532180469425025212 75293083842074844198369081890223286196576932805578575)
time=401.49759[s]
y^2=x^3+13x+(-65)
k(3 1)=(32331978916517572001010515322876908018141937175433486 27768103188815785423011044146591767644303486110209460)
time=401.47751[s]
y^2=x^3+14x+(-68)
k(3 1)=(138424618868737 nil)
time=401.445226[s]
-----------------------
bash-2.05$ ./ecm 9000000 <xx3
GMP-ECM 4c, by P. Zimmermann (Inria), 16 Dec 1999, with contributions from
T. Granlund, P. Leyland, C. Curry, A. Stuebinger, G. Woltman, JC. Meyrignac,
A. Yamasaki, and the invaluable help from P.L. Montgomery.
Input number is 83350359523839668906738182616297831422162449953458433 (53 digits)
Using B1=9000000, B2=3242407350, polynomial x^60, sigma=1481376117
Step 1 took 1896254ms for 117502079 muls, 3 gcdexts
********** Factor found in step 1: 138424618868737
Found probable prime factor of 15 digits: 138424618868737
Composite cofactor 602135373064510760049879989286625585409 has 39 digits
-----------------
bash-2.05$ ./ecm 90000000 <xx4
GMP-ECM 4c, by P. Zimmermann (Inria), 16 Dec 1999, with contributions from
T. Granlund, P. Leyland, C. Curry, A. Stuebinger, G. Woltman, JC. Meyrignac,
A. Yamasaki, and the invaluable help from P.L. Montgomery.
Input number is 602135373064510760049879989286625585409 (39 digits)
Using B1=90000000, B2=97415307990, polynomial x^1, sigma=1444589206
Step 1 took 14303030ms for 1180176662 muls, 3 gcdexts
Step 2 took 8840777ms for 545096839 muls, 350256 gcdexts
********** Factor found in step 2: 3913786281514524929
Found probable prime factor of 19 digits: 3913786281514524929
Probable prime cofactor 153849834853910661121 has 21 digits
---------------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                          %
%                           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 3913786281514524929
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=5000
% N_0=3913786281514524929
% next D is 0
% Cofactor after sieve is a probable prime
% D[[0]]=-1
% Factor= 3919^1
% Factor= 787^1
% Factor= 31^1
% Factor= 2^8
% End of depth 0 at 0.083315 s

% Pmax=5000
% N_1=159898891
% next D is 0
% Cofactor after sieve is a probable prime
% D[[1]]=-1
% Factor= 293^1
% Factor= 5^1
% Factor= 3^1
% Factor= 2^1
% End of depth 1 at 0.093964 s

% Pmax=5000
% N_2=18191
% next D is 0
% Factorization completed using sieve only
% D[[2]]=-1
% Factor= 107^1
% Factor= 17^1
% Factor= 5^1
% Factor= 2^1
% Cofactor is 1
% End of depth 2 at 0.096044 s

% Pmax=5000
% N_3=107
% next D is 0
% Factorization completed using sieve only
% D[[3]]=-1
% Factor= 53^1
% Factor= 2^1
% Cofactor is 1

% Time for building is 0.067975 s

% Starting phase 2: proving
% Starting proving job for step 0
% Using complete factorization theorem
% b=1
% Nonresidue is 6
% N_0 is prime
% Time for proof[0] is 0.011094 s

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

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

% Starting proving job for step 3
% Using complete factorization theorem
% N_3 is prime
% Time for proof[3] is 0.000574 s
% Time for building is 0.067975 s
% Time for proving  is 0.006145 s
% Total time is        0.074211 s
This number is prime
% Time for this number is 0.099395s

Working on 153849834853910661121
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=5000
% N_0=153849834853910661121
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[0]]=1
% Factor= 2^1
% End of depth 0 at 0.187420 s

% Pmax=5000
% N_1=76924917426955330561
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[1]]=3
% A[[1]]=15510447106
% B[[1]]=4730246656
% m[[1]]=76924917411444883456
% Factor= 769^1
% Factor= 19^1
% Factor= 13^1
% Factor= 2^16
% End of depth 1 at 0.273437 s

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

% Pmax=5000
% N_3=257485379
% next D is 0
% Cofactor after sieve is a probable prime
% D[[3]]=-1
% Factor= 19^1
% Factor= 2^1
% End of depth 3 at 0.320908 s

% Pmax=5000
% N_4=6775931
% next D is 0
% Cofactor after sieve is a probable prime
% D[[4]]=-1
% Factor= 7^1
% Factor= 5^1
% Factor= 2^1
% End of depth 4 at 0.342903 s

% Pmax=5000
% N_5=96799
% next D is 0
% Factorization completed using sieve only
% D[[5]]=-1
% Factor= 73^1
% Factor= 17^1
% Factor= 13^1
% Factor= 3^1
% Factor= 2^1
% Cofactor is 1

% Time for building is 0.204954 s

% Starting phase 2: proving
% Starting proving job for step 0
% N_0 is prime
% Time for proof[0] is 0.075343 s

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

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

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

% Starting proving job for step 4
% N_4 is prime
% Time for proof[4] is 0.000576 s

% Starting proving job for step 5
% Using complete factorization theorem
% b=1
% Nonresidue is 6
% N_5 is prime
% Time for proof[5] is 0.001699 s
% Time for building is 0.204954 s
% Time for proving  is 0.363394 s
% Total time is        0.568471 s
This number is prime
% Time for this number is 0.599696s

% ==> Total time for the computations is 0.700627s
--------------------------------