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 ?
-216 252 -315 -1476 -762
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 (-216,252,-315,-1476,-762) up to height 15
Entering qsieve::search: y^2 = -216x^4 + 252x^3 + -315x^2 + -1476x^1 + -762
Using speed ratios 1000 and 6.5
Even numerators are excluded.
8 primes used for first stage of sieving
52 primes used for both stages of sieving together.
Sieving primes:
 First stage: 29, 13, 131, 173, 241, 31, 179, 41, 
 Second stage: 233, 229, 107, 83, 19, 191, 223, 89, 227, 193, 53, 139, 113, 149, 199, 251, 181, 101, 5, 197, 23, 61, 79, 103, 17, 239, 211, 137, 167, 163, 151, 127, 43, 109, 157, 67, 73, 11, 71, 97, 59, 37, 47, 7, 
Probabilities: Min(29) = 0.367419738406659, Cut1(41) = 0.439024390243902, Cut2(7) = 0.755102040816326, Max(3) = 1

Forbidden divisors of the denominator:
13, 17, 19, 23, 37, 41, 43, 47, 61, 67, 71, 89, 109, 113, 137, 139, 157, 163, 167, 181, 191, 211, 229, 233, 239, 

Try to find the points up to height 3269017
Will stop at first point found.
x = -2021077/2486082 gives a rational point.
(x:y:z) = (-2021077:168298146:2486082)
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$