
(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.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (- b (- (* a (* t (* z 4.0))) (* y (* 9.0 x)))) (* z c_m)))
(t_2 (/ (- b (- (* (* a t) (* z 4.0)) (* x (* 9.0 y)))) (* z c_m))))
(*
c_s
(if (<= t_1 -1e-170)
t_2
(if (<= t_1 0.0)
(/ (+ (/ b z) (* -4.0 (* a t))) c_m)
(if (<= t_1 INFINITY) t_2 (* a (/ (* -4.0 t) c_m))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c_m);
double t_2 = (b - (((a * t) * (z * 4.0)) - (x * (9.0 * y)))) / (z * c_m);
double tmp;
if (t_1 <= -1e-170) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = ((b / z) + (-4.0 * (a * t))) / c_m;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = a * ((-4.0 * t) / c_m);
}
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;
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 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c_m);
double t_2 = (b - (((a * t) * (z * 4.0)) - (x * (9.0 * y)))) / (z * c_m);
double tmp;
if (t_1 <= -1e-170) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = ((b / z) + (-4.0 * (a * t))) / c_m;
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_2;
} else {
tmp = a * ((-4.0 * t) / 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]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c_m) t_2 = (b - (((a * t) * (z * 4.0)) - (x * (9.0 * y)))) / (z * c_m) tmp = 0 if t_1 <= -1e-170: tmp = t_2 elif t_1 <= 0.0: tmp = ((b / z) + (-4.0 * (a * t))) / c_m elif t_1 <= math.inf: tmp = t_2 else: tmp = a * ((-4.0 * t) / c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b - Float64(Float64(a * Float64(t * Float64(z * 4.0))) - Float64(y * Float64(9.0 * x)))) / Float64(z * c_m)) t_2 = Float64(Float64(b - Float64(Float64(Float64(a * t) * Float64(z * 4.0)) - Float64(x * Float64(9.0 * y)))) / Float64(z * c_m)) tmp = 0.0 if (t_1 <= -1e-170) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c_m); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(a * Float64(Float64(-4.0 * t) / 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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c_m);
t_2 = (b - (((a * t) * (z * 4.0)) - (x * (9.0 * y)))) / (z * c_m);
tmp = 0.0;
if (t_1 <= -1e-170)
tmp = t_2;
elseif (t_1 <= 0.0)
tmp = ((b / z) + (-4.0 * (a * t))) / c_m;
elseif (t_1 <= Inf)
tmp = t_2;
else
tmp = a * ((-4.0 * t) / 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b - N[(N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b - N[(N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision] - N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e-170], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(a * N[(N[(-4.0 * t), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_1 := \frac{b - \left(a \cdot \left(t \cdot \left(z \cdot 4\right)\right) - y \cdot \left(9 \cdot x\right)\right)}{z \cdot c\_m}\\
t_2 := \frac{b - \left(\left(a \cdot t\right) \cdot \left(z \cdot 4\right) - x \cdot \left(9 \cdot y\right)\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-170}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c\_m}\\
\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)) < -9.99999999999999983e-171 or -0.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)) < +inf.0Initial program 88.0%
associate-+l-88.0%
*-commutative88.0%
associate-*r*91.7%
*-commutative91.7%
associate-+l-91.7%
associate-*l*91.7%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
if -9.99999999999999983e-171 < (/.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)) < -0.0Initial program 39.3%
associate-+l-39.3%
*-commutative39.3%
associate-*r*31.6%
*-commutative31.6%
associate-+l-31.6%
associate-*l*31.6%
associate-*l*39.3%
*-commutative39.3%
Simplified39.3%
Taylor expanded in y around -inf 52.4%
Taylor expanded in y around 0 59.5%
mul-1-neg59.5%
*-commutative59.5%
associate-/r*86.8%
associate-*r/86.8%
div-sub86.8%
cancel-sign-sub-inv86.8%
metadata-eval86.8%
Simplified86.8%
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-+l-0.0%
*-commutative0.0%
associate-*r*7.1%
*-commutative7.1%
associate-+l-7.1%
associate-*l*7.1%
associate-*l*7.1%
*-commutative7.1%
Simplified7.1%
Taylor expanded in z around inf 58.3%
*-commutative58.3%
associate-/l*87.2%
associate-*r*87.2%
associate-*l/87.2%
Simplified87.2%
Final simplification91.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (or (<= z -1550.0) (not (<= z 4.5e-16)))
(+ (* 9.0 (* (/ x z) (/ y c_m))) (/ (+ (/ b z) (* -4.0 (* a t))) c_m))
(/ (+ b (fma x (* 9.0 y) (* t (* a (* z -4.0))))) (* z c_m)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if ((z <= -1550.0) || !(z <= 4.5e-16)) {
tmp = (9.0 * ((x / z) * (y / c_m))) + (((b / z) + (-4.0 * (a * t))) / c_m);
} else {
tmp = (b + fma(x, (9.0 * y), (t * (a * (z * -4.0))))) / (z * c_m);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if ((z <= -1550.0) || !(z <= 4.5e-16)) tmp = Float64(Float64(9.0 * Float64(Float64(x / z) * Float64(y / c_m))) + Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c_m)); else tmp = Float64(Float64(b + fma(x, Float64(9.0 * y), Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(z * c_m)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[Or[LessEqual[z, -1550.0], N[Not[LessEqual[z, 4.5e-16]], $MachinePrecision]], N[(N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1550 \lor \neg \left(z \leq 4.5 \cdot 10^{-16}\right):\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c\_m}\right) + \frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \mathsf{fma}\left(x, 9 \cdot y, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c\_m}\\
\end{array}
\end{array}
if z < -1550 or 4.5000000000000002e-16 < z Initial program 64.9%
associate-+l-64.9%
*-commutative64.9%
associate-*r*71.5%
*-commutative71.5%
associate-+l-71.5%
associate-*l*71.5%
associate-*l*76.7%
*-commutative76.7%
Simplified76.7%
Taylor expanded in t around inf 67.8%
Taylor expanded in t around 0 86.3%
+-commutative86.3%
associate-/l*86.5%
associate-/r*81.4%
*-commutative81.4%
associate-+l+81.4%
associate-/r*86.5%
associate-/l*86.3%
*-commutative86.3%
times-frac81.3%
*-commutative81.3%
metadata-eval81.3%
cancel-sign-sub-inv81.3%
Simplified85.0%
if -1550 < z < 4.5000000000000002e-16Initial program 95.3%
associate-+l-95.3%
*-commutative95.3%
associate-*r*95.0%
*-commutative95.0%
associate-+l-95.0%
Simplified95.0%
Final simplification89.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.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (* y (* 9.0 x))) (* z c_m)))
(t_2 (+ (* 9.0 (* (/ x z) (/ y c_m))) (/ (* t (* -4.0 a)) c_m))))
(*
c_s
(if (<= z -195000000000.0)
t_2
(if (<= z 7.6e-129)
t_1
(if (<= z 6.4e-62)
(/ (- b (* 4.0 (* a (* z t)))) (* z c_m))
(if (<= z 1.1e-20)
t_1
(if (<= z 5.4e+85) t_2 (/ (+ (/ b z) (* -4.0 (* a t))) c_m)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + (y * (9.0 * x))) / (z * c_m);
double t_2 = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m);
double tmp;
if (z <= -195000000000.0) {
tmp = t_2;
} else if (z <= 7.6e-129) {
tmp = t_1;
} else if (z <= 6.4e-62) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else if (z <= 1.1e-20) {
tmp = t_1;
} else if (z <= 5.4e+85) {
tmp = t_2;
} else {
tmp = ((b / z) + (-4.0 * (a * t))) / 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.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (b + (y * (9.0d0 * x))) / (z * c_m)
t_2 = (9.0d0 * ((x / z) * (y / c_m))) + ((t * ((-4.0d0) * a)) / c_m)
if (z <= (-195000000000.0d0)) then
tmp = t_2
else if (z <= 7.6d-129) then
tmp = t_1
else if (z <= 6.4d-62) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c_m)
else if (z <= 1.1d-20) then
tmp = t_1
else if (z <= 5.4d+85) then
tmp = t_2
else
tmp = ((b / z) + ((-4.0d0) * (a * t))) / 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;
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 = (b + (y * (9.0 * x))) / (z * c_m);
double t_2 = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m);
double tmp;
if (z <= -195000000000.0) {
tmp = t_2;
} else if (z <= 7.6e-129) {
tmp = t_1;
} else if (z <= 6.4e-62) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else if (z <= 1.1e-20) {
tmp = t_1;
} else if (z <= 5.4e+85) {
tmp = t_2;
} else {
tmp = ((b / z) + (-4.0 * (a * t))) / 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]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = (b + (y * (9.0 * x))) / (z * c_m) t_2 = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m) tmp = 0 if z <= -195000000000.0: tmp = t_2 elif z <= 7.6e-129: tmp = t_1 elif z <= 6.4e-62: tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m) elif z <= 1.1e-20: tmp = t_1 elif z <= 5.4e+85: tmp = t_2 else: tmp = ((b / z) + (-4.0 * (a * t))) / c_m return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c_m)) t_2 = Float64(Float64(9.0 * Float64(Float64(x / z) * Float64(y / c_m))) + Float64(Float64(t * Float64(-4.0 * a)) / c_m)) tmp = 0.0 if (z <= -195000000000.0) tmp = t_2; elseif (z <= 7.6e-129) tmp = t_1; elseif (z <= 6.4e-62) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c_m)); elseif (z <= 1.1e-20) tmp = t_1; elseif (z <= 5.4e+85) tmp = t_2; else tmp = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / 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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = (b + (y * (9.0 * x))) / (z * c_m);
t_2 = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m);
tmp = 0.0;
if (z <= -195000000000.0)
tmp = t_2;
elseif (z <= 7.6e-129)
tmp = t_1;
elseif (z <= 6.4e-62)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
elseif (z <= 1.1e-20)
tmp = t_1;
elseif (z <= 5.4e+85)
tmp = t_2;
else
tmp = ((b / z) + (-4.0 * (a * t))) / 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -195000000000.0], t$95$2, If[LessEqual[z, 7.6e-129], t$95$1, If[LessEqual[z, 6.4e-62], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.1e-20], t$95$1, If[LessEqual[z, 5.4e+85], t$95$2, N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $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])\\
\\
\begin{array}{l}
t_1 := \frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
t_2 := 9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c\_m}\right) + \frac{t \cdot \left(-4 \cdot a\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -195000000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 7.6 \cdot 10^{-129}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 6.4 \cdot 10^{-62}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c\_m}\\
\mathbf{elif}\;z \leq 1.1 \cdot 10^{-20}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5.4 \cdot 10^{+85}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c\_m}\\
\end{array}
\end{array}
\end{array}
if z < -1.95e11 or 1.09999999999999995e-20 < z < 5.39999999999999966e85Initial program 68.0%
associate-+l-68.0%
*-commutative68.0%
associate-*r*73.0%
*-commutative73.0%
associate-+l-73.0%
associate-*l*73.0%
associate-*l*76.7%
*-commutative76.7%
Simplified76.7%
Taylor expanded in t around inf 68.0%
Taylor expanded in t around 0 83.8%
+-commutative83.8%
associate-/l*86.3%
associate-/r*82.7%
*-commutative82.7%
associate-+l+82.7%
associate-/r*86.3%
associate-/l*83.8%
*-commutative83.8%
times-frac82.7%
*-commutative82.7%
metadata-eval82.7%
cancel-sign-sub-inv82.7%
Simplified87.6%
Taylor expanded in b around 0 77.1%
associate-*r*77.1%
Simplified77.1%
if -1.95e11 < z < 7.59999999999999969e-129 or 6.40000000000000043e-62 < z < 1.09999999999999995e-20Initial program 94.8%
associate-+l-94.8%
*-commutative94.8%
associate-*r*94.5%
*-commutative94.5%
associate-+l-94.5%
associate-*l*94.4%
associate-*l*90.5%
*-commutative90.5%
Simplified90.5%
Taylor expanded in x around inf 83.0%
associate-*r*83.0%
Simplified83.0%
if 7.59999999999999969e-129 < z < 6.40000000000000043e-62Initial program 93.6%
associate-+l-93.6%
*-commutative93.6%
associate-*r*93.7%
*-commutative93.7%
associate-+l-93.7%
associate-*l*93.7%
associate-*l*86.9%
*-commutative86.9%
Simplified86.9%
Taylor expanded in x around 0 93.6%
if 5.39999999999999966e85 < z Initial program 59.6%
associate-+l-59.6%
*-commutative59.6%
associate-*r*69.4%
*-commutative69.4%
associate-+l-69.4%
associate-*l*69.4%
associate-*l*77.3%
*-commutative77.3%
Simplified77.3%
Taylor expanded in y around -inf 77.7%
Taylor expanded in y around 0 78.5%
mul-1-neg78.5%
*-commutative78.5%
associate-/r*80.6%
associate-*r/80.6%
div-sub82.7%
cancel-sign-sub-inv82.7%
metadata-eval82.7%
Simplified82.7%
Final simplification81.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (* y (* 9.0 x))) (* z c_m))))
(*
c_s
(if (<= z -1.25e-31)
(* y (/ (- (* 4.0 (/ (* a t) (- y))) (* (/ x z) -9.0)) c_m))
(if (<= z 1.35e-128)
t_1
(if (<= z 1.15e-61)
(/ (- b (* 4.0 (* a (* z t)))) (* z c_m))
(if (<= z 1.8e-17)
t_1
(if (<= z 7.2e+77)
(+ (* 9.0 (* (/ x z) (/ y c_m))) (/ (* t (* -4.0 a)) c_m))
(/ (+ (/ b z) (* -4.0 (* a t))) c_m)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + (y * (9.0 * x))) / (z * c_m);
double tmp;
if (z <= -1.25e-31) {
tmp = y * (((4.0 * ((a * t) / -y)) - ((x / z) * -9.0)) / c_m);
} else if (z <= 1.35e-128) {
tmp = t_1;
} else if (z <= 1.15e-61) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else if (z <= 1.8e-17) {
tmp = t_1;
} else if (z <= 7.2e+77) {
tmp = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m);
} else {
tmp = ((b / z) + (-4.0 * (a * t))) / 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.
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 = (b + (y * (9.0d0 * x))) / (z * c_m)
if (z <= (-1.25d-31)) then
tmp = y * (((4.0d0 * ((a * t) / -y)) - ((x / z) * (-9.0d0))) / c_m)
else if (z <= 1.35d-128) then
tmp = t_1
else if (z <= 1.15d-61) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c_m)
else if (z <= 1.8d-17) then
tmp = t_1
else if (z <= 7.2d+77) then
tmp = (9.0d0 * ((x / z) * (y / c_m))) + ((t * ((-4.0d0) * a)) / c_m)
else
tmp = ((b / z) + ((-4.0d0) * (a * t))) / 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;
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 = (b + (y * (9.0 * x))) / (z * c_m);
double tmp;
if (z <= -1.25e-31) {
tmp = y * (((4.0 * ((a * t) / -y)) - ((x / z) * -9.0)) / c_m);
} else if (z <= 1.35e-128) {
tmp = t_1;
} else if (z <= 1.15e-61) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else if (z <= 1.8e-17) {
tmp = t_1;
} else if (z <= 7.2e+77) {
tmp = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m);
} else {
tmp = ((b / z) + (-4.0 * (a * t))) / 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]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = (b + (y * (9.0 * x))) / (z * c_m) tmp = 0 if z <= -1.25e-31: tmp = y * (((4.0 * ((a * t) / -y)) - ((x / z) * -9.0)) / c_m) elif z <= 1.35e-128: tmp = t_1 elif z <= 1.15e-61: tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m) elif z <= 1.8e-17: tmp = t_1 elif z <= 7.2e+77: tmp = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m) else: tmp = ((b / z) + (-4.0 * (a * t))) / c_m return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c_m)) tmp = 0.0 if (z <= -1.25e-31) tmp = Float64(y * Float64(Float64(Float64(4.0 * Float64(Float64(a * t) / Float64(-y))) - Float64(Float64(x / z) * -9.0)) / c_m)); elseif (z <= 1.35e-128) tmp = t_1; elseif (z <= 1.15e-61) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c_m)); elseif (z <= 1.8e-17) tmp = t_1; elseif (z <= 7.2e+77) tmp = Float64(Float64(9.0 * Float64(Float64(x / z) * Float64(y / c_m))) + Float64(Float64(t * Float64(-4.0 * a)) / c_m)); else tmp = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / 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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = (b + (y * (9.0 * x))) / (z * c_m);
tmp = 0.0;
if (z <= -1.25e-31)
tmp = y * (((4.0 * ((a * t) / -y)) - ((x / z) * -9.0)) / c_m);
elseif (z <= 1.35e-128)
tmp = t_1;
elseif (z <= 1.15e-61)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
elseif (z <= 1.8e-17)
tmp = t_1;
elseif (z <= 7.2e+77)
tmp = (9.0 * ((x / z) * (y / c_m))) + ((t * (-4.0 * a)) / c_m);
else
tmp = ((b / z) + (-4.0 * (a * t))) / 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.25e-31], N[(y * N[(N[(N[(4.0 * N[(N[(a * t), $MachinePrecision] / (-y)), $MachinePrecision]), $MachinePrecision] - N[(N[(x / z), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.35e-128], t$95$1, If[LessEqual[z, 1.15e-61], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.8e-17], t$95$1, If[LessEqual[z, 7.2e+77], N[(N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $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])\\
\\
\begin{array}{l}
t_1 := \frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.25 \cdot 10^{-31}:\\
\;\;\;\;y \cdot \frac{4 \cdot \frac{a \cdot t}{-y} - \frac{x}{z} \cdot -9}{c\_m}\\
\mathbf{elif}\;z \leq 1.35 \cdot 10^{-128}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{-61}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c\_m}\\
\mathbf{elif}\;z \leq 1.8 \cdot 10^{-17}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 7.2 \cdot 10^{+77}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c\_m}\right) + \frac{t \cdot \left(-4 \cdot a\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c\_m}\\
\end{array}
\end{array}
\end{array}
if z < -1.25e-31Initial program 65.5%
associate-+l-65.5%
*-commutative65.5%
associate-*r*72.1%
*-commutative72.1%
associate-+l-72.1%
associate-*l*72.1%
associate-*l*74.9%
*-commutative74.9%
Simplified74.9%
Taylor expanded in y around -inf 76.1%
Taylor expanded in b around 0 66.6%
times-frac63.9%
Simplified63.9%
Taylor expanded in c around 0 67.1%
if -1.25e-31 < z < 1.35000000000000003e-128 or 1.14999999999999996e-61 < z < 1.79999999999999997e-17Initial program 96.0%
associate-+l-96.0%
*-commutative96.0%
associate-*r*95.6%
*-commutative95.6%
associate-+l-95.6%
associate-*l*95.5%
associate-*l*91.0%
*-commutative91.0%
Simplified91.0%
Taylor expanded in x around inf 85.4%
associate-*r*85.4%
Simplified85.4%
if 1.35000000000000003e-128 < z < 1.14999999999999996e-61Initial program 93.6%
associate-+l-93.6%
*-commutative93.6%
associate-*r*93.7%
*-commutative93.7%
associate-+l-93.7%
associate-*l*93.7%
associate-*l*86.9%
*-commutative86.9%
Simplified86.9%
Taylor expanded in x around 0 93.6%
if 1.79999999999999997e-17 < z < 7.1999999999999996e77Initial program 90.3%
associate-+l-90.3%
*-commutative90.3%
associate-*r*86.2%
*-commutative86.2%
associate-+l-86.2%
associate-*l*86.2%
associate-*l*90.3%
*-commutative90.3%
Simplified90.3%
Taylor expanded in t around inf 77.2%
Taylor expanded in t around 0 85.6%
+-commutative85.6%
associate-/l*85.8%
associate-/r*85.8%
*-commutative85.8%
associate-+l+85.8%
associate-/r*85.8%
associate-/l*85.6%
*-commutative85.6%
times-frac85.8%
*-commutative85.8%
metadata-eval85.8%
cancel-sign-sub-inv85.8%
Simplified90.4%
Taylor expanded in b around 0 79.1%
associate-*r*79.1%
Simplified79.1%
if 7.1999999999999996e77 < z Initial program 59.6%
associate-+l-59.6%
*-commutative59.6%
associate-*r*69.4%
*-commutative69.4%
associate-+l-69.4%
associate-*l*69.4%
associate-*l*77.3%
*-commutative77.3%
Simplified77.3%
Taylor expanded in y around -inf 77.7%
Taylor expanded in y around 0 78.5%
mul-1-neg78.5%
*-commutative78.5%
associate-/r*80.6%
associate-*r/80.6%
div-sub82.7%
cancel-sign-sub-inv82.7%
metadata-eval82.7%
Simplified82.7%
Final simplification79.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ b (* z c_m))) (t_2 (* 9.0 (* x (/ y (* z c_m))))))
(*
c_s
(if (<= z -1500.0)
(* -4.0 (* t (/ a c_m)))
(if (<= z -7.2e-114)
t_2
(if (<= z 1.8e-268)
t_1
(if (<= z 3.2e-120)
t_2
(if (<= z 2.05e-19) t_1 (* a (/ (* -4.0 t) c_m))))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = b / (z * c_m);
double t_2 = 9.0 * (x * (y / (z * c_m)));
double tmp;
if (z <= -1500.0) {
tmp = -4.0 * (t * (a / c_m));
} else if (z <= -7.2e-114) {
tmp = t_2;
} else if (z <= 1.8e-268) {
tmp = t_1;
} else if (z <= 3.2e-120) {
tmp = t_2;
} else if (z <= 2.05e-19) {
tmp = t_1;
} else {
tmp = a * ((-4.0 * t) / 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.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = b / (z * c_m)
t_2 = 9.0d0 * (x * (y / (z * c_m)))
if (z <= (-1500.0d0)) then
tmp = (-4.0d0) * (t * (a / c_m))
else if (z <= (-7.2d-114)) then
tmp = t_2
else if (z <= 1.8d-268) then
tmp = t_1
else if (z <= 3.2d-120) then
tmp = t_2
else if (z <= 2.05d-19) then
tmp = t_1
else
tmp = a * (((-4.0d0) * t) / 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;
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 = b / (z * c_m);
double t_2 = 9.0 * (x * (y / (z * c_m)));
double tmp;
if (z <= -1500.0) {
tmp = -4.0 * (t * (a / c_m));
} else if (z <= -7.2e-114) {
tmp = t_2;
} else if (z <= 1.8e-268) {
tmp = t_1;
} else if (z <= 3.2e-120) {
tmp = t_2;
} else if (z <= 2.05e-19) {
tmp = t_1;
} else {
tmp = a * ((-4.0 * t) / 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]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = b / (z * c_m) t_2 = 9.0 * (x * (y / (z * c_m))) tmp = 0 if z <= -1500.0: tmp = -4.0 * (t * (a / c_m)) elif z <= -7.2e-114: tmp = t_2 elif z <= 1.8e-268: tmp = t_1 elif z <= 3.2e-120: tmp = t_2 elif z <= 2.05e-19: tmp = t_1 else: tmp = a * ((-4.0 * t) / c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(b / Float64(z * c_m)) t_2 = Float64(9.0 * Float64(x * Float64(y / Float64(z * c_m)))) tmp = 0.0 if (z <= -1500.0) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); elseif (z <= -7.2e-114) tmp = t_2; elseif (z <= 1.8e-268) tmp = t_1; elseif (z <= 3.2e-120) tmp = t_2; elseif (z <= 2.05e-19) tmp = t_1; else tmp = Float64(a * Float64(Float64(-4.0 * t) / 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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = b / (z * c_m);
t_2 = 9.0 * (x * (y / (z * c_m)));
tmp = 0.0;
if (z <= -1500.0)
tmp = -4.0 * (t * (a / c_m));
elseif (z <= -7.2e-114)
tmp = t_2;
elseif (z <= 1.8e-268)
tmp = t_1;
elseif (z <= 3.2e-120)
tmp = t_2;
elseif (z <= 2.05e-19)
tmp = t_1;
else
tmp = a * ((-4.0 * t) / 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(9.0 * N[(x * N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1500.0], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -7.2e-114], t$95$2, If[LessEqual[z, 1.8e-268], t$95$1, If[LessEqual[z, 3.2e-120], t$95$2, If[LessEqual[z, 2.05e-19], t$95$1, N[(a * N[(N[(-4.0 * t), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_1 := \frac{b}{z \cdot c\_m}\\
t_2 := 9 \cdot \left(x \cdot \frac{y}{z \cdot c\_m}\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1500:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{elif}\;z \leq -7.2 \cdot 10^{-114}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 1.8 \cdot 10^{-268}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 3.2 \cdot 10^{-120}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 2.05 \cdot 10^{-19}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c\_m}\\
\end{array}
\end{array}
\end{array}
if z < -1500Initial program 60.9%
associate-+l-60.9%
*-commutative60.9%
associate-*r*68.6%
*-commutative68.6%
associate-+l-68.6%
associate-*l*68.7%
associate-*l*72.0%
*-commutative72.0%
Simplified72.0%
Taylor expanded in y around inf 54.6%
Taylor expanded in a around inf 59.2%
associate-*l/62.1%
*-commutative62.1%
Simplified62.1%
if -1500 < z < -7.20000000000000036e-114 or 1.8000000000000001e-268 < z < 3.1999999999999999e-120Initial program 95.0%
associate-+l-95.0%
*-commutative95.0%
associate-*r*94.4%
*-commutative94.4%
associate-+l-94.4%
associate-*l*94.3%
associate-*l*93.3%
*-commutative93.3%
Simplified93.3%
Taylor expanded in t around inf 91.2%
Taylor expanded in x around inf 54.6%
associate-/l*53.1%
*-commutative53.1%
Simplified53.1%
if -7.20000000000000036e-114 < z < 1.8000000000000001e-268 or 3.1999999999999999e-120 < z < 2.04999999999999993e-19Initial program 95.5%
associate-+l-95.5%
*-commutative95.5%
associate-*r*95.5%
*-commutative95.5%
associate-+l-95.5%
associate-*l*95.5%
associate-*l*87.9%
*-commutative87.9%
Simplified87.9%
Taylor expanded in b around inf 59.0%
*-commutative59.0%
Simplified59.0%
if 2.04999999999999993e-19 < z Initial program 69.0%
associate-+l-69.0%
*-commutative69.0%
associate-*r*74.5%
*-commutative74.5%
associate-+l-74.5%
associate-*l*74.5%
associate-*l*81.2%
*-commutative81.2%
Simplified81.2%
Taylor expanded in z around inf 59.6%
*-commutative59.6%
associate-/l*59.2%
associate-*r*59.2%
associate-*l/59.2%
Simplified59.2%
Final simplification58.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ b (* z c_m))))
(*
c_s
(if (<= z -235.0)
(* -4.0 (* t (/ a c_m)))
(if (<= z -2.7e-114)
(* 9.0 (* x (/ y (* z c_m))))
(if (<= z 3.9e-268)
t_1
(if (<= z 2.5e-126)
(* 9.0 (/ (* x y) (* z c_m)))
(if (<= z 8.8e-20) t_1 (* a (/ (* -4.0 t) c_m))))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = b / (z * c_m);
double tmp;
if (z <= -235.0) {
tmp = -4.0 * (t * (a / c_m));
} else if (z <= -2.7e-114) {
tmp = 9.0 * (x * (y / (z * c_m)));
} else if (z <= 3.9e-268) {
tmp = t_1;
} else if (z <= 2.5e-126) {
tmp = 9.0 * ((x * y) / (z * c_m));
} else if (z <= 8.8e-20) {
tmp = t_1;
} else {
tmp = a * ((-4.0 * t) / 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.
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 = b / (z * c_m)
if (z <= (-235.0d0)) then
tmp = (-4.0d0) * (t * (a / c_m))
else if (z <= (-2.7d-114)) then
tmp = 9.0d0 * (x * (y / (z * c_m)))
else if (z <= 3.9d-268) then
tmp = t_1
else if (z <= 2.5d-126) then
tmp = 9.0d0 * ((x * y) / (z * c_m))
else if (z <= 8.8d-20) then
tmp = t_1
else
tmp = a * (((-4.0d0) * t) / 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;
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 = b / (z * c_m);
double tmp;
if (z <= -235.0) {
tmp = -4.0 * (t * (a / c_m));
} else if (z <= -2.7e-114) {
tmp = 9.0 * (x * (y / (z * c_m)));
} else if (z <= 3.9e-268) {
tmp = t_1;
} else if (z <= 2.5e-126) {
tmp = 9.0 * ((x * y) / (z * c_m));
} else if (z <= 8.8e-20) {
tmp = t_1;
} else {
tmp = a * ((-4.0 * t) / 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]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = b / (z * c_m) tmp = 0 if z <= -235.0: tmp = -4.0 * (t * (a / c_m)) elif z <= -2.7e-114: tmp = 9.0 * (x * (y / (z * c_m))) elif z <= 3.9e-268: tmp = t_1 elif z <= 2.5e-126: tmp = 9.0 * ((x * y) / (z * c_m)) elif z <= 8.8e-20: tmp = t_1 else: tmp = a * ((-4.0 * t) / c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(b / Float64(z * c_m)) tmp = 0.0 if (z <= -235.0) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); elseif (z <= -2.7e-114) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c_m)))); elseif (z <= 3.9e-268) tmp = t_1; elseif (z <= 2.5e-126) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c_m))); elseif (z <= 8.8e-20) tmp = t_1; else tmp = Float64(a * Float64(Float64(-4.0 * t) / 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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = b / (z * c_m);
tmp = 0.0;
if (z <= -235.0)
tmp = -4.0 * (t * (a / c_m));
elseif (z <= -2.7e-114)
tmp = 9.0 * (x * (y / (z * c_m)));
elseif (z <= 3.9e-268)
tmp = t_1;
elseif (z <= 2.5e-126)
tmp = 9.0 * ((x * y) / (z * c_m));
elseif (z <= 8.8e-20)
tmp = t_1;
else
tmp = a * ((-4.0 * t) / 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -235.0], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.7e-114], N[(9.0 * N[(x * N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.9e-268], t$95$1, If[LessEqual[z, 2.5e-126], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.8e-20], t$95$1, N[(a * N[(N[(-4.0 * t), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_1 := \frac{b}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -235:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{elif}\;z \leq -2.7 \cdot 10^{-114}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c\_m}\right)\\
\mathbf{elif}\;z \leq 3.9 \cdot 10^{-268}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{-126}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c\_m}\\
\mathbf{elif}\;z \leq 8.8 \cdot 10^{-20}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c\_m}\\
\end{array}
\end{array}
\end{array}
if z < -235Initial program 60.9%
associate-+l-60.9%
*-commutative60.9%
associate-*r*68.6%
*-commutative68.6%
associate-+l-68.6%
associate-*l*68.7%
associate-*l*72.0%
*-commutative72.0%
Simplified72.0%
Taylor expanded in y around inf 54.6%
Taylor expanded in a around inf 59.2%
associate-*l/62.1%
*-commutative62.1%
Simplified62.1%
if -235 < z < -2.7e-114Initial program 94.5%
associate-+l-94.5%
*-commutative94.5%
associate-*r*93.4%
*-commutative93.4%
associate-+l-93.4%
associate-*l*93.3%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in t around inf 85.1%
Taylor expanded in x around inf 47.4%
associate-/l*50.0%
*-commutative50.0%
Simplified50.0%
if -2.7e-114 < z < 3.8999999999999998e-268 or 2.50000000000000003e-126 < z < 8.79999999999999964e-20Initial program 95.5%
associate-+l-95.5%
*-commutative95.5%
associate-*r*95.5%
*-commutative95.5%
associate-+l-95.5%
associate-*l*95.5%
associate-*l*87.9%
*-commutative87.9%
Simplified87.9%
Taylor expanded in b around inf 59.0%
*-commutative59.0%
Simplified59.0%
if 3.8999999999999998e-268 < z < 2.50000000000000003e-126Initial program 95.8%
associate-+l-95.8%
*-commutative95.8%
associate-*r*95.8%
*-commutative95.8%
associate-+l-95.8%
associate-*l*95.7%
associate-*l*95.7%
*-commutative95.7%
Simplified95.7%
Taylor expanded in x around inf 64.8%
if 8.79999999999999964e-20 < z Initial program 69.0%
associate-+l-69.0%
*-commutative69.0%
associate-*r*74.5%
*-commutative74.5%
associate-+l-74.5%
associate-*l*74.5%
associate-*l*81.2%
*-commutative81.2%
Simplified81.2%
Taylor expanded in z around inf 59.6%
*-commutative59.6%
associate-/l*59.2%
associate-*r*59.2%
associate-*l/59.2%
Simplified59.2%
Final simplification59.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= b -3.8e+40)
(/ 1.0 (* z (/ c_m b)))
(if (<= b -150000000000.0)
(* y (* 9.0 (/ x (* z c_m))))
(if (<= b -3.5e-253)
(* -4.0 (* t (/ a c_m)))
(if (<= b 1.46e-152)
(* 9.0 (/ (* x y) (* z c_m)))
(if (<= b 13000.0) (* -4.0 (/ (* a t) c_m)) (/ (/ b c_m) z))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -3.8e+40) {
tmp = 1.0 / (z * (c_m / b));
} else if (b <= -150000000000.0) {
tmp = y * (9.0 * (x / (z * c_m)));
} else if (b <= -3.5e-253) {
tmp = -4.0 * (t * (a / c_m));
} else if (b <= 1.46e-152) {
tmp = 9.0 * ((x * y) / (z * c_m));
} else if (b <= 13000.0) {
tmp = -4.0 * ((a * t) / c_m);
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (b <= (-3.8d+40)) then
tmp = 1.0d0 / (z * (c_m / b))
else if (b <= (-150000000000.0d0)) then
tmp = y * (9.0d0 * (x / (z * c_m)))
else if (b <= (-3.5d-253)) then
tmp = (-4.0d0) * (t * (a / c_m))
else if (b <= 1.46d-152) then
tmp = 9.0d0 * ((x * y) / (z * c_m))
else if (b <= 13000.0d0) then
tmp = (-4.0d0) * ((a * t) / c_m)
else
tmp = (b / c_m) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -3.8e+40) {
tmp = 1.0 / (z * (c_m / b));
} else if (b <= -150000000000.0) {
tmp = y * (9.0 * (x / (z * c_m)));
} else if (b <= -3.5e-253) {
tmp = -4.0 * (t * (a / c_m));
} else if (b <= 1.46e-152) {
tmp = 9.0 * ((x * y) / (z * c_m));
} else if (b <= 13000.0) {
tmp = -4.0 * ((a * t) / c_m);
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if b <= -3.8e+40: tmp = 1.0 / (z * (c_m / b)) elif b <= -150000000000.0: tmp = y * (9.0 * (x / (z * c_m))) elif b <= -3.5e-253: tmp = -4.0 * (t * (a / c_m)) elif b <= 1.46e-152: tmp = 9.0 * ((x * y) / (z * c_m)) elif b <= 13000.0: tmp = -4.0 * ((a * t) / c_m) else: tmp = (b / c_m) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (b <= -3.8e+40) tmp = Float64(1.0 / Float64(z * Float64(c_m / b))); elseif (b <= -150000000000.0) tmp = Float64(y * Float64(9.0 * Float64(x / Float64(z * c_m)))); elseif (b <= -3.5e-253) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); elseif (b <= 1.46e-152) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c_m))); elseif (b <= 13000.0) tmp = Float64(-4.0 * Float64(Float64(a * t) / c_m)); else tmp = Float64(Float64(b / c_m) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (b <= -3.8e+40)
tmp = 1.0 / (z * (c_m / b));
elseif (b <= -150000000000.0)
tmp = y * (9.0 * (x / (z * c_m)));
elseif (b <= -3.5e-253)
tmp = -4.0 * (t * (a / c_m));
elseif (b <= 1.46e-152)
tmp = 9.0 * ((x * y) / (z * c_m));
elseif (b <= 13000.0)
tmp = -4.0 * ((a * t) / c_m);
else
tmp = (b / c_m) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[b, -3.8e+40], N[(1.0 / N[(z * N[(c$95$m / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -150000000000.0], N[(y * N[(9.0 * N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -3.5e-253], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.46e-152], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 13000.0], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -3.8 \cdot 10^{+40}:\\
\;\;\;\;\frac{1}{z \cdot \frac{c\_m}{b}}\\
\mathbf{elif}\;b \leq -150000000000:\\
\;\;\;\;y \cdot \left(9 \cdot \frac{x}{z \cdot c\_m}\right)\\
\mathbf{elif}\;b \leq -3.5 \cdot 10^{-253}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{elif}\;b \leq 1.46 \cdot 10^{-152}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c\_m}\\
\mathbf{elif}\;b \leq 13000:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if b < -3.80000000000000004e40Initial program 78.7%
associate-+l-78.7%
*-commutative78.7%
associate-*r*84.3%
*-commutative84.3%
associate-+l-84.3%
associate-*l*84.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 48.8%
*-commutative48.8%
Simplified48.8%
clear-num48.8%
inv-pow48.8%
Applied egg-rr48.8%
unpow-148.8%
associate-/l*56.4%
Simplified56.4%
if -3.80000000000000004e40 < b < -1.5e11Initial program 72.2%
associate-+l-72.2%
*-commutative72.2%
associate-*r*72.2%
*-commutative72.2%
associate-+l-72.2%
associate-*l*71.8%
associate-*l*71.8%
*-commutative71.8%
Simplified71.8%
Taylor expanded in t around inf 71.8%
Taylor expanded in t around 0 86.2%
+-commutative86.2%
associate-/l*86.0%
associate-/r*72.9%
*-commutative72.9%
associate-+l+72.9%
associate-/r*86.0%
associate-/l*86.2%
*-commutative86.2%
times-frac86.2%
*-commutative86.2%
metadata-eval86.2%
cancel-sign-sub-inv86.2%
Simplified86.2%
Taylor expanded in x around inf 68.8%
*-commutative68.8%
*-commutative68.8%
*-commutative68.8%
associate-/l*68.3%
*-commutative68.3%
associate-*r*68.6%
*-commutative68.6%
Simplified68.6%
if -1.5e11 < b < -3.50000000000000022e-253Initial program 68.3%
associate-+l-68.3%
*-commutative68.3%
associate-*r*71.3%
*-commutative71.3%
associate-+l-71.3%
associate-*l*71.4%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in y around inf 62.9%
Taylor expanded in a around inf 52.4%
associate-*l/55.9%
*-commutative55.9%
Simplified55.9%
if -3.50000000000000022e-253 < b < 1.46000000000000001e-152Initial program 84.5%
associate-+l-84.5%
*-commutative84.5%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
associate-*l*84.8%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Taylor expanded in x around inf 71.3%
if 1.46000000000000001e-152 < b < 13000Initial program 81.4%
associate-+l-81.4%
*-commutative81.4%
associate-*r*87.4%
*-commutative87.4%
associate-+l-87.4%
associate-*l*87.4%
associate-*l*87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around inf 57.8%
*-commutative57.8%
Simplified57.8%
if 13000 < b Initial program 86.5%
associate-+l-86.5%
*-commutative86.5%
associate-*r*89.4%
*-commutative89.4%
associate-+l-89.4%
associate-*l*89.4%
associate-*l*87.8%
*-commutative87.8%
Simplified87.8%
Taylor expanded in b around inf 54.9%
associate-/r*58.0%
Simplified58.0%
Final simplification60.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= b -3.3e+52)
(/ 1.0 (* z (/ c_m b)))
(if (<= b -1000000000000.0)
(* y (* 9.0 (/ x (* z c_m))))
(if (<= b -4.4e-253)
(* -4.0 (* t (/ a c_m)))
(if (<= b 2.8e-152)
(/ (* y (* 9.0 x)) (* z c_m))
(if (<= b 13000.0) (* -4.0 (/ (* a t) c_m)) (/ (/ b c_m) z))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -3.3e+52) {
tmp = 1.0 / (z * (c_m / b));
} else if (b <= -1000000000000.0) {
tmp = y * (9.0 * (x / (z * c_m)));
} else if (b <= -4.4e-253) {
tmp = -4.0 * (t * (a / c_m));
} else if (b <= 2.8e-152) {
tmp = (y * (9.0 * x)) / (z * c_m);
} else if (b <= 13000.0) {
tmp = -4.0 * ((a * t) / c_m);
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (b <= (-3.3d+52)) then
tmp = 1.0d0 / (z * (c_m / b))
else if (b <= (-1000000000000.0d0)) then
tmp = y * (9.0d0 * (x / (z * c_m)))
else if (b <= (-4.4d-253)) then
tmp = (-4.0d0) * (t * (a / c_m))
else if (b <= 2.8d-152) then
tmp = (y * (9.0d0 * x)) / (z * c_m)
else if (b <= 13000.0d0) then
tmp = (-4.0d0) * ((a * t) / c_m)
else
tmp = (b / c_m) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -3.3e+52) {
tmp = 1.0 / (z * (c_m / b));
} else if (b <= -1000000000000.0) {
tmp = y * (9.0 * (x / (z * c_m)));
} else if (b <= -4.4e-253) {
tmp = -4.0 * (t * (a / c_m));
} else if (b <= 2.8e-152) {
tmp = (y * (9.0 * x)) / (z * c_m);
} else if (b <= 13000.0) {
tmp = -4.0 * ((a * t) / c_m);
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if b <= -3.3e+52: tmp = 1.0 / (z * (c_m / b)) elif b <= -1000000000000.0: tmp = y * (9.0 * (x / (z * c_m))) elif b <= -4.4e-253: tmp = -4.0 * (t * (a / c_m)) elif b <= 2.8e-152: tmp = (y * (9.0 * x)) / (z * c_m) elif b <= 13000.0: tmp = -4.0 * ((a * t) / c_m) else: tmp = (b / c_m) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (b <= -3.3e+52) tmp = Float64(1.0 / Float64(z * Float64(c_m / b))); elseif (b <= -1000000000000.0) tmp = Float64(y * Float64(9.0 * Float64(x / Float64(z * c_m)))); elseif (b <= -4.4e-253) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); elseif (b <= 2.8e-152) tmp = Float64(Float64(y * Float64(9.0 * x)) / Float64(z * c_m)); elseif (b <= 13000.0) tmp = Float64(-4.0 * Float64(Float64(a * t) / c_m)); else tmp = Float64(Float64(b / c_m) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (b <= -3.3e+52)
tmp = 1.0 / (z * (c_m / b));
elseif (b <= -1000000000000.0)
tmp = y * (9.0 * (x / (z * c_m)));
elseif (b <= -4.4e-253)
tmp = -4.0 * (t * (a / c_m));
elseif (b <= 2.8e-152)
tmp = (y * (9.0 * x)) / (z * c_m);
elseif (b <= 13000.0)
tmp = -4.0 * ((a * t) / c_m);
else
tmp = (b / c_m) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[b, -3.3e+52], N[(1.0 / N[(z * N[(c$95$m / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -1000000000000.0], N[(y * N[(9.0 * N[(x / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.4e-253], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.8e-152], N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 13000.0], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -3.3 \cdot 10^{+52}:\\
\;\;\;\;\frac{1}{z \cdot \frac{c\_m}{b}}\\
\mathbf{elif}\;b \leq -1000000000000:\\
\;\;\;\;y \cdot \left(9 \cdot \frac{x}{z \cdot c\_m}\right)\\
\mathbf{elif}\;b \leq -4.4 \cdot 10^{-253}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{elif}\;b \leq 2.8 \cdot 10^{-152}:\\
\;\;\;\;\frac{y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
\mathbf{elif}\;b \leq 13000:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if b < -3.3e52Initial program 78.7%
associate-+l-78.7%
*-commutative78.7%
associate-*r*84.3%
*-commutative84.3%
associate-+l-84.3%
associate-*l*84.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 48.8%
*-commutative48.8%
Simplified48.8%
clear-num48.8%
inv-pow48.8%
Applied egg-rr48.8%
unpow-148.8%
associate-/l*56.4%
Simplified56.4%
if -3.3e52 < b < -1e12Initial program 72.2%
associate-+l-72.2%
*-commutative72.2%
associate-*r*72.2%
*-commutative72.2%
associate-+l-72.2%
associate-*l*71.8%
associate-*l*71.8%
*-commutative71.8%
Simplified71.8%
Taylor expanded in t around inf 71.8%
Taylor expanded in t around 0 86.2%
+-commutative86.2%
associate-/l*86.0%
associate-/r*72.9%
*-commutative72.9%
associate-+l+72.9%
associate-/r*86.0%
associate-/l*86.2%
*-commutative86.2%
times-frac86.2%
*-commutative86.2%
metadata-eval86.2%
cancel-sign-sub-inv86.2%
Simplified86.2%
Taylor expanded in x around inf 68.8%
*-commutative68.8%
*-commutative68.8%
*-commutative68.8%
associate-/l*68.3%
*-commutative68.3%
associate-*r*68.6%
*-commutative68.6%
Simplified68.6%
if -1e12 < b < -4.39999999999999992e-253Initial program 68.3%
associate-+l-68.3%
*-commutative68.3%
associate-*r*71.3%
*-commutative71.3%
associate-+l-71.3%
associate-*l*71.4%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in y around inf 62.9%
Taylor expanded in a around inf 52.4%
associate-*l/55.9%
*-commutative55.9%
Simplified55.9%
if -4.39999999999999992e-253 < b < 2.79999999999999984e-152Initial program 84.5%
associate-+l-84.5%
*-commutative84.5%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
associate-*l*84.8%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Taylor expanded in y around inf 82.5%
Taylor expanded in y around inf 71.3%
associate-*r/71.4%
associate-*r*71.3%
*-commutative71.3%
*-commutative71.3%
Simplified71.3%
if 2.79999999999999984e-152 < b < 13000Initial program 81.4%
associate-+l-81.4%
*-commutative81.4%
associate-*r*87.4%
*-commutative87.4%
associate-+l-87.4%
associate-*l*87.4%
associate-*l*87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around inf 57.8%
*-commutative57.8%
Simplified57.8%
if 13000 < b Initial program 86.5%
associate-+l-86.5%
*-commutative86.5%
associate-*r*89.4%
*-commutative89.4%
associate-+l-89.4%
associate-*l*89.4%
associate-*l*87.8%
*-commutative87.8%
Simplified87.8%
Taylor expanded in b around inf 54.9%
associate-/r*58.0%
Simplified58.0%
Final simplification60.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= b -3.2e+42)
(/ 1.0 (* z (/ c_m b)))
(if (<= b -260000000.0)
(* y (* (/ x z) (/ -9.0 (- c_m))))
(if (<= b -1.4e-253)
(* -4.0 (* t (/ a c_m)))
(if (<= b 2.3e-152)
(/ (* y (* 9.0 x)) (* z c_m))
(if (<= b 13.5) (* -4.0 (/ (* a t) c_m)) (/ (/ b c_m) z))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -3.2e+42) {
tmp = 1.0 / (z * (c_m / b));
} else if (b <= -260000000.0) {
tmp = y * ((x / z) * (-9.0 / -c_m));
} else if (b <= -1.4e-253) {
tmp = -4.0 * (t * (a / c_m));
} else if (b <= 2.3e-152) {
tmp = (y * (9.0 * x)) / (z * c_m);
} else if (b <= 13.5) {
tmp = -4.0 * ((a * t) / c_m);
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (b <= (-3.2d+42)) then
tmp = 1.0d0 / (z * (c_m / b))
else if (b <= (-260000000.0d0)) then
tmp = y * ((x / z) * ((-9.0d0) / -c_m))
else if (b <= (-1.4d-253)) then
tmp = (-4.0d0) * (t * (a / c_m))
else if (b <= 2.3d-152) then
tmp = (y * (9.0d0 * x)) / (z * c_m)
else if (b <= 13.5d0) then
tmp = (-4.0d0) * ((a * t) / c_m)
else
tmp = (b / c_m) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -3.2e+42) {
tmp = 1.0 / (z * (c_m / b));
} else if (b <= -260000000.0) {
tmp = y * ((x / z) * (-9.0 / -c_m));
} else if (b <= -1.4e-253) {
tmp = -4.0 * (t * (a / c_m));
} else if (b <= 2.3e-152) {
tmp = (y * (9.0 * x)) / (z * c_m);
} else if (b <= 13.5) {
tmp = -4.0 * ((a * t) / c_m);
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if b <= -3.2e+42: tmp = 1.0 / (z * (c_m / b)) elif b <= -260000000.0: tmp = y * ((x / z) * (-9.0 / -c_m)) elif b <= -1.4e-253: tmp = -4.0 * (t * (a / c_m)) elif b <= 2.3e-152: tmp = (y * (9.0 * x)) / (z * c_m) elif b <= 13.5: tmp = -4.0 * ((a * t) / c_m) else: tmp = (b / c_m) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (b <= -3.2e+42) tmp = Float64(1.0 / Float64(z * Float64(c_m / b))); elseif (b <= -260000000.0) tmp = Float64(y * Float64(Float64(x / z) * Float64(-9.0 / Float64(-c_m)))); elseif (b <= -1.4e-253) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); elseif (b <= 2.3e-152) tmp = Float64(Float64(y * Float64(9.0 * x)) / Float64(z * c_m)); elseif (b <= 13.5) tmp = Float64(-4.0 * Float64(Float64(a * t) / c_m)); else tmp = Float64(Float64(b / c_m) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (b <= -3.2e+42)
tmp = 1.0 / (z * (c_m / b));
elseif (b <= -260000000.0)
tmp = y * ((x / z) * (-9.0 / -c_m));
elseif (b <= -1.4e-253)
tmp = -4.0 * (t * (a / c_m));
elseif (b <= 2.3e-152)
tmp = (y * (9.0 * x)) / (z * c_m);
elseif (b <= 13.5)
tmp = -4.0 * ((a * t) / c_m);
else
tmp = (b / c_m) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[b, -3.2e+42], N[(1.0 / N[(z * N[(c$95$m / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -260000000.0], N[(y * N[(N[(x / z), $MachinePrecision] * N[(-9.0 / (-c$95$m)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -1.4e-253], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.3e-152], N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 13.5], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -3.2 \cdot 10^{+42}:\\
\;\;\;\;\frac{1}{z \cdot \frac{c\_m}{b}}\\
\mathbf{elif}\;b \leq -260000000:\\
\;\;\;\;y \cdot \left(\frac{x}{z} \cdot \frac{-9}{-c\_m}\right)\\
\mathbf{elif}\;b \leq -1.4 \cdot 10^{-253}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{elif}\;b \leq 2.3 \cdot 10^{-152}:\\
\;\;\;\;\frac{y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
\mathbf{elif}\;b \leq 13.5:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if b < -3.20000000000000002e42Initial program 78.7%
associate-+l-78.7%
*-commutative78.7%
associate-*r*84.3%
*-commutative84.3%
associate-+l-84.3%
associate-*l*84.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 48.8%
*-commutative48.8%
Simplified48.8%
clear-num48.8%
inv-pow48.8%
Applied egg-rr48.8%
unpow-148.8%
associate-/l*56.4%
Simplified56.4%
if -3.20000000000000002e42 < b < -2.6e8Initial program 72.2%
associate-+l-72.2%
*-commutative72.2%
associate-*r*72.2%
*-commutative72.2%
associate-+l-72.2%
associate-*l*71.8%
associate-*l*71.8%
*-commutative71.8%
Simplified71.8%
Taylor expanded in y around -inf 86.1%
Taylor expanded in b around 0 71.4%
times-frac71.4%
Simplified71.4%
Taylor expanded in x around inf 68.6%
associate-*r/68.6%
*-commutative68.6%
*-commutative68.6%
times-frac68.3%
Simplified68.3%
if -2.6e8 < b < -1.40000000000000003e-253Initial program 68.3%
associate-+l-68.3%
*-commutative68.3%
associate-*r*71.3%
*-commutative71.3%
associate-+l-71.3%
associate-*l*71.4%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in y around inf 62.9%
Taylor expanded in a around inf 52.4%
associate-*l/55.9%
*-commutative55.9%
Simplified55.9%
if -1.40000000000000003e-253 < b < 2.3000000000000001e-152Initial program 84.5%
associate-+l-84.5%
*-commutative84.5%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
associate-*l*84.8%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Taylor expanded in y around inf 82.5%
Taylor expanded in y around inf 71.3%
associate-*r/71.4%
associate-*r*71.3%
*-commutative71.3%
*-commutative71.3%
Simplified71.3%
if 2.3000000000000001e-152 < b < 13.5Initial program 83.9%
associate-+l-83.9%
*-commutative83.9%
associate-*r*90.1%
*-commutative90.1%
associate-+l-90.1%
associate-*l*90.1%
associate-*l*90.2%
*-commutative90.2%
Simplified90.2%
Taylor expanded in z around inf 59.5%
*-commutative59.5%
Simplified59.5%
if 13.5 < b Initial program 85.3%
associate-+l-85.3%
*-commutative85.3%
associate-*r*88.1%
*-commutative88.1%
associate-+l-88.1%
associate-*l*88.1%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Taylor expanded in b around inf 54.2%
associate-/r*57.2%
Simplified57.2%
Final simplification60.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (* y (* 9.0 x))) (* z c_m)))
(t_2 (/ (+ (/ b z) (* -4.0 (* a t))) c_m)))
(*
c_s
(if (<= z -2100.0)
t_2
(if (<= z 1.5e-132)
t_1
(if (<= z 1.25e-61)
(/ (- b (* 4.0 (* a (* z t)))) (* z c_m))
(if (<= z 2.3e-26) t_1 t_2)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + (y * (9.0 * x))) / (z * c_m);
double t_2 = ((b / z) + (-4.0 * (a * t))) / c_m;
double tmp;
if (z <= -2100.0) {
tmp = t_2;
} else if (z <= 1.5e-132) {
tmp = t_1;
} else if (z <= 1.25e-61) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else if (z <= 2.3e-26) {
tmp = t_1;
} else {
tmp = t_2;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (b + (y * (9.0d0 * x))) / (z * c_m)
t_2 = ((b / z) + ((-4.0d0) * (a * t))) / c_m
if (z <= (-2100.0d0)) then
tmp = t_2
else if (z <= 1.5d-132) then
tmp = t_1
else if (z <= 1.25d-61) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c_m)
else if (z <= 2.3d-26) then
tmp = t_1
else
tmp = t_2
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + (y * (9.0 * x))) / (z * c_m);
double t_2 = ((b / z) + (-4.0 * (a * t))) / c_m;
double tmp;
if (z <= -2100.0) {
tmp = t_2;
} else if (z <= 1.5e-132) {
tmp = t_1;
} else if (z <= 1.25e-61) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else if (z <= 2.3e-26) {
tmp = t_1;
} else {
tmp = t_2;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = (b + (y * (9.0 * x))) / (z * c_m) t_2 = ((b / z) + (-4.0 * (a * t))) / c_m tmp = 0 if z <= -2100.0: tmp = t_2 elif z <= 1.5e-132: tmp = t_1 elif z <= 1.25e-61: tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m) elif z <= 2.3e-26: tmp = t_1 else: tmp = t_2 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c_m)) t_2 = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c_m) tmp = 0.0 if (z <= -2100.0) tmp = t_2; elseif (z <= 1.5e-132) tmp = t_1; elseif (z <= 1.25e-61) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c_m)); elseif (z <= 2.3e-26) tmp = t_1; else tmp = t_2; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = (b + (y * (9.0 * x))) / (z * c_m);
t_2 = ((b / z) + (-4.0 * (a * t))) / c_m;
tmp = 0.0;
if (z <= -2100.0)
tmp = t_2;
elseif (z <= 1.5e-132)
tmp = t_1;
elseif (z <= 1.25e-61)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
elseif (z <= 2.3e-26)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -2100.0], t$95$2, If[LessEqual[z, 1.5e-132], t$95$1, If[LessEqual[z, 1.25e-61], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.3e-26], t$95$1, t$95$2]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
t_2 := \frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -2100:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 1.5 \cdot 10^{-132}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.25 \cdot 10^{-61}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c\_m}\\
\mathbf{elif}\;z \leq 2.3 \cdot 10^{-26}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
\end{array}
if z < -2100 or 2.30000000000000009e-26 < z Initial program 65.4%
associate-+l-65.4%
*-commutative65.4%
associate-*r*72.0%
*-commutative72.0%
associate-+l-72.0%
associate-*l*72.0%
associate-*l*77.1%
*-commutative77.1%
Simplified77.1%
Taylor expanded in y around -inf 74.5%
Taylor expanded in y around 0 69.4%
mul-1-neg69.4%
*-commutative69.4%
associate-/r*72.3%
associate-*r/72.3%
div-sub74.6%
cancel-sign-sub-inv74.6%
metadata-eval74.6%
Simplified74.6%
if -2100 < z < 1.5e-132 or 1.25e-61 < z < 2.30000000000000009e-26Initial program 95.5%
associate-+l-95.5%
*-commutative95.5%
associate-*r*95.1%
*-commutative95.1%
associate-+l-95.1%
associate-*l*95.1%
associate-*l*90.9%
*-commutative90.9%
Simplified90.9%
Taylor expanded in x around inf 83.1%
associate-*r*83.1%
Simplified83.1%
if 1.5e-132 < z < 1.25e-61Initial program 93.6%
associate-+l-93.6%
*-commutative93.6%
associate-*r*93.7%
*-commutative93.7%
associate-+l-93.7%
associate-*l*93.7%
associate-*l*86.9%
*-commutative86.9%
Simplified86.9%
Taylor expanded in x around 0 93.6%
Final simplification79.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (or (<= z -2500.0) (not (<= z 4.5e-16)))
(+ (* 9.0 (* (/ x z) (/ y c_m))) (/ (+ (/ b z) (* -4.0 (* a t))) c_m))
(/ (- b (- (* a (* t (* z 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);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if ((z <= -2500.0) || !(z <= 4.5e-16)) {
tmp = (9.0 * ((x / z) * (y / c_m))) + (((b / z) + (-4.0 * (a * t))) / c_m);
} else {
tmp = (b - ((a * (t * (z * 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.
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 <= (-2500.0d0)) .or. (.not. (z <= 4.5d-16))) then
tmp = (9.0d0 * ((x / z) * (y / c_m))) + (((b / z) + ((-4.0d0) * (a * t))) / c_m)
else
tmp = (b - ((a * (t * (z * 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;
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 <= -2500.0) || !(z <= 4.5e-16)) {
tmp = (9.0 * ((x / z) * (y / c_m))) + (((b / z) + (-4.0 * (a * t))) / c_m);
} else {
tmp = (b - ((a * (t * (z * 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]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if (z <= -2500.0) or not (z <= 4.5e-16): tmp = (9.0 * ((x / z) * (y / c_m))) + (((b / z) + (-4.0 * (a * t))) / c_m) else: tmp = (b - ((a * (t * (z * 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]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if ((z <= -2500.0) || !(z <= 4.5e-16)) tmp = Float64(Float64(9.0 * Float64(Float64(x / z) * Float64(y / c_m))) + Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c_m)); else tmp = Float64(Float64(b - Float64(Float64(a * Float64(t * Float64(z * 4.0))) - Float64(y * Float64(9.0 * x)))) / Float64(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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if ((z <= -2500.0) || ~((z <= 4.5e-16)))
tmp = (9.0 * ((x / z) * (y / c_m))) + (((b / z) + (-4.0 * (a * t))) / c_m);
else
tmp = (b - ((a * (t * (z * 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[Or[LessEqual[z, -2500.0], N[Not[LessEqual[z, 4.5e-16]], $MachinePrecision]], N[(N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(b - N[(N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -2500 \lor \neg \left(z \leq 4.5 \cdot 10^{-16}\right):\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c\_m}\right) + \frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{b - \left(a \cdot \left(t \cdot \left(z \cdot 4\right)\right) - y \cdot \left(9 \cdot x\right)\right)}{z \cdot c\_m}\\
\end{array}
\end{array}
if z < -2500 or 4.5000000000000002e-16 < z Initial program 64.9%
associate-+l-64.9%
*-commutative64.9%
associate-*r*71.5%
*-commutative71.5%
associate-+l-71.5%
associate-*l*71.5%
associate-*l*76.7%
*-commutative76.7%
Simplified76.7%
Taylor expanded in t around inf 67.8%
Taylor expanded in t around 0 86.3%
+-commutative86.3%
associate-/l*86.5%
associate-/r*81.4%
*-commutative81.4%
associate-+l+81.4%
associate-/r*86.5%
associate-/l*86.3%
*-commutative86.3%
times-frac81.3%
*-commutative81.3%
metadata-eval81.3%
cancel-sign-sub-inv81.3%
Simplified85.0%
if -2500 < z < 4.5000000000000002e-16Initial program 95.3%
Final simplification90.1%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= x -4.8e+20)
(/ (+ b (* y (* 9.0 x))) (* z c_m))
(if (<= x 7.2e-149)
(/ (+ b (* t (* a (* z -4.0)))) (* z c_m))
(/ (+ (* 9.0 (/ (* x y) c_m)) (/ b c_m)) z)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (x <= -4.8e+20) {
tmp = (b + (y * (9.0 * x))) / (z * c_m);
} else if (x <= 7.2e-149) {
tmp = (b + (t * (a * (z * -4.0)))) / (z * c_m);
} else {
tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (x <= (-4.8d+20)) then
tmp = (b + (y * (9.0d0 * x))) / (z * c_m)
else if (x <= 7.2d-149) then
tmp = (b + (t * (a * (z * (-4.0d0))))) / (z * c_m)
else
tmp = ((9.0d0 * ((x * y) / c_m)) + (b / c_m)) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (x <= -4.8e+20) {
tmp = (b + (y * (9.0 * x))) / (z * c_m);
} else if (x <= 7.2e-149) {
tmp = (b + (t * (a * (z * -4.0)))) / (z * c_m);
} else {
tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if x <= -4.8e+20: tmp = (b + (y * (9.0 * x))) / (z * c_m) elif x <= 7.2e-149: tmp = (b + (t * (a * (z * -4.0)))) / (z * c_m) else: tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (x <= -4.8e+20) tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c_m)); elseif (x <= 7.2e-149) tmp = Float64(Float64(b + Float64(t * Float64(a * Float64(z * -4.0)))) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / c_m)) + Float64(b / c_m)) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (x <= -4.8e+20)
tmp = (b + (y * (9.0 * x))) / (z * c_m);
elseif (x <= 7.2e-149)
tmp = (b + (t * (a * (z * -4.0)))) / (z * c_m);
else
tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[x, -4.8e+20], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 7.2e-149], N[(N[(b + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;x \leq -4.8 \cdot 10^{+20}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
\mathbf{elif}\;x \leq 7.2 \cdot 10^{-149}:\\
\;\;\;\;\frac{b + t \cdot \left(a \cdot \left(z \cdot -4\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{c\_m} + \frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if x < -4.8e20Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
associate-*l*77.2%
associate-*l*80.4%
*-commutative80.4%
Simplified80.4%
Taylor expanded in x around inf 67.4%
associate-*r*67.4%
Simplified67.4%
if -4.8e20 < x < 7.2000000000000004e-149Initial program 86.8%
associate-+l-86.8%
*-commutative86.8%
associate-*r*89.0%
*-commutative89.0%
associate-+l-89.0%
associate-*l*89.1%
associate-*l*89.5%
*-commutative89.5%
Simplified89.5%
Taylor expanded in t around inf 86.9%
Taylor expanded in x around 0 74.5%
metadata-eval74.5%
distribute-lft-neg-in74.5%
associate-*r*74.5%
*-commutative74.5%
associate-*r*74.5%
*-commutative74.5%
distribute-lft-neg-in74.5%
distribute-lft-neg-in74.5%
metadata-eval74.5%
Simplified74.5%
if 7.2000000000000004e-149 < x Initial program 73.0%
associate-+l-73.0%
*-commutative73.0%
associate-*r*80.3%
*-commutative80.3%
associate-+l-80.3%
associate-*l*80.2%
associate-*l*79.0%
*-commutative79.0%
Simplified79.0%
Taylor expanded in t around inf 80.2%
Taylor expanded in t around 0 77.7%
+-commutative77.7%
associate-/l*77.8%
associate-/r*75.8%
*-commutative75.8%
associate-+l+75.8%
associate-/r*77.8%
associate-/l*77.7%
*-commutative77.7%
times-frac75.6%
*-commutative75.6%
metadata-eval75.6%
cancel-sign-sub-inv75.6%
Simplified75.5%
Taylor expanded in z around 0 59.3%
Final simplification67.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= x -4e+20)
(/ (+ b (* y (* 9.0 x))) (* z c_m))
(if (<= x 7.2e-149)
(/ (- b (* 4.0 (* a (* z t)))) (* z c_m))
(/ (+ (* 9.0 (/ (* x y) c_m)) (/ b c_m)) z)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (x <= -4e+20) {
tmp = (b + (y * (9.0 * x))) / (z * c_m);
} else if (x <= 7.2e-149) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else {
tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (x <= (-4d+20)) then
tmp = (b + (y * (9.0d0 * x))) / (z * c_m)
else if (x <= 7.2d-149) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c_m)
else
tmp = ((9.0d0 * ((x * y) / c_m)) + (b / c_m)) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (x <= -4e+20) {
tmp = (b + (y * (9.0 * x))) / (z * c_m);
} else if (x <= 7.2e-149) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
} else {
tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if x <= -4e+20: tmp = (b + (y * (9.0 * x))) / (z * c_m) elif x <= 7.2e-149: tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m) else: tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (x <= -4e+20) tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c_m)); elseif (x <= 7.2e-149) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / c_m)) + Float64(b / c_m)) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (x <= -4e+20)
tmp = (b + (y * (9.0 * x))) / (z * c_m);
elseif (x <= 7.2e-149)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c_m);
else
tmp = ((9.0 * ((x * y) / c_m)) + (b / c_m)) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[x, -4e+20], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 7.2e-149], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;x \leq -4 \cdot 10^{+20}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
\mathbf{elif}\;x \leq 7.2 \cdot 10^{-149}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{c\_m} + \frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if x < -4e20Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
associate-*l*77.2%
associate-*l*80.4%
*-commutative80.4%
Simplified80.4%
Taylor expanded in x around inf 67.4%
associate-*r*67.4%
Simplified67.4%
if -4e20 < x < 7.2000000000000004e-149Initial program 86.8%
associate-+l-86.8%
*-commutative86.8%
associate-*r*89.0%
*-commutative89.0%
associate-+l-89.0%
associate-*l*89.1%
associate-*l*89.5%
*-commutative89.5%
Simplified89.5%
Taylor expanded in x around 0 73.2%
if 7.2000000000000004e-149 < x Initial program 73.0%
associate-+l-73.0%
*-commutative73.0%
associate-*r*80.3%
*-commutative80.3%
associate-+l-80.3%
associate-*l*80.2%
associate-*l*79.0%
*-commutative79.0%
Simplified79.0%
Taylor expanded in t around inf 80.2%
Taylor expanded in t around 0 77.7%
+-commutative77.7%
associate-/l*77.8%
associate-/r*75.8%
*-commutative75.8%
associate-+l+75.8%
associate-/r*77.8%
associate-/l*77.7%
*-commutative77.7%
times-frac75.6%
*-commutative75.6%
metadata-eval75.6%
cancel-sign-sub-inv75.6%
Simplified75.5%
Taylor expanded in z around 0 59.3%
Final simplification66.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (or (<= t -7.1e+154) (not (<= t 6.2e-51)))
(* a (/ (* -4.0 t) c_m))
(/ (+ b (* 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);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if ((t <= -7.1e+154) || !(t <= 6.2e-51)) {
tmp = a * ((-4.0 * t) / c_m);
} else {
tmp = (b + (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.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if ((t <= (-7.1d+154)) .or. (.not. (t <= 6.2d-51))) then
tmp = a * (((-4.0d0) * t) / c_m)
else
tmp = (b + (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;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if ((t <= -7.1e+154) || !(t <= 6.2e-51)) {
tmp = a * ((-4.0 * t) / c_m);
} else {
tmp = (b + (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]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if (t <= -7.1e+154) or not (t <= 6.2e-51): tmp = a * ((-4.0 * t) / c_m) else: tmp = (b + (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]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if ((t <= -7.1e+154) || !(t <= 6.2e-51)) tmp = Float64(a * Float64(Float64(-4.0 * t) / c_m)); else tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if ((t <= -7.1e+154) || ~((t <= 6.2e-51)))
tmp = a * ((-4.0 * t) / c_m);
else
tmp = (b + (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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[Or[LessEqual[t, -7.1e+154], N[Not[LessEqual[t, 6.2e-51]], $MachinePrecision]], N[(a * N[(N[(-4.0 * t), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -7.1 \cdot 10^{+154} \lor \neg \left(t \leq 6.2 \cdot 10^{-51}\right):\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c\_m}\\
\end{array}
\end{array}
if t < -7.09999999999999968e154 or 6.1999999999999995e-51 < t Initial program 71.4%
associate-+l-71.4%
*-commutative71.4%
associate-*r*81.1%
*-commutative81.1%
associate-+l-81.1%
associate-*l*81.1%
associate-*l*77.1%
*-commutative77.1%
Simplified77.1%
Taylor expanded in z around inf 53.6%
*-commutative53.6%
associate-/l*59.5%
associate-*r*59.5%
associate-*l/59.5%
Simplified59.5%
if -7.09999999999999968e154 < t < 6.1999999999999995e-51Initial program 86.8%
associate-+l-86.8%
*-commutative86.8%
associate-*r*84.7%
*-commutative84.7%
associate-+l-84.7%
associate-*l*84.7%
associate-*l*88.8%
*-commutative88.8%
Simplified88.8%
Taylor expanded in x around inf 74.8%
associate-*r*74.7%
Simplified74.7%
Final simplification67.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.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (or (<= z -8.2e-30) (not (<= z 2.1e-73)))
(* -4.0 (* t (/ a c_m)))
(/ b (* z c_m)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if ((z <= -8.2e-30) || !(z <= 2.1e-73)) {
tmp = -4.0 * (t * (a / c_m));
} else {
tmp = 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.
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 <= (-8.2d-30)) .or. (.not. (z <= 2.1d-73))) then
tmp = (-4.0d0) * (t * (a / c_m))
else
tmp = 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;
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 <= -8.2e-30) || !(z <= 2.1e-73)) {
tmp = -4.0 * (t * (a / c_m));
} else {
tmp = 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]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if (z <= -8.2e-30) or not (z <= 2.1e-73): tmp = -4.0 * (t * (a / c_m)) else: tmp = b / (z * c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if ((z <= -8.2e-30) || !(z <= 2.1e-73)) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); else tmp = Float64(b / Float64(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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if ((z <= -8.2e-30) || ~((z <= 2.1e-73)))
tmp = -4.0 * (t * (a / c_m));
else
tmp = 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[Or[LessEqual[z, -8.2e-30], N[Not[LessEqual[z, 2.1e-73]], $MachinePrecision]], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -8.2 \cdot 10^{-30} \lor \neg \left(z \leq 2.1 \cdot 10^{-73}\right):\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\end{array}
\end{array}
if z < -8.2000000000000007e-30 or 2.0999999999999999e-73 < z Initial program 69.9%
associate-+l-69.9%
*-commutative69.9%
associate-*r*75.6%
*-commutative75.6%
associate-+l-75.6%
associate-*l*75.6%
associate-*l*80.0%
*-commutative80.0%
Simplified80.0%
Taylor expanded in y around inf 65.0%
Taylor expanded in a around inf 56.1%
associate-*l/56.8%
*-commutative56.8%
Simplified56.8%
if -8.2000000000000007e-30 < z < 2.0999999999999999e-73Initial program 94.4%
associate-+l-94.4%
*-commutative94.4%
associate-*r*94.0%
*-commutative94.0%
associate-+l-94.0%
associate-*l*94.0%
associate-*l*88.7%
*-commutative88.7%
Simplified88.7%
Taylor expanded in b around inf 50.8%
*-commutative50.8%
Simplified50.8%
Final simplification54.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= z -6.8e-30)
(* -4.0 (* t (/ a c_m)))
(if (<= z 4.8e-20) (/ b (* z c_m)) (* a (/ (* -4.0 t) c_m))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (z <= -6.8e-30) {
tmp = -4.0 * (t * (a / c_m));
} else if (z <= 4.8e-20) {
tmp = b / (z * c_m);
} else {
tmp = a * ((-4.0 * t) / 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.
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 <= (-6.8d-30)) then
tmp = (-4.0d0) * (t * (a / c_m))
else if (z <= 4.8d-20) then
tmp = b / (z * c_m)
else
tmp = a * (((-4.0d0) * t) / 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;
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 <= -6.8e-30) {
tmp = -4.0 * (t * (a / c_m));
} else if (z <= 4.8e-20) {
tmp = b / (z * c_m);
} else {
tmp = a * ((-4.0 * t) / 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]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if z <= -6.8e-30: tmp = -4.0 * (t * (a / c_m)) elif z <= 4.8e-20: tmp = b / (z * c_m) else: tmp = a * ((-4.0 * t) / c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (z <= -6.8e-30) tmp = Float64(-4.0 * Float64(t * Float64(a / c_m))); elseif (z <= 4.8e-20) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(a * Float64(Float64(-4.0 * t) / 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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (z <= -6.8e-30)
tmp = -4.0 * (t * (a / c_m));
elseif (z <= 4.8e-20)
tmp = b / (z * c_m);
else
tmp = a * ((-4.0 * t) / 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[z, -6.8e-30], N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.8e-20], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(-4.0 * t), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -6.8 \cdot 10^{-30}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
\mathbf{elif}\;z \leq 4.8 \cdot 10^{-20}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c\_m}\\
\end{array}
\end{array}
if z < -6.8000000000000006e-30Initial program 66.3%
associate-+l-66.3%
*-commutative66.3%
associate-*r*73.0%
*-commutative73.0%
associate-+l-73.0%
associate-*l*73.0%
associate-*l*75.9%
*-commutative75.9%
Simplified75.9%
Taylor expanded in y around inf 60.9%
Taylor expanded in a around inf 55.5%
associate-*l/59.3%
*-commutative59.3%
Simplified59.3%
if -6.8000000000000006e-30 < z < 4.79999999999999986e-20Initial program 94.9%
associate-+l-94.9%
*-commutative94.9%
associate-*r*94.5%
*-commutative94.5%
associate-+l-94.5%
associate-*l*94.5%
associate-*l*89.7%
*-commutative89.7%
Simplified89.7%
Taylor expanded in b around inf 49.5%
*-commutative49.5%
Simplified49.5%
if 4.79999999999999986e-20 < z Initial program 69.0%
associate-+l-69.0%
*-commutative69.0%
associate-*r*74.5%
*-commutative74.5%
associate-+l-74.5%
associate-*l*74.5%
associate-*l*81.2%
*-commutative81.2%
Simplified81.2%
Taylor expanded in z around inf 59.6%
*-commutative59.6%
associate-/l*59.2%
associate-*r*59.2%
associate-*l/59.2%
Simplified59.2%
Final simplification54.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. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (if (<= t -2.85e-55) (/ (/ b c_m) z) (/ b (* z c_m)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -2.85e-55) {
tmp = (b / c_m) / z;
} else {
tmp = 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.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (t <= (-2.85d-55)) then
tmp = (b / c_m) / z
else
tmp = 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;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (t <= -2.85e-55) {
tmp = (b / c_m) / z;
} else {
tmp = 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]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if t <= -2.85e-55: tmp = (b / c_m) / z else: tmp = b / (z * c_m) return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (t <= -2.85e-55) tmp = Float64(Float64(b / c_m) / z); else tmp = Float64(b / Float64(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])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (t <= -2.85e-55)
tmp = (b / c_m) / z;
else
tmp = 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.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[t, -2.85e-55], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -2.85 \cdot 10^{-55}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\end{array}
\end{array}
if t < -2.8500000000000001e-55Initial program 71.1%
associate-+l-71.1%
*-commutative71.1%
associate-*r*79.8%
*-commutative79.8%
associate-+l-79.8%
associate-*l*79.8%
associate-*l*77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in b around inf 30.4%
associate-/r*37.7%
Simplified37.7%
if -2.8500000000000001e-55 < t Initial program 83.6%
associate-+l-83.6%
*-commutative83.6%
associate-*r*84.5%
*-commutative84.5%
associate-+l-84.5%
associate-*l*84.5%
associate-*l*86.3%
*-commutative86.3%
Simplified86.3%
Taylor expanded in b around inf 33.6%
*-commutative33.6%
Simplified33.6%
Final simplification34.8%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (/ b (* z c_m))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (z * c_m));
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c_m
code = c_s * (b / (z * c_m))
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (z * c_m));
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): return c_s * (b / (z * c_m))
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) return Float64(c_s * Float64(b / Float64(z * c_m))) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp = code(c_s, x, y, z, t, a, b, c_m)
tmp = c_s * (b / (z * c_m));
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{z \cdot c\_m}
\end{array}
Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*83.1%
*-commutative83.1%
associate-+l-83.1%
associate-*l*83.1%
associate-*l*83.5%
*-commutative83.5%
Simplified83.5%
Taylor expanded in b around inf 32.6%
*-commutative32.6%
Simplified32.6%
Final simplification32.6%
(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 2024089
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) -1.100156740804105e-171) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 0.0) (/ (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.1708877911747488e-53) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 2.876823679546137e+130) (- (+ (* (* 9.0 (/ y c)) (/ x z)) (/ b (* c z))) (* 4.0 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.3838515042456319e+158) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (- (+ (* 9.0 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4.0 (/ (* a t) c))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))