Average Error: 6.7 → 1.9
Time: 7.9s
Precision: binary64
\[x + \frac{y \cdot \left(z - x\right)}{t}\]
↓
\[\begin{array}{l} \mathbf{if}\;t \le -1.37836980272270247 \cdot 10^{107} \lor \neg \left(t \le 9.89123025060424723 \cdot 10^{-138}\right):\\ \;\;\;\;x + \frac{\sqrt[3]{y} \cdot \sqrt[3]{y}}{\sqrt[3]{t}} \cdot \left(\frac{\sqrt[3]{y}}{\sqrt[3]{t}} \cdot \frac{z - x}{\sqrt[3]{t}}\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y \cdot \left(z - x\right)\right) \cdot \frac{1}{t}\\ \end{array}\]
x + \frac{y \cdot \left(z - x\right)}{t}
↓
\begin{array}{l}
\mathbf{if}\;t \le -1.37836980272270247 \cdot 10^{107} \lor \neg \left(t \le 9.89123025060424723 \cdot 10^{-138}\right):\\
\;\;\;\;x + \frac{\sqrt[3]{y} \cdot \sqrt[3]{y}}{\sqrt[3]{t}} \cdot \left(\frac{\sqrt[3]{y}}{\sqrt[3]{t}} \cdot \frac{z - x}{\sqrt[3]{t}}\right)\\

\mathbf{else}:\\
\;\;\;\;x + \left(y \cdot \left(z - x\right)\right) \cdot \frac{1}{t}\\

\end{array}
double code(double x, double y, double z, double t) {
	return ((double) (x + (((double) (y * ((double) (z - x)))) / t)));
}
↓
double code(double x, double y, double z, double t) {
	double VAR;
	if (((t <= -1.3783698027227025e+107) || !(t <= 9.891230250604247e-138))) {
		VAR = ((double) (x + ((double) ((((double) (((double) cbrt(y)) * ((double) cbrt(y)))) / ((double) cbrt(t))) * ((double) ((((double) cbrt(y)) / ((double) cbrt(t))) * (((double) (z - x)) / ((double) cbrt(t)))))))));
	} else {
		VAR = ((double) (x + ((double) (((double) (y * ((double) (z - x)))) * (1.0 / 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.7
Target2.1
Herbie1.9
\[x - \left(x \cdot \frac{y}{t} + \left(-z\right) \cdot \frac{y}{t}\right)\]

Derivation

  1. Split input into 2 regimes

  2. if t < -1.37836980272270247e107 or 9.89123025060424723e-138 < t

    1. Initial program 8.7

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

    3. Applied add-cube-cbrt9.1

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

    4. Applied times-frac1.6

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

    6. Applied add-cube-cbrt1.7

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

    7. Applied times-frac1.7

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

    8. Applied associate-*l*1.1

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

    if -1.37836980272270247e107 < t < 9.89123025060424723e-138

    1. Initial program 3.1

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

    3. Applied div-inv3.1

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

  4. Final simplification1.9

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \le -1.37836980272270247 \cdot 10^{107} \lor \neg \left(t \le 9.89123025060424723 \cdot 10^{-138}\right):\\ \;\;\;\;x + \frac{\sqrt[3]{y} \cdot \sqrt[3]{y}}{\sqrt[3]{t}} \cdot \left(\frac{\sqrt[3]{y}}{\sqrt[3]{t}} \cdot \frac{z - x}{\sqrt[3]{t}}\right)\\ \mathbf{else}:\\ \;\;\;\;x + \left(y \cdot \left(z - x\right)\right) \cdot \frac{1}{t}\\ \end{array}\]

Reproduce

herbie shell --seed 2020182 
(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)) (* (neg z) (/ y t))))

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