Average Error: 28.3 → 0.2
Time: 3.5s
Precision: binary64
\[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\]
↓
\[\frac{y + \frac{x + z}{\frac{y}{x - z}}}{2}\]
\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}
↓
\frac{y + \frac{x + z}{\frac{y}{x - z}}}{2}
double code(double x, double y, double z) {
	return (((double) (((double) (((double) (x * x)) + ((double) (y * y)))) - ((double) (z * z)))) / ((double) (y * 2.0)));
}
↓
double code(double x, double y, double z) {
	return (((double) (y + (((double) (x + z)) / (y / ((double) (x - z)))))) / 2.0);
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original28.3
Target0.2
Herbie0.2
\[y \cdot 0.5 - \left(\frac{0.5}{y} \cdot \left(z + x\right)\right) \cdot \left(z - x\right)\]

Derivation

  1. Initial program 28.3

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

  2. Simplified0.2

    \[\leadsto \color{blue}{\frac{y + \left(x + z\right) \cdot \frac{x - z}{y}}{2}}\]
  3. Using strategy rm

  4. Applied clear-num0.2

    \[\leadsto \frac{y + \left(x + z\right) \cdot \color{blue}{\frac{1}{\frac{y}{x - z}}}}{2}\]
  5. Using strategy rm

  6. Applied un-div-inv0.2

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

  7. Final simplification0.2

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

Reproduce

herbie shell --seed 2020196 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A"
  :precision binary64

  :herbie-target
  (- (* y 0.5) (* (* (/ 0.5 y) (+ z x)) (- z x)))

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