Average Error: 6.4 → 2.1
Time: 4.2s
Precision: binary64
\[x + \frac{y \cdot \left(z - x\right)}{t}\]
↓
\[x + \frac{1}{\frac{\frac{t}{y}}{z - x}}\]
x + \frac{y \cdot \left(z - x\right)}{t}
↓
x + \frac{1}{\frac{\frac{t}{y}}{z - x}}
double code(double x, double y, double z, double t) {
	return ((double) (x + ((double) (((double) (y * ((double) (z - x)))) / t))));
}
↓
double code(double x, double y, double z, double t) {
	return ((double) (x + ((double) (1.0 / ((double) (((double) (t / y)) / ((double) (z - x))))))));
}

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

Original6.4
Target2.1
Herbie2.1
\[x - \left(x \cdot \frac{y}{t} + \left(-z\right) \cdot \frac{y}{t}\right)\]

Derivation

  1. Initial program 6.4

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

  3. Applied sub-neg6.4

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

  4. Applied distribute-lft-in6.4

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

  6. Applied clear-num6.5

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

  7. Simplified2.1

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

  8. Final simplification2.1

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

Reproduce

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

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

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