bash-2.05a$ ./ratpoint
Version compiled on Feb 11 2003 at 17:40:15 by GCC 3.2.1
using base arithmetic option LiDIA_ALL (LiDIA bigints and multiprecision floating point)
Verbose? 1
Computed 78519 primes, largest is 1000253
Enter quartic coefficients a,b,c,d,e ?
-3 4 891 -594 -66366
Limit on height? 15
I = 3190185, J = 11396035638
Minimal model for Jacobian: [0,0,0,-1063395,-422075394]
Checking local solublity in R:
Checking local solublity at primes [2 3 17 ]:
new_qpsoluble with p<1000 passing to old qpsoluble.
new_qpsoluble with p<1000 passing to old qpsoluble.
Everywhere locally soluble.
Searching for points on (-3,4,891,-594,-66366) up to height 15
Entering qsieve::search: y^2 = -3x^4 + 4x^3 + 891x^2 + -594x^1 + -66366
Using speed ratios 1000 and 6.5
Even numerators are excluded.
8 primes used for first stage of sieving
53 primes used for both stages of sieving together.
Sieving primes:
 First stage: 13, 29, 131, 241, 31, 41, 173, 179, 
 Second stage: 233, 19, 229, 107, 83, 191, 223, 89, 193, 139, 227, 53, 113, 199, 61, 181, 149, 251, 23, 197, 101, 79, 103, 17, 211, 239, 43, 137, 163, 167, 151, 109, 127, 157, 67, 73, 71, 97, 5, 37, 59, 11, 47, 7, 3, 
Probabilities: Min(13) = 0.36094674556213, Cut1(179) = 0.441340782122905, Cut2(3) = 0.777777777777778, Max(3) = 0.777777777777778

Forbidden divisors of the denominator:
4, 9, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 197, 227, 233, 239, 251, 

Try to find the points up to height 3269017
Will stop at first point found.
x = 211715/16886 gives a rational point.
(x:y:z) = (211715:9349897:16886)
Point = [52175045206724521444271926 : -13180351117189258356213783626 : 817373361745081357273]
        height = 43.175054488197621978
Curve = [0,0,0,-1063395,-422075394]
Point = [52175045206724521444271926 : -13180351117189258356213783626 : 817373361745081357273]
height = 43.175054488197621978
Enter quartic coefficients a,b,c,d,e ?
0 0 0 0 0
bash-2.05a$