
(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 (sin (* -0.3333333333333333 (* z t))))
(t_2 (* 2.0 (sqrt x)))
(t_3 (cos (* z (* t 0.3333333333333333))))
(t_4 (/ a (* 3.0 b))))
(if (<= (* t_2 (cos (- y (/ (* z t) 3.0)))) 1e+72)
(-
(*
t_2
(/
(-
(* t_3 (* t_3 (pow (cos y) 2.0)))
(* (pow (sin y) 2.0) (pow t_1 2.0)))
(fma (cos y) t_3 (* (sin y) t_1))))
t_4)
(- (* t_2 (cos y)) t_4))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = sin((-0.3333333333333333 * (z * t)));
double t_2 = 2.0 * sqrt(x);
double t_3 = cos((z * (t * 0.3333333333333333)));
double t_4 = a / (3.0 * b);
double tmp;
if ((t_2 * cos((y - ((z * t) / 3.0)))) <= 1e+72) {
tmp = (t_2 * (((t_3 * (t_3 * pow(cos(y), 2.0))) - (pow(sin(y), 2.0) * pow(t_1, 2.0))) / fma(cos(y), t_3, (sin(y) * t_1)))) - t_4;
} else {
tmp = (t_2 * cos(y)) - t_4;
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = sin(Float64(-0.3333333333333333 * Float64(z * t))) t_2 = Float64(2.0 * sqrt(x)) t_3 = cos(Float64(z * Float64(t * 0.3333333333333333))) t_4 = Float64(a / Float64(3.0 * b)) tmp = 0.0 if (Float64(t_2 * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 1e+72) tmp = Float64(Float64(t_2 * Float64(Float64(Float64(t_3 * Float64(t_3 * (cos(y) ^ 2.0))) - Float64((sin(y) ^ 2.0) * (t_1 ^ 2.0))) / fma(cos(y), t_3, Float64(sin(y) * t_1)))) - t_4); else tmp = Float64(Float64(t_2 * cos(y)) - t_4); 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[Sin[N[(-0.3333333333333333 * N[(z * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Cos[N[(z * N[(t * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$2 * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e+72], N[(N[(t$95$2 * N[(N[(N[(t$95$3 * N[(t$95$3 * N[Power[N[Cos[y], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[Power[N[Sin[y], $MachinePrecision], 2.0], $MachinePrecision] * N[Power[t$95$1, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Cos[y], $MachinePrecision] * t$95$3 + N[(N[Sin[y], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$4), $MachinePrecision], N[(N[(t$95$2 * N[Cos[y], $MachinePrecision]), $MachinePrecision] - t$95$4), $MachinePrecision]]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \sin \left(-0.3333333333333333 \cdot \left(z \cdot t\right)\right)\\
t_2 := 2 \cdot \sqrt{x}\\
t_3 := \cos \left(z \cdot \left(t \cdot 0.3333333333333333\right)\right)\\
t_4 := \frac{a}{3 \cdot b}\\
\mathbf{if}\;t_2 \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 10^{+72}:\\
\;\;\;\;t_2 \cdot \frac{t_3 \cdot \left(t_3 \cdot {\cos y}^{2}\right) - {\sin y}^{2} \cdot {t_1}^{2}}{\mathsf{fma}\left(\cos y, t_3, \sin y \cdot t_1\right)} - t_4\\
\mathbf{else}:\\
\;\;\;\;t_2 \cdot \cos y - t_4\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 9.99999999999999944e71Initial program 80.9%
*-commutative80.9%
*-commutative80.9%
associate-/l*81.1%
*-commutative81.1%
Simplified81.1%
associate-/l*80.9%
add-sqr-sqrt48.8%
pow248.8%
associate-/l*49.4%
div-inv48.4%
clear-num48.4%
div-inv48.9%
metadata-eval48.9%
Applied egg-rr48.9%
unpow248.9%
add-sqr-sqrt81.0%
cos-diff81.9%
flip-+81.9%
Applied egg-rr81.9%
Simplified82.2%
if 9.99999999999999944e71 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 48.6%
*-commutative48.6%
*-commutative48.6%
associate-/l*48.0%
*-commutative48.0%
Simplified48.0%
Taylor expanded in z around 0 73.4%
associate-*r*73.4%
*-commutative73.4%
Simplified73.4%
Final simplification80.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 (* 2.0 (sqrt x)))
(t_3 (* z (* t 0.3333333333333333))))
(if (<= (* t_2 (cos (- y (/ (* z t) 3.0)))) 1e+72)
(- (* t_2 (+ (* (cos t_3) (cos y)) (* (sin y) (sin t_3)))) t_1)
(- (* t_2 (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 = 2.0 * sqrt(x);
double t_3 = z * (t * 0.3333333333333333);
double tmp;
if ((t_2 * cos((y - ((z * t) / 3.0)))) <= 1e+72) {
tmp = (t_2 * ((cos(t_3) * cos(y)) + (sin(y) * sin(t_3)))) - t_1;
} else {
tmp = (t_2 * 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) :: t_3
real(8) :: tmp
t_1 = a / (3.0d0 * b)
t_2 = 2.0d0 * sqrt(x)
t_3 = z * (t * 0.3333333333333333d0)
if ((t_2 * cos((y - ((z * t) / 3.0d0)))) <= 1d+72) then
tmp = (t_2 * ((cos(t_3) * cos(y)) + (sin(y) * sin(t_3)))) - t_1
else
tmp = (t_2 * 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 = 2.0 * Math.sqrt(x);
double t_3 = z * (t * 0.3333333333333333);
double tmp;
if ((t_2 * Math.cos((y - ((z * t) / 3.0)))) <= 1e+72) {
tmp = (t_2 * ((Math.cos(t_3) * Math.cos(y)) + (Math.sin(y) * Math.sin(t_3)))) - t_1;
} else {
tmp = (t_2 * 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 = 2.0 * math.sqrt(x) t_3 = z * (t * 0.3333333333333333) tmp = 0 if (t_2 * math.cos((y - ((z * t) / 3.0)))) <= 1e+72: tmp = (t_2 * ((math.cos(t_3) * math.cos(y)) + (math.sin(y) * math.sin(t_3)))) - t_1 else: tmp = (t_2 * 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(2.0 * sqrt(x)) t_3 = Float64(z * Float64(t * 0.3333333333333333)) tmp = 0.0 if (Float64(t_2 * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 1e+72) tmp = Float64(Float64(t_2 * Float64(Float64(cos(t_3) * cos(y)) + Float64(sin(y) * sin(t_3)))) - t_1); else tmp = Float64(Float64(t_2 * 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 = 2.0 * sqrt(x);
t_3 = z * (t * 0.3333333333333333);
tmp = 0.0;
if ((t_2 * cos((y - ((z * t) / 3.0)))) <= 1e+72)
tmp = (t_2 * ((cos(t_3) * cos(y)) + (sin(y) * sin(t_3)))) - t_1;
else
tmp = (t_2 * 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[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(z * N[(t * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$2 * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e+72], N[(N[(t$95$2 * N[(N[(N[Cos[t$95$3], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[y], $MachinePrecision] * N[Sin[t$95$3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(t$95$2 * N[Cos[y], $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 := 2 \cdot \sqrt{x}\\
t_3 := z \cdot \left(t \cdot 0.3333333333333333\right)\\
\mathbf{if}\;t_2 \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 10^{+72}:\\
\;\;\;\;t_2 \cdot \left(\cos t_3 \cdot \cos y + \sin y \cdot \sin t_3\right) - t_1\\
\mathbf{else}:\\
\;\;\;\;t_2 \cdot \cos y - t_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 9.99999999999999944e71Initial program 80.9%
*-commutative80.9%
*-commutative80.9%
associate-/l*81.1%
*-commutative81.1%
Simplified81.1%
associate-/l*80.9%
cos-diff82.0%
associate-/l*82.1%
div-inv81.9%
clear-num82.3%
div-inv82.0%
metadata-eval82.0%
associate-/l*82.0%
div-inv81.9%
clear-num81.8%
div-inv81.9%
metadata-eval81.9%
Applied egg-rr81.9%
if 9.99999999999999944e71 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 48.6%
*-commutative48.6%
*-commutative48.6%
associate-/l*48.0%
*-commutative48.0%
Simplified48.0%
Taylor expanded in z around 0 73.4%
associate-*r*73.4%
*-commutative73.4%
Simplified73.4%
Final simplification79.8%
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)) (log1p (expm1 (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)) * log1p(expm1(cos(y)))) - (a / (3.0 * b));
}
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.log1p(Math.expm1(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.log1p(math.expm1(math.cos(y)))) - (a / (3.0 * b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(Float64(2.0 * sqrt(x)) * log1p(expm1(cos(y)))) - Float64(a / Float64(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[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Log[1 + N[(Exp[N[Cos[y], $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\left(2 \cdot \sqrt{x}\right) \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(\cos y\right)\right) - \frac{a}{3 \cdot b}
\end{array}
Initial program 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
associate-/l*72.8%
sub-neg72.8%
sub-neg72.8%
log1p-expm1-u72.8%
associate-/l*72.8%
div-inv72.7%
clear-num72.8%
div-inv72.9%
metadata-eval72.9%
Applied egg-rr72.9%
Taylor expanded in z around 0 78.1%
expm1-def78.2%
Simplified78.2%
Final simplification78.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= b 4.6e+178) (- (* 2.0 (sqrt x)) (* 0.3333333333333333 (/ a b))) (* 2.0 (* (sqrt x) (cos (+ y (* -0.3333333333333333 (* z t))))))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (b <= 4.6e+178) {
tmp = (2.0 * sqrt(x)) - (0.3333333333333333 * (a / b));
} else {
tmp = 2.0 * (sqrt(x) * cos((y + (-0.3333333333333333 * (z * t)))));
}
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) :: tmp
if (b <= 4.6d+178) then
tmp = (2.0d0 * sqrt(x)) - (0.3333333333333333d0 * (a / b))
else
tmp = 2.0d0 * (sqrt(x) * cos((y + ((-0.3333333333333333d0) * (z * t)))))
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 tmp;
if (b <= 4.6e+178) {
tmp = (2.0 * Math.sqrt(x)) - (0.3333333333333333 * (a / b));
} else {
tmp = 2.0 * (Math.sqrt(x) * Math.cos((y + (-0.3333333333333333 * (z * t)))));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): tmp = 0 if b <= 4.6e+178: tmp = (2.0 * math.sqrt(x)) - (0.3333333333333333 * (a / b)) else: tmp = 2.0 * (math.sqrt(x) * math.cos((y + (-0.3333333333333333 * (z * t))))) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) tmp = 0.0 if (b <= 4.6e+178) tmp = Float64(Float64(2.0 * sqrt(x)) - Float64(0.3333333333333333 * Float64(a / b))); else tmp = Float64(2.0 * Float64(sqrt(x) * cos(Float64(y + Float64(-0.3333333333333333 * Float64(z * t)))))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (b <= 4.6e+178)
tmp = (2.0 * sqrt(x)) - (0.3333333333333333 * (a / b));
else
tmp = 2.0 * (sqrt(x) * cos((y + (-0.3333333333333333 * (z * t)))));
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_] := If[LessEqual[b, 4.6e+178], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[N[(y + N[(-0.3333333333333333 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 4.6 \cdot 10^{+178}:\\
\;\;\;\;2 \cdot \sqrt{x} - 0.3333333333333333 \cdot \frac{a}{b}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos \left(y + -0.3333333333333333 \cdot \left(z \cdot t\right)\right)\right)\\
\end{array}
\end{array}
if b < 4.6000000000000002e178Initial program 73.6%
*-commutative73.6%
*-commutative73.6%
associate-/l*73.6%
*-commutative73.6%
Simplified73.6%
Taylor expanded in z around 0 79.2%
associate-*r*79.2%
*-commutative79.2%
Simplified79.2%
Taylor expanded in y around 0 69.6%
if 4.6000000000000002e178 < b Initial program 65.3%
*-commutative65.3%
*-commutative65.3%
*-commutative65.3%
associate-*l*65.3%
fma-neg65.3%
Simplified65.7%
Taylor expanded in a around 0 61.7%
Final simplification68.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (+ (* -0.3333333333333333 (/ a b)) (* 2.0 (* (sqrt x) (cos y)))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (-0.3333333333333333 * (a / b)) + (2.0 * (sqrt(x) * cos(y)));
}
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 = ((-0.3333333333333333d0) * (a / b)) + (2.0d0 * (sqrt(x) * cos(y)))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (-0.3333333333333333 * (a / b)) + (2.0 * (Math.sqrt(x) * Math.cos(y)));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (-0.3333333333333333 * (a / b)) + (2.0 * (math.sqrt(x) * math.cos(y)))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(-0.3333333333333333 * Float64(a / b)) + Float64(2.0 * Float64(sqrt(x) * cos(y)))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (-0.3333333333333333 * (a / b)) + (2.0 * (sqrt(x) * cos(y)));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-0.3333333333333333 \cdot \frac{a}{b} + 2 \cdot \left(\sqrt{x} \cdot \cos y\right)
\end{array}
Initial program 72.8%
fma-neg72.8%
*-commutative72.8%
associate-*l/72.8%
distribute-frac-neg72.8%
neg-mul-172.8%
*-commutative72.8%
times-frac72.8%
metadata-eval72.8%
Simplified72.8%
Taylor expanded in t around 0 78.1%
Final simplification78.1%
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(Float64(2.0 * 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[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{3 \cdot b}
\end{array}
Initial program 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in z around 0 78.2%
associate-*r*78.2%
*-commutative78.2%
Simplified78.2%
Final simplification78.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= b 4.2e+180) (- (* 2.0 (sqrt x)) (* 0.3333333333333333 (/ a b))) (* 2.0 (* (sqrt x) (cos y)))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (b <= 4.2e+180) {
tmp = (2.0 * sqrt(x)) - (0.3333333333333333 * (a / b));
} else {
tmp = 2.0 * (sqrt(x) * 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) :: tmp
if (b <= 4.2d+180) then
tmp = (2.0d0 * sqrt(x)) - (0.3333333333333333d0 * (a / b))
else
tmp = 2.0d0 * (sqrt(x) * 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 tmp;
if (b <= 4.2e+180) {
tmp = (2.0 * Math.sqrt(x)) - (0.3333333333333333 * (a / b));
} else {
tmp = 2.0 * (Math.sqrt(x) * Math.cos(y));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): tmp = 0 if b <= 4.2e+180: tmp = (2.0 * math.sqrt(x)) - (0.3333333333333333 * (a / b)) else: tmp = 2.0 * (math.sqrt(x) * math.cos(y)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) tmp = 0.0 if (b <= 4.2e+180) tmp = Float64(Float64(2.0 * sqrt(x)) - Float64(0.3333333333333333 * Float64(a / b))); else tmp = Float64(2.0 * Float64(sqrt(x) * cos(y))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (b <= 4.2e+180)
tmp = (2.0 * sqrt(x)) - (0.3333333333333333 * (a / b));
else
tmp = 2.0 * (sqrt(x) * 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_] := If[LessEqual[b, 4.2e+180], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 4.2 \cdot 10^{+180}:\\
\;\;\;\;2 \cdot \sqrt{x} - 0.3333333333333333 \cdot \frac{a}{b}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos y\right)\\
\end{array}
\end{array}
if b < 4.1999999999999999e180Initial program 73.6%
*-commutative73.6%
*-commutative73.6%
associate-/l*73.6%
*-commutative73.6%
Simplified73.6%
Taylor expanded in z around 0 79.2%
associate-*r*79.2%
*-commutative79.2%
Simplified79.2%
Taylor expanded in y around 0 69.6%
if 4.1999999999999999e180 < b Initial program 65.3%
*-commutative65.3%
*-commutative65.3%
*-commutative65.3%
associate-*l*65.3%
fma-neg65.3%
Simplified65.7%
Taylor expanded in a around 0 61.7%
Taylor expanded in t around 0 60.9%
Final simplification68.7%
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)) (* 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)) - (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)) - (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)) - (0.3333333333333333 * (a / b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * math.sqrt(x)) - (0.3333333333333333 * (a / b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * sqrt(x)) - 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)) - (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[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \sqrt{x} - 0.3333333333333333 \cdot \frac{a}{b}
\end{array}
Initial program 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in z around 0 78.2%
associate-*r*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in y around 0 66.1%
Final simplification66.1%
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) 3.0))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (-a / b) / 3.0;
}
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) / 3.0d0
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (-a / b) / 3.0;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (-a / b) / 3.0
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(Float64(-a) / b) / 3.0) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (-a / b) / 3.0;
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] / 3.0), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{\frac{-a}{b}}{3}
\end{array}
Initial program 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in z around 0 78.2%
associate-*r*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in x around 0 53.0%
*-commutative53.0%
Simplified53.0%
*-commutative53.0%
metadata-eval53.0%
distribute-lft-neg-in53.0%
clear-num53.0%
div-inv53.0%
clear-num53.0%
distribute-neg-frac53.0%
metadata-eval53.0%
div-inv53.0%
metadata-eval53.0%
Applied egg-rr53.0%
associate-/r*53.0%
metadata-eval53.0%
distribute-neg-frac53.0%
associate-/l*53.1%
*-lft-identity53.1%
distribute-neg-frac53.1%
Simplified53.1%
Final simplification53.1%
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 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in z around 0 78.2%
associate-*r*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in x around 0 53.0%
metadata-eval53.0%
distribute-lft-neg-in53.0%
metadata-eval53.0%
times-frac53.1%
associate-*l/53.0%
*-commutative53.0%
distribute-rgt-neg-in53.0%
associate-/r*53.0%
metadata-eval53.0%
distribute-neg-frac53.0%
metadata-eval53.0%
Simplified53.0%
Final simplification53.0%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* -0.3333333333333333 (/ a b)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return -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 = (-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 -0.3333333333333333 * (a / b);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return -0.3333333333333333 * (a / b)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(-0.3333333333333333 * Float64(a / b)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = -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[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-0.3333333333333333 \cdot \frac{a}{b}
\end{array}
Initial program 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in z around 0 78.2%
associate-*r*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in x around 0 53.0%
*-commutative53.0%
Simplified53.0%
Final simplification53.0%
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 -3.0)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return a / (b * -3.0);
}
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 * (-3.0d0))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return a / (b * -3.0);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return a / (b * -3.0)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(a / Float64(b * -3.0)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = a / (b * -3.0);
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 * -3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{a}{b \cdot -3}
\end{array}
Initial program 72.8%
*-commutative72.8%
*-commutative72.8%
associate-/l*72.8%
*-commutative72.8%
Simplified72.8%
Taylor expanded in z around 0 78.2%
associate-*r*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in x around 0 53.0%
metadata-eval53.0%
distribute-lft-neg-in53.0%
metadata-eval53.0%
times-frac53.1%
associate-*l/53.0%
*-commutative53.0%
distribute-rgt-neg-in53.0%
associate-/r*53.0%
metadata-eval53.0%
distribute-neg-frac53.0%
metadata-eval53.0%
Simplified53.0%
associate-*r/53.0%
metadata-eval53.0%
div-inv53.1%
associate-/l/53.1%
Applied egg-rr53.1%
Final simplification53.1%
(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 2023308
(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))))