
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* t (* a -4.0)))
(t_2 (* a (* t (* z 4.0))))
(t_3 (* x (* y 9.0)))
(t_4 (/ (+ b (- (* y (* 9.0 x)) t_2)) (* z c_m))))
(*
c_s
(if (<= t_4 5e+42)
(/ (+ t_1 (/ (+ b t_3) z)) c_m)
(if (<= t_4 2e+285)
(/ (+ b (- t_3 t_2)) (* z c_m))
(if (<= t_4 INFINITY)
(* (/ 1.0 c_m) (+ t_1 (/ (+ b (* 9.0 (* y x))) z)))
(+ (/ x (/ c_m (/ (* y 9.0) z))) (/ a (/ c_m (* t -4.0))))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * (a * -4.0);
double t_2 = a * (t * (z * 4.0));
double t_3 = x * (y * 9.0);
double t_4 = (b + ((y * (9.0 * x)) - t_2)) / (z * c_m);
double tmp;
if (t_4 <= 5e+42) {
tmp = (t_1 + ((b + t_3) / z)) / c_m;
} else if (t_4 <= 2e+285) {
tmp = (b + (t_3 - t_2)) / (z * c_m);
} else if (t_4 <= ((double) INFINITY)) {
tmp = (1.0 / c_m) * (t_1 + ((b + (9.0 * (y * x))) / z));
} else {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
}
return c_s * tmp;
}
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * (a * -4.0);
double t_2 = a * (t * (z * 4.0));
double t_3 = x * (y * 9.0);
double t_4 = (b + ((y * (9.0 * x)) - t_2)) / (z * c_m);
double tmp;
if (t_4 <= 5e+42) {
tmp = (t_1 + ((b + t_3) / z)) / c_m;
} else if (t_4 <= 2e+285) {
tmp = (b + (t_3 - t_2)) / (z * c_m);
} else if (t_4 <= Double.POSITIVE_INFINITY) {
tmp = (1.0 / c_m) * (t_1 + ((b + (9.0 * (y * x))) / z));
} else {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = t * (a * -4.0) t_2 = a * (t * (z * 4.0)) t_3 = x * (y * 9.0) t_4 = (b + ((y * (9.0 * x)) - t_2)) / (z * c_m) tmp = 0 if t_4 <= 5e+42: tmp = (t_1 + ((b + t_3) / z)) / c_m elif t_4 <= 2e+285: tmp = (b + (t_3 - t_2)) / (z * c_m) elif t_4 <= math.inf: tmp = (1.0 / c_m) * (t_1 + ((b + (9.0 * (y * x))) / z)) else: tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0))) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(t * Float64(a * -4.0)) t_2 = Float64(a * Float64(t * Float64(z * 4.0))) t_3 = Float64(x * Float64(y * 9.0)) t_4 = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - t_2)) / Float64(z * c_m)) tmp = 0.0 if (t_4 <= 5e+42) tmp = Float64(Float64(t_1 + Float64(Float64(b + t_3) / z)) / c_m); elseif (t_4 <= 2e+285) tmp = Float64(Float64(b + Float64(t_3 - t_2)) / Float64(z * c_m)); elseif (t_4 <= Inf) tmp = Float64(Float64(1.0 / c_m) * Float64(t_1 + Float64(Float64(b + Float64(9.0 * Float64(y * x))) / z))); else tmp = Float64(Float64(x / Float64(c_m / Float64(Float64(y * 9.0) / z))) + Float64(a / Float64(c_m / Float64(t * -4.0)))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = t * (a * -4.0);
t_2 = a * (t * (z * 4.0));
t_3 = x * (y * 9.0);
t_4 = (b + ((y * (9.0 * x)) - t_2)) / (z * c_m);
tmp = 0.0;
if (t_4 <= 5e+42)
tmp = (t_1 + ((b + t_3) / z)) / c_m;
elseif (t_4 <= 2e+285)
tmp = (b + (t_3 - t_2)) / (z * c_m);
elseif (t_4 <= Inf)
tmp = (1.0 / c_m) * (t_1 + ((b + (9.0 * (y * x))) / z));
else
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(x * N[(y * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$4, 5e+42], N[(N[(t$95$1 + N[(N[(b + t$95$3), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$4, 2e+285], N[(N[(b + N[(t$95$3 - t$95$2), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(t$95$1 + N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(c$95$m / N[(N[(y * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4\right)\\
t_2 := a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\\
t_3 := x \cdot \left(y \cdot 9\right)\\
t_4 := \frac{b + \left(y \cdot \left(9 \cdot x\right) - t\_2\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_4 \leq 5 \cdot 10^{+42}:\\
\;\;\;\;\frac{t\_1 + \frac{b + t\_3}{z}}{c\_m}\\
\mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+285}:\\
\;\;\;\;\frac{b + \left(t\_3 - t\_2\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{1}{c\_m} \cdot \left(t\_1 + \frac{b + 9 \cdot \left(y \cdot x\right)}{z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\frac{c\_m}{\frac{y \cdot 9}{z}}} + \frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 5.00000000000000007e42Initial program 87.7%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified94.3%
if 5.00000000000000007e42 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 2e285Initial program 97.7%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6497.7%
Applied egg-rr97.7%
if 2e285 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 81.4%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified90.4%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.4%
Applied egg-rr90.4%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified32.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6466.6%
Simplified66.6%
Taylor expanded in x around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6466.6%
Simplified66.6%
Applied egg-rr99.2%
Final simplification94.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1
(/ (+ (* y (+ (/ (* 9.0 x) z) (/ b (* z y)))) (* t (* a -4.0))) c_m)))
(*
c_s
(if (<= z -1.2e+24)
t_1
(if (<= z 3.4e+56)
(/ (+ b (- (* y (* 9.0 x)) (* t (* a (* z 4.0))))) (* z c_m))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((y * (((9.0 * x) / z) + (b / (z * y)))) + (t * (a * -4.0))) / c_m;
double tmp;
if (z <= -1.2e+24) {
tmp = t_1;
} else if (z <= 3.4e+56) {
tmp = (b + ((y * (9.0 * x)) - (t * (a * (z * 4.0))))) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = ((y * (((9.0d0 * x) / z) + (b / (z * y)))) + (t * (a * (-4.0d0)))) / c_m
if (z <= (-1.2d+24)) then
tmp = t_1
else if (z <= 3.4d+56) then
tmp = (b + ((y * (9.0d0 * x)) - (t * (a * (z * 4.0d0))))) / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((y * (((9.0 * x) / z) + (b / (z * y)))) + (t * (a * -4.0))) / c_m;
double tmp;
if (z <= -1.2e+24) {
tmp = t_1;
} else if (z <= 3.4e+56) {
tmp = (b + ((y * (9.0 * x)) - (t * (a * (z * 4.0))))) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((y * (((9.0 * x) / z) + (b / (z * y)))) + (t * (a * -4.0))) / c_m tmp = 0 if z <= -1.2e+24: tmp = t_1 elif z <= 3.4e+56: tmp = (b + ((y * (9.0 * x)) - (t * (a * (z * 4.0))))) / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(y * Float64(Float64(Float64(9.0 * x) / z) + Float64(b / Float64(z * y)))) + Float64(t * Float64(a * -4.0))) / c_m) tmp = 0.0 if (z <= -1.2e+24) tmp = t_1; elseif (z <= 3.4e+56) tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(t * Float64(a * Float64(z * 4.0))))) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((y * (((9.0 * x) / z) + (b / (z * y)))) + (t * (a * -4.0))) / c_m;
tmp = 0.0;
if (z <= -1.2e+24)
tmp = t_1;
elseif (z <= 3.4e+56)
tmp = (b + ((y * (9.0 * x)) - (t * (a * (z * 4.0))))) / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(y * N[(N[(N[(9.0 * x), $MachinePrecision] / z), $MachinePrecision] + N[(b / N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.2e+24], t$95$1, If[LessEqual[z, 3.4e+56], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(t * N[(a * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{y \cdot \left(\frac{9 \cdot x}{z} + \frac{b}{z \cdot y}\right) + t \cdot \left(a \cdot -4\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.2 \cdot 10^{+24}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 3.4 \cdot 10^{+56}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - t \cdot \left(a \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.2e24 or 3.40000000000000001e56 < z Initial program 64.1%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified86.3%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6489.5%
Simplified89.5%
if -1.2e24 < z < 3.40000000000000001e56Initial program 95.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6496.5%
Applied egg-rr96.5%
Final simplification93.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1e+97)
(+ (/ x (/ c_m (/ (* y 9.0) z))) (/ a (/ c_m (* t -4.0))))
(if (<= z 3.5e-62)
(/ (+ b (* 9.0 (* y x))) (* z c_m))
(/ (+ (* t (* a -4.0)) (* y (/ (* 9.0 x) z))) c_m)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1e+97) {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
} else if (z <= 3.5e-62) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1d+97)) then
tmp = (x / (c_m / ((y * 9.0d0) / z))) + (a / (c_m / (t * (-4.0d0))))
else if (z <= 3.5d-62) then
tmp = (b + (9.0d0 * (y * x))) / (z * c_m)
else
tmp = ((t * (a * (-4.0d0))) + (y * ((9.0d0 * x) / z))) / c_m
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1e+97) {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
} else if (z <= 3.5e-62) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1e+97: tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0))) elif z <= 3.5e-62: tmp = (b + (9.0 * (y * x))) / (z * c_m) else: tmp = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1e+97) tmp = Float64(Float64(x / Float64(c_m / Float64(Float64(y * 9.0) / z))) + Float64(a / Float64(c_m / Float64(t * -4.0)))); elseif (z <= 3.5e-62) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(t * Float64(a * -4.0)) + Float64(y * Float64(Float64(9.0 * x) / z))) / c_m); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1e+97)
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
elseif (z <= 3.5e-62)
tmp = (b + (9.0 * (y * x))) / (z * c_m);
else
tmp = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1e+97], N[(N[(x / N[(c$95$m / N[(N[(y * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.5e-62], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(9.0 * x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1 \cdot 10^{+97}:\\
\;\;\;\;\frac{x}{\frac{c\_m}{\frac{y \cdot 9}{z}}} + \frac{a}{\frac{c\_m}{t \cdot -4}}\\
\mathbf{elif}\;z \leq 3.5 \cdot 10^{-62}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right) + y \cdot \frac{9 \cdot x}{z}}{c\_m}\\
\end{array}
\end{array}
if z < -1.0000000000000001e97Initial program 58.7%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified83.5%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6486.5%
Simplified86.5%
Taylor expanded in x around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6479.0%
Simplified79.0%
Applied egg-rr85.5%
if -1.0000000000000001e97 < z < 3.5000000000000001e-62Initial program 95.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6487.7%
Simplified87.7%
if 3.5000000000000001e-62 < z Initial program 74.0%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified90.7%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6488.9%
Simplified88.9%
Taylor expanded in x around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6478.6%
Simplified78.6%
Final simplification84.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ (* t (* a -4.0)) (* y (/ (* 9.0 x) z))) c_m)))
(*
c_s
(if (<= z -3.4e+96)
t_1
(if (<= z 8.9e-63) (/ (+ b (* 9.0 (* y x))) (* z c_m)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m;
double tmp;
if (z <= -3.4e+96) {
tmp = t_1;
} else if (z <= 8.9e-63) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = ((t * (a * (-4.0d0))) + (y * ((9.0d0 * x) / z))) / c_m
if (z <= (-3.4d+96)) then
tmp = t_1
else if (z <= 8.9d-63) then
tmp = (b + (9.0d0 * (y * x))) / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m;
double tmp;
if (z <= -3.4e+96) {
tmp = t_1;
} else if (z <= 8.9e-63) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m tmp = 0 if z <= -3.4e+96: tmp = t_1 elif z <= 8.9e-63: tmp = (b + (9.0 * (y * x))) / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(t * Float64(a * -4.0)) + Float64(y * Float64(Float64(9.0 * x) / z))) / c_m) tmp = 0.0 if (z <= -3.4e+96) tmp = t_1; elseif (z <= 8.9e-63) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((t * (a * -4.0)) + (y * ((9.0 * x) / z))) / c_m;
tmp = 0.0;
if (z <= -3.4e+96)
tmp = t_1;
elseif (z <= 8.9e-63)
tmp = (b + (9.0 * (y * x))) / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(9.0 * x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -3.4e+96], t$95$1, If[LessEqual[z, 8.9e-63], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{t \cdot \left(a \cdot -4\right) + y \cdot \frac{9 \cdot x}{z}}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3.4 \cdot 10^{+96}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8.9 \cdot 10^{-63}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -3.4000000000000001e96 or 8.89999999999999988e-63 < z Initial program 67.2%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified87.6%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6487.9%
Simplified87.9%
Taylor expanded in x around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6478.7%
Simplified78.7%
if -3.4000000000000001e96 < z < 8.89999999999999988e-63Initial program 95.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6487.7%
Simplified87.7%
Final simplification83.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 1.3e+201)
(* (/ 1.0 c_m) (+ (* t (* a -4.0)) (/ (+ b (* 9.0 (* y x))) z)))
(+ (/ x (/ c_m (/ (* y 9.0) z))) (/ a (/ c_m (* t -4.0)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 1.3e+201) {
tmp = (1.0 / c_m) * ((t * (a * -4.0)) + ((b + (9.0 * (y * x))) / z));
} else {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (c_m <= 1.3d+201) then
tmp = (1.0d0 / c_m) * ((t * (a * (-4.0d0))) + ((b + (9.0d0 * (y * x))) / z))
else
tmp = (x / (c_m / ((y * 9.0d0) / z))) + (a / (c_m / (t * (-4.0d0))))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 1.3e+201) {
tmp = (1.0 / c_m) * ((t * (a * -4.0)) + ((b + (9.0 * (y * x))) / z));
} else {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if c_m <= 1.3e+201: tmp = (1.0 / c_m) * ((t * (a * -4.0)) + ((b + (9.0 * (y * x))) / z)) else: tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0))) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 1.3e+201) tmp = Float64(Float64(1.0 / c_m) * Float64(Float64(t * Float64(a * -4.0)) + Float64(Float64(b + Float64(9.0 * Float64(y * x))) / z))); else tmp = Float64(Float64(x / Float64(c_m / Float64(Float64(y * 9.0) / z))) + Float64(a / Float64(c_m / Float64(t * -4.0)))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (c_m <= 1.3e+201)
tmp = (1.0 / c_m) * ((t * (a * -4.0)) + ((b + (9.0 * (y * x))) / z));
else
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 1.3e+201], N[(N[(1.0 / c$95$m), $MachinePrecision] * N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(c$95$m / N[(N[(y * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 1.3 \cdot 10^{+201}:\\
\;\;\;\;\frac{1}{c\_m} \cdot \left(t \cdot \left(a \cdot -4\right) + \frac{b + 9 \cdot \left(y \cdot x\right)}{z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\frac{c\_m}{\frac{y \cdot 9}{z}}} + \frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if c < 1.29999999999999993e201Initial program 81.8%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified87.8%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6487.8%
Applied egg-rr87.8%
if 1.29999999999999993e201 < c Initial program 63.4%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified58.3%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6457.9%
Simplified57.9%
Taylor expanded in x around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6452.2%
Simplified52.2%
Applied egg-rr51.6%
Final simplification85.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1.65e+132)
(* (* t -4.0) (/ a c_m))
(if (<= z -1.66e-78)
(/ (* y (/ (* 9.0 x) z)) c_m)
(if (<= z 1.05) (/ b (* z c_m)) (/ a (/ c_m (* t -4.0))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.65e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -1.66e-78) {
tmp = (y * ((9.0 * x) / z)) / c_m;
} else if (z <= 1.05) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1.65d+132)) then
tmp = (t * (-4.0d0)) * (a / c_m)
else if (z <= (-1.66d-78)) then
tmp = (y * ((9.0d0 * x) / z)) / c_m
else if (z <= 1.05d0) then
tmp = b / (z * c_m)
else
tmp = a / (c_m / (t * (-4.0d0)))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.65e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -1.66e-78) {
tmp = (y * ((9.0 * x) / z)) / c_m;
} else if (z <= 1.05) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1.65e+132: tmp = (t * -4.0) * (a / c_m) elif z <= -1.66e-78: tmp = (y * ((9.0 * x) / z)) / c_m elif z <= 1.05: tmp = b / (z * c_m) else: tmp = a / (c_m / (t * -4.0)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1.65e+132) tmp = Float64(Float64(t * -4.0) * Float64(a / c_m)); elseif (z <= -1.66e-78) tmp = Float64(Float64(y * Float64(Float64(9.0 * x) / z)) / c_m); elseif (z <= 1.05) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(a / Float64(c_m / Float64(t * -4.0))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1.65e+132)
tmp = (t * -4.0) * (a / c_m);
elseif (z <= -1.66e-78)
tmp = (y * ((9.0 * x) / z)) / c_m;
elseif (z <= 1.05)
tmp = b / (z * c_m);
else
tmp = a / (c_m / (t * -4.0));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1.65e+132], N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.66e-78], N[(N[(y * N[(N[(9.0 * x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 1.05], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.65 \cdot 10^{+132}:\\
\;\;\;\;\left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
\mathbf{elif}\;z \leq -1.66 \cdot 10^{-78}:\\
\;\;\;\;\frac{y \cdot \frac{9 \cdot x}{z}}{c\_m}\\
\mathbf{elif}\;z \leq 1.05:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if z < -1.65000000000000015e132Initial program 57.8%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6434.6%
Simplified34.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.1%
Applied egg-rr46.1%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
if -1.65000000000000015e132 < z < -1.6600000000000001e-78Initial program 89.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6489.1%
Applied egg-rr89.1%
Taylor expanded in x around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.6%
Simplified54.6%
*-commutativeN/A
un-div-invN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6451.6%
Applied egg-rr51.6%
associate-*r/N/A
associate-*l/N/A
associate-*r*N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6461.6%
Applied egg-rr61.6%
if -1.6600000000000001e-78 < z < 1.05000000000000004Initial program 95.8%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6456.6%
Simplified56.6%
if 1.05000000000000004 < z Initial program 70.5%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.1%
Applied egg-rr59.1%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6463.5%
Applied egg-rr63.5%
Final simplification60.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -2.5e+132)
(* (* t -4.0) (/ a c_m))
(if (<= z -2.9e-75)
(/ x (/ c_m (/ (* y 9.0) z)))
(if (<= z 0.6) (/ b (* z c_m)) (/ a (/ c_m (* t -4.0))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -2.5e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -2.9e-75) {
tmp = x / (c_m / ((y * 9.0) / z));
} else if (z <= 0.6) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-2.5d+132)) then
tmp = (t * (-4.0d0)) * (a / c_m)
else if (z <= (-2.9d-75)) then
tmp = x / (c_m / ((y * 9.0d0) / z))
else if (z <= 0.6d0) then
tmp = b / (z * c_m)
else
tmp = a / (c_m / (t * (-4.0d0)))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -2.5e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -2.9e-75) {
tmp = x / (c_m / ((y * 9.0) / z));
} else if (z <= 0.6) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -2.5e+132: tmp = (t * -4.0) * (a / c_m) elif z <= -2.9e-75: tmp = x / (c_m / ((y * 9.0) / z)) elif z <= 0.6: tmp = b / (z * c_m) else: tmp = a / (c_m / (t * -4.0)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -2.5e+132) tmp = Float64(Float64(t * -4.0) * Float64(a / c_m)); elseif (z <= -2.9e-75) tmp = Float64(x / Float64(c_m / Float64(Float64(y * 9.0) / z))); elseif (z <= 0.6) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(a / Float64(c_m / Float64(t * -4.0))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -2.5e+132)
tmp = (t * -4.0) * (a / c_m);
elseif (z <= -2.9e-75)
tmp = x / (c_m / ((y * 9.0) / z));
elseif (z <= 0.6)
tmp = b / (z * c_m);
else
tmp = a / (c_m / (t * -4.0));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -2.5e+132], N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.9e-75], N[(x / N[(c$95$m / N[(N[(y * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 0.6], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -2.5 \cdot 10^{+132}:\\
\;\;\;\;\left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
\mathbf{elif}\;z \leq -2.9 \cdot 10^{-75}:\\
\;\;\;\;\frac{x}{\frac{c\_m}{\frac{y \cdot 9}{z}}}\\
\mathbf{elif}\;z \leq 0.6:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if z < -2.5000000000000001e132Initial program 57.8%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6434.6%
Simplified34.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.1%
Applied egg-rr46.1%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
if -2.5000000000000001e132 < z < -2.9000000000000002e-75Initial program 89.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6489.1%
Applied egg-rr89.1%
Taylor expanded in x around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.6%
Simplified54.6%
*-commutativeN/A
un-div-invN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6451.6%
Applied egg-rr51.6%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.6%
Applied egg-rr60.6%
if -2.9000000000000002e-75 < z < 0.599999999999999978Initial program 95.8%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6456.6%
Simplified56.6%
if 0.599999999999999978 < z Initial program 70.5%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.1%
Applied egg-rr59.1%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6463.5%
Applied egg-rr63.5%
Final simplification60.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1.75e+132)
(* (* t -4.0) (/ a c_m))
(if (<= z -1.5e-76)
(* (* y 9.0) (/ x (* z c_m)))
(if (<= z 0.37) (/ b (* z c_m)) (/ a (/ c_m (* t -4.0))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.75e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -1.5e-76) {
tmp = (y * 9.0) * (x / (z * c_m));
} else if (z <= 0.37) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1.75d+132)) then
tmp = (t * (-4.0d0)) * (a / c_m)
else if (z <= (-1.5d-76)) then
tmp = (y * 9.0d0) * (x / (z * c_m))
else if (z <= 0.37d0) then
tmp = b / (z * c_m)
else
tmp = a / (c_m / (t * (-4.0d0)))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.75e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -1.5e-76) {
tmp = (y * 9.0) * (x / (z * c_m));
} else if (z <= 0.37) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1.75e+132: tmp = (t * -4.0) * (a / c_m) elif z <= -1.5e-76: tmp = (y * 9.0) * (x / (z * c_m)) elif z <= 0.37: tmp = b / (z * c_m) else: tmp = a / (c_m / (t * -4.0)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1.75e+132) tmp = Float64(Float64(t * -4.0) * Float64(a / c_m)); elseif (z <= -1.5e-76) tmp = Float64(Float64(y * 9.0) * Float64(x / Float64(z * c_m))); elseif (z <= 0.37) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(a / Float64(c_m / Float64(t * -4.0))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1.75e+132)
tmp = (t * -4.0) * (a / c_m);
elseif (z <= -1.5e-76)
tmp = (y * 9.0) * (x / (z * c_m));
elseif (z <= 0.37)
tmp = b / (z * c_m);
else
tmp = a / (c_m / (t * -4.0));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1.75e+132], N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.5e-76], N[(N[(y * 9.0), $MachinePrecision] * N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 0.37], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{+132}:\\
\;\;\;\;\left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
\mathbf{elif}\;z \leq -1.5 \cdot 10^{-76}:\\
\;\;\;\;\left(y \cdot 9\right) \cdot \frac{x}{z \cdot c\_m}\\
\mathbf{elif}\;z \leq 0.37:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if z < -1.7500000000000001e132Initial program 57.8%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6434.6%
Simplified34.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.1%
Applied egg-rr46.1%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
if -1.7500000000000001e132 < z < -1.50000000000000012e-76Initial program 89.3%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6489.1%
Applied egg-rr89.1%
Taylor expanded in x around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.6%
Simplified54.6%
*-commutativeN/A
un-div-invN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6451.6%
Applied egg-rr51.6%
*-commutativeN/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
clear-numN/A
associate-*r/N/A
clear-numN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.4%
Applied egg-rr58.4%
if -1.50000000000000012e-76 < z < 0.37Initial program 95.8%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6456.6%
Simplified56.6%
if 0.37 < z Initial program 70.5%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.1%
Applied egg-rr59.1%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6463.5%
Applied egg-rr63.5%
Final simplification60.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1.65e+132)
(* (* t -4.0) (/ a c_m))
(if (<= z -5.3e-80)
(* 9.0 (/ (/ (* y x) z) c_m))
(if (<= z 74.0) (/ b (* z c_m)) (/ a (/ c_m (* t -4.0))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.65e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -5.3e-80) {
tmp = 9.0 * (((y * x) / z) / c_m);
} else if (z <= 74.0) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1.65d+132)) then
tmp = (t * (-4.0d0)) * (a / c_m)
else if (z <= (-5.3d-80)) then
tmp = 9.0d0 * (((y * x) / z) / c_m)
else if (z <= 74.0d0) then
tmp = b / (z * c_m)
else
tmp = a / (c_m / (t * (-4.0d0)))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.65e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= -5.3e-80) {
tmp = 9.0 * (((y * x) / z) / c_m);
} else if (z <= 74.0) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1.65e+132: tmp = (t * -4.0) * (a / c_m) elif z <= -5.3e-80: tmp = 9.0 * (((y * x) / z) / c_m) elif z <= 74.0: tmp = b / (z * c_m) else: tmp = a / (c_m / (t * -4.0)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1.65e+132) tmp = Float64(Float64(t * -4.0) * Float64(a / c_m)); elseif (z <= -5.3e-80) tmp = Float64(9.0 * Float64(Float64(Float64(y * x) / z) / c_m)); elseif (z <= 74.0) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(a / Float64(c_m / Float64(t * -4.0))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1.65e+132)
tmp = (t * -4.0) * (a / c_m);
elseif (z <= -5.3e-80)
tmp = 9.0 * (((y * x) / z) / c_m);
elseif (z <= 74.0)
tmp = b / (z * c_m);
else
tmp = a / (c_m / (t * -4.0));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1.65e+132], N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -5.3e-80], N[(9.0 * N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 74.0], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.65 \cdot 10^{+132}:\\
\;\;\;\;\left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
\mathbf{elif}\;z \leq -5.3 \cdot 10^{-80}:\\
\;\;\;\;9 \cdot \frac{\frac{y \cdot x}{z}}{c\_m}\\
\mathbf{elif}\;z \leq 74:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if z < -1.65000000000000015e132Initial program 57.8%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6434.6%
Simplified34.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.1%
Applied egg-rr46.1%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
if -1.65000000000000015e132 < z < -5.30000000000000026e-80Initial program 89.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6454.7%
Simplified54.7%
if -5.30000000000000026e-80 < z < 74Initial program 95.8%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6456.6%
Simplified56.6%
if 74 < z Initial program 70.5%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.1%
Applied egg-rr59.1%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6463.5%
Applied egg-rr63.5%
Final simplification60.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 8e+202)
(/ (+ (* t (* a -4.0)) (/ (+ b (* x (* y 9.0))) z)) c_m)
(+ (/ x (/ c_m (/ (* y 9.0) z))) (/ a (/ c_m (* t -4.0)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 8e+202) {
tmp = ((t * (a * -4.0)) + ((b + (x * (y * 9.0))) / z)) / c_m;
} else {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (c_m <= 8d+202) then
tmp = ((t * (a * (-4.0d0))) + ((b + (x * (y * 9.0d0))) / z)) / c_m
else
tmp = (x / (c_m / ((y * 9.0d0) / z))) + (a / (c_m / (t * (-4.0d0))))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 8e+202) {
tmp = ((t * (a * -4.0)) + ((b + (x * (y * 9.0))) / z)) / c_m;
} else {
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if c_m <= 8e+202: tmp = ((t * (a * -4.0)) + ((b + (x * (y * 9.0))) / z)) / c_m else: tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0))) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 8e+202) tmp = Float64(Float64(Float64(t * Float64(a * -4.0)) + Float64(Float64(b + Float64(x * Float64(y * 9.0))) / z)) / c_m); else tmp = Float64(Float64(x / Float64(c_m / Float64(Float64(y * 9.0) / z))) + Float64(a / Float64(c_m / Float64(t * -4.0)))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (c_m <= 8e+202)
tmp = ((t * (a * -4.0)) + ((b + (x * (y * 9.0))) / z)) / c_m;
else
tmp = (x / (c_m / ((y * 9.0) / z))) + (a / (c_m / (t * -4.0)));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 8e+202], N[(N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b + N[(x * N[(y * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(x / N[(c$95$m / N[(N[(y * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 8 \cdot 10^{+202}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right) + \frac{b + x \cdot \left(y \cdot 9\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{\frac{c\_m}{\frac{y \cdot 9}{z}}} + \frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if c < 7.9999999999999992e202Initial program 81.9%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified87.9%
if 7.9999999999999992e202 < c Initial program 60.9%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified55.5%
Taylor expanded in y around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6455.1%
Simplified55.1%
Taylor expanded in x around inf
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6449.0%
Simplified49.0%
Applied egg-rr48.5%
Final simplification85.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -1.65e+132)
(* t (+ (/ (* a -4.0) c_m) (/ (/ b z) (* t c_m))))
(if (<= z 4.1e-66)
(/ (+ b (* 9.0 (* y x))) (* z c_m))
(/ (+ (* t (* a -4.0)) (/ b z)) c_m)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.65e+132) {
tmp = t * (((a * -4.0) / c_m) + ((b / z) / (t * c_m)));
} else if (z <= 4.1e-66) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = ((t * (a * -4.0)) + (b / z)) / c_m;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-1.65d+132)) then
tmp = t * (((a * (-4.0d0)) / c_m) + ((b / z) / (t * c_m)))
else if (z <= 4.1d-66) then
tmp = (b + (9.0d0 * (y * x))) / (z * c_m)
else
tmp = ((t * (a * (-4.0d0))) + (b / z)) / c_m
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -1.65e+132) {
tmp = t * (((a * -4.0) / c_m) + ((b / z) / (t * c_m)));
} else if (z <= 4.1e-66) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = ((t * (a * -4.0)) + (b / z)) / c_m;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -1.65e+132: tmp = t * (((a * -4.0) / c_m) + ((b / z) / (t * c_m))) elif z <= 4.1e-66: tmp = (b + (9.0 * (y * x))) / (z * c_m) else: tmp = ((t * (a * -4.0)) + (b / z)) / c_m return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -1.65e+132) tmp = Float64(t * Float64(Float64(Float64(a * -4.0) / c_m) + Float64(Float64(b / z) / Float64(t * c_m)))); elseif (z <= 4.1e-66) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(t * Float64(a * -4.0)) + Float64(b / z)) / c_m); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -1.65e+132)
tmp = t * (((a * -4.0) / c_m) + ((b / z) / (t * c_m)));
elseif (z <= 4.1e-66)
tmp = (b + (9.0 * (y * x))) / (z * c_m);
else
tmp = ((t * (a * -4.0)) + (b / z)) / c_m;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -1.65e+132], N[(t * N[(N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision] + N[(N[(b / z), $MachinePrecision] / N[(t * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.1e-66], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.65 \cdot 10^{+132}:\\
\;\;\;\;t \cdot \left(\frac{a \cdot -4}{c\_m} + \frac{\frac{b}{z}}{t \cdot c\_m}\right)\\
\mathbf{elif}\;z \leq 4.1 \cdot 10^{-66}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right) + \frac{b}{z}}{c\_m}\\
\end{array}
\end{array}
if z < -1.65000000000000015e132Initial program 57.8%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified83.5%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.6%
Applied egg-rr83.6%
Taylor expanded in x around 0
/-lowering-/.f6468.3%
Simplified68.3%
Taylor expanded in t around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-/r*N/A
associate-/l/N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6472.5%
Simplified72.5%
if -1.65000000000000015e132 < z < 4.09999999999999998e-66Initial program 94.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6485.9%
Simplified85.9%
if 4.09999999999999998e-66 < z Initial program 74.3%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified90.8%
Taylor expanded in x around 0
/-lowering-/.f6475.0%
Simplified75.0%
Final simplification79.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (+ (* t (* a -4.0)) (/ b z))))
(*
c_s
(if (<= z -1.75e+132)
(* (/ 1.0 c_m) t_1)
(if (<= z 1.02e-64) (/ (+ b (* 9.0 (* y x))) (* z c_m)) (/ t_1 c_m))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (t * (a * -4.0)) + (b / z);
double tmp;
if (z <= -1.75e+132) {
tmp = (1.0 / c_m) * t_1;
} else if (z <= 1.02e-64) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = t_1 / c_m;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = (t * (a * (-4.0d0))) + (b / z)
if (z <= (-1.75d+132)) then
tmp = (1.0d0 / c_m) * t_1
else if (z <= 1.02d-64) then
tmp = (b + (9.0d0 * (y * x))) / (z * c_m)
else
tmp = t_1 / c_m
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (t * (a * -4.0)) + (b / z);
double tmp;
if (z <= -1.75e+132) {
tmp = (1.0 / c_m) * t_1;
} else if (z <= 1.02e-64) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = t_1 / c_m;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = (t * (a * -4.0)) + (b / z) tmp = 0 if z <= -1.75e+132: tmp = (1.0 / c_m) * t_1 elif z <= 1.02e-64: tmp = (b + (9.0 * (y * x))) / (z * c_m) else: tmp = t_1 / c_m return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(t * Float64(a * -4.0)) + Float64(b / z)) tmp = 0.0 if (z <= -1.75e+132) tmp = Float64(Float64(1.0 / c_m) * t_1); elseif (z <= 1.02e-64) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c_m)); else tmp = Float64(t_1 / c_m); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = (t * (a * -4.0)) + (b / z);
tmp = 0.0;
if (z <= -1.75e+132)
tmp = (1.0 / c_m) * t_1;
elseif (z <= 1.02e-64)
tmp = (b + (9.0 * (y * x))) / (z * c_m);
else
tmp = t_1 / c_m;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.75e+132], N[(N[(1.0 / c$95$m), $MachinePrecision] * t$95$1), $MachinePrecision], If[LessEqual[z, 1.02e-64], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / c$95$m), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4\right) + \frac{b}{z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{+132}:\\
\;\;\;\;\frac{1}{c\_m} \cdot t\_1\\
\mathbf{elif}\;z \leq 1.02 \cdot 10^{-64}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{c\_m}\\
\end{array}
\end{array}
\end{array}
if z < -1.7500000000000001e132Initial program 57.8%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified83.5%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
+-lowering-+.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.6%
Applied egg-rr83.6%
Taylor expanded in x around 0
/-lowering-/.f6468.3%
Simplified68.3%
if -1.7500000000000001e132 < z < 1.02e-64Initial program 94.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6485.9%
Simplified85.9%
if 1.02e-64 < z Initial program 74.3%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified90.8%
Taylor expanded in x around 0
/-lowering-/.f6475.0%
Simplified75.0%
Final simplification79.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ (* t (* a -4.0)) (/ b z)) c_m)))
(*
c_s
(if (<= z -1.75e+132)
t_1
(if (<= z 1.3e-64) (/ (+ b (* 9.0 (* y x))) (* z c_m)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((t * (a * -4.0)) + (b / z)) / c_m;
double tmp;
if (z <= -1.75e+132) {
tmp = t_1;
} else if (z <= 1.3e-64) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = ((t * (a * (-4.0d0))) + (b / z)) / c_m
if (z <= (-1.75d+132)) then
tmp = t_1
else if (z <= 1.3d-64) then
tmp = (b + (9.0d0 * (y * x))) / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = ((t * (a * -4.0)) + (b / z)) / c_m;
double tmp;
if (z <= -1.75e+132) {
tmp = t_1;
} else if (z <= 1.3e-64) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = ((t * (a * -4.0)) + (b / z)) / c_m tmp = 0 if z <= -1.75e+132: tmp = t_1 elif z <= 1.3e-64: tmp = (b + (9.0 * (y * x))) / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(Float64(t * Float64(a * -4.0)) + Float64(b / z)) / c_m) tmp = 0.0 if (z <= -1.75e+132) tmp = t_1; elseif (z <= 1.3e-64) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = ((t * (a * -4.0)) + (b / z)) / c_m;
tmp = 0.0;
if (z <= -1.75e+132)
tmp = t_1;
elseif (z <= 1.3e-64)
tmp = (b + (9.0 * (y * x))) / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.75e+132], t$95$1, If[LessEqual[z, 1.3e-64], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{t \cdot \left(a \cdot -4\right) + \frac{b}{z}}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{+132}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.3 \cdot 10^{-64}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.7500000000000001e132 or 1.3e-64 < z Initial program 67.5%
associate-/r*N/A
/-lowering-/.f64N/A
Simplified87.8%
Taylor expanded in x around 0
/-lowering-/.f6472.3%
Simplified72.3%
if -1.7500000000000001e132 < z < 1.3e-64Initial program 94.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6485.9%
Simplified85.9%
Final simplification79.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -3.1e+132)
(* (* t -4.0) (/ a c_m))
(if (<= z 130.0)
(/ (+ b (* 9.0 (* y x))) (* z c_m))
(/ a (/ c_m (* t -4.0)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -3.1e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= 130.0) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-3.1d+132)) then
tmp = (t * (-4.0d0)) * (a / c_m)
else if (z <= 130.0d0) then
tmp = (b + (9.0d0 * (y * x))) / (z * c_m)
else
tmp = a / (c_m / (t * (-4.0d0)))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -3.1e+132) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= 130.0) {
tmp = (b + (9.0 * (y * x))) / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -3.1e+132: tmp = (t * -4.0) * (a / c_m) elif z <= 130.0: tmp = (b + (9.0 * (y * x))) / (z * c_m) else: tmp = a / (c_m / (t * -4.0)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -3.1e+132) tmp = Float64(Float64(t * -4.0) * Float64(a / c_m)); elseif (z <= 130.0) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c_m)); else tmp = Float64(a / Float64(c_m / Float64(t * -4.0))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -3.1e+132)
tmp = (t * -4.0) * (a / c_m);
elseif (z <= 130.0)
tmp = (b + (9.0 * (y * x))) / (z * c_m);
else
tmp = a / (c_m / (t * -4.0));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -3.1e+132], N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 130.0], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3.1 \cdot 10^{+132}:\\
\;\;\;\;\left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
\mathbf{elif}\;z \leq 130:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if z < -3.0999999999999998e132Initial program 57.8%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6434.6%
Simplified34.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6446.1%
Applied egg-rr46.1%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6465.9%
Applied egg-rr65.9%
if -3.0999999999999998e132 < z < 130Initial program 94.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6484.2%
Simplified84.2%
if 130 < z Initial program 70.5%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.1%
Applied egg-rr59.1%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6463.5%
Applied egg-rr63.5%
Final simplification75.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -2.65e+69)
(* (* t -4.0) (/ a c_m))
(if (<= z 14.5) (/ b (* z c_m)) (/ a (/ c_m (* t -4.0)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -2.65e+69) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= 14.5) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (z <= (-2.65d+69)) then
tmp = (t * (-4.0d0)) * (a / c_m)
else if (z <= 14.5d0) then
tmp = b / (z * c_m)
else
tmp = a / (c_m / (t * (-4.0d0)))
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -2.65e+69) {
tmp = (t * -4.0) * (a / c_m);
} else if (z <= 14.5) {
tmp = b / (z * c_m);
} else {
tmp = a / (c_m / (t * -4.0));
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -2.65e+69: tmp = (t * -4.0) * (a / c_m) elif z <= 14.5: tmp = b / (z * c_m) else: tmp = a / (c_m / (t * -4.0)) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -2.65e+69) tmp = Float64(Float64(t * -4.0) * Float64(a / c_m)); elseif (z <= 14.5) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(a / Float64(c_m / Float64(t * -4.0))); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -2.65e+69)
tmp = (t * -4.0) * (a / c_m);
elseif (z <= 14.5)
tmp = b / (z * c_m);
else
tmp = a / (c_m / (t * -4.0));
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -2.65e+69], N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 14.5], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a / N[(c$95$m / N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -2.65 \cdot 10^{+69}:\\
\;\;\;\;\left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
\mathbf{elif}\;z \leq 14.5:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{\frac{c\_m}{t \cdot -4}}\\
\end{array}
\end{array}
if z < -2.65e69Initial program 60.7%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6431.4%
Simplified31.4%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6441.2%
Applied egg-rr41.2%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.1%
Applied egg-rr58.1%
if -2.65e69 < z < 14.5Initial program 95.6%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6453.9%
Simplified53.9%
if 14.5 < z Initial program 70.5%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6444.6%
Simplified44.6%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6459.1%
Applied egg-rr59.1%
*-commutativeN/A
clear-numN/A
frac-timesN/A
*-rgt-identityN/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
/-lowering-/.f64N/A
*-lowering-*.f6463.5%
Applied egg-rr63.5%
Final simplification57.4%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* (* t -4.0) (/ a c_m)))) (* c_s (if (<= z -1.55e+79) t_1 (if (<= z 7.8e-86) (/ b (* z c_m)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (t * -4.0) * (a / c_m);
double tmp;
if (z <= -1.55e+79) {
tmp = t_1;
} else if (z <= 7.8e-86) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = (t * (-4.0d0)) * (a / c_m)
if (z <= (-1.55d+79)) then
tmp = t_1
else if (z <= 7.8d-86) then
tmp = b / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (t * -4.0) * (a / c_m);
double tmp;
if (z <= -1.55e+79) {
tmp = t_1;
} else if (z <= 7.8e-86) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = (t * -4.0) * (a / c_m) tmp = 0 if z <= -1.55e+79: tmp = t_1 elif z <= 7.8e-86: tmp = b / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(t * -4.0) * Float64(a / c_m)) tmp = 0.0 if (z <= -1.55e+79) tmp = t_1; elseif (z <= 7.8e-86) tmp = Float64(b / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = (t * -4.0) * (a / c_m);
tmp = 0.0;
if (z <= -1.55e+79)
tmp = t_1;
elseif (z <= 7.8e-86)
tmp = b / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(t * -4.0), $MachinePrecision] * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.55e+79], t$95$1, If[LessEqual[z, 7.8e-86], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(t \cdot -4\right) \cdot \frac{a}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.55 \cdot 10^{+79}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 7.8 \cdot 10^{-86}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.5499999999999999e79 or 7.8000000000000003e-86 < z Initial program 68.6%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6436.3%
Simplified36.3%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6447.5%
Applied egg-rr47.5%
*-commutativeN/A
frac-2negN/A
div-invN/A
div-invN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.2%
Applied egg-rr58.2%
if -1.5499999999999999e79 < z < 7.8000000000000003e-86Initial program 96.0%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6457.2%
Simplified57.2%
Final simplification57.8%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* t (/ -4.0 (/ c_m a))))) (* c_s (if (<= z -1.08e+70) t_1 (if (<= z 7.5e-86) (/ b (* z c_m)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * (-4.0 / (c_m / a));
double tmp;
if (z <= -1.08e+70) {
tmp = t_1;
} else if (z <= 7.5e-86) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = t * ((-4.0d0) / (c_m / a))
if (z <= (-1.08d+70)) then
tmp = t_1
else if (z <= 7.5d-86) then
tmp = b / (z * c_m)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * (-4.0 / (c_m / a));
double tmp;
if (z <= -1.08e+70) {
tmp = t_1;
} else if (z <= 7.5e-86) {
tmp = b / (z * c_m);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = t * (-4.0 / (c_m / a)) tmp = 0 if z <= -1.08e+70: tmp = t_1 elif z <= 7.5e-86: tmp = b / (z * c_m) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(t * Float64(-4.0 / Float64(c_m / a))) tmp = 0.0 if (z <= -1.08e+70) tmp = t_1; elseif (z <= 7.5e-86) tmp = Float64(b / Float64(z * c_m)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = t * (-4.0 / (c_m / a));
tmp = 0.0;
if (z <= -1.08e+70)
tmp = t_1;
elseif (z <= 7.5e-86)
tmp = b / (z * c_m);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(t * N[(-4.0 / N[(c$95$m / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.08e+70], t$95$1, If[LessEqual[z, 7.5e-86], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \frac{-4}{\frac{c\_m}{a}}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.08 \cdot 10^{+70}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 7.5 \cdot 10^{-86}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.0799999999999999e70 or 7.50000000000000055e-86 < z Initial program 68.6%
Taylor expanded in z around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6436.3%
Simplified36.3%
*-commutativeN/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6447.5%
Applied egg-rr47.5%
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
associate-*l*N/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6458.2%
Applied egg-rr58.2%
if -1.0799999999999999e70 < z < 7.50000000000000055e-86Initial program 96.0%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6457.2%
Simplified57.2%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (/ b (* z c_m))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (z * c_m));
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
code = c_s * (b / (z * c_m))
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (z * c_m));
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): return c_s * (b / (z * c_m))
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) return Float64(c_s * Float64(b / Float64(z * c_m))) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp = code(c_s, x, y, z, t, a, b, c_m)
tmp = c_s * (b / (z * c_m));
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{z \cdot c\_m}
\end{array}
Initial program 80.7%
Taylor expanded in b around inf
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6435.8%
Simplified35.8%
(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 2024152
(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)))