
(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 16 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}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -8.5e-19)
(fma (* (/ y (* c z)) 9.0) x (fma (* -4.0 (/ a c)) t (/ b (* c z))))
(if (<= z 1.6e+102)
(/ (+ (- (* (* 9.0 x) y) (* (* (* 4.0 z) t) a)) b) (* c z))
(/ (fma (* (/ y z) 9.0) x (* (* a t) -4.0)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8.5e-19) {
tmp = fma(((y / (c * z)) * 9.0), x, fma((-4.0 * (a / c)), t, (b / (c * z))));
} else if (z <= 1.6e+102) {
tmp = ((((9.0 * x) * y) - (((4.0 * z) * t) * a)) + b) / (c * z);
} else {
tmp = fma(((y / z) * 9.0), x, ((a * t) * -4.0)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -8.5e-19) tmp = fma(Float64(Float64(y / Float64(c * z)) * 9.0), x, fma(Float64(-4.0 * Float64(a / c)), t, Float64(b / Float64(c * z)))); elseif (z <= 1.6e+102) tmp = Float64(Float64(Float64(Float64(Float64(9.0 * x) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(c * z)); else tmp = Float64(fma(Float64(Float64(y / z) * 9.0), x, Float64(Float64(a * t) * -4.0)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -8.5e-19], N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x + N[(N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision] * t + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.6e+102], N[(N[(N[(N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y / z), $MachinePrecision] * 9.0), $MachinePrecision] * x + N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8.5 \cdot 10^{-19}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{c \cdot z} \cdot 9, x, \mathsf{fma}\left(-4 \cdot \frac{a}{c}, t, \frac{b}{c \cdot z}\right)\right)\\
\mathbf{elif}\;z \leq 1.6 \cdot 10^{+102}:\\
\;\;\;\;\frac{\left(\left(9 \cdot x\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{y}{z} \cdot 9, x, \left(a \cdot t\right) \cdot -4\right)}{c}\\
\end{array}
\end{array}
if z < -8.50000000000000003e-19Initial program 67.9%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites88.6%
if -8.50000000000000003e-19 < z < 1.6e102Initial program 93.8%
if 1.6e102 < z Initial program 37.3%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6447.7
Applied rewrites47.7%
Taylor expanded in a around 0
Applied rewrites84.3%
Final simplification90.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(if (<= t_1 -1e+18)
(* (* (/ y (* c z)) 9.0) x)
(if (<= t_1 -5e-49)
(/ (/ b c) z)
(if (<= t_1 -5e-233)
(* (* (/ a c) t) -4.0)
(if (<= t_1 0.0)
(/ 1.0 (* (/ z b) c))
(if (<= t_1 2e+143)
(* (* (/ t c) a) -4.0)
(/ (* (* y x) 9.0) (* c z)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+18) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = 1.0 / ((z / b) * c);
} else if (t_1 <= 2e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = ((y * x) * 9.0) / (c * z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
t_1 = (9.0d0 * x) * y
if (t_1 <= (-1d+18)) then
tmp = ((y / (c * z)) * 9.0d0) * x
else if (t_1 <= (-5d-49)) then
tmp = (b / c) / z
else if (t_1 <= (-5d-233)) then
tmp = ((a / c) * t) * (-4.0d0)
else if (t_1 <= 0.0d0) then
tmp = 1.0d0 / ((z / b) * c)
else if (t_1 <= 2d+143) then
tmp = ((t / c) * a) * (-4.0d0)
else
tmp = ((y * x) * 9.0d0) / (c * z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+18) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = 1.0 / ((z / b) * c);
} else if (t_1 <= 2e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = ((y * x) * 9.0) / (c * z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (9.0 * x) * y tmp = 0 if t_1 <= -1e+18: tmp = ((y / (c * z)) * 9.0) * x elif t_1 <= -5e-49: tmp = (b / c) / z elif t_1 <= -5e-233: tmp = ((a / c) * t) * -4.0 elif t_1 <= 0.0: tmp = 1.0 / ((z / b) * c) elif t_1 <= 2e+143: tmp = ((t / c) * a) * -4.0 else: tmp = ((y * x) * 9.0) / (c * z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -1e+18) tmp = Float64(Float64(Float64(y / Float64(c * z)) * 9.0) * x); elseif (t_1 <= -5e-49) tmp = Float64(Float64(b / c) / z); elseif (t_1 <= -5e-233) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); elseif (t_1 <= 0.0) tmp = Float64(1.0 / Float64(Float64(z / b) * c)); elseif (t_1 <= 2e+143) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); else tmp = Float64(Float64(Float64(y * x) * 9.0) / Float64(c * z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (9.0 * x) * y;
tmp = 0.0;
if (t_1 <= -1e+18)
tmp = ((y / (c * z)) * 9.0) * x;
elseif (t_1 <= -5e-49)
tmp = (b / c) / z;
elseif (t_1 <= -5e-233)
tmp = ((a / c) * t) * -4.0;
elseif (t_1 <= 0.0)
tmp = 1.0 / ((z / b) * c);
elseif (t_1 <= 2e+143)
tmp = ((t / c) * a) * -4.0;
else
tmp = ((y * x) * 9.0) / (c * z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+18], N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[t$95$1, -5e-49], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, -5e-233], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(1.0 / N[(N[(z / b), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+143], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(N[(y * x), $MachinePrecision] * 9.0), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+18}:\\
\;\;\;\;\left(\frac{y}{c \cdot z} \cdot 9\right) \cdot x\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-233}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{1}{\frac{z}{b} \cdot c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+143}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(y \cdot x\right) \cdot 9}{c \cdot z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1e18Initial program 63.1%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6458.1
Applied rewrites58.1%
Applied rewrites56.4%
if -1e18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e-49Initial program 80.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6466.5
Applied rewrites66.5%
Applied rewrites66.7%
if -4.9999999999999999e-49 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000012e-233Initial program 76.0%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites69.8%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6463.4
Applied rewrites63.4%
Applied rewrites66.1%
if -5.00000000000000012e-233 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 0.0Initial program 86.2%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites84.2%
Taylor expanded in b around inf
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6461.4
Applied rewrites61.4%
Applied rewrites62.5%
if 0.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2e143Initial program 82.1%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites82.4%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.5
Applied rewrites55.5%
Applied rewrites55.5%
if 2e143 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 75.7%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.9
Applied rewrites72.9%
Final simplification61.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(if (<= t_1 -1e+18)
(* (* (/ y (* c z)) 9.0) x)
(if (<= t_1 -5e-49)
(/ (/ b c) z)
(if (<= t_1 -5e-233)
(* (* (/ a c) t) -4.0)
(if (<= t_1 0.0)
(/ (/ b z) c)
(if (<= t_1 2e+143)
(* (* (/ t c) a) -4.0)
(/ (* (* y x) 9.0) (* c z)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+18) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = (b / z) / c;
} else if (t_1 <= 2e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = ((y * x) * 9.0) / (c * z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
t_1 = (9.0d0 * x) * y
if (t_1 <= (-1d+18)) then
tmp = ((y / (c * z)) * 9.0d0) * x
else if (t_1 <= (-5d-49)) then
tmp = (b / c) / z
else if (t_1 <= (-5d-233)) then
tmp = ((a / c) * t) * (-4.0d0)
else if (t_1 <= 0.0d0) then
tmp = (b / z) / c
else if (t_1 <= 2d+143) then
tmp = ((t / c) * a) * (-4.0d0)
else
tmp = ((y * x) * 9.0d0) / (c * z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+18) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = (b / z) / c;
} else if (t_1 <= 2e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = ((y * x) * 9.0) / (c * z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (9.0 * x) * y tmp = 0 if t_1 <= -1e+18: tmp = ((y / (c * z)) * 9.0) * x elif t_1 <= -5e-49: tmp = (b / c) / z elif t_1 <= -5e-233: tmp = ((a / c) * t) * -4.0 elif t_1 <= 0.0: tmp = (b / z) / c elif t_1 <= 2e+143: tmp = ((t / c) * a) * -4.0 else: tmp = ((y * x) * 9.0) / (c * z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -1e+18) tmp = Float64(Float64(Float64(y / Float64(c * z)) * 9.0) * x); elseif (t_1 <= -5e-49) tmp = Float64(Float64(b / c) / z); elseif (t_1 <= -5e-233) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); elseif (t_1 <= 0.0) tmp = Float64(Float64(b / z) / c); elseif (t_1 <= 2e+143) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); else tmp = Float64(Float64(Float64(y * x) * 9.0) / Float64(c * z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (9.0 * x) * y;
tmp = 0.0;
if (t_1 <= -1e+18)
tmp = ((y / (c * z)) * 9.0) * x;
elseif (t_1 <= -5e-49)
tmp = (b / c) / z;
elseif (t_1 <= -5e-233)
tmp = ((a / c) * t) * -4.0;
elseif (t_1 <= 0.0)
tmp = (b / z) / c;
elseif (t_1 <= 2e+143)
tmp = ((t / c) * a) * -4.0;
else
tmp = ((y * x) * 9.0) / (c * z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+18], N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[t$95$1, -5e-49], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, -5e-233], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 2e+143], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(N[(y * x), $MachinePrecision] * 9.0), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+18}:\\
\;\;\;\;\left(\frac{y}{c \cdot z} \cdot 9\right) \cdot x\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-233}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+143}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(y \cdot x\right) \cdot 9}{c \cdot z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1e18Initial program 63.1%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6458.1
Applied rewrites58.1%
Applied rewrites56.4%
if -1e18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e-49Initial program 80.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6466.5
Applied rewrites66.5%
Applied rewrites66.7%
if -4.9999999999999999e-49 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000012e-233Initial program 76.0%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites69.8%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6463.4
Applied rewrites63.4%
Applied rewrites66.1%
if -5.00000000000000012e-233 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 0.0Initial program 86.2%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites84.2%
Taylor expanded in b around inf
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6461.4
Applied rewrites61.4%
if 0.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2e143Initial program 82.1%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites82.4%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.5
Applied rewrites55.5%
Applied rewrites55.5%
if 2e143 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 75.7%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.9
Applied rewrites72.9%
Final simplification60.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)) (t_2 (* (* (/ y (* c z)) 9.0) x)))
(if (<= t_1 -1e+18)
t_2
(if (<= t_1 -5e-49)
(/ (/ b c) z)
(if (<= t_1 -5e-233)
(* (* (/ a c) t) -4.0)
(if (<= t_1 0.0)
(/ (/ b z) c)
(if (<= t_1 1e+143) (* (* (/ t c) a) -4.0) t_2)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = ((y / (c * z)) * 9.0) * x;
double tmp;
if (t_1 <= -1e+18) {
tmp = t_2;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = (b / z) / c;
} else if (t_1 <= 1e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
t_1 = (9.0d0 * x) * y
t_2 = ((y / (c * z)) * 9.0d0) * x
if (t_1 <= (-1d+18)) then
tmp = t_2
else if (t_1 <= (-5d-49)) then
tmp = (b / c) / z
else if (t_1 <= (-5d-233)) then
tmp = ((a / c) * t) * (-4.0d0)
else if (t_1 <= 0.0d0) then
tmp = (b / z) / c
else if (t_1 <= 1d+143) then
tmp = ((t / c) * a) * (-4.0d0)
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = ((y / (c * z)) * 9.0) * x;
double tmp;
if (t_1 <= -1e+18) {
tmp = t_2;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = (b / z) / c;
} else if (t_1 <= 1e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (9.0 * x) * y t_2 = ((y / (c * z)) * 9.0) * x tmp = 0 if t_1 <= -1e+18: tmp = t_2 elif t_1 <= -5e-49: tmp = (b / c) / z elif t_1 <= -5e-233: tmp = ((a / c) * t) * -4.0 elif t_1 <= 0.0: tmp = (b / z) / c elif t_1 <= 1e+143: tmp = ((t / c) * a) * -4.0 else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) t_2 = Float64(Float64(Float64(y / Float64(c * z)) * 9.0) * x) tmp = 0.0 if (t_1 <= -1e+18) tmp = t_2; elseif (t_1 <= -5e-49) tmp = Float64(Float64(b / c) / z); elseif (t_1 <= -5e-233) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); elseif (t_1 <= 0.0) tmp = Float64(Float64(b / z) / c); elseif (t_1 <= 1e+143) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (9.0 * x) * y;
t_2 = ((y / (c * z)) * 9.0) * x;
tmp = 0.0;
if (t_1 <= -1e+18)
tmp = t_2;
elseif (t_1 <= -5e-49)
tmp = (b / c) / z;
elseif (t_1 <= -5e-233)
tmp = ((a / c) * t) * -4.0;
elseif (t_1 <= 0.0)
tmp = (b / z) / c;
elseif (t_1 <= 1e+143)
tmp = ((t / c) * a) * -4.0;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+18], t$95$2, If[LessEqual[t$95$1, -5e-49], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, -5e-233], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 1e+143], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], t$95$2]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \left(\frac{y}{c \cdot z} \cdot 9\right) \cdot x\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+18}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-233}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 10^{+143}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1e18 or 1e143 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 68.1%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6461.8
Applied rewrites61.8%
Applied rewrites63.9%
if -1e18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e-49Initial program 80.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6466.5
Applied rewrites66.5%
Applied rewrites66.7%
if -4.9999999999999999e-49 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000012e-233Initial program 76.0%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites69.8%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6463.4
Applied rewrites63.4%
Applied rewrites66.1%
if -5.00000000000000012e-233 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 0.0Initial program 86.2%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites84.2%
Taylor expanded in b around inf
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6461.4
Applied rewrites61.4%
if 0.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e143Initial program 81.8%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites82.2%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6454.9
Applied rewrites54.9%
Applied rewrites54.9%
Final simplification61.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)) (t_2 (* (/ x (* c z)) (* y 9.0))))
(if (<= t_1 -1e+18)
t_2
(if (<= t_1 -5e-49)
(/ (/ b c) z)
(if (<= t_1 -5e-233)
(* (* (/ a c) t) -4.0)
(if (<= t_1 0.0)
(/ (/ b z) c)
(if (<= t_1 2e+143) (* (* (/ t c) a) -4.0) t_2)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = (x / (c * z)) * (y * 9.0);
double tmp;
if (t_1 <= -1e+18) {
tmp = t_2;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = (b / z) / c;
} else if (t_1 <= 2e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
t_1 = (9.0d0 * x) * y
t_2 = (x / (c * z)) * (y * 9.0d0)
if (t_1 <= (-1d+18)) then
tmp = t_2
else if (t_1 <= (-5d-49)) then
tmp = (b / c) / z
else if (t_1 <= (-5d-233)) then
tmp = ((a / c) * t) * (-4.0d0)
else if (t_1 <= 0.0d0) then
tmp = (b / z) / c
else if (t_1 <= 2d+143) then
tmp = ((t / c) * a) * (-4.0d0)
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = (x / (c * z)) * (y * 9.0);
double tmp;
if (t_1 <= -1e+18) {
tmp = t_2;
} else if (t_1 <= -5e-49) {
tmp = (b / c) / z;
} else if (t_1 <= -5e-233) {
tmp = ((a / c) * t) * -4.0;
} else if (t_1 <= 0.0) {
tmp = (b / z) / c;
} else if (t_1 <= 2e+143) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (9.0 * x) * y t_2 = (x / (c * z)) * (y * 9.0) tmp = 0 if t_1 <= -1e+18: tmp = t_2 elif t_1 <= -5e-49: tmp = (b / c) / z elif t_1 <= -5e-233: tmp = ((a / c) * t) * -4.0 elif t_1 <= 0.0: tmp = (b / z) / c elif t_1 <= 2e+143: tmp = ((t / c) * a) * -4.0 else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) t_2 = Float64(Float64(x / Float64(c * z)) * Float64(y * 9.0)) tmp = 0.0 if (t_1 <= -1e+18) tmp = t_2; elseif (t_1 <= -5e-49) tmp = Float64(Float64(b / c) / z); elseif (t_1 <= -5e-233) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); elseif (t_1 <= 0.0) tmp = Float64(Float64(b / z) / c); elseif (t_1 <= 2e+143) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (9.0 * x) * y;
t_2 = (x / (c * z)) * (y * 9.0);
tmp = 0.0;
if (t_1 <= -1e+18)
tmp = t_2;
elseif (t_1 <= -5e-49)
tmp = (b / c) / z;
elseif (t_1 <= -5e-233)
tmp = ((a / c) * t) * -4.0;
elseif (t_1 <= 0.0)
tmp = (b / z) / c;
elseif (t_1 <= 2e+143)
tmp = ((t / c) * a) * -4.0;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * N[(y * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+18], t$95$2, If[LessEqual[t$95$1, -5e-49], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, -5e-233], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 2e+143], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], t$95$2]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \frac{x}{c \cdot z} \cdot \left(y \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+18}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-49}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-233}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+143}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1e18 or 2e143 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 67.7%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6462.5
Applied rewrites62.5%
Applied rewrites62.5%
Applied rewrites61.2%
if -1e18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e-49Initial program 80.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6466.5
Applied rewrites66.5%
Applied rewrites66.7%
if -4.9999999999999999e-49 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000012e-233Initial program 76.0%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites69.8%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6463.4
Applied rewrites63.4%
Applied rewrites66.1%
if -5.00000000000000012e-233 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 0.0Initial program 86.2%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites84.2%
Taylor expanded in b around inf
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6461.4
Applied rewrites61.4%
if 0.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2e143Initial program 82.1%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites82.4%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.5
Applied rewrites55.5%
Applied rewrites55.5%
Final simplification60.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)) (t_2 (fma (* y x) 9.0 b)))
(if (<= t_1 -5e+305)
(* (/ x z) (/ (* y 9.0) c))
(if (<= t_1 -5e-53)
(/ t_2 (* c z))
(if (<= t_1 0.0)
(/ (/ (fma (* (* a t) -4.0) z b) z) c)
(if (<= t_1 1e+142)
(fma (* -4.0 (/ a c)) t (/ b (* c z)))
(/ (/ t_2 c) z)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = fma((y * x), 9.0, b);
double tmp;
if (t_1 <= -5e+305) {
tmp = (x / z) * ((y * 9.0) / c);
} else if (t_1 <= -5e-53) {
tmp = t_2 / (c * z);
} else if (t_1 <= 0.0) {
tmp = (fma(((a * t) * -4.0), z, b) / z) / c;
} else if (t_1 <= 1e+142) {
tmp = fma((-4.0 * (a / c)), t, (b / (c * z)));
} else {
tmp = (t_2 / c) / z;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) t_2 = fma(Float64(y * x), 9.0, b) tmp = 0.0 if (t_1 <= -5e+305) tmp = Float64(Float64(x / z) * Float64(Float64(y * 9.0) / c)); elseif (t_1 <= -5e-53) tmp = Float64(t_2 / Float64(c * z)); elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(Float64(Float64(a * t) * -4.0), z, b) / z) / c); elseif (t_1 <= 1e+142) tmp = fma(Float64(-4.0 * Float64(a / c)), t, Float64(b / Float64(c * z))); else tmp = Float64(Float64(t_2 / c) / z); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+305], N[(N[(x / z), $MachinePrecision] * N[(N[(y * 9.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -5e-53], N[(t$95$2 / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 1e+142], N[(N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision] * t + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \mathsf{fma}\left(y \cdot x, 9, b\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+305}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{y \cdot 9}{c}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-53}:\\
\;\;\;\;\frac{t\_2}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(a \cdot t\right) \cdot -4, z, b\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 10^{+142}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot \frac{a}{c}, t, \frac{b}{c \cdot z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_2}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000009e305Initial program 40.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.6
Applied rewrites87.6%
Applied rewrites87.7%
if -5.00000000000000009e305 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5e-53Initial program 75.6%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6472.5
Applied rewrites72.5%
if -5e-53 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 0.0Initial program 82.6%
Taylor expanded in y around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6489.3
Applied rewrites89.3%
if 0.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000005e142Initial program 81.6%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites81.9%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6454.3
Applied rewrites54.3%
Taylor expanded in x around inf
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites67.5%
Taylor expanded in x around 0
Applied rewrites79.2%
if 1.00000000000000005e142 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.2%
Taylor expanded in a around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
Final simplification80.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* a t) -4.0)) (t_2 (* (* 9.0 x) y)))
(if (<= t_2 -5e+305)
(* (/ x z) (/ (* y 9.0) c))
(if (<= t_2 -5e-53)
(/ (fma (* y x) 9.0 b) (* c z))
(if (<= t_2 5e-31)
(/ (/ (fma t_1 z b) z) c)
(/ (fma (* (/ y z) 9.0) x t_1) c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (a * t) * -4.0;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -5e+305) {
tmp = (x / z) * ((y * 9.0) / c);
} else if (t_2 <= -5e-53) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else if (t_2 <= 5e-31) {
tmp = (fma(t_1, z, b) / z) / c;
} else {
tmp = fma(((y / z) * 9.0), x, t_1) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(a * t) * -4.0) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -5e+305) tmp = Float64(Float64(x / z) * Float64(Float64(y * 9.0) / c)); elseif (t_2 <= -5e-53) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); elseif (t_2 <= 5e-31) tmp = Float64(Float64(fma(t_1, z, b) / z) / c); else tmp = Float64(fma(Float64(Float64(y / z) * 9.0), x, t_1) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+305], N[(N[(x / z), $MachinePrecision] * N[(N[(y * 9.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-53], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e-31], N[(N[(N[(t$95$1 * z + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(N[(y / z), $MachinePrecision] * 9.0), $MachinePrecision] * x + t$95$1), $MachinePrecision] / c), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot t\right) \cdot -4\\
t_2 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+305}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{y \cdot 9}{c}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-53}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{-31}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(t\_1, z, b\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{y}{z} \cdot 9, x, t\_1\right)}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000009e305Initial program 40.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.6
Applied rewrites87.6%
Applied rewrites87.7%
if -5.00000000000000009e305 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5e-53Initial program 75.6%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6472.5
Applied rewrites72.5%
if -5e-53 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e-31Initial program 80.8%
Taylor expanded in y around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6487.3
Applied rewrites87.3%
if 5e-31 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 81.7%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
Taylor expanded in a around 0
Applied rewrites83.1%
Final simplification82.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(if (<= t_1 -5e+305)
(* (/ x z) (/ (* y 9.0) c))
(if (<= t_1 -5e-53)
(/ (fma (* y x) 9.0 b) (* c z))
(if (<= t_1 1e-19)
(/ (/ (fma (* (* a t) -4.0) z b) z) c)
(/ (fma -4.0 (* (* t z) a) (* (* y x) 9.0)) (* c z)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -5e+305) {
tmp = (x / z) * ((y * 9.0) / c);
} else if (t_1 <= -5e-53) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else if (t_1 <= 1e-19) {
tmp = (fma(((a * t) * -4.0), z, b) / z) / c;
} else {
tmp = fma(-4.0, ((t * z) * a), ((y * x) * 9.0)) / (c * z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -5e+305) tmp = Float64(Float64(x / z) * Float64(Float64(y * 9.0) / c)); elseif (t_1 <= -5e-53) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); elseif (t_1 <= 1e-19) tmp = Float64(Float64(fma(Float64(Float64(a * t) * -4.0), z, b) / z) / c); else tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), Float64(Float64(y * x) * 9.0)) / Float64(c * z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+305], N[(N[(x / z), $MachinePrecision] * N[(N[(y * 9.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -5e-53], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-19], N[(N[(N[(N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + N[(N[(y * x), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+305}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{y \cdot 9}{c}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-53}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 10^{-19}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(a \cdot t\right) \cdot -4, z, b\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, \left(y \cdot x\right) \cdot 9\right)}{c \cdot z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000009e305Initial program 40.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.6
Applied rewrites87.6%
Applied rewrites87.7%
if -5.00000000000000009e305 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5e-53Initial program 75.6%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6472.5
Applied rewrites72.5%
if -5e-53 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999998e-20Initial program 80.2%
Taylor expanded in y around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6486.6
Applied rewrites86.6%
if 9.9999999999999998e-20 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 82.7%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.6
Applied rewrites75.6%
Final simplification80.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)) (t_2 (fma (* y x) 9.0 b)))
(if (<= t_1 -5e+305)
(* (/ x z) (/ (* y 9.0) c))
(if (<= t_1 -5e+71)
(/ t_2 (* c z))
(if (<= t_1 1e+142)
(fma (* -4.0 (/ a c)) t (/ b (* c z)))
(/ (/ t_2 c) z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = fma((y * x), 9.0, b);
double tmp;
if (t_1 <= -5e+305) {
tmp = (x / z) * ((y * 9.0) / c);
} else if (t_1 <= -5e+71) {
tmp = t_2 / (c * z);
} else if (t_1 <= 1e+142) {
tmp = fma((-4.0 * (a / c)), t, (b / (c * z)));
} else {
tmp = (t_2 / c) / z;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) t_2 = fma(Float64(y * x), 9.0, b) tmp = 0.0 if (t_1 <= -5e+305) tmp = Float64(Float64(x / z) * Float64(Float64(y * 9.0) / c)); elseif (t_1 <= -5e+71) tmp = Float64(t_2 / Float64(c * z)); elseif (t_1 <= 1e+142) tmp = fma(Float64(-4.0 * Float64(a / c)), t, Float64(b / Float64(c * z))); else tmp = Float64(Float64(t_2 / c) / z); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+305], N[(N[(x / z), $MachinePrecision] * N[(N[(y * 9.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -5e+71], N[(t$95$2 / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+142], N[(N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision] * t + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 / c), $MachinePrecision] / z), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \mathsf{fma}\left(y \cdot x, 9, b\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+305}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{y \cdot 9}{c}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{+71}:\\
\;\;\;\;\frac{t\_2}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 10^{+142}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot \frac{a}{c}, t, \frac{b}{c \cdot z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_2}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000009e305Initial program 40.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.6
Applied rewrites87.6%
Applied rewrites87.7%
if -5.00000000000000009e305 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.99999999999999972e71Initial program 72.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6480.8
Applied rewrites80.8%
if -4.99999999999999972e71 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000005e142Initial program 81.3%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites80.0%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6448.9
Applied rewrites48.9%
Taylor expanded in x around inf
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites58.5%
Taylor expanded in x around 0
Applied rewrites78.5%
if 1.00000000000000005e142 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.2%
Taylor expanded in a around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
Final simplification78.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)) (t_2 (fma (* y x) 9.0 b)))
(if (<= t_1 -5e+305)
(* (/ x z) (/ (* y 9.0) c))
(if (<= t_1 -2e+18)
(/ t_2 (* c z))
(if (<= t_1 1e+142)
(/ (fma (* (* a t) -4.0) z b) (* c z))
(/ (/ t_2 c) z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double t_2 = fma((y * x), 9.0, b);
double tmp;
if (t_1 <= -5e+305) {
tmp = (x / z) * ((y * 9.0) / c);
} else if (t_1 <= -2e+18) {
tmp = t_2 / (c * z);
} else if (t_1 <= 1e+142) {
tmp = fma(((a * t) * -4.0), z, b) / (c * z);
} else {
tmp = (t_2 / c) / z;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) t_2 = fma(Float64(y * x), 9.0, b) tmp = 0.0 if (t_1 <= -5e+305) tmp = Float64(Float64(x / z) * Float64(Float64(y * 9.0) / c)); elseif (t_1 <= -2e+18) tmp = Float64(t_2 / Float64(c * z)); elseif (t_1 <= 1e+142) tmp = Float64(fma(Float64(Float64(a * t) * -4.0), z, b) / Float64(c * z)); else tmp = Float64(Float64(t_2 / c) / z); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+305], N[(N[(x / z), $MachinePrecision] * N[(N[(y * 9.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -2e+18], N[(t$95$2 / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+142], N[(N[(N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 / c), $MachinePrecision] / z), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \mathsf{fma}\left(y \cdot x, 9, b\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+305}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{y \cdot 9}{c}\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{+18}:\\
\;\;\;\;\frac{t\_2}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 10^{+142}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(a \cdot t\right) \cdot -4, z, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_2}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000009e305Initial program 40.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.6
Applied rewrites87.6%
Applied rewrites87.7%
if -5.00000000000000009e305 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e18Initial program 74.0%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.4
Applied rewrites74.4%
if -2e18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000005e142Initial program 81.6%
Taylor expanded in y around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.2
Applied rewrites76.2%
if 1.00000000000000005e142 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.2%
Taylor expanded in a around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.7
Applied rewrites74.7%
Final simplification76.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)))
(if (<= t_1 -5e+305)
(* (/ x z) (/ (* y 9.0) c))
(if (<= t_1 -2e+18)
(/ (fma (* y x) 9.0 b) (* c z))
(if (<= t_1 1e+142)
(/ (fma (* (* a t) -4.0) z b) (* c z))
(/ (* (* (/ y c) 9.0) x) z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -5e+305) {
tmp = (x / z) * ((y * 9.0) / c);
} else if (t_1 <= -2e+18) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else if (t_1 <= 1e+142) {
tmp = fma(((a * t) * -4.0), z, b) / (c * z);
} else {
tmp = (((y / c) * 9.0) * x) / z;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -5e+305) tmp = Float64(Float64(x / z) * Float64(Float64(y * 9.0) / c)); elseif (t_1 <= -2e+18) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); elseif (t_1 <= 1e+142) tmp = Float64(fma(Float64(Float64(a * t) * -4.0), z, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(Float64(y / c) * 9.0) * x) / z); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+305], N[(N[(x / z), $MachinePrecision] * N[(N[(y * 9.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -2e+18], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+142], N[(N[(N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * x), $MachinePrecision] / z), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+305}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{y \cdot 9}{c}\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{+18}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 10^{+142}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(a \cdot t\right) \cdot -4, z, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\frac{y}{c} \cdot 9\right) \cdot x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000009e305Initial program 40.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.6
Applied rewrites87.6%
Applied rewrites87.7%
if -5.00000000000000009e305 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e18Initial program 74.0%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.4
Applied rewrites74.4%
if -2e18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000005e142Initial program 81.6%
Taylor expanded in y around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.2
Applied rewrites76.2%
if 1.00000000000000005e142 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.2%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6466.0
Applied rewrites66.0%
Applied rewrites74.7%
Final simplification76.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -7.5e+144)
(fma (* -4.0 (/ a c)) t (/ (/ b z) c))
(if (<= z 1.6e+102)
(/ (+ (- (* (* 9.0 x) y) (* (* (* 4.0 z) t) a)) b) (* c z))
(/ (fma (* (/ y z) 9.0) x (* (* a t) -4.0)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -7.5e+144) {
tmp = fma((-4.0 * (a / c)), t, ((b / z) / c));
} else if (z <= 1.6e+102) {
tmp = ((((9.0 * x) * y) - (((4.0 * z) * t) * a)) + b) / (c * z);
} else {
tmp = fma(((y / z) * 9.0), x, ((a * t) * -4.0)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -7.5e+144) tmp = fma(Float64(-4.0 * Float64(a / c)), t, Float64(Float64(b / z) / c)); elseif (z <= 1.6e+102) tmp = Float64(Float64(Float64(Float64(Float64(9.0 * x) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(c * z)); else tmp = Float64(fma(Float64(Float64(y / z) * 9.0), x, Float64(Float64(a * t) * -4.0)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -7.5e+144], N[(N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision] * t + N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.6e+102], N[(N[(N[(N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y / z), $MachinePrecision] * 9.0), $MachinePrecision] * x + N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -7.5 \cdot 10^{+144}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot \frac{a}{c}, t, \frac{\frac{b}{z}}{c}\right)\\
\mathbf{elif}\;z \leq 1.6 \cdot 10^{+102}:\\
\;\;\;\;\frac{\left(\left(9 \cdot x\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{y}{z} \cdot 9, x, \left(a \cdot t\right) \cdot -4\right)}{c}\\
\end{array}
\end{array}
if z < -7.5000000000000006e144Initial program 54.2%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites89.8%
Taylor expanded in y around 0
Applied rewrites82.9%
if -7.5000000000000006e144 < z < 1.6e102Initial program 90.9%
if 1.6e102 < z Initial program 37.3%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6447.7
Applied rewrites47.7%
Taylor expanded in a around 0
Applied rewrites84.3%
Final simplification88.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -3.9e+126) (* (* (/ a c) t) -4.0) (if (<= z 6.5e-48) (/ (fma (* y x) 9.0 b) (* c z)) (* (/ (* a t) c) -4.0))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3.9e+126) {
tmp = ((a / c) * t) * -4.0;
} else if (z <= 6.5e-48) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = ((a * t) / c) * -4.0;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3.9e+126) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); elseif (z <= 6.5e-48) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(a * t) / c) * -4.0); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -3.9e+126], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 6.5e-48], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.9 \cdot 10^{+126}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{elif}\;z \leq 6.5 \cdot 10^{-48}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\end{array}
\end{array}
if z < -3.89999999999999993e126Initial program 58.5%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites88.4%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6466.7
Applied rewrites66.7%
Applied rewrites66.8%
if -3.89999999999999993e126 < z < 6.5e-48Initial program 90.5%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.6
Applied rewrites74.6%
if 6.5e-48 < z Initial program 58.2%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6465.6
Applied rewrites65.6%
Final simplification71.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -1.26e-63) (* (* (/ t c) a) -4.0) (if (<= z 1.15e-88) (/ b (* c z)) (* (/ (* a t) c) -4.0))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.26e-63) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= 1.15e-88) {
tmp = b / (c * z);
} else {
tmp = ((a * t) / c) * -4.0;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
if (z <= (-1.26d-63)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (z <= 1.15d-88) then
tmp = b / (c * z)
else
tmp = ((a * t) / c) * (-4.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.26e-63) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= 1.15e-88) {
tmp = b / (c * z);
} else {
tmp = ((a * t) / c) * -4.0;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -1.26e-63: tmp = ((t / c) * a) * -4.0 elif z <= 1.15e-88: tmp = b / (c * z) else: tmp = ((a * t) / c) * -4.0 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.26e-63) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (z <= 1.15e-88) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(Float64(a * t) / c) * -4.0); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -1.26e-63)
tmp = ((t / c) * a) * -4.0;
elseif (z <= 1.15e-88)
tmp = b / (c * z);
else
tmp = ((a * t) / c) * -4.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -1.26e-63], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 1.15e-88], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.26 \cdot 10^{-63}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{-88}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\end{array}
\end{array}
if z < -1.26e-63Initial program 69.8%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/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
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites85.7%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6448.3
Applied rewrites48.3%
Applied rewrites52.4%
if -1.26e-63 < z < 1.14999999999999993e-88Initial program 95.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6453.0
Applied rewrites53.0%
if 1.14999999999999993e-88 < z Initial program 61.7%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6461.6
Applied rewrites61.6%
Final simplification55.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (let* ((t_1 (* (/ (* a t) c) -4.0))) (if (<= z -2.1e-17) t_1 (if (<= z 1.15e-88) (/ b (* c z)) t_1))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((a * t) / c) * -4.0;
double tmp;
if (z <= -2.1e-17) {
tmp = t_1;
} else if (z <= 1.15e-88) {
tmp = b / (c * z);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
t_1 = ((a * t) / c) * (-4.0d0)
if (z <= (-2.1d-17)) then
tmp = t_1
else if (z <= 1.15d-88) then
tmp = b / (c * z)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((a * t) / c) * -4.0;
double tmp;
if (z <= -2.1e-17) {
tmp = t_1;
} else if (z <= 1.15e-88) {
tmp = b / (c * z);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = ((a * t) / c) * -4.0 tmp = 0 if z <= -2.1e-17: tmp = t_1 elif z <= 1.15e-88: tmp = b / (c * z) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(a * t) / c) * -4.0) tmp = 0.0 if (z <= -2.1e-17) tmp = t_1; elseif (z <= 1.15e-88) tmp = Float64(b / Float64(c * z)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((a * t) / c) * -4.0;
tmp = 0.0;
if (z <= -2.1e-17)
tmp = t_1;
elseif (z <= 1.15e-88)
tmp = b / (c * z);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision]}, If[LessEqual[z, -2.1e-17], t$95$1, If[LessEqual[z, 1.15e-88], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{a \cdot t}{c} \cdot -4\\
\mathbf{if}\;z \leq -2.1 \cdot 10^{-17}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{-88}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -2.09999999999999992e-17 or 1.14999999999999993e-88 < z Initial program 64.8%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6456.9
Applied rewrites56.9%
if -2.09999999999999992e-17 < z < 1.14999999999999993e-88Initial program 93.9%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6450.2
Applied rewrites50.2%
Final simplification54.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* c z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = b / (c * z)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (c * z)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(c * z)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (c * z);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{c \cdot z}
\end{array}
Initial program 77.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6433.3
Applied rewrites33.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 2024257
(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)))