
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* z (* t -9.0))))
(*
a_s
(if (<= (* a_m 2.0) 1e+66)
(/ (fma x y t_1) (* a_m 2.0))
(+ (* t_1 (/ 0.5 a_m)) (* x (* y (/ 0.5 a_m))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = z * (t * -9.0);
double tmp;
if ((a_m * 2.0) <= 1e+66) {
tmp = fma(x, y, t_1) / (a_m * 2.0);
} else {
tmp = (t_1 * (0.5 / a_m)) + (x * (y * (0.5 / a_m)));
}
return a_s * tmp;
}
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(z * Float64(t * -9.0)) tmp = 0.0 if (Float64(a_m * 2.0) <= 1e+66) tmp = Float64(fma(x, y, t_1) / Float64(a_m * 2.0)); else tmp = Float64(Float64(t_1 * Float64(0.5 / a_m)) + Float64(x * Float64(y * Float64(0.5 / a_m)))); end return Float64(a_s * tmp) end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(a$95$m * 2.0), $MachinePrecision], 1e+66], N[(N[(x * y + t$95$1), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := z \cdot \left(t \cdot -9\right)\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;a\_m \cdot 2 \leq 10^{+66}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, t\_1\right)}{a\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{0.5}{a\_m} + x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 9.99999999999999945e65Initial program 94.5%
div-sub91.5%
*-commutative91.5%
div-sub94.5%
cancel-sign-sub-inv94.5%
*-commutative94.5%
fma-define94.5%
distribute-rgt-neg-in94.5%
associate-*r*94.5%
distribute-lft-neg-in94.5%
*-commutative94.5%
distribute-rgt-neg-in94.5%
metadata-eval94.5%
Simplified94.5%
if 9.99999999999999945e65 < (*.f64 a #s(literal 2 binary64)) Initial program 79.4%
clear-num78.2%
inv-pow78.2%
*-commutative78.2%
associate-/l*78.2%
fma-neg78.2%
*-commutative78.2%
distribute-rgt-neg-in78.2%
distribute-rgt-neg-in78.2%
metadata-eval78.2%
Applied egg-rr78.2%
unpow-178.2%
associate-/r*78.2%
metadata-eval78.2%
associate-*r*78.3%
*-commutative78.3%
metadata-eval78.3%
distribute-lft-neg-in78.3%
distribute-lft-neg-in78.3%
metadata-eval78.3%
associate-*r*78.2%
*-commutative78.2%
*-commutative78.2%
Simplified78.2%
associate-/r/79.3%
fma-undefine79.3%
distribute-lft-in79.3%
*-commutative79.3%
associate-*l*91.5%
Applied egg-rr91.5%
Final simplification93.9%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= (* x y) -5e+145)
(* x (* y (/ 0.5 a_m)))
(if (<= (* x y) -2e+57)
(/ (* z (* t -9.0)) (* a_m 2.0))
(if (<= (* x y) -2e-32)
(* (/ 0.5 a_m) (* x y))
(if (<= (* x y) 5e-30)
(/ (* z -4.5) (/ a_m t))
(* x (/ (* y 0.5) a_m))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z * (t * -9.0)) / (a_m * 2.0);
} else if ((x * y) <= -2e-32) {
tmp = (0.5 / a_m) * (x * y);
} else if ((x * y) <= 5e-30) {
tmp = (z * -4.5) / (a_m / t);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: tmp
if ((x * y) <= (-5d+145)) then
tmp = x * (y * (0.5d0 / a_m))
else if ((x * y) <= (-2d+57)) then
tmp = (z * (t * (-9.0d0))) / (a_m * 2.0d0)
else if ((x * y) <= (-2d-32)) then
tmp = (0.5d0 / a_m) * (x * y)
else if ((x * y) <= 5d-30) then
tmp = (z * (-4.5d0)) / (a_m / t)
else
tmp = x * ((y * 0.5d0) / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z * (t * -9.0)) / (a_m * 2.0);
} else if ((x * y) <= -2e-32) {
tmp = (0.5 / a_m) * (x * y);
} else if ((x * y) <= 5e-30) {
tmp = (z * -4.5) / (a_m / t);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if (x * y) <= -5e+145: tmp = x * (y * (0.5 / a_m)) elif (x * y) <= -2e+57: tmp = (z * (t * -9.0)) / (a_m * 2.0) elif (x * y) <= -2e-32: tmp = (0.5 / a_m) * (x * y) elif (x * y) <= 5e-30: tmp = (z * -4.5) / (a_m / t) else: tmp = x * ((y * 0.5) / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (Float64(x * y) <= -5e+145) tmp = Float64(x * Float64(y * Float64(0.5 / a_m))); elseif (Float64(x * y) <= -2e+57) tmp = Float64(Float64(z * Float64(t * -9.0)) / Float64(a_m * 2.0)); elseif (Float64(x * y) <= -2e-32) tmp = Float64(Float64(0.5 / a_m) * Float64(x * y)); elseif (Float64(x * y) <= 5e-30) tmp = Float64(Float64(z * -4.5) / Float64(a_m / t)); else tmp = Float64(x * Float64(Float64(y * 0.5) / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if ((x * y) <= -5e+145)
tmp = x * (y * (0.5 / a_m));
elseif ((x * y) <= -2e+57)
tmp = (z * (t * -9.0)) / (a_m * 2.0);
elseif ((x * y) <= -2e-32)
tmp = (0.5 / a_m) * (x * y);
elseif ((x * y) <= 5e-30)
tmp = (z * -4.5) / (a_m / t);
else
tmp = x * ((y * 0.5) / a_m);
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(x * y), $MachinePrecision], -5e+145], N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e+57], N[(N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e-32], N[(N[(0.5 / a$95$m), $MachinePrecision] * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-30], N[(N[(z * -4.5), $MachinePrecision] / N[(a$95$m / t), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+145}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{+57}:\\
\;\;\;\;\frac{z \cdot \left(t \cdot -9\right)}{a\_m \cdot 2}\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-32}:\\
\;\;\;\;\frac{0.5}{a\_m} \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-30}:\\
\;\;\;\;\frac{z \cdot -4.5}{\frac{a\_m}{t}}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a\_m}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999967e145Initial program 88.6%
clear-num88.6%
inv-pow88.6%
*-commutative88.6%
associate-/l*88.6%
fma-neg88.6%
*-commutative88.6%
distribute-rgt-neg-in88.6%
distribute-rgt-neg-in88.6%
metadata-eval88.6%
Applied egg-rr88.6%
unpow-188.6%
associate-/r*88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
metadata-eval88.6%
distribute-lft-neg-in88.6%
distribute-lft-neg-in88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
*-commutative88.6%
Simplified88.6%
Taylor expanded in x around inf 72.2%
*-commutative72.2%
associate-*l/72.2%
associate-*r*72.2%
associate-/l*83.4%
Simplified83.4%
associate-*r/83.3%
*-commutative83.3%
Applied egg-rr83.3%
if -4.99999999999999967e145 < (*.f64 x y) < -2.0000000000000001e57Initial program 99.9%
Taylor expanded in x around 0 77.6%
*-commutative77.6%
*-commutative77.6%
associate-*r*77.7%
Simplified77.7%
if -2.0000000000000001e57 < (*.f64 x y) < -2.00000000000000011e-32Initial program 99.6%
div-inv99.6%
fma-neg99.7%
*-commutative99.7%
distribute-rgt-neg-in99.7%
distribute-rgt-neg-in99.7%
metadata-eval99.7%
*-commutative99.7%
associate-/r*99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in x around inf 75.4%
if -2.00000000000000011e-32 < (*.f64 x y) < 4.99999999999999972e-30Initial program 94.2%
Taylor expanded in x around 0 83.6%
div-inv83.6%
*-commutative83.6%
associate-*l*79.2%
div-inv79.2%
associate-*l*79.2%
clear-num79.3%
un-div-inv79.9%
*-commutative79.9%
Applied egg-rr79.9%
if 4.99999999999999972e-30 < (*.f64 x y) Initial program 84.8%
Taylor expanded in x around inf 73.7%
*-commutative73.7%
associate-/l*76.3%
associate-*r*76.3%
*-commutative76.3%
associate-*r/76.3%
Simplified76.3%
Final simplification79.2%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= (* x y) -5e+145)
(* x (* y (/ 0.5 a_m)))
(if (<= (* x y) -2e+57)
(* (/ z a_m) (* t -4.5))
(if (<= (* x y) -2e-32)
(* (/ 0.5 a_m) (* x y))
(if (<= (* x y) 5e-30)
(/ (* z -4.5) (/ a_m t))
(* x (/ (* y 0.5) a_m))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z / a_m) * (t * -4.5);
} else if ((x * y) <= -2e-32) {
tmp = (0.5 / a_m) * (x * y);
} else if ((x * y) <= 5e-30) {
tmp = (z * -4.5) / (a_m / t);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: tmp
if ((x * y) <= (-5d+145)) then
tmp = x * (y * (0.5d0 / a_m))
else if ((x * y) <= (-2d+57)) then
tmp = (z / a_m) * (t * (-4.5d0))
else if ((x * y) <= (-2d-32)) then
tmp = (0.5d0 / a_m) * (x * y)
else if ((x * y) <= 5d-30) then
tmp = (z * (-4.5d0)) / (a_m / t)
else
tmp = x * ((y * 0.5d0) / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z / a_m) * (t * -4.5);
} else if ((x * y) <= -2e-32) {
tmp = (0.5 / a_m) * (x * y);
} else if ((x * y) <= 5e-30) {
tmp = (z * -4.5) / (a_m / t);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if (x * y) <= -5e+145: tmp = x * (y * (0.5 / a_m)) elif (x * y) <= -2e+57: tmp = (z / a_m) * (t * -4.5) elif (x * y) <= -2e-32: tmp = (0.5 / a_m) * (x * y) elif (x * y) <= 5e-30: tmp = (z * -4.5) / (a_m / t) else: tmp = x * ((y * 0.5) / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (Float64(x * y) <= -5e+145) tmp = Float64(x * Float64(y * Float64(0.5 / a_m))); elseif (Float64(x * y) <= -2e+57) tmp = Float64(Float64(z / a_m) * Float64(t * -4.5)); elseif (Float64(x * y) <= -2e-32) tmp = Float64(Float64(0.5 / a_m) * Float64(x * y)); elseif (Float64(x * y) <= 5e-30) tmp = Float64(Float64(z * -4.5) / Float64(a_m / t)); else tmp = Float64(x * Float64(Float64(y * 0.5) / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if ((x * y) <= -5e+145)
tmp = x * (y * (0.5 / a_m));
elseif ((x * y) <= -2e+57)
tmp = (z / a_m) * (t * -4.5);
elseif ((x * y) <= -2e-32)
tmp = (0.5 / a_m) * (x * y);
elseif ((x * y) <= 5e-30)
tmp = (z * -4.5) / (a_m / t);
else
tmp = x * ((y * 0.5) / a_m);
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(x * y), $MachinePrecision], -5e+145], N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e+57], N[(N[(z / a$95$m), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e-32], N[(N[(0.5 / a$95$m), $MachinePrecision] * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-30], N[(N[(z * -4.5), $MachinePrecision] / N[(a$95$m / t), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+145}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{+57}:\\
\;\;\;\;\frac{z}{a\_m} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-32}:\\
\;\;\;\;\frac{0.5}{a\_m} \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-30}:\\
\;\;\;\;\frac{z \cdot -4.5}{\frac{a\_m}{t}}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a\_m}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999967e145Initial program 88.6%
clear-num88.6%
inv-pow88.6%
*-commutative88.6%
associate-/l*88.6%
fma-neg88.6%
*-commutative88.6%
distribute-rgt-neg-in88.6%
distribute-rgt-neg-in88.6%
metadata-eval88.6%
Applied egg-rr88.6%
unpow-188.6%
associate-/r*88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
metadata-eval88.6%
distribute-lft-neg-in88.6%
distribute-lft-neg-in88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
*-commutative88.6%
Simplified88.6%
Taylor expanded in x around inf 72.2%
*-commutative72.2%
associate-*l/72.2%
associate-*r*72.2%
associate-/l*83.4%
Simplified83.4%
associate-*r/83.3%
*-commutative83.3%
Applied egg-rr83.3%
if -4.99999999999999967e145 < (*.f64 x y) < -2.0000000000000001e57Initial program 99.9%
Taylor expanded in x around 0 77.6%
*-commutative77.6%
associate-*r*77.8%
Simplified77.8%
associate-*r*77.6%
times-frac77.4%
metadata-eval77.4%
*-commutative77.4%
associate-/l*77.4%
associate-*r*77.7%
Applied egg-rr77.7%
if -2.0000000000000001e57 < (*.f64 x y) < -2.00000000000000011e-32Initial program 99.6%
div-inv99.6%
fma-neg99.7%
*-commutative99.7%
distribute-rgt-neg-in99.7%
distribute-rgt-neg-in99.7%
metadata-eval99.7%
*-commutative99.7%
associate-/r*99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in x around inf 75.4%
if -2.00000000000000011e-32 < (*.f64 x y) < 4.99999999999999972e-30Initial program 94.2%
Taylor expanded in x around 0 83.6%
div-inv83.6%
*-commutative83.6%
associate-*l*79.2%
div-inv79.2%
associate-*l*79.2%
clear-num79.3%
un-div-inv79.9%
*-commutative79.9%
Applied egg-rr79.9%
if 4.99999999999999972e-30 < (*.f64 x y) Initial program 84.8%
Taylor expanded in x around inf 73.7%
*-commutative73.7%
associate-/l*76.3%
associate-*r*76.3%
*-commutative76.3%
associate-*r/76.3%
Simplified76.3%
Final simplification79.2%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= (* x y) -5e+145)
(* x (* y (/ 0.5 a_m)))
(if (<= (* x y) -2e+57)
(* (/ z a_m) (* t -4.5))
(if (<= (* x y) -2e-9)
(/ 0.5 (/ a_m (* x y)))
(if (<= (* x y) 5e-30)
(* -4.5 (/ (* z t) a_m))
(* x (/ (* y 0.5) a_m))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z / a_m) * (t * -4.5);
} else if ((x * y) <= -2e-9) {
tmp = 0.5 / (a_m / (x * y));
} else if ((x * y) <= 5e-30) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: tmp
if ((x * y) <= (-5d+145)) then
tmp = x * (y * (0.5d0 / a_m))
else if ((x * y) <= (-2d+57)) then
tmp = (z / a_m) * (t * (-4.5d0))
else if ((x * y) <= (-2d-9)) then
tmp = 0.5d0 / (a_m / (x * y))
else if ((x * y) <= 5d-30) then
tmp = (-4.5d0) * ((z * t) / a_m)
else
tmp = x * ((y * 0.5d0) / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z / a_m) * (t * -4.5);
} else if ((x * y) <= -2e-9) {
tmp = 0.5 / (a_m / (x * y));
} else if ((x * y) <= 5e-30) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if (x * y) <= -5e+145: tmp = x * (y * (0.5 / a_m)) elif (x * y) <= -2e+57: tmp = (z / a_m) * (t * -4.5) elif (x * y) <= -2e-9: tmp = 0.5 / (a_m / (x * y)) elif (x * y) <= 5e-30: tmp = -4.5 * ((z * t) / a_m) else: tmp = x * ((y * 0.5) / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (Float64(x * y) <= -5e+145) tmp = Float64(x * Float64(y * Float64(0.5 / a_m))); elseif (Float64(x * y) <= -2e+57) tmp = Float64(Float64(z / a_m) * Float64(t * -4.5)); elseif (Float64(x * y) <= -2e-9) tmp = Float64(0.5 / Float64(a_m / Float64(x * y))); elseif (Float64(x * y) <= 5e-30) tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); else tmp = Float64(x * Float64(Float64(y * 0.5) / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if ((x * y) <= -5e+145)
tmp = x * (y * (0.5 / a_m));
elseif ((x * y) <= -2e+57)
tmp = (z / a_m) * (t * -4.5);
elseif ((x * y) <= -2e-9)
tmp = 0.5 / (a_m / (x * y));
elseif ((x * y) <= 5e-30)
tmp = -4.5 * ((z * t) / a_m);
else
tmp = x * ((y * 0.5) / a_m);
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(x * y), $MachinePrecision], -5e+145], N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e+57], N[(N[(z / a$95$m), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e-9], N[(0.5 / N[(a$95$m / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-30], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+145}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{+57}:\\
\;\;\;\;\frac{z}{a\_m} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-9}:\\
\;\;\;\;\frac{0.5}{\frac{a\_m}{x \cdot y}}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-30}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a\_m}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999967e145Initial program 88.6%
clear-num88.6%
inv-pow88.6%
*-commutative88.6%
associate-/l*88.6%
fma-neg88.6%
*-commutative88.6%
distribute-rgt-neg-in88.6%
distribute-rgt-neg-in88.6%
metadata-eval88.6%
Applied egg-rr88.6%
unpow-188.6%
associate-/r*88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
metadata-eval88.6%
distribute-lft-neg-in88.6%
distribute-lft-neg-in88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
*-commutative88.6%
Simplified88.6%
Taylor expanded in x around inf 72.2%
*-commutative72.2%
associate-*l/72.2%
associate-*r*72.2%
associate-/l*83.4%
Simplified83.4%
associate-*r/83.3%
*-commutative83.3%
Applied egg-rr83.3%
if -4.99999999999999967e145 < (*.f64 x y) < -2.0000000000000001e57Initial program 99.9%
Taylor expanded in x around 0 77.6%
*-commutative77.6%
associate-*r*77.8%
Simplified77.8%
associate-*r*77.6%
times-frac77.4%
metadata-eval77.4%
*-commutative77.4%
associate-/l*77.4%
associate-*r*77.7%
Applied egg-rr77.7%
if -2.0000000000000001e57 < (*.f64 x y) < -2.00000000000000012e-9Initial program 99.2%
clear-num99.5%
inv-pow99.5%
*-commutative99.5%
associate-/l*99.5%
fma-neg99.5%
*-commutative99.5%
distribute-rgt-neg-in99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
Applied egg-rr99.5%
unpow-199.5%
associate-/r*99.5%
metadata-eval99.5%
associate-*r*99.5%
*-commutative99.5%
metadata-eval99.5%
distribute-lft-neg-in99.5%
distribute-lft-neg-in99.5%
metadata-eval99.5%
associate-*r*99.5%
*-commutative99.5%
*-commutative99.5%
Simplified99.5%
Taylor expanded in x around inf 94.1%
if -2.00000000000000012e-9 < (*.f64 x y) < 4.99999999999999972e-30Initial program 94.5%
Taylor expanded in x around 0 82.5%
if 4.99999999999999972e-30 < (*.f64 x y) Initial program 84.8%
Taylor expanded in x around inf 73.7%
*-commutative73.7%
associate-/l*76.3%
associate-*r*76.3%
*-commutative76.3%
associate-*r/76.3%
Simplified76.3%
Final simplification81.0%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= (* x y) -5e+145)
(* x (* y (/ 0.5 a_m)))
(if (<= (* x y) -2e+57)
(* (/ z a_m) (* t -4.5))
(if (<= (* x y) -2e-9)
(* (/ 0.5 a_m) (* x y))
(if (<= (* x y) 5e-30)
(* -4.5 (/ (* z t) a_m))
(* x (/ (* y 0.5) a_m))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z / a_m) * (t * -4.5);
} else if ((x * y) <= -2e-9) {
tmp = (0.5 / a_m) * (x * y);
} else if ((x * y) <= 5e-30) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: tmp
if ((x * y) <= (-5d+145)) then
tmp = x * (y * (0.5d0 / a_m))
else if ((x * y) <= (-2d+57)) then
tmp = (z / a_m) * (t * (-4.5d0))
else if ((x * y) <= (-2d-9)) then
tmp = (0.5d0 / a_m) * (x * y)
else if ((x * y) <= 5d-30) then
tmp = (-4.5d0) * ((z * t) / a_m)
else
tmp = x * ((y * 0.5d0) / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((x * y) <= -5e+145) {
tmp = x * (y * (0.5 / a_m));
} else if ((x * y) <= -2e+57) {
tmp = (z / a_m) * (t * -4.5);
} else if ((x * y) <= -2e-9) {
tmp = (0.5 / a_m) * (x * y);
} else if ((x * y) <= 5e-30) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = x * ((y * 0.5) / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if (x * y) <= -5e+145: tmp = x * (y * (0.5 / a_m)) elif (x * y) <= -2e+57: tmp = (z / a_m) * (t * -4.5) elif (x * y) <= -2e-9: tmp = (0.5 / a_m) * (x * y) elif (x * y) <= 5e-30: tmp = -4.5 * ((z * t) / a_m) else: tmp = x * ((y * 0.5) / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (Float64(x * y) <= -5e+145) tmp = Float64(x * Float64(y * Float64(0.5 / a_m))); elseif (Float64(x * y) <= -2e+57) tmp = Float64(Float64(z / a_m) * Float64(t * -4.5)); elseif (Float64(x * y) <= -2e-9) tmp = Float64(Float64(0.5 / a_m) * Float64(x * y)); elseif (Float64(x * y) <= 5e-30) tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); else tmp = Float64(x * Float64(Float64(y * 0.5) / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if ((x * y) <= -5e+145)
tmp = x * (y * (0.5 / a_m));
elseif ((x * y) <= -2e+57)
tmp = (z / a_m) * (t * -4.5);
elseif ((x * y) <= -2e-9)
tmp = (0.5 / a_m) * (x * y);
elseif ((x * y) <= 5e-30)
tmp = -4.5 * ((z * t) / a_m);
else
tmp = x * ((y * 0.5) / a_m);
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(x * y), $MachinePrecision], -5e+145], N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e+57], N[(N[(z / a$95$m), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e-9], N[(N[(0.5 / a$95$m), $MachinePrecision] * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-30], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+145}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{+57}:\\
\;\;\;\;\frac{z}{a\_m} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-9}:\\
\;\;\;\;\frac{0.5}{a\_m} \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-30}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a\_m}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999967e145Initial program 88.6%
clear-num88.6%
inv-pow88.6%
*-commutative88.6%
associate-/l*88.6%
fma-neg88.6%
*-commutative88.6%
distribute-rgt-neg-in88.6%
distribute-rgt-neg-in88.6%
metadata-eval88.6%
Applied egg-rr88.6%
unpow-188.6%
associate-/r*88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
metadata-eval88.6%
distribute-lft-neg-in88.6%
distribute-lft-neg-in88.6%
metadata-eval88.6%
associate-*r*88.6%
*-commutative88.6%
*-commutative88.6%
Simplified88.6%
Taylor expanded in x around inf 72.2%
*-commutative72.2%
associate-*l/72.2%
associate-*r*72.2%
associate-/l*83.4%
Simplified83.4%
associate-*r/83.3%
*-commutative83.3%
Applied egg-rr83.3%
if -4.99999999999999967e145 < (*.f64 x y) < -2.0000000000000001e57Initial program 99.9%
Taylor expanded in x around 0 77.6%
*-commutative77.6%
associate-*r*77.8%
Simplified77.8%
associate-*r*77.6%
times-frac77.4%
metadata-eval77.4%
*-commutative77.4%
associate-/l*77.4%
associate-*r*77.7%
Applied egg-rr77.7%
if -2.0000000000000001e57 < (*.f64 x y) < -2.00000000000000012e-9Initial program 99.2%
div-inv99.2%
fma-neg99.5%
*-commutative99.5%
distribute-rgt-neg-in99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
*-commutative99.5%
associate-/r*99.5%
metadata-eval99.5%
Applied egg-rr99.5%
Taylor expanded in x around inf 93.9%
if -2.00000000000000012e-9 < (*.f64 x y) < 4.99999999999999972e-30Initial program 94.5%
Taylor expanded in x around 0 82.5%
if 4.99999999999999972e-30 < (*.f64 x y) Initial program 84.8%
Taylor expanded in x around inf 73.7%
*-commutative73.7%
associate-/l*76.3%
associate-*r*76.3%
*-commutative76.3%
associate-*r/76.3%
Simplified76.3%
Final simplification81.0%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* x (* y (/ 0.5 a_m)))))
(*
a_s
(if (<= x -5.6e+134)
t_1
(if (<= x -4.5e+118)
(* t (* -4.5 (/ z a_m)))
(if (or (<= x -5e+88) (not (<= x 1.85e-119)))
t_1
(* -4.5 (/ (* z t) a_m))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = x * (y * (0.5 / a_m));
double tmp;
if (x <= -5.6e+134) {
tmp = t_1;
} else if (x <= -4.5e+118) {
tmp = t * (-4.5 * (z / a_m));
} else if ((x <= -5e+88) || !(x <= 1.85e-119)) {
tmp = t_1;
} else {
tmp = -4.5 * ((z * t) / a_m);
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: t_1
real(8) :: tmp
t_1 = x * (y * (0.5d0 / a_m))
if (x <= (-5.6d+134)) then
tmp = t_1
else if (x <= (-4.5d+118)) then
tmp = t * ((-4.5d0) * (z / a_m))
else if ((x <= (-5d+88)) .or. (.not. (x <= 1.85d-119))) then
tmp = t_1
else
tmp = (-4.5d0) * ((z * t) / a_m)
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = x * (y * (0.5 / a_m));
double tmp;
if (x <= -5.6e+134) {
tmp = t_1;
} else if (x <= -4.5e+118) {
tmp = t * (-4.5 * (z / a_m));
} else if ((x <= -5e+88) || !(x <= 1.85e-119)) {
tmp = t_1;
} else {
tmp = -4.5 * ((z * t) / a_m);
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): t_1 = x * (y * (0.5 / a_m)) tmp = 0 if x <= -5.6e+134: tmp = t_1 elif x <= -4.5e+118: tmp = t * (-4.5 * (z / a_m)) elif (x <= -5e+88) or not (x <= 1.85e-119): tmp = t_1 else: tmp = -4.5 * ((z * t) / a_m) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(x * Float64(y * Float64(0.5 / a_m))) tmp = 0.0 if (x <= -5.6e+134) tmp = t_1; elseif (x <= -4.5e+118) tmp = Float64(t * Float64(-4.5 * Float64(z / a_m))); elseif ((x <= -5e+88) || !(x <= 1.85e-119)) tmp = t_1; else tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
t_1 = x * (y * (0.5 / a_m));
tmp = 0.0;
if (x <= -5.6e+134)
tmp = t_1;
elseif (x <= -4.5e+118)
tmp = t * (-4.5 * (z / a_m));
elseif ((x <= -5e+88) || ~((x <= 1.85e-119)))
tmp = t_1;
else
tmp = -4.5 * ((z * t) / a_m);
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[x, -5.6e+134], t$95$1, If[LessEqual[x, -4.5e+118], N[(t * N[(-4.5 * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[x, -5e+88], N[Not[LessEqual[x, 1.85e-119]], $MachinePrecision]], t$95$1, N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \leq -5.6 \cdot 10^{+134}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -4.5 \cdot 10^{+118}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a\_m}\right)\\
\mathbf{elif}\;x \leq -5 \cdot 10^{+88} \lor \neg \left(x \leq 1.85 \cdot 10^{-119}\right):\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\end{array}
\end{array}
\end{array}
if x < -5.5999999999999997e134 or -4.50000000000000002e118 < x < -4.99999999999999997e88 or 1.8500000000000001e-119 < x Initial program 88.6%
clear-num88.1%
inv-pow88.2%
*-commutative88.2%
associate-/l*88.2%
fma-neg88.2%
*-commutative88.2%
distribute-rgt-neg-in88.2%
distribute-rgt-neg-in88.2%
metadata-eval88.2%
Applied egg-rr88.2%
unpow-188.2%
associate-/r*88.2%
metadata-eval88.2%
associate-*r*88.2%
*-commutative88.2%
metadata-eval88.2%
distribute-lft-neg-in88.2%
distribute-lft-neg-in88.2%
metadata-eval88.2%
associate-*r*88.2%
*-commutative88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in x around inf 61.0%
*-commutative61.0%
associate-*l/61.0%
associate-*r*61.0%
associate-/l*69.1%
Simplified69.1%
associate-*r/69.1%
*-commutative69.1%
Applied egg-rr69.1%
if -5.5999999999999997e134 < x < -4.50000000000000002e118Initial program 53.1%
Taylor expanded in x around 0 27.1%
*-commutative27.1%
associate-*r*27.5%
Simplified27.5%
associate-/l*50.6%
*-commutative50.6%
*-commutative50.6%
times-frac50.3%
metadata-eval50.3%
Applied egg-rr50.3%
if -4.99999999999999997e88 < x < 1.8500000000000001e-119Initial program 94.7%
Taylor expanded in x around 0 67.9%
Final simplification68.2%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* x (/ (* y 0.5) a_m))))
(*
a_s
(if (<= x -4.9e+134)
t_1
(if (<= x -4.5e+118)
(* t (* -4.5 (/ z a_m)))
(if (<= x -7e+91)
t_1
(if (<= x 4.6e-121)
(* z (/ (* t -4.5) a_m))
(* x (* y (/ 0.5 a_m))))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = x * ((y * 0.5) / a_m);
double tmp;
if (x <= -4.9e+134) {
tmp = t_1;
} else if (x <= -4.5e+118) {
tmp = t * (-4.5 * (z / a_m));
} else if (x <= -7e+91) {
tmp = t_1;
} else if (x <= 4.6e-121) {
tmp = z * ((t * -4.5) / a_m);
} else {
tmp = x * (y * (0.5 / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: t_1
real(8) :: tmp
t_1 = x * ((y * 0.5d0) / a_m)
if (x <= (-4.9d+134)) then
tmp = t_1
else if (x <= (-4.5d+118)) then
tmp = t * ((-4.5d0) * (z / a_m))
else if (x <= (-7d+91)) then
tmp = t_1
else if (x <= 4.6d-121) then
tmp = z * ((t * (-4.5d0)) / a_m)
else
tmp = x * (y * (0.5d0 / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = x * ((y * 0.5) / a_m);
double tmp;
if (x <= -4.9e+134) {
tmp = t_1;
} else if (x <= -4.5e+118) {
tmp = t * (-4.5 * (z / a_m));
} else if (x <= -7e+91) {
tmp = t_1;
} else if (x <= 4.6e-121) {
tmp = z * ((t * -4.5) / a_m);
} else {
tmp = x * (y * (0.5 / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): t_1 = x * ((y * 0.5) / a_m) tmp = 0 if x <= -4.9e+134: tmp = t_1 elif x <= -4.5e+118: tmp = t * (-4.5 * (z / a_m)) elif x <= -7e+91: tmp = t_1 elif x <= 4.6e-121: tmp = z * ((t * -4.5) / a_m) else: tmp = x * (y * (0.5 / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(x * Float64(Float64(y * 0.5) / a_m)) tmp = 0.0 if (x <= -4.9e+134) tmp = t_1; elseif (x <= -4.5e+118) tmp = Float64(t * Float64(-4.5 * Float64(z / a_m))); elseif (x <= -7e+91) tmp = t_1; elseif (x <= 4.6e-121) tmp = Float64(z * Float64(Float64(t * -4.5) / a_m)); else tmp = Float64(x * Float64(y * Float64(0.5 / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
t_1 = x * ((y * 0.5) / a_m);
tmp = 0.0;
if (x <= -4.9e+134)
tmp = t_1;
elseif (x <= -4.5e+118)
tmp = t * (-4.5 * (z / a_m));
elseif (x <= -7e+91)
tmp = t_1;
elseif (x <= 4.6e-121)
tmp = z * ((t * -4.5) / a_m);
else
tmp = x * (y * (0.5 / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(x * N[(N[(y * 0.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[x, -4.9e+134], t$95$1, If[LessEqual[x, -4.5e+118], N[(t * N[(-4.5 * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -7e+91], t$95$1, If[LessEqual[x, 4.6e-121], N[(z * N[(N[(t * -4.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := x \cdot \frac{y \cdot 0.5}{a\_m}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \leq -4.9 \cdot 10^{+134}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -4.5 \cdot 10^{+118}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a\_m}\right)\\
\mathbf{elif}\;x \leq -7 \cdot 10^{+91}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 4.6 \cdot 10^{-121}:\\
\;\;\;\;z \cdot \frac{t \cdot -4.5}{a\_m}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\end{array}
\end{array}
\end{array}
if x < -4.89999999999999996e134 or -4.50000000000000002e118 < x < -7.00000000000000001e91Initial program 82.8%
Taylor expanded in x around inf 65.0%
*-commutative65.0%
associate-/l*77.2%
associate-*r*77.2%
*-commutative77.2%
associate-*r/77.2%
Simplified77.2%
if -4.89999999999999996e134 < x < -4.50000000000000002e118Initial program 53.1%
Taylor expanded in x around 0 27.1%
*-commutative27.1%
associate-*r*27.5%
Simplified27.5%
associate-/l*50.6%
*-commutative50.6%
*-commutative50.6%
times-frac50.3%
metadata-eval50.3%
Applied egg-rr50.3%
if -7.00000000000000001e91 < x < 4.60000000000000025e-121Initial program 94.7%
Taylor expanded in x around 0 67.9%
associate-*r/67.9%
associate-*r*68.0%
associate-*l/63.1%
associate-*r/63.1%
*-commutative63.1%
associate-*r/63.1%
Simplified63.1%
if 4.60000000000000025e-121 < x Initial program 92.0%
clear-num91.5%
inv-pow91.5%
*-commutative91.5%
associate-/l*91.5%
fma-neg91.6%
*-commutative91.6%
distribute-rgt-neg-in91.6%
distribute-rgt-neg-in91.6%
metadata-eval91.6%
Applied egg-rr91.6%
unpow-191.6%
associate-/r*91.6%
metadata-eval91.6%
associate-*r*91.6%
*-commutative91.6%
metadata-eval91.6%
distribute-lft-neg-in91.6%
distribute-lft-neg-in91.6%
metadata-eval91.6%
associate-*r*91.6%
*-commutative91.6%
*-commutative91.6%
Simplified91.6%
Taylor expanded in x around inf 58.7%
*-commutative58.7%
associate-*l/58.7%
associate-*r*58.7%
associate-/l*64.4%
Simplified64.4%
associate-*r/64.3%
*-commutative64.3%
Applied egg-rr64.3%
Final simplification65.7%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* x (/ (* y 0.5) a_m))))
(*
a_s
(if (<= x -1.1e+135)
t_1
(if (<= x -4.5e+118)
(* t (* -4.5 (/ z a_m)))
(if (<= x -5.7e+88)
t_1
(if (<= x 1.3e-119)
(* -4.5 (/ (* z t) a_m))
(* x (* y (/ 0.5 a_m))))))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = x * ((y * 0.5) / a_m);
double tmp;
if (x <= -1.1e+135) {
tmp = t_1;
} else if (x <= -4.5e+118) {
tmp = t * (-4.5 * (z / a_m));
} else if (x <= -5.7e+88) {
tmp = t_1;
} else if (x <= 1.3e-119) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = x * (y * (0.5 / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: t_1
real(8) :: tmp
t_1 = x * ((y * 0.5d0) / a_m)
if (x <= (-1.1d+135)) then
tmp = t_1
else if (x <= (-4.5d+118)) then
tmp = t * ((-4.5d0) * (z / a_m))
else if (x <= (-5.7d+88)) then
tmp = t_1
else if (x <= 1.3d-119) then
tmp = (-4.5d0) * ((z * t) / a_m)
else
tmp = x * (y * (0.5d0 / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = x * ((y * 0.5) / a_m);
double tmp;
if (x <= -1.1e+135) {
tmp = t_1;
} else if (x <= -4.5e+118) {
tmp = t * (-4.5 * (z / a_m));
} else if (x <= -5.7e+88) {
tmp = t_1;
} else if (x <= 1.3e-119) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = x * (y * (0.5 / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): t_1 = x * ((y * 0.5) / a_m) tmp = 0 if x <= -1.1e+135: tmp = t_1 elif x <= -4.5e+118: tmp = t * (-4.5 * (z / a_m)) elif x <= -5.7e+88: tmp = t_1 elif x <= 1.3e-119: tmp = -4.5 * ((z * t) / a_m) else: tmp = x * (y * (0.5 / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(x * Float64(Float64(y * 0.5) / a_m)) tmp = 0.0 if (x <= -1.1e+135) tmp = t_1; elseif (x <= -4.5e+118) tmp = Float64(t * Float64(-4.5 * Float64(z / a_m))); elseif (x <= -5.7e+88) tmp = t_1; elseif (x <= 1.3e-119) tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); else tmp = Float64(x * Float64(y * Float64(0.5 / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
t_1 = x * ((y * 0.5) / a_m);
tmp = 0.0;
if (x <= -1.1e+135)
tmp = t_1;
elseif (x <= -4.5e+118)
tmp = t * (-4.5 * (z / a_m));
elseif (x <= -5.7e+88)
tmp = t_1;
elseif (x <= 1.3e-119)
tmp = -4.5 * ((z * t) / a_m);
else
tmp = x * (y * (0.5 / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(x * N[(N[(y * 0.5), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[x, -1.1e+135], t$95$1, If[LessEqual[x, -4.5e+118], N[(t * N[(-4.5 * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.7e+88], t$95$1, If[LessEqual[x, 1.3e-119], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := x \cdot \frac{y \cdot 0.5}{a\_m}\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;x \leq -1.1 \cdot 10^{+135}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -4.5 \cdot 10^{+118}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a\_m}\right)\\
\mathbf{elif}\;x \leq -5.7 \cdot 10^{+88}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 1.3 \cdot 10^{-119}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\end{array}
\end{array}
\end{array}
if x < -1.1e135 or -4.50000000000000002e118 < x < -5.70000000000000021e88Initial program 82.8%
Taylor expanded in x around inf 65.0%
*-commutative65.0%
associate-/l*77.2%
associate-*r*77.2%
*-commutative77.2%
associate-*r/77.2%
Simplified77.2%
if -1.1e135 < x < -4.50000000000000002e118Initial program 53.1%
Taylor expanded in x around 0 27.1%
*-commutative27.1%
associate-*r*27.5%
Simplified27.5%
associate-/l*50.6%
*-commutative50.6%
*-commutative50.6%
times-frac50.3%
metadata-eval50.3%
Applied egg-rr50.3%
if -5.70000000000000021e88 < x < 1.30000000000000006e-119Initial program 94.7%
Taylor expanded in x around 0 67.9%
if 1.30000000000000006e-119 < x Initial program 92.0%
clear-num91.5%
inv-pow91.5%
*-commutative91.5%
associate-/l*91.5%
fma-neg91.6%
*-commutative91.6%
distribute-rgt-neg-in91.6%
distribute-rgt-neg-in91.6%
metadata-eval91.6%
Applied egg-rr91.6%
unpow-191.6%
associate-/r*91.6%
metadata-eval91.6%
associate-*r*91.6%
*-commutative91.6%
metadata-eval91.6%
distribute-lft-neg-in91.6%
distribute-lft-neg-in91.6%
metadata-eval91.6%
associate-*r*91.6%
*-commutative91.6%
*-commutative91.6%
Simplified91.6%
Taylor expanded in x around inf 58.7%
*-commutative58.7%
associate-*l/58.7%
associate-*r*58.7%
associate-/l*64.4%
Simplified64.4%
associate-*r/64.3%
*-commutative64.3%
Applied egg-rr64.3%
Final simplification68.2%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(*
a_s
(if (<= (* a_m 2.0) 5e-21)
(/ (- (* x y) (* t (* z 9.0))) (* a_m 2.0))
(+ (* (* z (* t -9.0)) (/ 0.5 a_m)) (* x (* y (/ 0.5 a_m)))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((a_m * 2.0) <= 5e-21) {
tmp = ((x * y) - (t * (z * 9.0))) / (a_m * 2.0);
} else {
tmp = ((z * (t * -9.0)) * (0.5 / a_m)) + (x * (y * (0.5 / a_m)));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: tmp
if ((a_m * 2.0d0) <= 5d-21) then
tmp = ((x * y) - (t * (z * 9.0d0))) / (a_m * 2.0d0)
else
tmp = ((z * (t * (-9.0d0))) * (0.5d0 / a_m)) + (x * (y * (0.5d0 / a_m)))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if ((a_m * 2.0) <= 5e-21) {
tmp = ((x * y) - (t * (z * 9.0))) / (a_m * 2.0);
} else {
tmp = ((z * (t * -9.0)) * (0.5 / a_m)) + (x * (y * (0.5 / a_m)));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if (a_m * 2.0) <= 5e-21: tmp = ((x * y) - (t * (z * 9.0))) / (a_m * 2.0) else: tmp = ((z * (t * -9.0)) * (0.5 / a_m)) + (x * (y * (0.5 / a_m))) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (Float64(a_m * 2.0) <= 5e-21) tmp = Float64(Float64(Float64(x * y) - Float64(t * Float64(z * 9.0))) / Float64(a_m * 2.0)); else tmp = Float64(Float64(Float64(z * Float64(t * -9.0)) * Float64(0.5 / a_m)) + Float64(x * Float64(y * Float64(0.5 / a_m)))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if ((a_m * 2.0) <= 5e-21)
tmp = ((x * y) - (t * (z * 9.0))) / (a_m * 2.0);
else
tmp = ((z * (t * -9.0)) * (0.5 / a_m)) + (x * (y * (0.5 / a_m)));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(a$95$m * 2.0), $MachinePrecision], 5e-21], N[(N[(N[(x * y), $MachinePrecision] - N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * N[(y * N[(0.5 / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;a\_m \cdot 2 \leq 5 \cdot 10^{-21}:\\
\;\;\;\;\frac{x \cdot y - t \cdot \left(z \cdot 9\right)}{a\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\left(z \cdot \left(t \cdot -9\right)\right) \cdot \frac{0.5}{a\_m} + x \cdot \left(y \cdot \frac{0.5}{a\_m}\right)\\
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 4.99999999999999973e-21Initial program 94.1%
if 4.99999999999999973e-21 < (*.f64 a #s(literal 2 binary64)) Initial program 83.2%
clear-num82.3%
inv-pow82.3%
*-commutative82.3%
associate-/l*82.3%
fma-neg82.3%
*-commutative82.3%
distribute-rgt-neg-in82.3%
distribute-rgt-neg-in82.3%
metadata-eval82.3%
Applied egg-rr82.3%
unpow-182.3%
associate-/r*82.3%
metadata-eval82.3%
associate-*r*82.3%
*-commutative82.3%
metadata-eval82.3%
distribute-lft-neg-in82.3%
distribute-lft-neg-in82.3%
metadata-eval82.3%
associate-*r*82.3%
*-commutative82.3%
*-commutative82.3%
Simplified82.3%
associate-/r/83.2%
fma-undefine83.2%
distribute-lft-in83.2%
*-commutative83.2%
associate-*l*93.1%
Applied egg-rr93.1%
Final simplification93.8%
a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
:precision binary64
(let* ((t_1 (* t (* z 9.0))))
(*
a_s
(if (<= t_1 1e+235)
(/ (- (* x y) t_1) (* a_m 2.0))
(* t (* -4.5 (/ z a_m)))))))a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= 1e+235) {
tmp = ((x * y) - t_1) / (a_m * 2.0);
} else {
tmp = t * (-4.5 * (z / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: t_1
real(8) :: tmp
t_1 = t * (z * 9.0d0)
if (t_1 <= 1d+235) then
tmp = ((x * y) - t_1) / (a_m * 2.0d0)
else
tmp = t * ((-4.5d0) * (z / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= 1e+235) {
tmp = ((x * y) - t_1) / (a_m * 2.0);
} else {
tmp = t * (-4.5 * (z / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): t_1 = t * (z * 9.0) tmp = 0 if t_1 <= 1e+235: tmp = ((x * y) - t_1) / (a_m * 2.0) else: tmp = t * (-4.5 * (z / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) t_1 = Float64(t * Float64(z * 9.0)) tmp = 0.0 if (t_1 <= 1e+235) tmp = Float64(Float64(Float64(x * y) - t_1) / Float64(a_m * 2.0)); else tmp = Float64(t * Float64(-4.5 * Float64(z / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
t_1 = t * (z * 9.0);
tmp = 0.0;
if (t_1 <= 1e+235)
tmp = ((x * y) - t_1) / (a_m * 2.0);
else
tmp = t * (-4.5 * (z / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[t$95$1, 1e+235], N[(N[(N[(x * y), $MachinePrecision] - t$95$1), $MachinePrecision] / N[(a$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(z \cdot 9\right)\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq 10^{+235}:\\
\;\;\;\;\frac{x \cdot y - t\_1}{a\_m \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.0000000000000001e235Initial program 94.0%
if 1.0000000000000001e235 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 64.4%
Taylor expanded in x around 0 64.7%
*-commutative64.7%
associate-*r*64.7%
Simplified64.7%
associate-/l*95.4%
*-commutative95.4%
*-commutative95.4%
times-frac95.6%
metadata-eval95.6%
Applied egg-rr95.6%
Final simplification94.2%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function. (FPCore (a_s x y z t a_m) :precision binary64 (* a_s (if (<= a_m 6.5e+103) (* -4.5 (/ (* z t) a_m)) (* t (* -4.5 (/ z a_m))))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (a_m <= 6.5e+103) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = t * (-4.5 * (z / a_m));
}
return a_s * tmp;
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
real(8) :: tmp
if (a_m <= 6.5d+103) then
tmp = (-4.5d0) * ((z * t) / a_m)
else
tmp = t * ((-4.5d0) * (z / a_m))
end if
code = a_s * tmp
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
double tmp;
if (a_m <= 6.5e+103) {
tmp = -4.5 * ((z * t) / a_m);
} else {
tmp = t * (-4.5 * (z / a_m));
}
return a_s * tmp;
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): tmp = 0 if a_m <= 6.5e+103: tmp = -4.5 * ((z * t) / a_m) else: tmp = t * (-4.5 * (z / a_m)) return a_s * tmp
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) tmp = 0.0 if (a_m <= 6.5e+103) tmp = Float64(-4.5 * Float64(Float64(z * t) / a_m)); else tmp = Float64(t * Float64(-4.5 * Float64(z / a_m))); end return Float64(a_s * tmp) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
tmp = 0.0;
if (a_m <= 6.5e+103)
tmp = -4.5 * ((z * t) / a_m);
else
tmp = t * (-4.5 * (z / a_m));
end
tmp_2 = a_s * tmp;
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[a$95$m, 6.5e+103], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \begin{array}{l}
\mathbf{if}\;a\_m \leq 6.5 \cdot 10^{+103}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a\_m}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a\_m}\right)\\
\end{array}
\end{array}
if a < 6.50000000000000001e103Initial program 94.7%
Taylor expanded in x around 0 56.2%
if 6.50000000000000001e103 < a Initial program 74.9%
Taylor expanded in x around 0 50.8%
*-commutative50.8%
associate-*r*50.6%
Simplified50.6%
associate-/l*54.6%
*-commutative54.6%
*-commutative54.6%
times-frac54.8%
metadata-eval54.8%
Applied egg-rr54.8%
Final simplification56.0%
a\_m = (fabs.f64 a) a\_s = (copysign.f64 #s(literal 1 binary64) a) NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function. (FPCore (a_s x y z t a_m) :precision binary64 (* a_s (* -4.5 (/ (* z t) a_m))))
a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * (-4.5 * ((z * t) / a_m));
}
a\_m = abs(a)
a\_s = copysign(1.0d0, a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
real(8) function code(a_s, x, y, z, t, a_m)
real(8), intent (in) :: a_s
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_m
code = a_s * ((-4.5d0) * ((z * t) / a_m))
end function
a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
return a_s * (-4.5 * ((z * t) / a_m));
}
a\_m = math.fabs(a) a\_s = math.copysign(1.0, a) [x, y, z, t, a_m] = sort([x, y, z, t, a_m]) def code(a_s, x, y, z, t, a_m): return a_s * (-4.5 * ((z * t) / a_m))
a\_m = abs(a) a\_s = copysign(1.0, a) x, y, z, t, a_m = sort([x, y, z, t, a_m]) function code(a_s, x, y, z, t, a_m) return Float64(a_s * Float64(-4.5 * Float64(Float64(z * t) / a_m))) end
a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
tmp = a_s * (-4.5 * ((z * t) / a_m));
end
a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
a\_m = \left|a\right|
\\
a\_s = \mathsf{copysign}\left(1, a\right)
\\
[x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\
\\
a\_s \cdot \left(-4.5 \cdot \frac{z \cdot t}{a\_m}\right)
\end{array}
Initial program 91.2%
Taylor expanded in x around 0 55.3%
Final simplification55.3%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
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) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2024085
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:alt
(if (< a -2.090464557976709e+86) (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z)))) (if (< a 2.144030707833976e+99) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)) (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5)))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))