Average Error: 10.8 → 0.1
Time: 3.0s
Precision: binary64
\[\frac{x \cdot \left(\left(y - z\right) + 1\right)}{z}\]
↓
\[\begin{array}{l} \mathbf{if}\;x \le -5.2325671158835024 \cdot 10^{-129} \lor \neg \left(x \le 143785121308844464\right):\\ \;\;\;\;\frac{x}{z} \cdot \left(y + 1\right) - x\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \left(y + 1\right)}{z} - x\\ \end{array}\]
\frac{x \cdot \left(\left(y - z\right) + 1\right)}{z}
↓
\begin{array}{l}
\mathbf{if}\;x \le -5.2325671158835024 \cdot 10^{-129} \lor \neg \left(x \le 143785121308844464\right):\\
\;\;\;\;\frac{x}{z} \cdot \left(y + 1\right) - x\\

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

\end{array}
double code(double x, double y, double z) {
	return (((double) (x * ((double) (((double) (y - z)) + 1.0)))) / z);
}
↓
double code(double x, double y, double z) {
	double VAR;
	if (((x <= -5.2325671158835024e-129) || !(x <= 1.4378512130884446e+17))) {
		VAR = ((double) (((double) ((x / z) * ((double) (y + 1.0)))) - x));
	} else {
		VAR = ((double) ((((double) (x * ((double) (y + 1.0)))) / z) - x));
	}
	return VAR;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original10.8
Target0.5
Herbie0.1
\[\begin{array}{l} \mathbf{if}\;x \lt -2.7148310671343599 \cdot 10^{-162}:\\ \;\;\;\;\left(1 + y\right) \cdot \frac{x}{z} - x\\ \mathbf{elif}\;x \lt 3.87410881643954616 \cdot 10^{-197}:\\ \;\;\;\;\left(x \cdot \left(\left(y - z\right) + 1\right)\right) \cdot \frac{1}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(1 + y\right) \cdot \frac{x}{z} - x\\ \end{array}\]

Derivation

  1. Split input into 2 regimes

  2. if x < -5.2325671158835024e-129 or 143785121308844464 < x

    1. Initial program 21.2

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

    2. Simplified0.8

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

    4. Applied add-cube-cbrt1.3

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

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

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

    6. Applied times-frac1.3

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

    7. Applied associate-*r*0.7

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

    8. Simplified0.7

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

    9. Taylor expanded around 0 7.1

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

    10. Simplified0.2

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

    if -5.2325671158835024e-129 < x < 143785121308844464

    1. Initial program 0.2

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

    2. Simplified6.7

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

    4. Applied associate-*r/0.1

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

  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \le -5.2325671158835024 \cdot 10^{-129} \lor \neg \left(x \le 143785121308844464\right):\\ \;\;\;\;\frac{x}{z} \cdot \left(y + 1\right) - x\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \left(y + 1\right)}{z} - x\\ \end{array}\]

Reproduce

herbie shell --seed 2020182 
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment.Bernstein:evaluateBernstein from diagrams-lib-1.3.0.3"
  :precision binary64

  :herbie-target
  (if (< x -2.71483106713436e-162) (- (* (+ 1.0 y) (/ x z)) x) (if (< x 3.874108816439546e-197) (* (* x (+ (- y z) 1.0)) (/ 1.0 z)) (- (* (+ 1.0 y) (/ x z)) x)))

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