Average Error: 5.9 → 2.4
Time: 5.2s
Precision: binary64
\[x - \frac{y \cdot \left(z - t\right)}{a}\]
\[x - \frac{y}{a} \cdot \left(z - t\right)\]
x - \frac{y \cdot \left(z - t\right)}{a}
x - \frac{y}{a} \cdot \left(z - t\right)
double code(double x, double y, double z, double t, double a) {
	return ((double) (x - ((double) (((double) (y * ((double) (z - t)))) / a))));
}
double code(double x, double y, double z, double t, double a) {
	return ((double) (x - ((double) (((double) (y / a)) * ((double) (z - 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

Original5.9
Target0.7
Herbie2.4
\[\begin{array}{l} \mathbf{if}\;y \lt -1.07612662163899753 \cdot 10^{-10}:\\ \;\;\;\;x - \frac{1}{\frac{\frac{a}{z - t}}{y}}\\ \mathbf{elif}\;y \lt 2.8944268627920891 \cdot 10^{-49}:\\ \;\;\;\;x - \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{\frac{a}{z - t}}\\ \end{array}\]

Derivation

  1. Initial program 5.9

    \[x - \frac{y \cdot \left(z - t\right)}{a}\]
  2. Using strategy rm
  3. Applied associate-/l*5.6

    \[\leadsto x - \color{blue}{\frac{y}{\frac{a}{z - t}}}\]
  4. Using strategy rm
  5. Applied associate-/r/2.4

    \[\leadsto x - \color{blue}{\frac{y}{a} \cdot \left(z - t\right)}\]
  6. Final simplification2.4

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

Reproduce

herbie shell --seed 2020173 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F"
  :precision binary64

  :herbie-target
  (if (< y -1.0761266216389975e-10) (- x (/ 1.0 (/ (/ a (- z t)) y))) (if (< y 2.894426862792089e-49) (- x (/ (* y (- z t)) a)) (- x (/ y (/ a (- z t))))))

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