Average Error: 10.6 → 1.6
Time: 3.5s
Precision: 64
\[x + \frac{y \cdot \left(z - t\right)}{a - t}\]
↓
\[x + y \cdot \left(\left(z - t\right) \cdot \frac{1}{a - t}\right)\]
x + \frac{y \cdot \left(z - t\right)}{a - t}
↓
x + y \cdot \left(\left(z - t\right) \cdot \frac{1}{a - t}\right)
double code(double x, double y, double z, double t, double a) {
	return ((double) (x + ((double) (((double) (y * ((double) (z - t)))) / ((double) (a - t))))));
}
↓
double code(double x, double y, double z, double t, double a) {
	return ((double) (x + ((double) (y * ((double) (((double) (z - t)) * ((double) (1.0 / ((double) (a - t))))))))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original10.6
Target1.4
Herbie1.6
\[x + \frac{y}{\frac{a - t}{z - t}}\]

Derivation

  1. Initial program 10.6

    \[x + \frac{y \cdot \left(z - t\right)}{a - t}\]
  2. Using strategy rm

  3. Applied *-un-lft-identity10.6

    \[\leadsto x + \frac{y \cdot \left(z - t\right)}{\color{blue}{1 \cdot \left(a - t\right)}}\]

  4. Applied times-frac1.5

    \[\leadsto x + \color{blue}{\frac{y}{1} \cdot \frac{z - t}{a - t}}\]

  5. Simplified1.5

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

  7. Applied div-inv1.6

    \[\leadsto x + y \cdot \color{blue}{\left(\left(z - t\right) \cdot \frac{1}{a - t}\right)}\]

  8. Final simplification1.6

    \[\leadsto x + y \cdot \left(\left(z - t\right) \cdot \frac{1}{a - t}\right)\]

Reproduce

herbie shell --seed 2020130 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, B"
  :precision binary64

  :herbie-target
  (+ x (/ y (/ (- a t) (- z t))))

  (+ x (/ (* y (- z t)) (- a t))))