Average Error: 0.6 → 0.9
Time: 2.8s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t) {
	return ((double) (1.0 - ((double) (x / ((double) (((double) (y - z)) * ((double) (y - t))))))));
}

↓
double code(double x, double y, double z, double t) {
	return ((double) (1.0 + ((double) (-1.0 / ((double) (((double) (y - z)) * ((double) (((double) (y - t)) / x))))))));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.6
    \[\]
  2. Using strategy rm
  3. Applied clear-num0.6
    \[\leadsto \]
  4. Simplified1.0
    \[\leadsto \]
  5. Using strategy rm
  6. Applied div-inv1.0
    \[\leadsto \]
  7. Applied associate-*l*0.9
    \[\leadsto \]
  8. Simplified0.9
    \[\leadsto \]
  9. Final simplification0.9
    \[\leadsto \]
Reproduce
herbie shell --seed 2020190 
(FPCore (x y z t)
  :name "Data.Random.Distribution.Triangular:triangularCDF from random-fu-0.2.6.2, A"
  :precision binary64
  (- 1.0 (/ x (* (- y z) (- y t)))))