Average Error: 12.0 → 0.1
Time: 5.2s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t) {
	return ((double) (x - ((double) (((double) (((double) (y * 2.0)) * z)) / ((double) (((double) (((double) (z * 2.0)) * z)) - ((double) (y * t))))))));
}

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

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
Target
Original12.0
Target0.1
Herbie0.1
\[\]
Derivation
  1. Initial program 12.0
    \[\]
  2. Simplified0.1
    \[\leadsto \]
  3. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x y z t)
  :name "Numeric.AD.Rank1.Halley:findZero from ad-4.2.4"
  :precision binary64

  :herbie-target
  (- x (/ 1.0 (- (/ z y) (/ (/ t 2.0) z))))

  (- x (/ (* (* y 2.0) z) (- (* (* z 2.0) z) (* y t)))))