
(FPCore (x y z t a) :precision binary64 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))
double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}
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) / sqrt(((z * z) - (t * a)))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}
def code(x, y, z, t, a): return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a)))) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) * z) / sqrt(((z * z) - (t * a))); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))
double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / sqrt(((z * z) - (t * a)));
}
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) / sqrt(((z * z) - (t * a)))
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) * z) / Math.sqrt(((z * z) - (t * a)));
}
def code(x, y, z, t, a): return ((x * y) * z) / math.sqrt(((z * z) - (t * a)))
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) * z) / sqrt(Float64(Float64(z * z) - Float64(t * a)))) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) * z) / sqrt(((z * z) - (t * a))); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision] / N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(x \cdot y\right) \cdot z}{\sqrt{z \cdot z - t \cdot a}}
\end{array}
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 5e+85)
(* x_m (* y_m (/ z_m (sqrt (fma (- a) t (* z_m z_m))))))
(* (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) x_m) y_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 5e+85) {
tmp = x_m * (y_m * (z_m / sqrt(fma(-a, t, (z_m * z_m)))));
} else {
tmp = ((z_m / fma((a / z_m), (-0.5 * t), z_m)) * x_m) * y_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 5e+85) tmp = Float64(x_m * Float64(y_m * Float64(z_m / sqrt(fma(Float64(-a), t, Float64(z_m * z_m)))))); else tmp = Float64(Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * x_m) * y_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 5e+85], N[(x$95$m * N[(y$95$m * N[(z$95$m / N[Sqrt[N[((-a) * t + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z$95$m / N[(N[(a / z$95$m), $MachinePrecision] * N[(-0.5 * t), $MachinePrecision] + z$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 5 \cdot 10^{+85}:\\
\;\;\;\;x\_m \cdot \left(y\_m \cdot \frac{z\_m}{\sqrt{\mathsf{fma}\left(-a, t, z\_m \cdot z\_m\right)}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot x\_m\right) \cdot y\_m\\
\end{array}\right)\right)
\end{array}
if z < 5.0000000000000001e85Initial program 72.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites71.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6471.4
Applied rewrites71.4%
if 5.0000000000000001e85 < z Initial program 34.3%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6476.0
Applied rewrites76.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites98.4%
Final simplification77.6%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 7e-150)
(/ (* (* y_m z_m) x_m) (sqrt (* t (- a))))
(if (<= z_m 5.9e+85)
(* (/ y_m (sqrt (fma (- a) t (* z_m z_m)))) (* x_m z_m))
(* (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) x_m) y_m)))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 7e-150) {
tmp = ((y_m * z_m) * x_m) / sqrt((t * -a));
} else if (z_m <= 5.9e+85) {
tmp = (y_m / sqrt(fma(-a, t, (z_m * z_m)))) * (x_m * z_m);
} else {
tmp = ((z_m / fma((a / z_m), (-0.5 * t), z_m)) * x_m) * y_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 7e-150) tmp = Float64(Float64(Float64(y_m * z_m) * x_m) / sqrt(Float64(t * Float64(-a)))); elseif (z_m <= 5.9e+85) tmp = Float64(Float64(y_m / sqrt(fma(Float64(-a), t, Float64(z_m * z_m)))) * Float64(x_m * z_m)); else tmp = Float64(Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * x_m) * y_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 7e-150], N[(N[(N[(y$95$m * z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[z$95$m, 5.9e+85], N[(N[(y$95$m / N[Sqrt[N[((-a) * t + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z$95$m / N[(N[(a / z$95$m), $MachinePrecision] * N[(-0.5 * t), $MachinePrecision] + z$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 7 \cdot 10^{-150}:\\
\;\;\;\;\frac{\left(y\_m \cdot z\_m\right) \cdot x\_m}{\sqrt{t \cdot \left(-a\right)}}\\
\mathbf{elif}\;z\_m \leq 5.9 \cdot 10^{+85}:\\
\;\;\;\;\frac{y\_m}{\sqrt{\mathsf{fma}\left(-a, t, z\_m \cdot z\_m\right)}} \cdot \left(x\_m \cdot z\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot x\_m\right) \cdot y\_m\\
\end{array}\right)\right)
\end{array}
if z < 6.9999999999999996e-150Initial program 67.1%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6467.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.5
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6467.5
Applied rewrites67.5%
Taylor expanded in z around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6441.1
Applied rewrites41.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites35.7%
if 6.9999999999999996e-150 < z < 5.9e85Initial program 89.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6493.2
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6493.2
Applied rewrites93.2%
if 5.9e85 < z Initial program 34.3%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6476.0
Applied rewrites76.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites98.4%
Final simplification60.3%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 1.55e+72)
(* (/ x_m (sqrt (fma (- a) t (* z_m z_m)))) (* y_m z_m))
(* (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.55e+72) {
tmp = (x_m / sqrt(fma(-a, t, (z_m * z_m)))) * (y_m * z_m);
} else {
tmp = ((z_m / fma((a / z_m), (-0.5 * t), z_m)) * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.55e+72) tmp = Float64(Float64(x_m / sqrt(fma(Float64(-a), t, Float64(z_m * z_m)))) * Float64(y_m * z_m)); else tmp = Float64(Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 1.55e+72], N[(N[(x$95$m / N[Sqrt[N[((-a) * t + N[(z$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(y$95$m * z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z$95$m / N[(N[(a / z$95$m), $MachinePrecision] * N[(-0.5 * t), $MachinePrecision] + z$95$m), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.55 \cdot 10^{+72}:\\
\;\;\;\;\frac{x\_m}{\sqrt{\mathsf{fma}\left(-a, t, z\_m \cdot z\_m\right)}} \cdot \left(y\_m \cdot z\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 1.54999999999999994e72Initial program 71.7%
lift-/.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6464.7
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6464.7
Applied rewrites64.7%
if 1.54999999999999994e72 < z Initial program 38.4%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6477.5
Applied rewrites77.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites98.5%
Final simplification73.0%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 3.6e-132)
(/ (* (* y_m z_m) x_m) (sqrt (* t (- a))))
(* (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 3.6e-132) {
tmp = ((y_m * z_m) * x_m) / sqrt((t * -a));
} else {
tmp = ((z_m / fma((a / z_m), (-0.5 * t), z_m)) * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 3.6e-132) tmp = Float64(Float64(Float64(y_m * z_m) * x_m) / sqrt(Float64(t * Float64(-a)))); else tmp = Float64(Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 3.6e-132], N[(N[(N[(y$95$m * z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(z$95$m / N[(N[(a / z$95$m), $MachinePrecision] * N[(-0.5 * t), $MachinePrecision] + z$95$m), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 3.6 \cdot 10^{-132}:\\
\;\;\;\;\frac{\left(y\_m \cdot z\_m\right) \cdot x\_m}{\sqrt{t \cdot \left(-a\right)}}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 3.60000000000000007e-132Initial program 66.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6467.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.3
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6467.3
Applied rewrites67.3%
Taylor expanded in z around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6441.3
Applied rewrites41.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites36.5%
if 3.60000000000000007e-132 < z Initial program 58.5%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6477.1
Applied rewrites77.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.8%
Final simplification58.2%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 3.6e-132)
(/ (* (* y_m z_m) x_m) (sqrt (* t (- a))))
(* (* (/ z_m (fma (/ a z_m) (* -0.5 t) z_m)) x_m) y_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 3.6e-132) {
tmp = ((y_m * z_m) * x_m) / sqrt((t * -a));
} else {
tmp = ((z_m / fma((a / z_m), (-0.5 * t), z_m)) * x_m) * y_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 3.6e-132) tmp = Float64(Float64(Float64(y_m * z_m) * x_m) / sqrt(Float64(t * Float64(-a)))); else tmp = Float64(Float64(Float64(z_m / fma(Float64(a / z_m), Float64(-0.5 * t), z_m)) * x_m) * y_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 3.6e-132], N[(N[(N[(y$95$m * z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(z$95$m / N[(N[(a / z$95$m), $MachinePrecision] * N[(-0.5 * t), $MachinePrecision] + z$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 3.6 \cdot 10^{-132}:\\
\;\;\;\;\frac{\left(y\_m \cdot z\_m\right) \cdot x\_m}{\sqrt{t \cdot \left(-a\right)}}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z\_m}{\mathsf{fma}\left(\frac{a}{z\_m}, -0.5 \cdot t, z\_m\right)} \cdot x\_m\right) \cdot y\_m\\
\end{array}\right)\right)
\end{array}
if z < 3.60000000000000007e-132Initial program 66.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6467.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.3
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6467.3
Applied rewrites67.3%
Taylor expanded in z around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6441.3
Applied rewrites41.3%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites36.5%
if 3.60000000000000007e-132 < z Initial program 58.5%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6477.1
Applied rewrites77.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.8%
Final simplification58.2%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 1.1e-78)
(/ (* (* y_m z_m) x_m) (sqrt (* t (- a))))
(* (* 1.0 y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.1e-78) {
tmp = ((y_m * z_m) * x_m) / sqrt((t * -a));
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.1d-78) then
tmp = ((y_m * z_m) * x_m) / sqrt((t * -a))
else
tmp = (1.0d0 * y_m) * x_m
end if
code = x_s * (y_s * (z_s * tmp))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.1e-78) {
tmp = ((y_m * z_m) * x_m) / Math.sqrt((t * -a));
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.1e-78: tmp = ((y_m * z_m) * x_m) / math.sqrt((t * -a)) else: tmp = (1.0 * y_m) * x_m return x_s * (y_s * (z_s * tmp))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.1e-78) tmp = Float64(Float64(Float64(y_m * z_m) * x_m) / sqrt(Float64(t * Float64(-a)))); else tmp = Float64(Float64(1.0 * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.1e-78)
tmp = ((y_m * z_m) * x_m) / sqrt((t * -a));
else
tmp = (1.0 * y_m) * x_m;
end
tmp_2 = x_s * (y_s * (z_s * tmp));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 1.1e-78], N[(N[(N[(y$95$m * z$95$m), $MachinePrecision] * x$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.1 \cdot 10^{-78}:\\
\;\;\;\;\frac{\left(y\_m \cdot z\_m\right) \cdot x\_m}{\sqrt{t \cdot \left(-a\right)}}\\
\mathbf{else}:\\
\;\;\;\;\left(1 \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 1.0999999999999999e-78Initial program 68.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6469.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6469.3
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6469.3
Applied rewrites69.3%
Taylor expanded in z around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6442.4
Applied rewrites42.4%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
frac-2negN/A
lower-/.f64N/A
Applied rewrites37.9%
if 1.0999999999999999e-78 < z Initial program 54.1%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.9%
Taylor expanded in z around inf
Applied rewrites90.8%
Final simplification56.9%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 1.1e-78)
(* (/ (* x_m y_m) (sqrt (* t (- a)))) z_m)
(* (* 1.0 y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.1e-78) {
tmp = ((x_m * y_m) / sqrt((t * -a))) * z_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1.1d-78) then
tmp = ((x_m * y_m) / sqrt((t * -a))) * z_m
else
tmp = (1.0d0 * y_m) * x_m
end if
code = x_s * (y_s * (z_s * tmp))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1.1e-78) {
tmp = ((x_m * y_m) / Math.sqrt((t * -a))) * z_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1.1e-78: tmp = ((x_m * y_m) / math.sqrt((t * -a))) * z_m else: tmp = (1.0 * y_m) * x_m return x_s * (y_s * (z_s * tmp))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1.1e-78) tmp = Float64(Float64(Float64(x_m * y_m) / sqrt(Float64(t * Float64(-a)))) * z_m); else tmp = Float64(Float64(1.0 * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1.1e-78)
tmp = ((x_m * y_m) / sqrt((t * -a))) * z_m;
else
tmp = (1.0 * y_m) * x_m;
end
tmp_2 = x_s * (y_s * (z_s * tmp));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 1.1e-78], N[(N[(N[(x$95$m * y$95$m), $MachinePrecision] / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * z$95$m), $MachinePrecision], N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 1.1 \cdot 10^{-78}:\\
\;\;\;\;\frac{x\_m \cdot y\_m}{\sqrt{t \cdot \left(-a\right)}} \cdot z\_m\\
\mathbf{else}:\\
\;\;\;\;\left(1 \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 1.0999999999999999e-78Initial program 68.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6469.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6469.3
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6469.3
Applied rewrites69.3%
Taylor expanded in z around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6442.4
Applied rewrites42.4%
if 1.0999999999999999e-78 < z Initial program 54.1%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.9%
Taylor expanded in z around inf
Applied rewrites90.8%
Final simplification59.8%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 3.6e-132)
(* (* (/ y_m (sqrt (* t (- a)))) x_m) z_m)
(* (* 1.0 y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 3.6e-132) {
tmp = ((y_m / sqrt((t * -a))) * x_m) * z_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 3.6d-132) then
tmp = ((y_m / sqrt((t * -a))) * x_m) * z_m
else
tmp = (1.0d0 * y_m) * x_m
end if
code = x_s * (y_s * (z_s * tmp))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 3.6e-132) {
tmp = ((y_m / Math.sqrt((t * -a))) * x_m) * z_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 3.6e-132: tmp = ((y_m / math.sqrt((t * -a))) * x_m) * z_m else: tmp = (1.0 * y_m) * x_m return x_s * (y_s * (z_s * tmp))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 3.6e-132) tmp = Float64(Float64(Float64(y_m / sqrt(Float64(t * Float64(-a)))) * x_m) * z_m); else tmp = Float64(Float64(1.0 * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 3.6e-132)
tmp = ((y_m / sqrt((t * -a))) * x_m) * z_m;
else
tmp = (1.0 * y_m) * x_m;
end
tmp_2 = x_s * (y_s * (z_s * tmp));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 3.6e-132], N[(N[(N[(y$95$m / N[Sqrt[N[(t * (-a)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] * z$95$m), $MachinePrecision], N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 3.6 \cdot 10^{-132}:\\
\;\;\;\;\left(\frac{y\_m}{\sqrt{t \cdot \left(-a\right)}} \cdot x\_m\right) \cdot z\_m\\
\mathbf{else}:\\
\;\;\;\;\left(1 \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 3.60000000000000007e-132Initial program 66.9%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6467.3
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.3
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6467.3
Applied rewrites67.3%
Taylor expanded in z around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6441.3
Applied rewrites41.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6440.0
Applied rewrites40.0%
if 3.60000000000000007e-132 < z Initial program 58.5%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6477.1
Applied rewrites77.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.8%
Taylor expanded in z around inf
Applied rewrites89.0%
Final simplification59.6%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 1e-87)
(* (* (/ 1.0 z_m) (* x_m z_m)) y_m)
(* (* 1.0 y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1e-87) {
tmp = ((1.0 / z_m) * (x_m * z_m)) * y_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 1d-87) then
tmp = ((1.0d0 / z_m) * (x_m * z_m)) * y_m
else
tmp = (1.0d0 * y_m) * x_m
end if
code = x_s * (y_s * (z_s * tmp))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 1e-87) {
tmp = ((1.0 / z_m) * (x_m * z_m)) * y_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 1e-87: tmp = ((1.0 / z_m) * (x_m * z_m)) * y_m else: tmp = (1.0 * y_m) * x_m return x_s * (y_s * (z_s * tmp))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 1e-87) tmp = Float64(Float64(Float64(1.0 / z_m) * Float64(x_m * z_m)) * y_m); else tmp = Float64(Float64(1.0 * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 1e-87)
tmp = ((1.0 / z_m) * (x_m * z_m)) * y_m;
else
tmp = (1.0 * y_m) * x_m;
end
tmp_2 = x_s * (y_s * (z_s * tmp));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 1e-87], N[(N[(N[(1.0 / z$95$m), $MachinePrecision] * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision] * y$95$m), $MachinePrecision], N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 10^{-87}:\\
\;\;\;\;\left(\frac{1}{z\_m} \cdot \left(x\_m \cdot z\_m\right)\right) \cdot y\_m\\
\mathbf{else}:\\
\;\;\;\;\left(1 \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 1.00000000000000002e-87Initial program 68.8%
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites66.5%
Taylor expanded in z around inf
lower-/.f6419.7
Applied rewrites19.7%
if 1.00000000000000002e-87 < z Initial program 54.1%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites90.9%
Taylor expanded in z around inf
Applied rewrites90.8%
Final simplification45.2%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= z_m 4.1e-223)
(/ (* (* x_m y_m) z_m) (- z_m))
(* (* 1.0 y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 4.1e-223) {
tmp = ((x_m * y_m) * z_m) / -z_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (z_m <= 4.1d-223) then
tmp = ((x_m * y_m) * z_m) / -z_m
else
tmp = (1.0d0 * y_m) * x_m
end if
code = x_s * (y_s * (z_s * tmp))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (z_m <= 4.1e-223) {
tmp = ((x_m * y_m) * z_m) / -z_m;
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): tmp = 0 if z_m <= 4.1e-223: tmp = ((x_m * y_m) * z_m) / -z_m else: tmp = (1.0 * y_m) * x_m return x_s * (y_s * (z_s * tmp))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (z_m <= 4.1e-223) tmp = Float64(Float64(Float64(x_m * y_m) * z_m) / Float64(-z_m)); else tmp = Float64(Float64(1.0 * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (z_m <= 4.1e-223)
tmp = ((x_m * y_m) * z_m) / -z_m;
else
tmp = (1.0 * y_m) * x_m;
end
tmp_2 = x_s * (y_s * (z_s * tmp));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[z$95$m, 4.1e-223], N[(N[(N[(x$95$m * y$95$m), $MachinePrecision] * z$95$m), $MachinePrecision] / (-z$95$m)), $MachinePrecision], N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;z\_m \leq 4.1 \cdot 10^{-223}:\\
\;\;\;\;\frac{\left(x\_m \cdot y\_m\right) \cdot z\_m}{-z\_m}\\
\mathbf{else}:\\
\;\;\;\;\left(1 \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if z < 4.10000000000000015e-223Initial program 66.0%
Taylor expanded in z around -inf
mul-1-negN/A
lower-neg.f6464.3
Applied rewrites64.3%
if 4.10000000000000015e-223 < z Initial program 60.5%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6470.6
Applied rewrites70.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites82.8%
Taylor expanded in z around inf
Applied rewrites81.0%
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
(FPCore (x_s y_s z_s x_m y_m z_m t a)
:precision binary64
(*
x_s
(*
y_s
(*
z_s
(if (<= x_m 5.2e-157) (* (/ y_m z_m) (* x_m z_m)) (* (* 1.0 y_m) x_m))))))z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (x_m <= 5.2e-157) {
tmp = (y_m / z_m) * (x_m * z_m);
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (x_m <= 5.2d-157) then
tmp = (y_m / z_m) * (x_m * z_m)
else
tmp = (1.0d0 * y_m) * x_m
end if
code = x_s * (y_s * (z_s * tmp))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
double tmp;
if (x_m <= 5.2e-157) {
tmp = (y_m / z_m) * (x_m * z_m);
} else {
tmp = (1.0 * y_m) * x_m;
}
return x_s * (y_s * (z_s * tmp));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): tmp = 0 if x_m <= 5.2e-157: tmp = (y_m / z_m) * (x_m * z_m) else: tmp = (1.0 * y_m) * x_m return x_s * (y_s * (z_s * tmp))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) tmp = 0.0 if (x_m <= 5.2e-157) tmp = Float64(Float64(y_m / z_m) * Float64(x_m * z_m)); else tmp = Float64(Float64(1.0 * y_m) * x_m); end return Float64(x_s * Float64(y_s * Float64(z_s * tmp))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp_2 = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = 0.0;
if (x_m <= 5.2e-157)
tmp = (y_m / z_m) * (x_m * z_m);
else
tmp = (1.0 * y_m) * x_m;
end
tmp_2 = x_s * (y_s * (z_s * tmp));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * If[LessEqual[x$95$m, 5.2e-157], N[(N[(y$95$m / z$95$m), $MachinePrecision] * N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \begin{array}{l}
\mathbf{if}\;x\_m \leq 5.2 \cdot 10^{-157}:\\
\;\;\;\;\frac{y\_m}{z\_m} \cdot \left(x\_m \cdot z\_m\right)\\
\mathbf{else}:\\
\;\;\;\;\left(1 \cdot y\_m\right) \cdot x\_m\\
\end{array}\right)\right)
\end{array}
if x < 5.19999999999999977e-157Initial program 68.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
associate-/l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6468.0
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6469.2
Applied rewrites69.2%
Taylor expanded in z around inf
lower-/.f6439.3
Applied rewrites39.3%
if 5.19999999999999977e-157 < x Initial program 54.5%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6436.0
Applied rewrites36.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites43.3%
Taylor expanded in z around inf
Applied rewrites39.7%
Final simplification39.5%
z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (x_s y_s z_s x_m y_m z_m t a) :precision binary64 (* x_s (* y_s (* z_s (* (* 1.0 y_m) x_m)))))
z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
return x_s * (y_s * (z_s * ((1.0 * y_m) * x_m)));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = x_s * (y_s * (z_s * ((1.0d0 * y_m) * x_m)))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
return x_s * (y_s * (z_s * ((1.0 * y_m) * x_m)));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): return x_s * (y_s * (z_s * ((1.0 * y_m) * x_m)))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) return Float64(x_s * Float64(y_s * Float64(z_s * Float64(Float64(1.0 * y_m) * x_m)))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = x_s * (y_s * (z_s * ((1.0 * y_m) * x_m)));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * N[(N[(1.0 * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \left(\left(1 \cdot y\_m\right) \cdot x\_m\right)\right)\right)
\end{array}
Initial program 63.5%
Taylor expanded in t around 0
+-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6442.3
Applied rewrites42.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites47.8%
Taylor expanded in z around inf
Applied rewrites43.7%
z\_m = (fabs.f64 z) z\_s = (copysign.f64 #s(literal 1 binary64) z) y\_m = (fabs.f64 y) y\_s = (copysign.f64 #s(literal 1 binary64) y) x\_m = (fabs.f64 x) x\_s = (copysign.f64 #s(literal 1 binary64) x) NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function. (FPCore (x_s y_s z_s x_m y_m z_m t a) :precision binary64 (* x_s (* y_s (* z_s (* (- y_m) x_m)))))
z\_m = fabs(z);
z\_s = copysign(1.0, z);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y_m && y_m < z_m && z_m < t && t < a);
double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
return x_s * (y_s * (z_s * (-y_m * x_m)));
}
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
real(8), intent (in) :: x_s
real(8), intent (in) :: y_s
real(8), intent (in) :: z_s
real(8), intent (in) :: x_m
real(8), intent (in) :: y_m
real(8), intent (in) :: z_m
real(8), intent (in) :: t
real(8), intent (in) :: a
code = x_s * (y_s * (z_s * (-y_m * x_m)))
end function
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z_m && z_m < t && t < a;
public static double code(double x_s, double y_s, double z_s, double x_m, double y_m, double z_m, double t, double a) {
return x_s * (y_s * (z_s * (-y_m * x_m)));
}
z\_m = math.fabs(z) z\_s = math.copysign(1.0, z) y\_m = math.fabs(y) y\_s = math.copysign(1.0, y) x\_m = math.fabs(x) x\_s = math.copysign(1.0, x) [x_m, y_m, z_m, t, a] = sort([x_m, y_m, z_m, t, a]) def code(x_s, y_s, z_s, x_m, y_m, z_m, t, a): return x_s * (y_s * (z_s * (-y_m * x_m)))
z\_m = abs(z) z\_s = copysign(1.0, z) y\_m = abs(y) y\_s = copysign(1.0, y) x\_m = abs(x) x\_s = copysign(1.0, x) x_m, y_m, z_m, t, a = sort([x_m, y_m, z_m, t, a]) function code(x_s, y_s, z_s, x_m, y_m, z_m, t, a) return Float64(x_s * Float64(y_s * Float64(z_s * Float64(Float64(-y_m) * x_m)))) end
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z_m, t, a = num2cell(sort([x_m, y_m, z_m, t, a])){:}
function tmp = code(x_s, y_s, z_s, x_m, y_m, z_m, t, a)
tmp = x_s * (y_s * (z_s * (-y_m * x_m)));
end
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, z_m, t, and a should be sorted in increasing order before calling this function.
code[x$95$s_, y$95$s_, z$95$s_, x$95$m_, y$95$m_, z$95$m_, t_, a_] := N[(x$95$s * N[(y$95$s * N[(z$95$s * N[((-y$95$m) * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
z\_m = \left|z\right|
\\
z\_s = \mathsf{copysign}\left(1, z\right)
\\
y\_m = \left|y\right|
\\
y\_s = \mathsf{copysign}\left(1, y\right)
\\
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y_m, z_m, t, a] = \mathsf{sort}([x_m, y_m, z_m, t, a])\\
\\
x\_s \cdot \left(y\_s \cdot \left(z\_s \cdot \left(\left(-y\_m\right) \cdot x\_m\right)\right)\right)
\end{array}
Initial program 63.5%
Taylor expanded in z around -inf
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
neg-mul-1N/A
lower-neg.f6445.3
Applied rewrites45.3%
(FPCore (x y z t a)
:precision binary64
(if (< z -3.1921305903852764e+46)
(- (* y x))
(if (< z 5.976268120920894e+90)
(/ (* x z) (/ (sqrt (- (* z z) (* a t))) y))
(* y x))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z < -3.1921305903852764e+46) {
tmp = -(y * x);
} else if (z < 5.976268120920894e+90) {
tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y);
} else {
tmp = y * x;
}
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 (z < (-3.1921305903852764d+46)) then
tmp = -(y * x)
else if (z < 5.976268120920894d+90) then
tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y)
else
tmp = y * x
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z < -3.1921305903852764e+46) {
tmp = -(y * x);
} else if (z < 5.976268120920894e+90) {
tmp = (x * z) / (Math.sqrt(((z * z) - (a * t))) / y);
} else {
tmp = y * x;
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if z < -3.1921305903852764e+46: tmp = -(y * x) elif z < 5.976268120920894e+90: tmp = (x * z) / (math.sqrt(((z * z) - (a * t))) / y) else: tmp = y * x return tmp
function code(x, y, z, t, a) tmp = 0.0 if (z < -3.1921305903852764e+46) tmp = Float64(-Float64(y * x)); elseif (z < 5.976268120920894e+90) tmp = Float64(Float64(x * z) / Float64(sqrt(Float64(Float64(z * z) - Float64(a * t))) / y)); else tmp = Float64(y * x); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (z < -3.1921305903852764e+46) tmp = -(y * x); elseif (z < 5.976268120920894e+90) tmp = (x * z) / (sqrt(((z * z) - (a * t))) / y); else tmp = y * x; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[z, -3.1921305903852764e+46], (-N[(y * x), $MachinePrecision]), If[Less[z, 5.976268120920894e+90], N[(N[(x * z), $MachinePrecision] / N[(N[Sqrt[N[(N[(z * z), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(y * x), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z < -3.1921305903852764 \cdot 10^{+46}:\\
\;\;\;\;-y \cdot x\\
\mathbf{elif}\;z < 5.976268120920894 \cdot 10^{+90}:\\
\;\;\;\;\frac{x \cdot z}{\frac{\sqrt{z \cdot z - a \cdot t}}{y}}\\
\mathbf{else}:\\
\;\;\;\;y \cdot x\\
\end{array}
\end{array}
herbie shell --seed 2024294
(FPCore (x y z t a)
:name "Statistics.Math.RootFinding:ridders from math-functions-0.1.5.2"
:precision binary64
:alt
(! :herbie-platform default (if (< z -31921305903852764000000000000000000000000000000) (- (* y x)) (if (< z 5976268120920894000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (* x z) (/ (sqrt (- (* z z) (* a t))) y)) (* y x))))
(/ (* (* x y) z) (sqrt (- (* z z) (* t a)))))