Average Error: 6.8 → 2.2
Time: 2.8s
Precision: 64
\[x + \frac{\left(y - x\right) \cdot z}{t}\]
↓
\[x + \left(y - x\right) \cdot \frac{z}{t}\]
x + \frac{\left(y - x\right) \cdot z}{t}
↓
x + \left(y - x\right) \cdot \frac{z}{t}
double code(double x, double y, double z, double t) {
	return (x + (((y - x) * z) / t));
}
↓
double code(double x, double y, double z, double t) {
	return (x + ((y - x) * (z / 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

Original6.8
Target2.3
Herbie2.2
\[\begin{array}{l} \mathbf{if}\;x \lt -9.0255111955330046 \cdot 10^{-135}:\\ \;\;\;\;x - \frac{z}{t} \cdot \left(x - y\right)\\ \mathbf{elif}\;x \lt 4.2750321637007147 \cdot 10^{-250}:\\ \;\;\;\;x + \frac{y - x}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y - x}{\frac{t}{z}}\\ \end{array}\]

Derivation

  1. Initial program 6.8

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

  3. Applied *-un-lft-identity6.8

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

  4. Applied times-frac2.2

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

  5. Simplified2.2

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

  6. Final simplification2.2

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

Reproduce

herbie shell --seed 2020091 
(FPCore (x y z t)
  :name "Numeric.Histogram:binBounds from Chart-1.5.3"
  :precision binary64

  :herbie-target
  (if (< x -9.025511195533005e-135) (- x (* (/ z t) (- x y))) (if (< x 4.275032163700715e-250) (+ x (* (/ (- y x) t) z)) (+ x (/ (- y x) (/ t z)))))

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