
(FPCore (x y z t a b) :precision binary64 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))
double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
def code(x, y, z, t, a, b): return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))
function code(x, y, z, t, a, b) return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0))) end
function tmp = code(x, y, z, t, a, b) tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0)); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b) :precision binary64 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))
double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
def code(x, y, z, t, a, b): return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))
function code(x, y, z, t, a, b) return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0))) end
function tmp = code(x, y, z, t, a, b) tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0)); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3}
\end{array}
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (/ a (* 3.0 b))) (t_2 (* t (/ z 3.0))))
(if (<= (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) 1e+142)
(- (* 2.0 (* (sqrt x) (fma (sin y) (sin t_2) (* (cos y) (cos t_2))))) t_1)
(- (* 2.0 (* (sqrt x) (- (cos y)))) t_1))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = a / (3.0 * b);
double t_2 = t * (z / 3.0);
double tmp;
if (((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) <= 1e+142) {
tmp = (2.0 * (sqrt(x) * fma(sin(y), sin(t_2), (cos(y) * cos(t_2))))) - t_1;
} else {
tmp = (2.0 * (sqrt(x) * -cos(y))) - t_1;
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(a / Float64(3.0 * b)) t_2 = Float64(t * Float64(z / 3.0)) tmp = 0.0 if (Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 1e+142) tmp = Float64(Float64(2.0 * Float64(sqrt(x) * fma(sin(y), sin(t_2), Float64(cos(y) * cos(t_2))))) - t_1); else tmp = Float64(Float64(2.0 * Float64(sqrt(x) * Float64(-cos(y)))) - t_1); end return tmp end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z / 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e+142], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[Sin[y], $MachinePrecision] * N[Sin[t$95$2], $MachinePrecision] + N[(N[Cos[y], $MachinePrecision] * N[Cos[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * (-N[Cos[y], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \frac{a}{3 \cdot b}\\
t_2 := t \cdot \frac{z}{3}\\
\mathbf{if}\;\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 10^{+142}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \mathsf{fma}\left(\sin y, \sin t_2, \cos y \cdot \cos t_2\right)\right) - t_1\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \left(-\cos y\right)\right) - t_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 1.00000000000000005e142Initial program 77.9%
associate-*l*77.9%
fma-neg77.9%
remove-double-neg77.9%
fma-neg77.9%
remove-double-neg77.9%
associate-/l*77.9%
*-commutative77.9%
Simplified77.9%
cos-diff79.8%
associate-/r/79.3%
*-commutative79.3%
div-inv79.5%
metadata-eval79.5%
associate-/r/79.6%
*-commutative79.6%
div-inv79.6%
metadata-eval79.6%
Applied egg-rr79.6%
+-commutative79.6%
cos-neg79.6%
fma-def79.6%
*-commutative79.6%
associate-*l*79.4%
metadata-eval79.4%
associate-/r/79.6%
associate-*r/79.5%
*-rgt-identity79.5%
associate-/r/79.6%
*-commutative79.6%
*-commutative79.6%
associate-*l*79.3%
*-commutative79.3%
associate-*r*79.3%
distribute-lft-neg-in79.3%
metadata-eval79.3%
Simplified79.3%
if 1.00000000000000005e142 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 8.4%
associate-*l*8.4%
fma-neg8.4%
remove-double-neg8.4%
fma-neg8.4%
remove-double-neg8.4%
associate-/l*8.4%
*-commutative8.4%
Simplified8.4%
Taylor expanded in z around 0 52.6%
add-cube-cbrt52.6%
pow352.6%
Applied egg-rr52.6%
Taylor expanded in x around -inf 0.0%
*-commutative0.0%
pow-base-10.0%
*-lft-identity0.0%
unpow20.0%
rem-square-sqrt54.2%
neg-mul-154.2%
Simplified54.2%
Final simplification75.8%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (/ a (* 3.0 b))) (t_2 (* t (* z 0.3333333333333333))))
(if (<= (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) 2e+154)
(- (* 2.0 (* (sqrt x) (fma (cos y) (cos t_2) (* (sin y) (sin t_2))))) t_1)
(- (* 2.0 (* (sqrt x) (- (cos y)))) t_1))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = a / (3.0 * b);
double t_2 = t * (z * 0.3333333333333333);
double tmp;
if (((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) <= 2e+154) {
tmp = (2.0 * (sqrt(x) * fma(cos(y), cos(t_2), (sin(y) * sin(t_2))))) - t_1;
} else {
tmp = (2.0 * (sqrt(x) * -cos(y))) - t_1;
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(a / Float64(3.0 * b)) t_2 = Float64(t * Float64(z * 0.3333333333333333)) tmp = 0.0 if (Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 2e+154) tmp = Float64(Float64(2.0 * Float64(sqrt(x) * fma(cos(y), cos(t_2), Float64(sin(y) * sin(t_2))))) - t_1); else tmp = Float64(Float64(2.0 * Float64(sqrt(x) * Float64(-cos(y)))) - t_1); end return tmp end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2e+154], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[Cos[y], $MachinePrecision] * N[Cos[t$95$2], $MachinePrecision] + N[(N[Sin[y], $MachinePrecision] * N[Sin[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * (-N[Cos[y], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \frac{a}{3 \cdot b}\\
t_2 := t \cdot \left(z \cdot 0.3333333333333333\right)\\
\mathbf{if}\;\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 2 \cdot 10^{+154}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \mathsf{fma}\left(\cos y, \cos t_2, \sin y \cdot \sin t_2\right)\right) - t_1\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \left(-\cos y\right)\right) - t_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 2.00000000000000007e154Initial program 77.8%
associate-*l*77.8%
fma-neg77.8%
remove-double-neg77.8%
fma-neg77.8%
remove-double-neg77.8%
associate-/l*77.9%
*-commutative77.9%
Simplified77.9%
associate-/r/77.8%
cos-diff79.3%
fma-def79.3%
*-commutative79.3%
div-inv79.6%
metadata-eval79.6%
associate-/r/79.6%
associate-/r/79.6%
*-commutative79.6%
div-inv79.6%
metadata-eval79.6%
Applied egg-rr79.6%
if 2.00000000000000007e154 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 0.0%
associate-*l*0.0%
fma-neg0.0%
remove-double-neg0.0%
fma-neg0.0%
remove-double-neg0.0%
associate-/l*0.0%
*-commutative0.0%
Simplified0.0%
Taylor expanded in z around 0 49.8%
add-cube-cbrt49.8%
pow349.8%
Applied egg-rr49.8%
Taylor expanded in x around -inf 0.0%
*-commutative0.0%
pow-base-10.0%
*-lft-identity0.0%
unpow20.0%
rem-square-sqrt50.9%
neg-mul-150.9%
Simplified50.9%
Final simplification76.0%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (/ a (* 3.0 b))) (t_2 (* t (* z 0.3333333333333333))))
(if (<= (cos (- y (/ (* z t) 3.0))) 2.0)
(-
(* 2.0 (* (sqrt x) (+ (* (sin y) (sin t_2)) (* (cos y) (cos t_2)))))
t_1)
(- (* 2.0 (* (sqrt x) (- (cos y)))) t_1))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = a / (3.0 * b);
double t_2 = t * (z * 0.3333333333333333);
double tmp;
if (cos((y - ((z * t) / 3.0))) <= 2.0) {
tmp = (2.0 * (sqrt(x) * ((sin(y) * sin(t_2)) + (cos(y) * cos(t_2))))) - t_1;
} else {
tmp = (2.0 * (sqrt(x) * -cos(y))) - t_1;
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = a / (3.0d0 * b)
t_2 = t * (z * 0.3333333333333333d0)
if (cos((y - ((z * t) / 3.0d0))) <= 2.0d0) then
tmp = (2.0d0 * (sqrt(x) * ((sin(y) * sin(t_2)) + (cos(y) * cos(t_2))))) - t_1
else
tmp = (2.0d0 * (sqrt(x) * -cos(y))) - t_1
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = a / (3.0 * b);
double t_2 = t * (z * 0.3333333333333333);
double tmp;
if (Math.cos((y - ((z * t) / 3.0))) <= 2.0) {
tmp = (2.0 * (Math.sqrt(x) * ((Math.sin(y) * Math.sin(t_2)) + (Math.cos(y) * Math.cos(t_2))))) - t_1;
} else {
tmp = (2.0 * (Math.sqrt(x) * -Math.cos(y))) - t_1;
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): t_1 = a / (3.0 * b) t_2 = t * (z * 0.3333333333333333) tmp = 0 if math.cos((y - ((z * t) / 3.0))) <= 2.0: tmp = (2.0 * (math.sqrt(x) * ((math.sin(y) * math.sin(t_2)) + (math.cos(y) * math.cos(t_2))))) - t_1 else: tmp = (2.0 * (math.sqrt(x) * -math.cos(y))) - t_1 return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(a / Float64(3.0 * b)) t_2 = Float64(t * Float64(z * 0.3333333333333333)) tmp = 0.0 if (cos(Float64(y - Float64(Float64(z * t) / 3.0))) <= 2.0) tmp = Float64(Float64(2.0 * Float64(sqrt(x) * Float64(Float64(sin(y) * sin(t_2)) + Float64(cos(y) * cos(t_2))))) - t_1); else tmp = Float64(Float64(2.0 * Float64(sqrt(x) * Float64(-cos(y)))) - t_1); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = a / (3.0 * b);
t_2 = t * (z * 0.3333333333333333);
tmp = 0.0;
if (cos((y - ((z * t) / 3.0))) <= 2.0)
tmp = (2.0 * (sqrt(x) * ((sin(y) * sin(t_2)) + (cos(y) * cos(t_2))))) - t_1;
else
tmp = (2.0 * (sqrt(x) * -cos(y))) - t_1;
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[(N[Sin[y], $MachinePrecision] * N[Sin[t$95$2], $MachinePrecision]), $MachinePrecision] + N[(N[Cos[y], $MachinePrecision] * N[Cos[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * (-N[Cos[y], $MachinePrecision])), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \frac{a}{3 \cdot b}\\
t_2 := t \cdot \left(z \cdot 0.3333333333333333\right)\\
\mathbf{if}\;\cos \left(y - \frac{z \cdot t}{3}\right) \leq 2:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \left(\sin y \cdot \sin t_2 + \cos y \cdot \cos t_2\right)\right) - t_1\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \left(-\cos y\right)\right) - t_1\\
\end{array}
\end{array}
if (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3))) < 2Initial program 77.8%
associate-*l*77.8%
fma-neg77.8%
remove-double-neg77.8%
fma-neg77.8%
remove-double-neg77.8%
associate-/l*77.9%
*-commutative77.9%
Simplified77.9%
cos-diff79.8%
associate-/r/79.3%
*-commutative79.3%
div-inv79.6%
metadata-eval79.6%
associate-/r/79.6%
*-commutative79.6%
div-inv79.6%
metadata-eval79.6%
Applied egg-rr79.6%
if 2 < (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3))) Initial program 0.0%
associate-*l*0.0%
fma-neg0.0%
remove-double-neg0.0%
fma-neg0.0%
remove-double-neg0.0%
associate-/l*0.0%
*-commutative0.0%
Simplified0.0%
Taylor expanded in z around 0 49.8%
add-cube-cbrt49.8%
pow349.8%
Applied egg-rr49.8%
Taylor expanded in x around -inf 0.0%
*-commutative0.0%
pow-base-10.0%
*-lft-identity0.0%
unpow20.0%
rem-square-sqrt50.9%
neg-mul-150.9%
Simplified50.9%
Final simplification76.0%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (fma (* 2.0 (sqrt x)) (cos y) (/ (- (/ a 3.0)) b)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return fma((2.0 * sqrt(x)), cos(y), (-(a / 3.0) / b));
}
z, t = sort([z, t]) function code(x, y, z, t, a, b) return fma(Float64(2.0 * sqrt(x)), cos(y), Float64(Float64(-Float64(a / 3.0)) / b)) end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[y], $MachinePrecision] + N[((-N[(a / 3.0), $MachinePrecision]) / b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\mathsf{fma}\left(2 \cdot \sqrt{x}, \cos y, \frac{-\frac{a}{3}}{b}\right)
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
associate-*r*73.3%
fma-neg73.3%
Applied egg-rr73.3%
*-commutative73.3%
associate-/r*73.3%
Simplified73.3%
Final simplification73.3%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (/ a (* 3.0 b))))
(if (or (<= t_1 -1e-63) (not (<= t_1 1.5e-162)))
(- (* 2.0 (sqrt x)) t_1)
(* (sqrt x) (* 2.0 (cos y))))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = a / (3.0 * b);
double tmp;
if ((t_1 <= -1e-63) || !(t_1 <= 1.5e-162)) {
tmp = (2.0 * sqrt(x)) - t_1;
} else {
tmp = sqrt(x) * (2.0 * cos(y));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: tmp
t_1 = a / (3.0d0 * b)
if ((t_1 <= (-1d-63)) .or. (.not. (t_1 <= 1.5d-162))) then
tmp = (2.0d0 * sqrt(x)) - t_1
else
tmp = sqrt(x) * (2.0d0 * cos(y))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = a / (3.0 * b);
double tmp;
if ((t_1 <= -1e-63) || !(t_1 <= 1.5e-162)) {
tmp = (2.0 * Math.sqrt(x)) - t_1;
} else {
tmp = Math.sqrt(x) * (2.0 * Math.cos(y));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): t_1 = a / (3.0 * b) tmp = 0 if (t_1 <= -1e-63) or not (t_1 <= 1.5e-162): tmp = (2.0 * math.sqrt(x)) - t_1 else: tmp = math.sqrt(x) * (2.0 * math.cos(y)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(a / Float64(3.0 * b)) tmp = 0.0 if ((t_1 <= -1e-63) || !(t_1 <= 1.5e-162)) tmp = Float64(Float64(2.0 * sqrt(x)) - t_1); else tmp = Float64(sqrt(x) * Float64(2.0 * cos(y))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = a / (3.0 * b);
tmp = 0.0;
if ((t_1 <= -1e-63) || ~((t_1 <= 1.5e-162)))
tmp = (2.0 * sqrt(x)) - t_1;
else
tmp = sqrt(x) * (2.0 * cos(y));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e-63], N[Not[LessEqual[t$95$1, 1.5e-162]], $MachinePrecision]], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[Sqrt[x], $MachinePrecision] * N[(2.0 * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \frac{a}{3 \cdot b}\\
\mathbf{if}\;t_1 \leq -1 \cdot 10^{-63} \lor \neg \left(t_1 \leq 1.5 \cdot 10^{-162}\right):\\
\;\;\;\;2 \cdot \sqrt{x} - t_1\\
\mathbf{else}:\\
\;\;\;\;\sqrt{x} \cdot \left(2 \cdot \cos y\right)\\
\end{array}
\end{array}
if (/.f64 a (*.f64 b 3)) < -1.00000000000000007e-63 or 1.49999999999999999e-162 < (/.f64 a (*.f64 b 3)) Initial program 78.1%
associate-*l*78.1%
fma-neg78.1%
remove-double-neg78.1%
fma-neg78.1%
remove-double-neg78.1%
associate-/l*78.0%
*-commutative78.0%
Simplified78.0%
Taylor expanded in z around 0 86.1%
Taylor expanded in y around 0 80.1%
if -1.00000000000000007e-63 < (/.f64 a (*.f64 b 3)) < 1.49999999999999999e-162Initial program 47.5%
associate-*l*47.5%
fma-neg47.5%
remove-double-neg47.5%
fma-neg47.5%
remove-double-neg47.5%
associate-/l*48.0%
*-commutative48.0%
Simplified48.0%
Taylor expanded in z around 0 47.0%
Taylor expanded in a around 0 47.0%
*-commutative47.0%
*-commutative47.0%
associate-*l*47.0%
Simplified47.0%
Final simplification69.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (* (sqrt x) (cos y))) (* 0.3333333333333333 (/ a b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (sqrt(x) * cos(y))) - (0.3333333333333333 * (a / b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * (sqrt(x) * cos(y))) - (0.3333333333333333d0 * (a / b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (Math.sqrt(x) * Math.cos(y))) - (0.3333333333333333 * (a / b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * (math.sqrt(x) * math.cos(y))) - (0.3333333333333333 * (a / b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * Float64(sqrt(x) * cos(y))) - Float64(0.3333333333333333 * Float64(a / b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * (sqrt(x) * cos(y))) - (0.3333333333333333 * (a / b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \left(\sqrt{x} \cdot \cos y\right) - 0.3333333333333333 \cdot \frac{a}{b}
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
Taylor expanded in a around 0 73.2%
Final simplification73.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (* (sqrt x) (cos y))) (/ a (* 3.0 b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (sqrt(x) * cos(y))) - (a / (3.0 * b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * (sqrt(x) * cos(y))) - (a / (3.0d0 * b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (Math.sqrt(x) * Math.cos(y))) - (a / (3.0 * b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * (math.sqrt(x) * math.cos(y))) - (a / (3.0 * b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * Float64(sqrt(x) * cos(y))) - Float64(a / Float64(3.0 * b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * (sqrt(x) * cos(y))) - (a / (3.0 * b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \left(\sqrt{x} \cdot \cos y\right) - \frac{a}{3 \cdot b}
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
Final simplification73.3%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (sqrt x)) (/ a (* 3.0 b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * sqrt(x)) - (a / (3.0 * b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * sqrt(x)) - (a / (3.0d0 * b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * Math.sqrt(x)) - (a / (3.0 * b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * math.sqrt(x)) - (a / (3.0 * b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * sqrt(x)) - Float64(a / Float64(3.0 * b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \sqrt{x} - \frac{a}{3 \cdot b}
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
Taylor expanded in y around 0 62.2%
Final simplification62.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* (/ a b) -0.3333333333333333))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (a / b) * -0.3333333333333333;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a / b) * (-0.3333333333333333d0)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (a / b) * -0.3333333333333333;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (a / b) * -0.3333333333333333
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(a / b) * -0.3333333333333333) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (a / b) * -0.3333333333333333;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(a / b), $MachinePrecision] * -0.3333333333333333), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{a}{b} \cdot -0.3333333333333333
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
Taylor expanded in x around 0 51.5%
Final simplification51.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* a (/ -0.3333333333333333 b)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return a * (-0.3333333333333333 / b);
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = a * ((-0.3333333333333333d0) / b)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return a * (-0.3333333333333333 / b);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return a * (-0.3333333333333333 / b)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(a * Float64(-0.3333333333333333 / b)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = a * (-0.3333333333333333 / b);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(a * N[(-0.3333333333333333 / b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
a \cdot \frac{-0.3333333333333333}{b}
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
associate-*r*73.3%
fma-neg73.3%
Applied egg-rr73.3%
*-commutative73.3%
associate-/r*73.3%
Simplified73.3%
Taylor expanded in x around 0 51.5%
associate-*r/51.5%
*-commutative51.5%
*-rgt-identity51.5%
associate-*r/51.4%
associate-*l*51.4%
associate-*r/51.5%
metadata-eval51.5%
Simplified51.5%
Final simplification51.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (/ a (/ b -0.3333333333333333)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return a / (b / -0.3333333333333333);
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = a / (b / (-0.3333333333333333d0))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return a / (b / -0.3333333333333333);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return a / (b / -0.3333333333333333)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(a / Float64(b / -0.3333333333333333)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = a / (b / -0.3333333333333333);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(a / N[(b / -0.3333333333333333), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{a}{\frac{b}{-0.3333333333333333}}
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
Taylor expanded in x around 0 51.5%
expm1-log1p-u27.0%
expm1-udef22.2%
Applied egg-rr22.2%
expm1-def27.0%
expm1-log1p51.5%
*-commutative51.5%
associate-/r/51.5%
Simplified51.5%
Final simplification51.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (/ (* a -0.3333333333333333) b))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (a * -0.3333333333333333) / b;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a * (-0.3333333333333333d0)) / b
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (a * -0.3333333333333333) / b;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (a * -0.3333333333333333) / b
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(a * -0.3333333333333333) / b) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (a * -0.3333333333333333) / b;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(a * -0.3333333333333333), $MachinePrecision] / b), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{a \cdot -0.3333333333333333}{b}
\end{array}
Initial program 68.1%
associate-*l*68.1%
fma-neg68.1%
remove-double-neg68.1%
fma-neg68.1%
remove-double-neg68.1%
associate-/l*68.1%
*-commutative68.1%
Simplified68.1%
Taylor expanded in z around 0 73.3%
Taylor expanded in x around 0 51.5%
associate-*r/51.5%
*-commutative51.5%
Applied egg-rr51.5%
Final simplification51.5%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (/ (/ 0.3333333333333333 z) t))
(t_2 (/ (/ a 3.0) b))
(t_3 (* 2.0 (sqrt x))))
(if (< z -1.3793337487235141e+129)
(- (* t_3 (cos (- (/ 1.0 y) t_1))) t_2)
(if (< z 3.516290613555987e+106)
(- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) t_2)
(- (* (cos (- y t_1)) t_3) (/ (/ a b) 3.0))))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (0.3333333333333333 / z) / t;
double t_2 = (a / 3.0) / b;
double t_3 = 2.0 * sqrt(x);
double tmp;
if (z < -1.3793337487235141e+129) {
tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2;
} else if (z < 3.516290613555987e+106) {
tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2;
} else {
tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (0.3333333333333333d0 / z) / t
t_2 = (a / 3.0d0) / b
t_3 = 2.0d0 * sqrt(x)
if (z < (-1.3793337487235141d+129)) then
tmp = (t_3 * cos(((1.0d0 / y) - t_1))) - t_2
else if (z < 3.516290613555987d+106) then
tmp = ((sqrt(x) * 2.0d0) * cos((y - ((t / 3.0d0) * z)))) - t_2
else
tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (0.3333333333333333 / z) / t;
double t_2 = (a / 3.0) / b;
double t_3 = 2.0 * Math.sqrt(x);
double tmp;
if (z < -1.3793337487235141e+129) {
tmp = (t_3 * Math.cos(((1.0 / y) - t_1))) - t_2;
} else if (z < 3.516290613555987e+106) {
tmp = ((Math.sqrt(x) * 2.0) * Math.cos((y - ((t / 3.0) * z)))) - t_2;
} else {
tmp = (Math.cos((y - t_1)) * t_3) - ((a / b) / 3.0);
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = (0.3333333333333333 / z) / t t_2 = (a / 3.0) / b t_3 = 2.0 * math.sqrt(x) tmp = 0 if z < -1.3793337487235141e+129: tmp = (t_3 * math.cos(((1.0 / y) - t_1))) - t_2 elif z < 3.516290613555987e+106: tmp = ((math.sqrt(x) * 2.0) * math.cos((y - ((t / 3.0) * z)))) - t_2 else: tmp = (math.cos((y - t_1)) * t_3) - ((a / b) / 3.0) return tmp
function code(x, y, z, t, a, b) t_1 = Float64(Float64(0.3333333333333333 / z) / t) t_2 = Float64(Float64(a / 3.0) / b) t_3 = Float64(2.0 * sqrt(x)) tmp = 0.0 if (z < -1.3793337487235141e+129) tmp = Float64(Float64(t_3 * cos(Float64(Float64(1.0 / y) - t_1))) - t_2); elseif (z < 3.516290613555987e+106) tmp = Float64(Float64(Float64(sqrt(x) * 2.0) * cos(Float64(y - Float64(Float64(t / 3.0) * z)))) - t_2); else tmp = Float64(Float64(cos(Float64(y - t_1)) * t_3) - Float64(Float64(a / b) / 3.0)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = (0.3333333333333333 / z) / t; t_2 = (a / 3.0) / b; t_3 = 2.0 * sqrt(x); tmp = 0.0; if (z < -1.3793337487235141e+129) tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2; elseif (z < 3.516290613555987e+106) tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2; else tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(0.3333333333333333 / z), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[Less[z, -1.3793337487235141e+129], N[(N[(t$95$3 * N[Cos[N[(N[(1.0 / y), $MachinePrecision] - t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[z, 3.516290613555987e+106], N[(N[(N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision] * N[Cos[N[(y - N[(N[(t / 3.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], N[(N[(N[Cos[N[(y - t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] - N[(N[(a / b), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\frac{0.3333333333333333}{z}}{t}\\
t_2 := \frac{\frac{a}{3}}{b}\\
t_3 := 2 \cdot \sqrt{x}\\
\mathbf{if}\;z < -1.3793337487235141 \cdot 10^{+129}:\\
\;\;\;\;t_3 \cdot \cos \left(\frac{1}{y} - t_1\right) - t_2\\
\mathbf{elif}\;z < 3.516290613555987 \cdot 10^{+106}:\\
\;\;\;\;\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(y - \frac{t}{3} \cdot z\right) - t_2\\
\mathbf{else}:\\
\;\;\;\;\cos \left(y - t_1\right) \cdot t_3 - \frac{\frac{a}{b}}{3}\\
\end{array}
\end{array}
herbie shell --seed 2023257
(FPCore (x y z t a b)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, K"
:precision binary64
:herbie-target
(if (< z -1.3793337487235141e+129) (- (* (* 2.0 (sqrt x)) (cos (- (/ 1.0 y) (/ (/ 0.3333333333333333 z) t)))) (/ (/ a 3.0) b)) (if (< z 3.516290613555987e+106) (- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) (/ (/ a 3.0) b)) (- (* (cos (- y (/ (/ 0.3333333333333333 z) t))) (* 2.0 (sqrt x))) (/ (/ a b) 3.0))))
(- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))