999905550669144001 =factor: n = 999905550669144001
Factors found until now: 999905550669144001
  Completing factorization...
prove_prime: n = 999905550669144001
theorem10: n = 999905550669144001
  u = 100, r.GetNum() = 220437731629
  factors of 999905550669144000: 2 2 2 2 2 2 3 3 3 3 5 5 5 7 220437731629 (composite)
  cannot decide, trying theorem11
theorem11: n = 999905550669144001
  u = 100, r.GetNum() = 220437731629
  factors of 999905550669144000: 2 2 2 2 2 2 3 3 3 3 5 5 5 7 220437731629 (composite)
  Test base 2
  Found a nontrivial factor: 139982664403
prove_prime result: composite
handle_factor: n = 999905550669144001, factor = 139982664403
factor: n = 139982664403
Factors found until now: 139982664403
Pollard P-1: N = 139982664403, b1 = 10000, b2 = 10000
  Performing last gcd in step 1
  Step 1 found factor 139982664403 at p = 6299
Pollard P-1: N = 139982664403, b1 = 5000, b2 = 10000
  Performing last gcd in step 1
pollardstep2: n = 139982664403, b2 = 10000
  Performing last gcd in step 2
P+1: N = 139982664403, b1 = 10000, b2 = 10000
  Step 1 found factor 264559 at p = 7001
handle_factor: n = 139982664403, factor = 264559
factor: n = 264559
Factors found until now: 264559
  Completing factorization...
prove_prime: n = 264559
theorem10: n = 264559
theorem9: n = 264559
  u = 100, r.GetNum() = 6299
  factors of 264558: 2 3 7 6299 (prime)
  Factor 2 of 264558
    Test base 2
    Test base 3
  Factor 3 of 264558
    Test base 2
  Factor 7 of 264558
    Test base 2
  Factor 6299 of 264558
    Test base 2
theorem9 result: prime
prove_prime result: prime
factor result: prime
factor: n = 529117
Factors found until now: 529117
  Completing factorization...
prove_prime: n = 529117
theorem10: n = 529117
theorem9: n = 529117
  u = 100, r.GetNum() = 6299
  factors of 529116: 2 2 3 7 6299 (prime)
  Factor 2 of 529116
    Test base 2
  Factor 3 of 529116
    Test base 2
  Factor 7 of 529116
    Test base 2
  Factor 6299 of 529116
    Test base 2
theorem9 result: prime
prove_prime result: prime
factor result: prime
handle_factor(139982664403) completed
factor result: prime
factor: n = 7143067
Factors found until now: 7143067
  Completing factorization...
prove_prime: n = 7143067
theorem10: n = 7143067
theorem9: n = 7143067
  u = 100, r.GetNum() = 6299
  factors of 7143066: 2 3 3 3 3 7 6299 (prime)
  Factor 2 of 7143066
    Test base 2
  Factor 3 of 7143066
    Test base 2
  Factor 7 of 7143066
    Test base 2
  Factor 6299 of 7143066
    Test base 2
theorem9 result: prime
prove_prime result: prime
factor result: prime
handle_factor(999905550669144001) completed
factor result: prime
 264559 529117 7143067
Verifying factor list... done