Average Error: 6.4 → 2.5
Time: 3.7s
Precision: 64
\[x + \frac{y \cdot \left(z - x\right)}{t}\]
↓
\[\begin{array}{l} \mathbf{if}\;z \le -2.1832233794878784 \cdot 10^{-49} \lor \neg \left(z \le 1.69883915275051465 \cdot 10^{-241}\right):\\ \;\;\;\;x + \frac{y}{t} \cdot \left(z - x\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z - x}{t}\\ \end{array}\]
x + \frac{y \cdot \left(z - x\right)}{t}
↓
\begin{array}{l}
\mathbf{if}\;z \le -2.1832233794878784 \cdot 10^{-49} \lor \neg \left(z \le 1.69883915275051465 \cdot 10^{-241}\right):\\
\;\;\;\;x + \frac{y}{t} \cdot \left(z - x\right)\\

\mathbf{else}:\\
\;\;\;\;x + y \cdot \frac{z - x}{t}\\

\end{array}
double code(double x, double y, double z, double t) {
	return (x + ((y * (z - x)) / t));
}
↓
double code(double x, double y, double z, double t) {
	double VAR;
	if (((z <= -2.1832233794878784e-49) || !(z <= 1.6988391527505147e-241))) {
		VAR = (x + ((y / t) * (z - x)));
	} else {
		VAR = (x + (y * ((z - x) / t)));
	}
	return VAR;
}

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
Target1.9
Herbie2.5
\[x - \left(x \cdot \frac{y}{t} + \left(-z\right) \cdot \frac{y}{t}\right)\]

Derivation

  1. Split input into 2 regimes

  2. if z < -2.1832233794878784e-49 or 1.6988391527505147e-241 < z

    1. Initial program 7.1

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

    3. Applied associate-/l*6.8

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

    5. Applied associate-/r/1.6

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

    if -2.1832233794878784e-49 < z < 1.6988391527505147e-241

    1. Initial program 4.5

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

    3. Applied *-un-lft-identity4.5

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

    4. Applied times-frac4.7

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

    5. Simplified4.7

      \[\leadsto x + \color{blue}{y} \cdot \frac{z - x}{t}\]
  3. Recombined 2 regimes into one program.

  4. Final simplification2.5

    \[\leadsto \begin{array}{l} \mathbf{if}\;z \le -2.1832233794878784 \cdot 10^{-49} \lor \neg \left(z \le 1.69883915275051465 \cdot 10^{-241}\right):\\ \;\;\;\;x + \frac{y}{t} \cdot \left(z - x\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z - x}{t}\\ \end{array}\]

Reproduce

herbie shell --seed 2020075 
(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)))