Average Error: 11.9 → 1.1
Time: 3.8s
Precision: binary64
\[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\]
↓
\[x - \frac{y}{z - \frac{y}{z \cdot \frac{2}{t}}}\]
x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}
↓
x - \frac{y}{z - \frac{y}{z \cdot \frac{2}{t}}}
(FPCore (x y z t)
 :precision binary64
 (- x (/ (* (* y 2.0) z) (- (* (* z 2.0) z) (* y t)))))
↓
(FPCore (x y z t) :precision binary64 (- x (/ y (- z (/ y (* z (/ 2.0 t)))))))
double code(double x, double y, double z, double t) {
	return x - (((y * 2.0) * z) / (((z * 2.0) * z) - (y * t)));
}
↓
double code(double x, double y, double z, double t) {
	return x - (y / (z - (y / (z * (2.0 / t)))));
}

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

Original11.9
Target0.1
Herbie1.1
\[x - \frac{1}{\frac{z}{y} - \frac{\frac{t}{2}}{z}}\]

Derivation

  1. Initial program 11.9

    \[x - \frac{\left(y \cdot 2\right) \cdot z}{\left(z \cdot 2\right) \cdot z - y \cdot t}\]

  2. Simplified3.0

    \[\leadsto \color{blue}{x - \frac{y}{z - \frac{y \cdot t}{2 \cdot z}}}\]
  3. Using strategy rm

  4. Applied associate-/l*_binary641.0

    \[\leadsto x - \frac{y}{z - \color{blue}{\frac{y}{\frac{2 \cdot z}{t}}}}\]

  5. Simplified1.1

    \[\leadsto x - \frac{y}{z - \frac{y}{\color{blue}{\frac{2}{\frac{t}{z}}}}}\]
  6. Using strategy rm

  7. Applied associate-/r/_binary641.1

    \[\leadsto x - \frac{y}{z - \frac{y}{\color{blue}{\frac{2}{t} \cdot z}}}\]

  8. Final simplification1.1

    \[\leadsto x - \frac{y}{z - \frac{y}{z \cdot \frac{2}{t}}}\]

Reproduce

herbie shell --seed 2020219 
(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)))))