Average Error: 6.9 → 1.2
Time: 7.5s
Precision: binary64
\[x + \frac{y \cdot \left(z - x\right)}{t}\]
↓
\[\begin{array}{l} \mathbf{if}\;x + \frac{y \cdot \left(z - x\right)}{t} \le -1.5327609267348506 \cdot 10^{261} \lor \neg \left(x + \frac{y \cdot \left(z - x\right)}{t} \le 2.657445570864299 \cdot 10^{245}\right):\\ \;\;\;\;x + \frac{y}{t} \cdot \left(z - x\right)\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot \left(z - x\right)}{t}\\ \end{array}\]
x + \frac{y \cdot \left(z - x\right)}{t}
↓
\begin{array}{l}
\mathbf{if}\;x + \frac{y \cdot \left(z - x\right)}{t} \le -1.5327609267348506 \cdot 10^{261} \lor \neg \left(x + \frac{y \cdot \left(z - x\right)}{t} \le 2.657445570864299 \cdot 10^{245}\right):\\
\;\;\;\;x + \frac{y}{t} \cdot \left(z - x\right)\\

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

\end{array}
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) {
	double VAR;
	if (((((double) (x + ((double) (((double) (y * ((double) (z - x)))) / t)))) <= -1.5327609267348506e+261) || !(((double) (x + ((double) (((double) (y * ((double) (z - x)))) / t)))) <= 2.657445570864299e+245))) {
		VAR = ((double) (x + ((double) (((double) (y / t)) * ((double) (z - x))))));
	} else {
		VAR = ((double) (x + ((double) (((double) (y * ((double) (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.9
Target2.2
Herbie1.2
\[x - \left(x \cdot \frac{y}{t} + \left(-z\right) \cdot \frac{y}{t}\right)\]

Derivation

  1. Split input into 2 regimes

  2. if (+ x (/ (* y (- z x)) t)) < -1.5327609267348506e261 or 2.657445570864299e245 < (+ x (/ (* y (- z x)) t))

    1. Initial program 31.2

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

    3. Applied associate-/l*10.1

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

    5. Applied associate-/r/2.7

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

    if -1.5327609267348506e261 < (+ x (/ (* y (- z x)) t)) < 2.657445570864299e245

    1. Initial program 0.8

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

  4. Final simplification1.2

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

Reproduce

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