y^2=x^3+0x+(-7)
k(2 1)=(493121 nil)
time=3081.800926[s]
--------------------
cc=2253222051202668535939680344400484082225480381308261280925191
--------------------
bash-2.03$ ecm 100000000 <xx5
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 2253222051202668535939680344400484082225480381308261280925191 (61 digits)
Using B1=100000000, B2=135793107450, polynomial x^1, sigma=1585031531
Step 1 took 2850411ms for 1311593670 muls, 3 gcdexts
Step 2 took 1533122ms for 601885847 muls, 311889 gcdexts
********** Factor found in step 2: 79863595778924342083
Found probable prime factor of 20 digits: 79863595778924342083
Probable prime cofactor 28213380943176667001263153660999177245677 has 41 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 79863595778924342083
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=5000
% N_0=79863595778924342083
% next D is 0
% Cofactor after sieve is a probable prime
% D[[0]]=-1
% Factor= 67^1
% Factor= 37^1
% Factor= 3^2
% Factor= 2^1
% End of depth 0 at 0.078240 s

% Pmax=5000
% N_1=1789780731005431
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[1]]=1
% Factor= 79^1
% Factor= 37^1
% Factor= 11^1
% Factor= 2^3
% End of depth 1 at 0.106365 s

% Pmax=5000
% N_2=6958062743
% next D is 0
% Cofactor after sieve is a probable prime
% D[[2]]=-1
% Factor= 109^1
% Factor= 29^1
% Factor= 2^1
% End of depth 2 at 0.128697 s

% Pmax=5000
% N_3=1100611
% next D is 0
% Factorization completed using sieve only
% D[[3]]=-1
% Factor= 1747^1
% Factor= 7^1
% Factor= 5^1
% Factor= 3^2
% Factor= 2^1
% Cofactor is 1
% End of depth 3 at 0.150158 s

% Pmax=5000
% N_4=1747
% next D is 0
% Factorization completed using sieve only
% D[[4]]=-1
% Factor= 97^1
% Factor= 3^2
% Factor= 2^1
% Cofactor is 1

% Time for building is 0.109042 s

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

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

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

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

% Starting proving job for step 4
% Using complete factorization theorem
% N_4 is prime
% Time for proof[4] is 0.000648 s
% Time for building is 0.109042 s
% Time for proving  is 0.040655 s
% Total time is        0.149797 s
This number is prime
% Time for this number is 0.182949s

Working on 28213380943176667001263153660999177245677
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=7000
% N_0=28213380943176667001263153660999177245677
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 4
% 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
% next D is 7
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 11
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 43
% Cofactor after sieve is a probable prime
% D[[0]]=43
% A[[0]]=335345212256588488546
% B[[0]]=3038942553580116788
% m[[0]]=28213380943176667000927808448742588757132
% Factor= 173^1
% Factor= 53^1
% Factor= 47^1
% Factor= 13^1
% Factor= 2^2
% End of depth 0 at 0.499471 s

% Pmax=7000
% N_1=1259018056072410566921656444692337
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[1]]=1
% Factor= 271^1
% Factor= 61^1
% Factor= 2^1
% End of depth 1 at 0.547057 s

% Pmax=5000
% N_2=38080517091295462068890461699
% 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[[2]]=3
% A[[2]]=186970200604513
% B[[2]]=-197791314648453
% m[[2]]=38080517091295275098689857187
% Factor= 19^1
% Factor= 7^1
% End of depth 2 at 0.608473 s

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

% Pmax=5000
% N_4=4338176929972120653758243
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 7
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 8
% Cofactor after sieve is a probable prime
% D[[4]]=8
% A[[4]]=3746510727858
% B[[4]]=643852184699
% m[[4]]=4338176929968374143030386
% Factor= 3^4
% Factor= 2^1
% End of depth 4 at 0.718195 s

% Pmax=5000
% N_5=26778869938076383598953
% 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[[5]]=3
% A[[5]]=76139836085
% B[[5]]=-183773597227
% m[[5]]=26778869938000243762869
% Factor= 499^1
% Factor= 181^1
% Factor= 3^1
% End of depth 5 at 0.770479 s

% Pmax=5000
% N_6=98830699845363817
% next D is 0
% Cofactor after sieve is a probable prime
% D[[6]]=-1
% Factor= 353^1
% Factor= 239^1
% Factor= 17^1
% Factor= 11^1
% Factor= 3^1
% Factor= 2^3
% End of depth 6 at 0.795337 s

% Pmax=5000
% N_7=261015571
% next D is 0
% Factorization completed using sieve only
% D[[7]]=-1
% Factor= 1709^1
% Factor= 1697^1
% Factor= 5^1
% Factor= 3^2
% Factor= 2^1
% Cofactor is 1
% End of depth 7 at 0.817159 s

% Pmax=5000
% N_8=1709
% next D is 0
% Factorization completed using sieve only
% D[[8]]=-1
% Factor= 61^1
% Factor= 7^1
% Factor= 2^2
% Cofactor is 1

% Time for building is 0.587651 s

% Starting phase 2: proving
% Starting proving job for step 0
% File /home/his/ECPP/Ecpp/Data/Weber/h1g1.cwdx does not exist
% tpber=0.000389s
% j has been computed
% E found
% Suggested twist(43)=-1
% N_0 is prime
% Time for proof[0] is 0.246523 s

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

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

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

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

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

% Starting proving job for step 6
% N_6 is prime
% Time for proof[6] is 0.002508 s

% Starting proving job for step 7
% Using complete factorization theorem
% N_7 is prime
% Time for proof[7] is 0.002133 s

% Starting proving job for step 8
% Using complete factorization theorem
% b=1
% Nonresidue is 3
% N_8 is prime
% Time for proof[8] is 0.001155 s
% Time for building is 0.587651 s
% Time for proving  is 0.707135 s
% Total time is        1.294930 s
This number is prime
% Time for this number is 1.343579s

% ==> Total time for the computations is 1.535455s