
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 12800000000000.0)
(/ (fma (* a t) -4.0 (fma (/ (* y x) z) 9.0 (/ b z))) c_m)
(fma
(* (/ x (* z c_m)) 9.0)
y
(fma (* (/ a c_m) t) -4.0 (/ b (* z c_m)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 12800000000000.0) {
tmp = fma((a * t), -4.0, fma(((y * x) / z), 9.0, (b / z))) / c_m;
} else {
tmp = fma(((x / (z * c_m)) * 9.0), y, fma(((a / c_m) * t), -4.0, (b / (z * c_m))));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 12800000000000.0) tmp = Float64(fma(Float64(a * t), -4.0, fma(Float64(Float64(y * x) / z), 9.0, Float64(b / z))) / c_m); else tmp = fma(Float64(Float64(x / Float64(z * c_m)) * 9.0), y, fma(Float64(Float64(a / c_m) * t), -4.0, Float64(b / Float64(z * c_m)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 12800000000000.0], N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0 + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(N[(N[(a / c$95$m), $MachinePrecision] * t), $MachinePrecision] * -4.0 + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 12800000000000:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4, \mathsf{fma}\left(\frac{y \cdot x}{z}, 9, \frac{b}{z}\right)\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{z \cdot c\_m} \cdot 9, y, \mathsf{fma}\left(\frac{a}{c\_m} \cdot t, -4, \frac{b}{z \cdot c\_m}\right)\right)\\
\end{array}
\end{array}
if c < 1.28e13Initial program 84.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6483.3
Applied rewrites83.3%
Taylor expanded in c around 0
Applied rewrites89.6%
if 1.28e13 < c Initial program 65.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6487.6
Applied rewrites87.6%
Applied rewrites89.7%
Final simplification89.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma (* a t) -4.0 (* (/ (* y x) z) 9.0)) c_m))
(t_2 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_2 -2e+34)
t_1
(if (<= t_2 1e-32)
(fma (/ (* a t) c_m) -4.0 (/ b (* z c_m)))
(if (<= t_2 1e+238) t_1 (* (* (/ (/ x z) c_m) y) 9.0)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma((a * t), -4.0, (((y * x) / z) * 9.0)) / c_m;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -2e+34) {
tmp = t_1;
} else if (t_2 <= 1e-32) {
tmp = fma(((a * t) / c_m), -4.0, (b / (z * c_m)));
} else if (t_2 <= 1e+238) {
tmp = t_1;
} else {
tmp = (((x / z) / c_m) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(Float64(a * t), -4.0, Float64(Float64(Float64(y * x) / z) * 9.0)) / c_m) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -2e+34) tmp = t_1; elseif (t_2 <= 1e-32) tmp = fma(Float64(Float64(a * t) / c_m), -4.0, Float64(b / Float64(z * c_m))); elseif (t_2 <= 1e+238) tmp = t_1; else tmp = Float64(Float64(Float64(Float64(x / z) / c_m) * y) * 9.0); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -2e+34], t$95$1, If[LessEqual[t$95$2, 1e-32], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0 + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+238], t$95$1, N[(N[(N[(N[(x / z), $MachinePrecision] / c$95$m), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(a \cdot t, -4, \frac{y \cdot x}{z} \cdot 9\right)}{c\_m}\\
t_2 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+34}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{-32}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a \cdot t}{c\_m}, -4, \frac{b}{z \cdot c\_m}\right)\\
\mathbf{elif}\;t\_2 \leq 10^{+238}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\frac{x}{z}}{c\_m} \cdot y\right) \cdot 9\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.99999999999999989e34 or 1.00000000000000006e-32 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e238Initial program 80.6%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6483.1
Applied rewrites83.1%
Taylor expanded in c around 0
Applied rewrites87.7%
Taylor expanded in x around inf
Applied rewrites84.4%
if -1.99999999999999989e34 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000006e-32Initial program 80.8%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6485.2
Applied rewrites85.2%
Taylor expanded in x around 0
Applied rewrites81.4%
if 1e238 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 65.9%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6484.9
Applied rewrites84.9%
Taylor expanded in x around inf
Applied rewrites81.4%
Applied rewrites92.1%
Final simplification83.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* (/ -4.0 c_m) t) a)) (t_2 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_2 -1e+33)
(* (* (/ y (* z c_m)) x) 9.0)
(if (<= t_2 -2e-72)
t_1
(if (<= t_2 1e-177)
(/ b (* z c_m))
(if (<= t_2 1e+162) t_1 (* (* (/ x (* z c_m)) y) 9.0))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((-4.0 / c_m) * t) * a;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -1e+33) {
tmp = ((y / (z * c_m)) * x) * 9.0;
} else if (t_2 <= -2e-72) {
tmp = t_1;
} else if (t_2 <= 1e-177) {
tmp = b / (z * c_m);
} else if (t_2 <= 1e+162) {
tmp = t_1;
} else {
tmp = ((x / (z * c_m)) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (((-4.0d0) / c_m) * t) * a
t_2 = (9.0d0 * x) * y
if (t_2 <= (-1d+33)) then
tmp = ((y / (z * c_m)) * x) * 9.0d0
else if (t_2 <= (-2d-72)) then
tmp = t_1
else if (t_2 <= 1d-177) then
tmp = b / (z * c_m)
else if (t_2 <= 1d+162) then
tmp = t_1
else
tmp = ((x / (z * c_m)) * y) * 9.0d0
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((-4.0 / c_m) * t) * a;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -1e+33) {
tmp = ((y / (z * c_m)) * x) * 9.0;
} else if (t_2 <= -2e-72) {
tmp = t_1;
} else if (t_2 <= 1e-177) {
tmp = b / (z * c_m);
} else if (t_2 <= 1e+162) {
tmp = t_1;
} else {
tmp = ((x / (z * c_m)) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((-4.0 / c_m) * t) * a t_2 = (9.0 * x) * y tmp = 0 if t_2 <= -1e+33: tmp = ((y / (z * c_m)) * x) * 9.0 elif t_2 <= -2e-72: tmp = t_1 elif t_2 <= 1e-177: tmp = b / (z * c_m) elif t_2 <= 1e+162: tmp = t_1 else: tmp = ((x / (z * c_m)) * y) * 9.0 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(-4.0 / c_m) * t) * a) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -1e+33) tmp = Float64(Float64(Float64(y / Float64(z * c_m)) * x) * 9.0); elseif (t_2 <= -2e-72) tmp = t_1; elseif (t_2 <= 1e-177) tmp = Float64(b / Float64(z * c_m)); elseif (t_2 <= 1e+162) tmp = t_1; else tmp = Float64(Float64(Float64(x / Float64(z * c_m)) * y) * 9.0); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((-4.0 / c_m) * t) * a;
t_2 = (9.0 * x) * y;
tmp = 0.0;
if (t_2 <= -1e+33)
tmp = ((y / (z * c_m)) * x) * 9.0;
elseif (t_2 <= -2e-72)
tmp = t_1;
elseif (t_2 <= 1e-177)
tmp = b / (z * c_m);
elseif (t_2 <= 1e+162)
tmp = t_1;
else
tmp = ((x / (z * c_m)) * y) * 9.0;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(-4.0 / c$95$m), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -1e+33], N[(N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] * 9.0), $MachinePrecision], If[LessEqual[t$95$2, -2e-72], t$95$1, If[LessEqual[t$95$2, 1e-177], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+162], t$95$1, N[(N[(N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(\frac{-4}{c\_m} \cdot t\right) \cdot a\\
t_2 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+33}:\\
\;\;\;\;\left(\frac{y}{z \cdot c\_m} \cdot x\right) \cdot 9\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-72}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{-177}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{elif}\;t\_2 \leq 10^{+162}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{x}{z \cdot c\_m} \cdot y\right) \cdot 9\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999995e32Initial program 84.4%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6482.6
Applied rewrites82.6%
Taylor expanded in x around inf
Applied rewrites67.3%
Applied rewrites68.9%
Applied rewrites68.9%
if -9.9999999999999995e32 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e-72 or 9.99999999999999952e-178 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999994e161Initial program 71.4%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6454.0
Applied rewrites54.0%
Applied rewrites61.6%
Applied rewrites61.5%
if -1.9999999999999999e-72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999952e-178Initial program 85.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
if 9.9999999999999994e161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 73.9%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6488.3
Applied rewrites88.3%
Taylor expanded in x around inf
Applied rewrites79.8%
Taylor expanded in x around 0
Applied rewrites76.8%
Final simplification66.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* (/ -4.0 c_m) t) a)) (t_2 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_2 -2e+110)
(* (/ y (* z c_m)) (* 9.0 x))
(if (<= t_2 -2e-72)
t_1
(if (<= t_2 1e-177)
(/ b (* z c_m))
(if (<= t_2 1e+162) t_1 (* (* (/ x (* z c_m)) y) 9.0))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((-4.0 / c_m) * t) * a;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -2e+110) {
tmp = (y / (z * c_m)) * (9.0 * x);
} else if (t_2 <= -2e-72) {
tmp = t_1;
} else if (t_2 <= 1e-177) {
tmp = b / (z * c_m);
} else if (t_2 <= 1e+162) {
tmp = t_1;
} else {
tmp = ((x / (z * c_m)) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (((-4.0d0) / c_m) * t) * a
t_2 = (9.0d0 * x) * y
if (t_2 <= (-2d+110)) then
tmp = (y / (z * c_m)) * (9.0d0 * x)
else if (t_2 <= (-2d-72)) then
tmp = t_1
else if (t_2 <= 1d-177) then
tmp = b / (z * c_m)
else if (t_2 <= 1d+162) then
tmp = t_1
else
tmp = ((x / (z * c_m)) * y) * 9.0d0
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((-4.0 / c_m) * t) * a;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -2e+110) {
tmp = (y / (z * c_m)) * (9.0 * x);
} else if (t_2 <= -2e-72) {
tmp = t_1;
} else if (t_2 <= 1e-177) {
tmp = b / (z * c_m);
} else if (t_2 <= 1e+162) {
tmp = t_1;
} else {
tmp = ((x / (z * c_m)) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((-4.0 / c_m) * t) * a t_2 = (9.0 * x) * y tmp = 0 if t_2 <= -2e+110: tmp = (y / (z * c_m)) * (9.0 * x) elif t_2 <= -2e-72: tmp = t_1 elif t_2 <= 1e-177: tmp = b / (z * c_m) elif t_2 <= 1e+162: tmp = t_1 else: tmp = ((x / (z * c_m)) * y) * 9.0 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(-4.0 / c_m) * t) * a) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -2e+110) tmp = Float64(Float64(y / Float64(z * c_m)) * Float64(9.0 * x)); elseif (t_2 <= -2e-72) tmp = t_1; elseif (t_2 <= 1e-177) tmp = Float64(b / Float64(z * c_m)); elseif (t_2 <= 1e+162) tmp = t_1; else tmp = Float64(Float64(Float64(x / Float64(z * c_m)) * y) * 9.0); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((-4.0 / c_m) * t) * a;
t_2 = (9.0 * x) * y;
tmp = 0.0;
if (t_2 <= -2e+110)
tmp = (y / (z * c_m)) * (9.0 * x);
elseif (t_2 <= -2e-72)
tmp = t_1;
elseif (t_2 <= 1e-177)
tmp = b / (z * c_m);
elseif (t_2 <= 1e+162)
tmp = t_1;
else
tmp = ((x / (z * c_m)) * y) * 9.0;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(-4.0 / c$95$m), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -2e+110], N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(9.0 * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -2e-72], t$95$1, If[LessEqual[t$95$2, 1e-177], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+162], t$95$1, N[(N[(N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(\frac{-4}{c\_m} \cdot t\right) \cdot a\\
t_2 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+110}:\\
\;\;\;\;\frac{y}{z \cdot c\_m} \cdot \left(9 \cdot x\right)\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-72}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{-177}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{elif}\;t\_2 \leq 10^{+162}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{x}{z \cdot c\_m} \cdot y\right) \cdot 9\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e110Initial program 82.8%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6482.8
Applied rewrites82.8%
Taylor expanded in x around inf
Applied rewrites76.2%
Applied rewrites76.1%
Applied rewrites76.1%
if -2e110 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e-72 or 9.99999999999999952e-178 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999994e161Initial program 73.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6454.3
Applied rewrites54.3%
Applied rewrites58.9%
Applied rewrites58.8%
if -1.9999999999999999e-72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999952e-178Initial program 85.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
if 9.9999999999999994e161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 73.9%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6488.3
Applied rewrites88.3%
Taylor expanded in x around inf
Applied rewrites79.8%
Taylor expanded in x around 0
Applied rewrites76.8%
Final simplification66.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* (/ x (* z c_m)) y) 9.0))
(t_2 (* (* (/ -4.0 c_m) t) a))
(t_3 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_3 -2e+110)
t_1
(if (<= t_3 -2e-72)
t_2
(if (<= t_3 1e-177) (/ b (* z c_m)) (if (<= t_3 1e+162) t_2 t_1)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((x / (z * c_m)) * y) * 9.0;
double t_2 = ((-4.0 / c_m) * t) * a;
double t_3 = (9.0 * x) * y;
double tmp;
if (t_3 <= -2e+110) {
tmp = t_1;
} else if (t_3 <= -2e-72) {
tmp = t_2;
} else if (t_3 <= 1e-177) {
tmp = b / (z * c_m);
} else if (t_3 <= 1e+162) {
tmp = t_2;
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = ((x / (z * c_m)) * y) * 9.0d0
t_2 = (((-4.0d0) / c_m) * t) * a
t_3 = (9.0d0 * x) * y
if (t_3 <= (-2d+110)) then
tmp = t_1
else if (t_3 <= (-2d-72)) then
tmp = t_2
else if (t_3 <= 1d-177) then
tmp = b / (z * c_m)
else if (t_3 <= 1d+162) then
tmp = t_2
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((x / (z * c_m)) * y) * 9.0;
double t_2 = ((-4.0 / c_m) * t) * a;
double t_3 = (9.0 * x) * y;
double tmp;
if (t_3 <= -2e+110) {
tmp = t_1;
} else if (t_3 <= -2e-72) {
tmp = t_2;
} else if (t_3 <= 1e-177) {
tmp = b / (z * c_m);
} else if (t_3 <= 1e+162) {
tmp = t_2;
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((x / (z * c_m)) * y) * 9.0 t_2 = ((-4.0 / c_m) * t) * a t_3 = (9.0 * x) * y tmp = 0 if t_3 <= -2e+110: tmp = t_1 elif t_3 <= -2e-72: tmp = t_2 elif t_3 <= 1e-177: tmp = b / (z * c_m) elif t_3 <= 1e+162: tmp = t_2 else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(x / Float64(z * c_m)) * y) * 9.0) t_2 = Float64(Float64(Float64(-4.0 / c_m) * t) * a) t_3 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_3 <= -2e+110) tmp = t_1; elseif (t_3 <= -2e-72) tmp = t_2; elseif (t_3 <= 1e-177) tmp = Float64(b / Float64(z * c_m)); elseif (t_3 <= 1e+162) tmp = t_2; else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((x / (z * c_m)) * y) * 9.0;
t_2 = ((-4.0 / c_m) * t) * a;
t_3 = (9.0 * x) * y;
tmp = 0.0;
if (t_3 <= -2e+110)
tmp = t_1;
elseif (t_3 <= -2e-72)
tmp = t_2;
elseif (t_3 <= 1e-177)
tmp = b / (z * c_m);
elseif (t_3 <= 1e+162)
tmp = t_2;
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(-4.0 / c$95$m), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]}, Block[{t$95$3 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$3, -2e+110], t$95$1, If[LessEqual[t$95$3, -2e-72], t$95$2, If[LessEqual[t$95$3, 1e-177], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 1e+162], t$95$2, t$95$1]]]]), $MachinePrecision]]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(\frac{x}{z \cdot c\_m} \cdot y\right) \cdot 9\\
t_2 := \left(\frac{-4}{c\_m} \cdot t\right) \cdot a\\
t_3 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+110}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-72}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq 10^{-177}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{elif}\;t\_3 \leq 10^{+162}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e110 or 9.9999999999999994e161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 79.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6485.1
Applied rewrites85.1%
Taylor expanded in x around inf
Applied rewrites77.8%
Taylor expanded in x around 0
Applied rewrites76.4%
if -2e110 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e-72 or 9.99999999999999952e-178 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999994e161Initial program 73.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6454.3
Applied rewrites54.3%
Applied rewrites58.9%
Applied rewrites58.8%
if -1.9999999999999999e-72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999952e-178Initial program 85.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
Final simplification66.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_1 -2e+34)
(/ (fma (* (* t z) a) -4.0 (* (* y x) 9.0)) (* z c_m))
(if (<= t_1 5e+191)
(fma (/ (* a t) c_m) -4.0 (/ b (* z c_m)))
(* (* (/ (/ x z) c_m) y) 9.0))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -2e+34) {
tmp = fma(((t * z) * a), -4.0, ((y * x) * 9.0)) / (z * c_m);
} else if (t_1 <= 5e+191) {
tmp = fma(((a * t) / c_m), -4.0, (b / (z * c_m)));
} else {
tmp = (((x / z) / c_m) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -2e+34) tmp = Float64(fma(Float64(Float64(t * z) * a), -4.0, Float64(Float64(y * x) * 9.0)) / Float64(z * c_m)); elseif (t_1 <= 5e+191) tmp = fma(Float64(Float64(a * t) / c_m), -4.0, Float64(b / Float64(z * c_m))); else tmp = Float64(Float64(Float64(Float64(x / z) / c_m) * y) * 9.0); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+34], N[(N[(N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] * -4.0 + N[(N[(y * x), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+191], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0 + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x / z), $MachinePrecision] / c$95$m), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+34}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot z\right) \cdot a, -4, \left(y \cdot x\right) \cdot 9\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+191}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a \cdot t}{c\_m}, -4, \frac{b}{z \cdot c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\frac{x}{z}}{c\_m} \cdot y\right) \cdot 9\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.99999999999999989e34Initial program 84.1%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
Applied rewrites86.0%
Taylor expanded in b around 0
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6482.5
Applied rewrites82.5%
if -1.99999999999999989e34 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000002e191Initial program 79.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6484.7
Applied rewrites84.7%
Taylor expanded in x around 0
Applied rewrites78.5%
if 5.0000000000000002e191 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.4%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6486.7
Applied rewrites86.7%
Taylor expanded in x around inf
Applied rewrites83.8%
Applied rewrites90.0%
Final simplification80.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_1 -1e+144)
(* (* (/ y (* z c_m)) x) 9.0)
(if (<= t_1 5e+191)
(fma (/ (* a t) c_m) -4.0 (/ b (* z c_m)))
(* (* (/ (/ x z) c_m) y) 9.0))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+144) {
tmp = ((y / (z * c_m)) * x) * 9.0;
} else if (t_1 <= 5e+191) {
tmp = fma(((a * t) / c_m), -4.0, (b / (z * c_m)));
} else {
tmp = (((x / z) / c_m) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -1e+144) tmp = Float64(Float64(Float64(y / Float64(z * c_m)) * x) * 9.0); elseif (t_1 <= 5e+191) tmp = fma(Float64(Float64(a * t) / c_m), -4.0, Float64(b / Float64(z * c_m))); else tmp = Float64(Float64(Float64(Float64(x / z) / c_m) * y) * 9.0); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+144], N[(N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] * 9.0), $MachinePrecision], If[LessEqual[t$95$1, 5e+191], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0 + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x / z), $MachinePrecision] / c$95$m), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+144}:\\
\;\;\;\;\left(\frac{y}{z \cdot c\_m} \cdot x\right) \cdot 9\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+191}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a \cdot t}{c\_m}, -4, \frac{b}{z \cdot c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\frac{x}{z}}{c\_m} \cdot y\right) \cdot 9\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.00000000000000002e144Initial program 81.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6481.1
Applied rewrites81.1%
Taylor expanded in x around inf
Applied rewrites76.3%
Applied rewrites76.1%
Applied rewrites76.2%
if -1.00000000000000002e144 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000002e191Initial program 80.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6484.8
Applied rewrites84.8%
Taylor expanded in x around 0
Applied rewrites78.0%
if 5.0000000000000002e191 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.4%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6486.7
Applied rewrites86.7%
Taylor expanded in x around inf
Applied rewrites83.8%
Applied rewrites90.0%
Final simplification79.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma (* a t) -4.0 (fma (/ (* y x) z) 9.0 (/ b z))) c_m)))
(*
c_s
(if (<= z -2.5e-65)
t_1
(if (<= z 4.2e-120)
(/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c_m))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma((a * t), -4.0, fma(((y * x) / z), 9.0, (b / z))) / c_m;
double tmp;
if (z <= -2.5e-65) {
tmp = t_1;
} else if (z <= 4.2e-120) {
tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(Float64(a * t), -4.0, fma(Float64(Float64(y * x) / z), 9.0, Float64(b / z))) / c_m) tmp = 0.0 if (z <= -2.5e-65) tmp = t_1; elseif (z <= 4.2e-120) tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0 + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -2.5e-65], t$95$1, If[LessEqual[z, 4.2e-120], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(a \cdot t, -4, \mathsf{fma}\left(\frac{y \cdot x}{z}, 9, \frac{b}{z}\right)\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -2.5 \cdot 10^{-65}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{-120}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -2.49999999999999991e-65 or 4.2000000000000001e-120 < z Initial program 69.8%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6488.8
Applied rewrites88.8%
Taylor expanded in c around 0
Applied rewrites90.7%
if -2.49999999999999991e-65 < z < 4.2000000000000001e-120Initial program 98.1%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites98.8%
Final simplification93.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_1 -1e+144)
(* (* (/ y (* z c_m)) x) 9.0)
(if (<= t_1 5e+191)
(/ (fma (* a t) -4.0 (/ b z)) c_m)
(* (* (/ (/ x z) c_m) y) 9.0))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+144) {
tmp = ((y / (z * c_m)) * x) * 9.0;
} else if (t_1 <= 5e+191) {
tmp = fma((a * t), -4.0, (b / z)) / c_m;
} else {
tmp = (((x / z) / c_m) * y) * 9.0;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -1e+144) tmp = Float64(Float64(Float64(y / Float64(z * c_m)) * x) * 9.0); elseif (t_1 <= 5e+191) tmp = Float64(fma(Float64(a * t), -4.0, Float64(b / z)) / c_m); else tmp = Float64(Float64(Float64(Float64(x / z) / c_m) * y) * 9.0); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+144], N[(N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] * 9.0), $MachinePrecision], If[LessEqual[t$95$1, 5e+191], N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[(N[(x / z), $MachinePrecision] / c$95$m), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+144}:\\
\;\;\;\;\left(\frac{y}{z \cdot c\_m} \cdot x\right) \cdot 9\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+191}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\frac{x}{z}}{c\_m} \cdot y\right) \cdot 9\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.00000000000000002e144Initial program 81.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6481.1
Applied rewrites81.1%
Taylor expanded in x around inf
Applied rewrites76.3%
Applied rewrites76.1%
Applied rewrites76.2%
if -1.00000000000000002e144 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000002e191Initial program 80.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6484.8
Applied rewrites84.8%
Taylor expanded in c around 0
Applied rewrites89.9%
Taylor expanded in x around 0
Applied rewrites76.1%
if 5.0000000000000002e191 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.4%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6486.7
Applied rewrites86.7%
Taylor expanded in x around inf
Applied rewrites83.8%
Applied rewrites90.0%
Final simplification77.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (fma (* (/ y (* z c_m)) 9.0) x (* (/ (* a t) c_m) -4.0))))
(*
c_s
(if (<= z -7.2e+103)
t_1
(if (<= z 2.6e+134)
(/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c_m))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(((y / (z * c_m)) * 9.0), x, (((a * t) / c_m) * -4.0));
double tmp;
if (z <= -7.2e+103) {
tmp = t_1;
} else if (z <= 2.6e+134) {
tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = fma(Float64(Float64(y / Float64(z * c_m)) * 9.0), x, Float64(Float64(Float64(a * t) / c_m) * -4.0)) tmp = 0.0 if (z <= -7.2e+103) tmp = t_1; elseif (z <= 2.6e+134) tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x + N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -7.2e+103], t$95$1, If[LessEqual[z, 2.6e+134], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(\frac{y}{z \cdot c\_m} \cdot 9, x, \frac{a \cdot t}{c\_m} \cdot -4\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -7.2 \cdot 10^{+103}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.6 \cdot 10^{+134}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -7.20000000000000033e103 or 2.6000000000000002e134 < z Initial program 51.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6492.0
Applied rewrites92.0%
Taylor expanded in b around 0
Applied rewrites79.6%
if -7.20000000000000033e103 < z < 2.6000000000000002e134Initial program 94.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites94.0%
Final simplification89.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma (* a t) -4.0 (* (/ (* y x) z) 9.0)) c_m)))
(*
c_s
(if (<= z -4.8e+102)
t_1
(if (<= z 2.6e+134)
(/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c_m))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma((a * t), -4.0, (((y * x) / z) * 9.0)) / c_m;
double tmp;
if (z <= -4.8e+102) {
tmp = t_1;
} else if (z <= 2.6e+134) {
tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(Float64(a * t), -4.0, Float64(Float64(Float64(y * x) / z) * 9.0)) / c_m) tmp = 0.0 if (z <= -4.8e+102) tmp = t_1; elseif (z <= 2.6e+134) tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -4.8e+102], t$95$1, If[LessEqual[z, 2.6e+134], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(a \cdot t, -4, \frac{y \cdot x}{z} \cdot 9\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -4.8 \cdot 10^{+102}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.6 \cdot 10^{+134}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -4.79999999999999989e102 or 2.6000000000000002e134 < z Initial program 51.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6492.0
Applied rewrites92.0%
Taylor expanded in c around 0
Applied rewrites89.9%
Taylor expanded in x around inf
Applied rewrites78.7%
if -4.79999999999999989e102 < z < 2.6000000000000002e134Initial program 94.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites94.0%
Final simplification88.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma (* a t) -4.0 (* (/ (* y x) z) 9.0)) c_m)))
(*
c_s
(if (<= z -4.8e+102)
t_1
(if (<= z 2.6e+134)
(/ (fma (* 9.0 x) y (fma (* (* -4.0 z) a) t b)) (* z c_m))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma((a * t), -4.0, (((y * x) / z) * 9.0)) / c_m;
double tmp;
if (z <= -4.8e+102) {
tmp = t_1;
} else if (z <= 2.6e+134) {
tmp = fma((9.0 * x), y, fma(((-4.0 * z) * a), t, b)) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(Float64(a * t), -4.0, Float64(Float64(Float64(y * x) / z) * 9.0)) / c_m) tmp = 0.0 if (z <= -4.8e+102) tmp = t_1; elseif (z <= 2.6e+134) tmp = Float64(fma(Float64(9.0 * x), y, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -4.8e+102], t$95$1, If[LessEqual[z, 2.6e+134], N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(a \cdot t, -4, \frac{y \cdot x}{z} \cdot 9\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -4.8 \cdot 10^{+102}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.6 \cdot 10^{+134}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -4.79999999999999989e102 or 2.6000000000000002e134 < z Initial program 51.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6492.0
Applied rewrites92.0%
Taylor expanded in c around 0
Applied rewrites89.9%
Taylor expanded in x around inf
Applied rewrites78.7%
if -4.79999999999999989e102 < z < 2.6000000000000002e134Initial program 94.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites93.9%
Final simplification88.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -4.8e+102)
(/ (fma (* a t) -4.0 (* (/ (* y x) z) 9.0)) c_m)
(if (<= z 2.5e+128)
(/ (fma (* (* t z) -4.0) a (fma (* y x) 9.0 b)) (* z c_m))
(fma (/ (* a t) c_m) -4.0 (/ b (* z c_m)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -4.8e+102) {
tmp = fma((a * t), -4.0, (((y * x) / z) * 9.0)) / c_m;
} else if (z <= 2.5e+128) {
tmp = fma(((t * z) * -4.0), a, fma((y * x), 9.0, b)) / (z * c_m);
} else {
tmp = fma(((a * t) / c_m), -4.0, (b / (z * c_m)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -4.8e+102) tmp = Float64(fma(Float64(a * t), -4.0, Float64(Float64(Float64(y * x) / z) * 9.0)) / c_m); elseif (z <= 2.5e+128) tmp = Float64(fma(Float64(Float64(t * z) * -4.0), a, fma(Float64(y * x), 9.0, b)) / Float64(z * c_m)); else tmp = fma(Float64(Float64(a * t) / c_m), -4.0, Float64(b / Float64(z * c_m))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -4.8e+102], N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 2.5e+128], N[(N[(N[(N[(t * z), $MachinePrecision] * -4.0), $MachinePrecision] * a + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0 + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -4.8 \cdot 10^{+102}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4, \frac{y \cdot x}{z} \cdot 9\right)}{c\_m}\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{+128}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot z\right) \cdot -4, a, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a \cdot t}{c\_m}, -4, \frac{b}{z \cdot c\_m}\right)\\
\end{array}
\end{array}
if z < -4.79999999999999989e102Initial program 50.9%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
Taylor expanded in c around 0
Applied rewrites87.7%
Taylor expanded in x around inf
Applied rewrites74.4%
if -4.79999999999999989e102 < z < 2.5e128Initial program 94.2%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites94.3%
if 2.5e128 < z Initial program 52.7%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6497.0
Applied rewrites97.0%
Taylor expanded in x around 0
Applied rewrites85.2%
Final simplification88.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= a -1.85e+33)
(* (* (/ -4.0 c_m) t) a)
(if (<= a 1e-36)
(/ (fma (* y x) 9.0 b) (* z c_m))
(/ (fma -4.0 (* (* t z) a) b) (* z c_m))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (a <= -1.85e+33) {
tmp = ((-4.0 / c_m) * t) * a;
} else if (a <= 1e-36) {
tmp = fma((y * x), 9.0, b) / (z * c_m);
} else {
tmp = fma(-4.0, ((t * z) * a), b) / (z * c_m);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (a <= -1.85e+33) tmp = Float64(Float64(Float64(-4.0 / c_m) * t) * a); elseif (a <= 1e-36) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c_m)); else tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(z * c_m)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[a, -1.85e+33], N[(N[(N[(-4.0 / c$95$m), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[a, 1e-36], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -1.85 \cdot 10^{+33}:\\
\;\;\;\;\left(\frac{-4}{c\_m} \cdot t\right) \cdot a\\
\mathbf{elif}\;a \leq 10^{-36}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{z \cdot c\_m}\\
\end{array}
\end{array}
if a < -1.8499999999999999e33Initial program 76.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6455.5
Applied rewrites55.5%
Applied rewrites64.7%
Applied rewrites64.6%
if -1.8499999999999999e33 < a < 9.9999999999999994e-37Initial program 83.2%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6477.1
Applied rewrites77.1%
if 9.9999999999999994e-37 < a Initial program 73.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6463.3
Applied rewrites63.3%
Final simplification70.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= t -3.05e+143)
(* (* (/ t c_m) -4.0) a)
(if (<= t 9.6e-87)
(/ (fma (* y x) 9.0 b) (* z c_m))
(* (/ (* a t) c_m) -4.0)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -3.05e+143) {
tmp = ((t / c_m) * -4.0) * a;
} else if (t <= 9.6e-87) {
tmp = fma((y * x), 9.0, b) / (z * c_m);
} else {
tmp = ((a * t) / c_m) * -4.0;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (t <= -3.05e+143) tmp = Float64(Float64(Float64(t / c_m) * -4.0) * a); elseif (t <= 9.6e-87) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(a * t) / c_m) * -4.0); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[t, -3.05e+143], N[(N[(N[(t / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[t, 9.6e-87], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -3.05 \cdot 10^{+143}:\\
\;\;\;\;\left(\frac{t}{c\_m} \cdot -4\right) \cdot a\\
\mathbf{elif}\;t \leq 9.6 \cdot 10^{-87}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot t}{c\_m} \cdot -4\\
\end{array}
\end{array}
if t < -3.0500000000000002e143Initial program 64.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6460.3
Applied rewrites60.3%
Applied rewrites75.3%
if -3.0500000000000002e143 < t < 9.5999999999999998e-87Initial program 83.8%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6472.4
Applied rewrites72.4%
if 9.5999999999999998e-87 < t Initial program 78.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6451.6
Applied rewrites51.6%
Final simplification66.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= t -1.5e+124)
(* (* (/ t c_m) -4.0) a)
(if (<= t 2.05e-87) (/ b (* z c_m)) (* (/ (* a t) c_m) -4.0)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -1.5e+124) {
tmp = ((t / c_m) * -4.0) * a;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = ((a * t) / c_m) * -4.0;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (t <= (-1.5d+124)) then
tmp = ((t / c_m) * (-4.0d0)) * a
else if (t <= 2.05d-87) then
tmp = b / (z * c_m)
else
tmp = ((a * t) / c_m) * (-4.0d0)
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -1.5e+124) {
tmp = ((t / c_m) * -4.0) * a;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = ((a * t) / c_m) * -4.0;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if t <= -1.5e+124: tmp = ((t / c_m) * -4.0) * a elif t <= 2.05e-87: tmp = b / (z * c_m) else: tmp = ((a * t) / c_m) * -4.0 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (t <= -1.5e+124) tmp = Float64(Float64(Float64(t / c_m) * -4.0) * a); elseif (t <= 2.05e-87) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(Float64(Float64(a * t) / c_m) * -4.0); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (t <= -1.5e+124)
tmp = ((t / c_m) * -4.0) * a;
elseif (t <= 2.05e-87)
tmp = b / (z * c_m);
else
tmp = ((a * t) / c_m) * -4.0;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[t, -1.5e+124], N[(N[(N[(t / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[t, 2.05e-87], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -1.5 \cdot 10^{+124}:\\
\;\;\;\;\left(\frac{t}{c\_m} \cdot -4\right) \cdot a\\
\mathbf{elif}\;t \leq 2.05 \cdot 10^{-87}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot t}{c\_m} \cdot -4\\
\end{array}
\end{array}
if t < -1.5e124Initial program 66.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6456.8
Applied rewrites56.8%
Applied rewrites69.7%
if -1.5e124 < t < 2.05000000000000016e-87Initial program 83.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6441.0
Applied rewrites41.0%
if 2.05000000000000016e-87 < t Initial program 78.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6451.6
Applied rewrites51.6%
Final simplification49.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= t -1.5e+124)
(* (* (/ t c_m) -4.0) a)
(if (<= t 2.05e-87) (/ b (* z c_m)) (* (/ -4.0 c_m) (* a t))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -1.5e+124) {
tmp = ((t / c_m) * -4.0) * a;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = (-4.0 / c_m) * (a * t);
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (t <= (-1.5d+124)) then
tmp = ((t / c_m) * (-4.0d0)) * a
else if (t <= 2.05d-87) then
tmp = b / (z * c_m)
else
tmp = ((-4.0d0) / c_m) * (a * t)
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -1.5e+124) {
tmp = ((t / c_m) * -4.0) * a;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = (-4.0 / c_m) * (a * t);
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if t <= -1.5e+124: tmp = ((t / c_m) * -4.0) * a elif t <= 2.05e-87: tmp = b / (z * c_m) else: tmp = (-4.0 / c_m) * (a * t) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (t <= -1.5e+124) tmp = Float64(Float64(Float64(t / c_m) * -4.0) * a); elseif (t <= 2.05e-87) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(Float64(-4.0 / c_m) * Float64(a * t)); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (t <= -1.5e+124)
tmp = ((t / c_m) * -4.0) * a;
elseif (t <= 2.05e-87)
tmp = b / (z * c_m);
else
tmp = (-4.0 / c_m) * (a * t);
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[t, -1.5e+124], N[(N[(N[(t / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[t, 2.05e-87], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 / c$95$m), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -1.5 \cdot 10^{+124}:\\
\;\;\;\;\left(\frac{t}{c\_m} \cdot -4\right) \cdot a\\
\mathbf{elif}\;t \leq 2.05 \cdot 10^{-87}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4}{c\_m} \cdot \left(a \cdot t\right)\\
\end{array}
\end{array}
if t < -1.5e124Initial program 66.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6456.8
Applied rewrites56.8%
Applied rewrites69.7%
if -1.5e124 < t < 2.05000000000000016e-87Initial program 83.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6441.0
Applied rewrites41.0%
if 2.05000000000000016e-87 < t Initial program 78.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6451.6
Applied rewrites51.6%
Applied rewrites51.5%
Final simplification49.3%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* (* (/ t c_m) -4.0) a))) (* c_s (if (<= t -1.5e+124) t_1 (if (<= t 2.05e-87) (/ b (* z c_m)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((t / c_m) * -4.0) * a;
double tmp;
if (t <= -1.5e+124) {
tmp = t_1;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = ((t / c_m) * (-4.0d0)) * a
if (t <= (-1.5d+124)) then
tmp = t_1
else if (t <= 2.05d-87) then
tmp = b / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((t / c_m) * -4.0) * a;
double tmp;
if (t <= -1.5e+124) {
tmp = t_1;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((t / c_m) * -4.0) * a tmp = 0 if t <= -1.5e+124: tmp = t_1 elif t <= 2.05e-87: tmp = b / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(t / c_m) * -4.0) * a) tmp = 0.0 if (t <= -1.5e+124) tmp = t_1; elseif (t <= 2.05e-87) tmp = Float64(b / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((t / c_m) * -4.0) * a;
tmp = 0.0;
if (t <= -1.5e+124)
tmp = t_1;
elseif (t <= 2.05e-87)
tmp = b / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(t / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision] * a), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t, -1.5e+124], t$95$1, If[LessEqual[t, 2.05e-87], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(\frac{t}{c\_m} \cdot -4\right) \cdot a\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -1.5 \cdot 10^{+124}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 2.05 \cdot 10^{-87}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if t < -1.5e124 or 2.05000000000000016e-87 < t Initial program 74.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6453.4
Applied rewrites53.4%
Applied rewrites59.3%
if -1.5e124 < t < 2.05000000000000016e-87Initial program 83.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6441.0
Applied rewrites41.0%
Final simplification50.0%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* (* (/ -4.0 c_m) t) a))) (* c_s (if (<= t -1.5e+124) t_1 (if (<= t 2.05e-87) (/ b (* z c_m)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((-4.0 / c_m) * t) * a;
double tmp;
if (t <= -1.5e+124) {
tmp = t_1;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = (((-4.0d0) / c_m) * t) * a
if (t <= (-1.5d+124)) then
tmp = t_1
else if (t <= 2.05d-87) then
tmp = b / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((-4.0 / c_m) * t) * a;
double tmp;
if (t <= -1.5e+124) {
tmp = t_1;
} else if (t <= 2.05e-87) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((-4.0 / c_m) * t) * a tmp = 0 if t <= -1.5e+124: tmp = t_1 elif t <= 2.05e-87: tmp = b / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(-4.0 / c_m) * t) * a) tmp = 0.0 if (t <= -1.5e+124) tmp = t_1; elseif (t <= 2.05e-87) tmp = Float64(b / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((-4.0 / c_m) * t) * a;
tmp = 0.0;
if (t <= -1.5e+124)
tmp = t_1;
elseif (t <= 2.05e-87)
tmp = b / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(-4.0 / c$95$m), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t, -1.5e+124], t$95$1, If[LessEqual[t, 2.05e-87], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(\frac{-4}{c\_m} \cdot t\right) \cdot a\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -1.5 \cdot 10^{+124}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 2.05 \cdot 10^{-87}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if t < -1.5e124 or 2.05000000000000016e-87 < t Initial program 74.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6453.4
Applied rewrites53.4%
Applied rewrites59.3%
Applied rewrites59.2%
if -1.5e124 < t < 2.05000000000000016e-87Initial program 83.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6441.0
Applied rewrites41.0%
Final simplification50.0%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (/ b (* z c_m))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (z * c_m));
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_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
real(8), intent (in) :: b
real(8), intent (in) :: c_m
code = c_s * (b / (z * c_m))
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (z * c_m));
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): return c_s * (b / (z * c_m))
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) return Float64(c_s * Float64(b / Float64(z * c_m))) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp = code(c_s, x, y, z, t, a, b, c_m)
tmp = c_s * (b / (z * c_m));
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{z \cdot c\_m}
\end{array}
Initial program 79.2%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6434.3
Applied rewrites34.3%
Final simplification34.3%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024296
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))