Average Error: 2.0 → 2.6
Time: 4.2s
Precision: binary64
\[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b\]
↓
\[\begin{array}{l} \mathbf{if}\;x \le 3.8529998682082477 \cdot 10^{-282}:\\ \;\;\;\;\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(\sqrt[3]{\left(a \cdot z\right) \cdot b} \cdot \sqrt[3]{\left(a \cdot z\right) \cdot b}\right) \cdot \sqrt[3]{\left(a \cdot z\right) \cdot b}\\ \mathbf{else}:\\ \;\;\;\;y \cdot z + \left(x + a \cdot \left(t + z \cdot b\right)\right)\\ \end{array}\]
\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b
↓
\begin{array}{l}
\mathbf{if}\;x \le 3.8529998682082477 \cdot 10^{-282}:\\
\;\;\;\;\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(\sqrt[3]{\left(a \cdot z\right) \cdot b} \cdot \sqrt[3]{\left(a \cdot z\right) \cdot b}\right) \cdot \sqrt[3]{\left(a \cdot z\right) \cdot b}\\

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

\end{array}
double code(double x, double y, double z, double t, double a, double b) {
	return ((double) (((double) (((double) (x + ((double) (y * z)))) + ((double) (t * a)))) + ((double) (((double) (a * z)) * b))));
}
↓
double code(double x, double y, double z, double t, double a, double b) {
	double VAR;
	if ((x <= 3.852999868208248e-282)) {
		VAR = ((double) (((double) (((double) (x + ((double) (y * z)))) + ((double) (t * a)))) + ((double) (((double) (((double) cbrt(((double) (((double) (a * z)) * b)))) * ((double) cbrt(((double) (((double) (a * z)) * b)))))) * ((double) cbrt(((double) (((double) (a * z)) * b))))))));
	} else {
		VAR = ((double) (((double) (y * z)) + ((double) (x + ((double) (a * ((double) (t + ((double) (z * b))))))))));
	}
	return VAR;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original2.0
Target0.3
Herbie2.6
\[\begin{array}{l} \mathbf{if}\;z \lt -11820553527347888000:\\ \;\;\;\;z \cdot \left(b \cdot a + y\right) + \left(x + t \cdot a\right)\\ \mathbf{elif}\;z \lt 4.75897431883642871 \cdot 10^{-122}:\\ \;\;\;\;\left(b \cdot z + t\right) \cdot a + \left(z \cdot y + x\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(b \cdot a + y\right) + \left(x + t \cdot a\right)\\ \end{array}\]

Derivation

  1. Split input into 2 regimes

  2. if x < 3.8529998682082477e-282

    1. Initial program 2.2

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b\]
    2. Using strategy rm

    3. Applied add-cube-cbrt2.4

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

    if 3.8529998682082477e-282 < x

    1. Initial program 1.8

      \[\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(a \cdot z\right) \cdot b\]

    2. Simplified2.9

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

  4. Final simplification2.6

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \le 3.8529998682082477 \cdot 10^{-282}:\\ \;\;\;\;\left(\left(x + y \cdot z\right) + t \cdot a\right) + \left(\sqrt[3]{\left(a \cdot z\right) \cdot b} \cdot \sqrt[3]{\left(a \cdot z\right) \cdot b}\right) \cdot \sqrt[3]{\left(a \cdot z\right) \cdot b}\\ \mathbf{else}:\\ \;\;\;\;y \cdot z + \left(x + a \cdot \left(t + z \cdot b\right)\right)\\ \end{array}\]

Reproduce

herbie shell --seed 2020155 
(FPCore (x y z t a b)
  :name "Graphics.Rasterific.CubicBezier:cachedBezierAt from Rasterific-0.6.1"
  :precision binary64

  :herbie-target
  (if (< z -1.1820553527347888e+19) (+ (* z (+ (* b a) y)) (+ x (* t a))) (if (< z 4.7589743188364287e-122) (+ (* (+ (* b z) t) a) (+ (* z y) x)) (+ (* z (+ (* b a) y)) (+ x (* t a)))))

  (+ (+ (+ x (* y z)) (* t a)) (* (* a z) b)))