
(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 24 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.95e+48) (not (<= z 1.9e-149))) (/ (- (+ (* 9.0 (* y (/ x z))) (/ b z)) (* 4.0 (* a t))) c) (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.95e+48) || !(z <= 1.9e-149)) {
tmp = (((9.0 * (y * (x / z))) + (b / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((z <= (-1.95d+48)) .or. (.not. (z <= 1.9d-149))) then
tmp = (((9.0d0 * (y * (x / z))) + (b / z)) - (4.0d0 * (a * t))) / c
else
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.95e+48) || !(z <= 1.9e-149)) {
tmp = (((9.0 * (y * (x / z))) + (b / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -1.95e+48) or not (z <= 1.9e-149): tmp = (((9.0 * (y * (x / z))) + (b / z)) - (4.0 * (a * t))) / c else: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.95e+48) || !(z <= 1.9e-149)) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y * Float64(x / z))) + Float64(b / z)) - Float64(4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -1.95e+48) || ~((z <= 1.9e-149)))
tmp = (((9.0 * (y * (x / z))) + (b / z)) - (4.0 * (a * t))) / c;
else
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.95e+48], N[Not[LessEqual[z, 1.9e-149]], $MachinePrecision]], N[(N[(N[(N[(9.0 * N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.95 \cdot 10^{+48} \lor \neg \left(z \leq 1.9 \cdot 10^{-149}\right):\\
\;\;\;\;\frac{\left(9 \cdot \left(y \cdot \frac{x}{z}\right) + \frac{b}{z}\right) - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.95e48 or 1.90000000000000003e-149 < z Initial program 67.1%
associate-+l-67.1%
*-commutative67.1%
associate-*r*67.7%
*-commutative67.7%
associate-+l-67.7%
*-commutative67.7%
associate-*r*67.1%
*-commutative67.1%
associate-*l*67.1%
associate-*l*71.8%
Simplified71.8%
associate-+l-71.8%
div-sub70.5%
*-commutative70.5%
associate-*l*70.5%
associate-*l*70.5%
fma-neg70.5%
Applied egg-rr70.5%
associate-*r*70.5%
times-frac71.1%
fma-udef71.1%
unsub-neg71.1%
*-commutative71.1%
*-commutative71.1%
associate-*l*71.1%
*-commutative71.1%
Simplified71.1%
Taylor expanded in c around 0 91.2%
*-commutative91.2%
*-un-lft-identity91.2%
times-frac93.5%
Applied egg-rr93.5%
Taylor expanded in y around 0 91.2%
*-commutative91.2%
associate-*r/93.5%
Simplified93.5%
if -1.95e48 < z < 1.90000000000000003e-149Initial program 94.6%
Final simplification94.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* (/ x c) (/ y z)))))
(if (<= a -9.2e-120)
(* -4.0 (/ a (/ c t)))
(if (<= a -2.1e-203)
t_1
(if (<= a 4.9e-306)
(/ 1.0 (/ c (/ b z)))
(if (<= a 4.7e-212)
t_1
(if (<= a 7e-47)
(* b (/ (/ 1.0 c) z))
(if (<= a 2.3e-12) t_1 (* -4.0 (* t (/ a c)))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x / c) * (y / z));
double tmp;
if (a <= -9.2e-120) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -2.1e-203) {
tmp = t_1;
} else if (a <= 4.9e-306) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 4.7e-212) {
tmp = t_1;
} else if (a <= 7e-47) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.3e-12) {
tmp = t_1;
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x / c) * (y / z))
if (a <= (-9.2d-120)) then
tmp = (-4.0d0) * (a / (c / t))
else if (a <= (-2.1d-203)) then
tmp = t_1
else if (a <= 4.9d-306) then
tmp = 1.0d0 / (c / (b / z))
else if (a <= 4.7d-212) then
tmp = t_1
else if (a <= 7d-47) then
tmp = b * ((1.0d0 / c) / z)
else if (a <= 2.3d-12) then
tmp = t_1
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x / c) * (y / z));
double tmp;
if (a <= -9.2e-120) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -2.1e-203) {
tmp = t_1;
} else if (a <= 4.9e-306) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 4.7e-212) {
tmp = t_1;
} else if (a <= 7e-47) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.3e-12) {
tmp = t_1;
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x / c) * (y / z)) tmp = 0 if a <= -9.2e-120: tmp = -4.0 * (a / (c / t)) elif a <= -2.1e-203: tmp = t_1 elif a <= 4.9e-306: tmp = 1.0 / (c / (b / z)) elif a <= 4.7e-212: tmp = t_1 elif a <= 7e-47: tmp = b * ((1.0 / c) / z) elif a <= 2.3e-12: tmp = t_1 else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))) tmp = 0.0 if (a <= -9.2e-120) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (a <= -2.1e-203) tmp = t_1; elseif (a <= 4.9e-306) tmp = Float64(1.0 / Float64(c / Float64(b / z))); elseif (a <= 4.7e-212) tmp = t_1; elseif (a <= 7e-47) tmp = Float64(b * Float64(Float64(1.0 / c) / z)); elseif (a <= 2.3e-12) tmp = t_1; else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x / c) * (y / z));
tmp = 0.0;
if (a <= -9.2e-120)
tmp = -4.0 * (a / (c / t));
elseif (a <= -2.1e-203)
tmp = t_1;
elseif (a <= 4.9e-306)
tmp = 1.0 / (c / (b / z));
elseif (a <= 4.7e-212)
tmp = t_1;
elseif (a <= 7e-47)
tmp = b * ((1.0 / c) / z);
elseif (a <= 2.3e-12)
tmp = t_1;
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -9.2e-120], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -2.1e-203], t$95$1, If[LessEqual[a, 4.9e-306], N[(1.0 / N[(c / N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 4.7e-212], t$95$1, If[LessEqual[a, 7e-47], N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.3e-12], t$95$1, N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{if}\;a \leq -9.2 \cdot 10^{-120}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq -2.1 \cdot 10^{-203}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 4.9 \cdot 10^{-306}:\\
\;\;\;\;\frac{1}{\frac{c}{\frac{b}{z}}}\\
\mathbf{elif}\;a \leq 4.7 \cdot 10^{-212}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 7 \cdot 10^{-47}:\\
\;\;\;\;b \cdot \frac{\frac{1}{c}}{z}\\
\mathbf{elif}\;a \leq 2.3 \cdot 10^{-12}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -9.19999999999999946e-120Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -9.19999999999999946e-120 < a < -2.10000000000000002e-203 or 4.90000000000000025e-306 < a < 4.69999999999999998e-212 or 6.9999999999999996e-47 < a < 2.29999999999999989e-12Initial program 75.5%
associate-+l-75.5%
*-commutative75.5%
associate-*r*83.7%
*-commutative83.7%
associate-+l-83.7%
*-commutative83.7%
associate-*r*75.5%
*-commutative75.5%
associate-*l*75.5%
associate-*l*83.8%
Simplified83.8%
associate-+l-83.8%
div-sub77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
fma-neg77.6%
Applied egg-rr77.6%
associate-*r*77.5%
times-frac65.2%
fma-udef65.2%
unsub-neg65.2%
*-commutative65.2%
*-commutative65.2%
associate-*l*65.2%
*-commutative65.2%
Simplified65.2%
Taylor expanded in c around 0 85.7%
Taylor expanded in x around inf 48.0%
times-frac43.8%
Simplified43.8%
if -2.10000000000000002e-203 < a < 4.90000000000000025e-306Initial program 85.7%
associate-+l-85.7%
*-commutative85.7%
associate-*r*99.7%
*-commutative99.7%
associate-+l-99.7%
*-commutative99.7%
associate-*r*85.7%
*-commutative85.7%
associate-*l*85.7%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in b around inf 61.5%
*-commutative61.5%
Simplified61.5%
clear-num61.3%
inv-pow61.3%
*-commutative61.3%
Applied egg-rr61.3%
unpow-161.3%
associate-/l*57.0%
Simplified57.0%
if 4.69999999999999998e-212 < a < 6.9999999999999996e-47Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*82.6%
*-commutative82.6%
associate-+l-82.6%
*-commutative82.6%
associate-*r*82.5%
*-commutative82.5%
associate-*l*82.5%
associate-*l*82.5%
Simplified82.5%
Taylor expanded in b around inf 54.9%
*-commutative54.9%
Simplified54.9%
div-inv55.0%
*-commutative55.0%
Applied egg-rr55.0%
expm1-log1p-u40.1%
expm1-udef26.0%
*-commutative26.0%
Applied egg-rr26.0%
expm1-def40.1%
expm1-log1p55.0%
*-commutative55.0%
associate-/r*56.8%
Simplified56.8%
if 2.29999999999999989e-12 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*70.8%
*-commutative70.8%
associate-+l-70.8%
*-commutative70.8%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
Simplified77.6%
associate-+l-77.6%
div-sub69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
fma-neg69.1%
Applied egg-rr69.1%
associate-*r*69.1%
times-frac66.4%
fma-udef66.4%
unsub-neg66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l*66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in z around inf 43.5%
*-commutative43.5%
associate-*l/56.0%
*-commutative56.0%
Simplified56.0%
Final simplification53.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* (/ x c) (/ y z)))))
(if (<= a -9.2e-120)
(* -4.0 (/ a (/ c t)))
(if (<= a -7.5e-215)
t_1
(if (<= a 2.2e-304)
(/ 1.0 (/ c (/ b z)))
(if (<= a 2.25e-185)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= a 1.06e-47)
(* b (/ (/ 1.0 c) z))
(if (<= a 2.25e-12) t_1 (* -4.0 (* t (/ a c)))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x / c) * (y / z));
double tmp;
if (a <= -9.2e-120) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -7.5e-215) {
tmp = t_1;
} else if (a <= 2.2e-304) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 2.25e-185) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (a <= 1.06e-47) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.25e-12) {
tmp = t_1;
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x / c) * (y / z))
if (a <= (-9.2d-120)) then
tmp = (-4.0d0) * (a / (c / t))
else if (a <= (-7.5d-215)) then
tmp = t_1
else if (a <= 2.2d-304) then
tmp = 1.0d0 / (c / (b / z))
else if (a <= 2.25d-185) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (a <= 1.06d-47) then
tmp = b * ((1.0d0 / c) / z)
else if (a <= 2.25d-12) then
tmp = t_1
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x / c) * (y / z));
double tmp;
if (a <= -9.2e-120) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -7.5e-215) {
tmp = t_1;
} else if (a <= 2.2e-304) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 2.25e-185) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (a <= 1.06e-47) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.25e-12) {
tmp = t_1;
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x / c) * (y / z)) tmp = 0 if a <= -9.2e-120: tmp = -4.0 * (a / (c / t)) elif a <= -7.5e-215: tmp = t_1 elif a <= 2.2e-304: tmp = 1.0 / (c / (b / z)) elif a <= 2.25e-185: tmp = 9.0 * ((x / z) * (y / c)) elif a <= 1.06e-47: tmp = b * ((1.0 / c) / z) elif a <= 2.25e-12: tmp = t_1 else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))) tmp = 0.0 if (a <= -9.2e-120) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (a <= -7.5e-215) tmp = t_1; elseif (a <= 2.2e-304) tmp = Float64(1.0 / Float64(c / Float64(b / z))); elseif (a <= 2.25e-185) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (a <= 1.06e-47) tmp = Float64(b * Float64(Float64(1.0 / c) / z)); elseif (a <= 2.25e-12) tmp = t_1; else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x / c) * (y / z));
tmp = 0.0;
if (a <= -9.2e-120)
tmp = -4.0 * (a / (c / t));
elseif (a <= -7.5e-215)
tmp = t_1;
elseif (a <= 2.2e-304)
tmp = 1.0 / (c / (b / z));
elseif (a <= 2.25e-185)
tmp = 9.0 * ((x / z) * (y / c));
elseif (a <= 1.06e-47)
tmp = b * ((1.0 / c) / z);
elseif (a <= 2.25e-12)
tmp = t_1;
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -9.2e-120], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -7.5e-215], t$95$1, If[LessEqual[a, 2.2e-304], N[(1.0 / N[(c / N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.25e-185], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.06e-47], N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.25e-12], t$95$1, N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{if}\;a \leq -9.2 \cdot 10^{-120}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq -7.5 \cdot 10^{-215}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.2 \cdot 10^{-304}:\\
\;\;\;\;\frac{1}{\frac{c}{\frac{b}{z}}}\\
\mathbf{elif}\;a \leq 2.25 \cdot 10^{-185}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;a \leq 1.06 \cdot 10^{-47}:\\
\;\;\;\;b \cdot \frac{\frac{1}{c}}{z}\\
\mathbf{elif}\;a \leq 2.25 \cdot 10^{-12}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -9.19999999999999946e-120Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -9.19999999999999946e-120 < a < -7.49999999999999986e-215 or 1.06e-47 < a < 2.2499999999999999e-12Initial program 76.6%
associate-+l-76.6%
*-commutative76.6%
associate-*r*79.8%
*-commutative79.8%
associate-+l-79.8%
*-commutative79.8%
associate-*r*76.6%
*-commutative76.6%
associate-*l*76.6%
associate-*l*79.8%
Simplified79.8%
associate-+l-79.8%
div-sub69.5%
*-commutative69.5%
associate-*l*69.5%
associate-*l*69.5%
fma-neg69.5%
Applied egg-rr69.5%
associate-*r*69.5%
times-frac59.4%
fma-udef59.4%
unsub-neg59.4%
*-commutative59.4%
*-commutative59.4%
associate-*l*59.4%
*-commutative59.4%
Simplified59.4%
Taylor expanded in c around 0 76.4%
Taylor expanded in x around inf 40.6%
times-frac33.7%
Simplified33.7%
if -7.49999999999999986e-215 < a < 2.2e-304Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*84.2%
*-commutative84.2%
associate-*l*84.2%
associate-*l*99.6%
Simplified99.6%
Taylor expanded in b around inf 62.5%
*-commutative62.5%
Simplified62.5%
clear-num62.3%
inv-pow62.3%
*-commutative62.3%
Applied egg-rr62.3%
unpow-162.3%
associate-/l*57.5%
Simplified57.5%
if 2.2e-304 < a < 2.2500000000000001e-185Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.9%
associate-*l*92.1%
Simplified92.1%
associate-+l-92.1%
div-sub88.0%
*-commutative88.0%
associate-*l*88.1%
associate-*l*88.1%
fma-neg88.1%
Applied egg-rr88.1%
associate-*r*88.0%
times-frac80.2%
fma-udef80.2%
unsub-neg80.2%
*-commutative80.2%
*-commutative80.2%
associate-*l*80.2%
*-commutative80.2%
Simplified80.2%
Taylor expanded in c around 0 99.8%
*-commutative99.8%
*-un-lft-identity99.8%
times-frac95.9%
Applied egg-rr95.9%
Taylor expanded in y around inf 57.3%
*-commutative57.3%
times-frac53.5%
Simplified53.5%
if 2.2500000000000001e-185 < a < 1.06e-47Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.8%
associate-*l*79.9%
Simplified79.9%
Taylor expanded in b around inf 51.6%
*-commutative51.6%
Simplified51.6%
div-inv51.8%
*-commutative51.8%
Applied egg-rr51.8%
expm1-log1p-u38.5%
expm1-udef26.1%
*-commutative26.1%
Applied egg-rr26.1%
expm1-def38.5%
expm1-log1p51.8%
*-commutative51.8%
associate-/r*53.8%
Simplified53.8%
if 2.2499999999999999e-12 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*70.8%
*-commutative70.8%
associate-+l-70.8%
*-commutative70.8%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
Simplified77.6%
associate-+l-77.6%
div-sub69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
fma-neg69.1%
Applied egg-rr69.1%
associate-*r*69.1%
times-frac66.4%
fma-udef66.4%
unsub-neg66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l*66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in z around inf 43.5%
*-commutative43.5%
associate-*l/56.0%
*-commutative56.0%
Simplified56.0%
Final simplification52.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -1e-119)
(* -4.0 (/ a (/ c t)))
(if (<= a -8.8e-218)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a -5e-309)
(/ 1.0 (/ c (/ b z)))
(if (<= a 1.5e-180)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= a 5e-46)
(* b (/ (/ 1.0 c) z))
(if (<= a 2.25e-12)
(* 9.0 (* (/ x c) (/ y z)))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1e-119) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -8.8e-218) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= -5e-309) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 1.5e-180) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (a <= 5e-46) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.25e-12) {
tmp = 9.0 * ((x / c) * (y / z));
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-1d-119)) then
tmp = (-4.0d0) * (a / (c / t))
else if (a <= (-8.8d-218)) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= (-5d-309)) then
tmp = 1.0d0 / (c / (b / z))
else if (a <= 1.5d-180) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (a <= 5d-46) then
tmp = b * ((1.0d0 / c) / z)
else if (a <= 2.25d-12) then
tmp = 9.0d0 * ((x / c) * (y / z))
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1e-119) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -8.8e-218) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= -5e-309) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 1.5e-180) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (a <= 5e-46) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.25e-12) {
tmp = 9.0 * ((x / c) * (y / z));
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -1e-119: tmp = -4.0 * (a / (c / t)) elif a <= -8.8e-218: tmp = 9.0 * ((y * x) / (z * c)) elif a <= -5e-309: tmp = 1.0 / (c / (b / z)) elif a <= 1.5e-180: tmp = 9.0 * ((x / z) * (y / c)) elif a <= 5e-46: tmp = b * ((1.0 / c) / z) elif a <= 2.25e-12: tmp = 9.0 * ((x / c) * (y / z)) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -1e-119) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (a <= -8.8e-218) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= -5e-309) tmp = Float64(1.0 / Float64(c / Float64(b / z))); elseif (a <= 1.5e-180) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (a <= 5e-46) tmp = Float64(b * Float64(Float64(1.0 / c) / z)); elseif (a <= 2.25e-12) tmp = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -1e-119)
tmp = -4.0 * (a / (c / t));
elseif (a <= -8.8e-218)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= -5e-309)
tmp = 1.0 / (c / (b / z));
elseif (a <= 1.5e-180)
tmp = 9.0 * ((x / z) * (y / c));
elseif (a <= 5e-46)
tmp = b * ((1.0 / c) / z);
elseif (a <= 2.25e-12)
tmp = 9.0 * ((x / c) * (y / z));
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1e-119], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -8.8e-218], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -5e-309], N[(1.0 / N[(c / N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.5e-180], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5e-46], N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.25e-12], N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1 \cdot 10^{-119}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq -8.8 \cdot 10^{-218}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq -5 \cdot 10^{-309}:\\
\;\;\;\;\frac{1}{\frac{c}{\frac{b}{z}}}\\
\mathbf{elif}\;a \leq 1.5 \cdot 10^{-180}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;a \leq 5 \cdot 10^{-46}:\\
\;\;\;\;b \cdot \frac{\frac{1}{c}}{z}\\
\mathbf{elif}\;a \leq 2.25 \cdot 10^{-12}:\\
\;\;\;\;9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -1.00000000000000001e-119Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -1.00000000000000001e-119 < a < -8.80000000000000028e-218Initial program 89.5%
associate-+l-89.5%
*-commutative89.5%
associate-*r*94.5%
*-commutative94.5%
associate-+l-94.5%
*-commutative94.5%
associate-*r*89.5%
*-commutative89.5%
associate-*l*89.5%
associate-*l*94.5%
Simplified94.5%
Taylor expanded in x around inf 48.5%
if -8.80000000000000028e-218 < a < -4.9999999999999995e-309Initial program 83.3%
associate-+l-83.3%
*-commutative83.3%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*83.3%
*-commutative83.3%
associate-*l*83.3%
associate-*l*99.6%
Simplified99.6%
Taylor expanded in b around inf 60.4%
*-commutative60.4%
Simplified60.4%
clear-num60.3%
inv-pow60.3%
*-commutative60.3%
Applied egg-rr60.3%
unpow-160.3%
associate-/l*55.1%
Simplified55.1%
if -4.9999999999999995e-309 < a < 1.5e-180Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.9%
associate-*l*92.1%
Simplified92.1%
associate-+l-92.1%
div-sub88.0%
*-commutative88.0%
associate-*l*88.1%
associate-*l*88.1%
fma-neg88.1%
Applied egg-rr88.1%
associate-*r*88.0%
times-frac80.2%
fma-udef80.2%
unsub-neg80.2%
*-commutative80.2%
*-commutative80.2%
associate-*l*80.2%
*-commutative80.2%
Simplified80.2%
Taylor expanded in c around 0 99.8%
*-commutative99.8%
*-un-lft-identity99.8%
times-frac95.9%
Applied egg-rr95.9%
Taylor expanded in y around inf 57.3%
*-commutative57.3%
times-frac53.5%
Simplified53.5%
if 1.5e-180 < a < 4.99999999999999992e-46Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.8%
associate-*l*79.9%
Simplified79.9%
Taylor expanded in b around inf 51.6%
*-commutative51.6%
Simplified51.6%
div-inv51.8%
*-commutative51.8%
Applied egg-rr51.8%
expm1-log1p-u38.5%
expm1-udef26.1%
*-commutative26.1%
Applied egg-rr26.1%
expm1-def38.5%
expm1-log1p51.8%
*-commutative51.8%
associate-/r*53.8%
Simplified53.8%
if 4.99999999999999992e-46 < a < 2.2499999999999999e-12Initial program 56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-*l*56.4%
associate-*l*56.4%
Simplified56.4%
associate-+l-56.4%
div-sub56.4%
*-commutative56.4%
associate-*l*56.3%
associate-*l*56.3%
fma-neg56.3%
Applied egg-rr56.3%
associate-*r*56.4%
times-frac65.1%
fma-udef65.1%
unsub-neg65.1%
*-commutative65.1%
*-commutative65.1%
associate-*l*65.1%
*-commutative65.1%
Simplified65.1%
Taylor expanded in c around 0 82.4%
Taylor expanded in x around inf 23.5%
times-frac32.1%
Simplified32.1%
if 2.2499999999999999e-12 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*70.8%
*-commutative70.8%
associate-+l-70.8%
*-commutative70.8%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
Simplified77.6%
associate-+l-77.6%
div-sub69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
fma-neg69.1%
Applied egg-rr69.1%
associate-*r*69.1%
times-frac66.4%
fma-udef66.4%
unsub-neg66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l*66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in z around inf 43.5%
*-commutative43.5%
associate-*l/56.0%
*-commutative56.0%
Simplified56.0%
Final simplification53.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -1.45e-119)
(* -4.0 (/ a (/ c t)))
(if (<= a -7e-209)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 2.4e-303)
(/ 1.0 (/ c (/ b z)))
(if (<= a 5.8e-183)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= a 2.9e-46)
(* b (/ (/ 1.0 c) z))
(if (<= a 2.25e-12)
(* (/ (* 9.0 y) z) (/ x c))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.45e-119) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -7e-209) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 2.4e-303) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 5.8e-183) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (a <= 2.9e-46) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.25e-12) {
tmp = ((9.0 * y) / z) * (x / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-1.45d-119)) then
tmp = (-4.0d0) * (a / (c / t))
else if (a <= (-7d-209)) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 2.4d-303) then
tmp = 1.0d0 / (c / (b / z))
else if (a <= 5.8d-183) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (a <= 2.9d-46) then
tmp = b * ((1.0d0 / c) / z)
else if (a <= 2.25d-12) then
tmp = ((9.0d0 * y) / z) * (x / c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.45e-119) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -7e-209) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 2.4e-303) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 5.8e-183) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (a <= 2.9e-46) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.25e-12) {
tmp = ((9.0 * y) / z) * (x / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -1.45e-119: tmp = -4.0 * (a / (c / t)) elif a <= -7e-209: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 2.4e-303: tmp = 1.0 / (c / (b / z)) elif a <= 5.8e-183: tmp = 9.0 * ((x / z) * (y / c)) elif a <= 2.9e-46: tmp = b * ((1.0 / c) / z) elif a <= 2.25e-12: tmp = ((9.0 * y) / z) * (x / c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -1.45e-119) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (a <= -7e-209) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 2.4e-303) tmp = Float64(1.0 / Float64(c / Float64(b / z))); elseif (a <= 5.8e-183) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (a <= 2.9e-46) tmp = Float64(b * Float64(Float64(1.0 / c) / z)); elseif (a <= 2.25e-12) tmp = Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -1.45e-119)
tmp = -4.0 * (a / (c / t));
elseif (a <= -7e-209)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 2.4e-303)
tmp = 1.0 / (c / (b / z));
elseif (a <= 5.8e-183)
tmp = 9.0 * ((x / z) * (y / c));
elseif (a <= 2.9e-46)
tmp = b * ((1.0 / c) / z);
elseif (a <= 2.25e-12)
tmp = ((9.0 * y) / z) * (x / c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1.45e-119], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -7e-209], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.4e-303], N[(1.0 / N[(c / N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.8e-183], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.9e-46], N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.25e-12], N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.45 \cdot 10^{-119}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq -7 \cdot 10^{-209}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 2.4 \cdot 10^{-303}:\\
\;\;\;\;\frac{1}{\frac{c}{\frac{b}{z}}}\\
\mathbf{elif}\;a \leq 5.8 \cdot 10^{-183}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;a \leq 2.9 \cdot 10^{-46}:\\
\;\;\;\;b \cdot \frac{\frac{1}{c}}{z}\\
\mathbf{elif}\;a \leq 2.25 \cdot 10^{-12}:\\
\;\;\;\;\frac{9 \cdot y}{z} \cdot \frac{x}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -1.45e-119Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -1.45e-119 < a < -7.00000000000000004e-209Initial program 88.3%
associate-+l-88.3%
*-commutative88.3%
associate-*r*93.8%
*-commutative93.8%
associate-+l-93.8%
*-commutative93.8%
associate-*r*88.3%
*-commutative88.3%
associate-*l*88.3%
associate-*l*93.8%
Simplified93.8%
Taylor expanded in x around inf 48.2%
if -7.00000000000000004e-209 < a < 2.4000000000000001e-303Initial program 85.0%
associate-+l-85.0%
*-commutative85.0%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*85.0%
*-commutative85.0%
associate-*l*85.0%
associate-*l*99.6%
Simplified99.6%
Taylor expanded in b around inf 59.5%
*-commutative59.5%
Simplified59.5%
clear-num59.4%
inv-pow59.4%
*-commutative59.4%
Applied egg-rr59.4%
unpow-159.4%
associate-/l*54.8%
Simplified54.8%
if 2.4000000000000001e-303 < a < 5.8000000000000001e-183Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.9%
associate-*l*92.1%
Simplified92.1%
associate-+l-92.1%
div-sub88.0%
*-commutative88.0%
associate-*l*88.1%
associate-*l*88.1%
fma-neg88.1%
Applied egg-rr88.1%
associate-*r*88.0%
times-frac80.2%
fma-udef80.2%
unsub-neg80.2%
*-commutative80.2%
*-commutative80.2%
associate-*l*80.2%
*-commutative80.2%
Simplified80.2%
Taylor expanded in c around 0 99.8%
*-commutative99.8%
*-un-lft-identity99.8%
times-frac95.9%
Applied egg-rr95.9%
Taylor expanded in y around inf 57.3%
*-commutative57.3%
times-frac53.5%
Simplified53.5%
if 5.8000000000000001e-183 < a < 2.90000000000000005e-46Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.8%
associate-*l*79.9%
Simplified79.9%
Taylor expanded in b around inf 51.6%
*-commutative51.6%
Simplified51.6%
div-inv51.8%
*-commutative51.8%
Applied egg-rr51.8%
expm1-log1p-u38.5%
expm1-udef26.1%
*-commutative26.1%
Applied egg-rr26.1%
expm1-def38.5%
expm1-log1p51.8%
*-commutative51.8%
associate-/r*53.8%
Simplified53.8%
if 2.90000000000000005e-46 < a < 2.2499999999999999e-12Initial program 56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-*l*56.4%
associate-*l*56.4%
Simplified56.4%
Taylor expanded in x around inf 23.5%
associate-*r/23.5%
*-commutative23.5%
associate-*r*23.5%
*-commutative23.5%
times-frac32.1%
Simplified32.1%
if 2.2499999999999999e-12 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*70.8%
*-commutative70.8%
associate-+l-70.8%
*-commutative70.8%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
Simplified77.6%
associate-+l-77.6%
div-sub69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
fma-neg69.1%
Applied egg-rr69.1%
associate-*r*69.1%
times-frac66.4%
fma-udef66.4%
unsub-neg66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l*66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in z around inf 43.5%
*-commutative43.5%
associate-*l/56.0%
*-commutative56.0%
Simplified56.0%
Final simplification53.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -1.4e-119)
(* -4.0 (/ a (/ c t)))
(if (<= a -1.35e-208)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 2.8e-306)
(/ 1.0 (/ c (/ b z)))
(if (<= a 1.66e-183)
(/ (* 9.0 (/ (* y x) z)) c)
(if (<= a 9.5e-46)
(* b (/ (/ 1.0 c) z))
(if (<= a 2.4e-12)
(* (/ (* 9.0 y) z) (/ x c))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.4e-119) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -1.35e-208) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 2.8e-306) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 1.66e-183) {
tmp = (9.0 * ((y * x) / z)) / c;
} else if (a <= 9.5e-46) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.4e-12) {
tmp = ((9.0 * y) / z) * (x / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-1.4d-119)) then
tmp = (-4.0d0) * (a / (c / t))
else if (a <= (-1.35d-208)) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 2.8d-306) then
tmp = 1.0d0 / (c / (b / z))
else if (a <= 1.66d-183) then
tmp = (9.0d0 * ((y * x) / z)) / c
else if (a <= 9.5d-46) then
tmp = b * ((1.0d0 / c) / z)
else if (a <= 2.4d-12) then
tmp = ((9.0d0 * y) / z) * (x / c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.4e-119) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -1.35e-208) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 2.8e-306) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 1.66e-183) {
tmp = (9.0 * ((y * x) / z)) / c;
} else if (a <= 9.5e-46) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.4e-12) {
tmp = ((9.0 * y) / z) * (x / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -1.4e-119: tmp = -4.0 * (a / (c / t)) elif a <= -1.35e-208: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 2.8e-306: tmp = 1.0 / (c / (b / z)) elif a <= 1.66e-183: tmp = (9.0 * ((y * x) / z)) / c elif a <= 9.5e-46: tmp = b * ((1.0 / c) / z) elif a <= 2.4e-12: tmp = ((9.0 * y) / z) * (x / c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -1.4e-119) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (a <= -1.35e-208) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 2.8e-306) tmp = Float64(1.0 / Float64(c / Float64(b / z))); elseif (a <= 1.66e-183) tmp = Float64(Float64(9.0 * Float64(Float64(y * x) / z)) / c); elseif (a <= 9.5e-46) tmp = Float64(b * Float64(Float64(1.0 / c) / z)); elseif (a <= 2.4e-12) tmp = Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -1.4e-119)
tmp = -4.0 * (a / (c / t));
elseif (a <= -1.35e-208)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 2.8e-306)
tmp = 1.0 / (c / (b / z));
elseif (a <= 1.66e-183)
tmp = (9.0 * ((y * x) / z)) / c;
elseif (a <= 9.5e-46)
tmp = b * ((1.0 / c) / z);
elseif (a <= 2.4e-12)
tmp = ((9.0 * y) / z) * (x / c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1.4e-119], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -1.35e-208], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.8e-306], N[(1.0 / N[(c / N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.66e-183], N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 9.5e-46], N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.4e-12], N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.4 \cdot 10^{-119}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq -1.35 \cdot 10^{-208}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{-306}:\\
\;\;\;\;\frac{1}{\frac{c}{\frac{b}{z}}}\\
\mathbf{elif}\;a \leq 1.66 \cdot 10^{-183}:\\
\;\;\;\;\frac{9 \cdot \frac{y \cdot x}{z}}{c}\\
\mathbf{elif}\;a \leq 9.5 \cdot 10^{-46}:\\
\;\;\;\;b \cdot \frac{\frac{1}{c}}{z}\\
\mathbf{elif}\;a \leq 2.4 \cdot 10^{-12}:\\
\;\;\;\;\frac{9 \cdot y}{z} \cdot \frac{x}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -1.4e-119Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -1.4e-119 < a < -1.35e-208Initial program 88.3%
associate-+l-88.3%
*-commutative88.3%
associate-*r*93.8%
*-commutative93.8%
associate-+l-93.8%
*-commutative93.8%
associate-*r*88.3%
*-commutative88.3%
associate-*l*88.3%
associate-*l*93.8%
Simplified93.8%
Taylor expanded in x around inf 48.2%
if -1.35e-208 < a < 2.8000000000000001e-306Initial program 85.0%
associate-+l-85.0%
*-commutative85.0%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*85.0%
*-commutative85.0%
associate-*l*85.0%
associate-*l*99.6%
Simplified99.6%
Taylor expanded in b around inf 59.5%
*-commutative59.5%
Simplified59.5%
clear-num59.4%
inv-pow59.4%
*-commutative59.4%
Applied egg-rr59.4%
unpow-159.4%
associate-/l*54.8%
Simplified54.8%
if 2.8000000000000001e-306 < a < 1.66e-183Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.9%
associate-*l*92.1%
Simplified92.1%
associate-+l-92.1%
div-sub88.0%
*-commutative88.0%
associate-*l*88.1%
associate-*l*88.1%
fma-neg88.1%
Applied egg-rr88.1%
associate-*r*88.0%
times-frac80.2%
fma-udef80.2%
unsub-neg80.2%
*-commutative80.2%
*-commutative80.2%
associate-*l*80.2%
*-commutative80.2%
Simplified80.2%
Taylor expanded in c around 0 99.8%
Taylor expanded in x around inf 61.3%
if 1.66e-183 < a < 9.49999999999999993e-46Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.8%
associate-*l*79.9%
Simplified79.9%
Taylor expanded in b around inf 51.6%
*-commutative51.6%
Simplified51.6%
div-inv51.8%
*-commutative51.8%
Applied egg-rr51.8%
expm1-log1p-u38.5%
expm1-udef26.1%
*-commutative26.1%
Applied egg-rr26.1%
expm1-def38.5%
expm1-log1p51.8%
*-commutative51.8%
associate-/r*53.8%
Simplified53.8%
if 9.49999999999999993e-46 < a < 2.39999999999999987e-12Initial program 56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-*l*56.4%
associate-*l*56.4%
Simplified56.4%
Taylor expanded in x around inf 23.5%
associate-*r/23.5%
*-commutative23.5%
associate-*r*23.5%
*-commutative23.5%
times-frac32.1%
Simplified32.1%
if 2.39999999999999987e-12 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*70.8%
*-commutative70.8%
associate-+l-70.8%
*-commutative70.8%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
Simplified77.6%
associate-+l-77.6%
div-sub69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
fma-neg69.1%
Applied egg-rr69.1%
associate-*r*69.1%
times-frac66.4%
fma-udef66.4%
unsub-neg66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l*66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in z around inf 43.5%
*-commutative43.5%
associate-*l/56.0%
*-commutative56.0%
Simplified56.0%
Final simplification54.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -1.5e-120)
(* -4.0 (/ a (/ c t)))
(if (<= a -1.22e-213)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 5e-309)
(/ 1.0 (/ c (/ b z)))
(if (<= a 1.2e-185)
(/ (/ (* y (* 9.0 x)) z) c)
(if (<= a 4.1e-47)
(* b (/ (/ 1.0 c) z))
(if (<= a 2.5e-12)
(* (/ (* 9.0 y) z) (/ x c))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.5e-120) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -1.22e-213) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 5e-309) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 1.2e-185) {
tmp = ((y * (9.0 * x)) / z) / c;
} else if (a <= 4.1e-47) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.5e-12) {
tmp = ((9.0 * y) / z) * (x / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-1.5d-120)) then
tmp = (-4.0d0) * (a / (c / t))
else if (a <= (-1.22d-213)) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 5d-309) then
tmp = 1.0d0 / (c / (b / z))
else if (a <= 1.2d-185) then
tmp = ((y * (9.0d0 * x)) / z) / c
else if (a <= 4.1d-47) then
tmp = b * ((1.0d0 / c) / z)
else if (a <= 2.5d-12) then
tmp = ((9.0d0 * y) / z) * (x / c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.5e-120) {
tmp = -4.0 * (a / (c / t));
} else if (a <= -1.22e-213) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 5e-309) {
tmp = 1.0 / (c / (b / z));
} else if (a <= 1.2e-185) {
tmp = ((y * (9.0 * x)) / z) / c;
} else if (a <= 4.1e-47) {
tmp = b * ((1.0 / c) / z);
} else if (a <= 2.5e-12) {
tmp = ((9.0 * y) / z) * (x / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -1.5e-120: tmp = -4.0 * (a / (c / t)) elif a <= -1.22e-213: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 5e-309: tmp = 1.0 / (c / (b / z)) elif a <= 1.2e-185: tmp = ((y * (9.0 * x)) / z) / c elif a <= 4.1e-47: tmp = b * ((1.0 / c) / z) elif a <= 2.5e-12: tmp = ((9.0 * y) / z) * (x / c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -1.5e-120) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (a <= -1.22e-213) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 5e-309) tmp = Float64(1.0 / Float64(c / Float64(b / z))); elseif (a <= 1.2e-185) tmp = Float64(Float64(Float64(y * Float64(9.0 * x)) / z) / c); elseif (a <= 4.1e-47) tmp = Float64(b * Float64(Float64(1.0 / c) / z)); elseif (a <= 2.5e-12) tmp = Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -1.5e-120)
tmp = -4.0 * (a / (c / t));
elseif (a <= -1.22e-213)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 5e-309)
tmp = 1.0 / (c / (b / z));
elseif (a <= 1.2e-185)
tmp = ((y * (9.0 * x)) / z) / c;
elseif (a <= 4.1e-47)
tmp = b * ((1.0 / c) / z);
elseif (a <= 2.5e-12)
tmp = ((9.0 * y) / z) * (x / c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1.5e-120], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -1.22e-213], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5e-309], N[(1.0 / N[(c / N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.2e-185], N[(N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 4.1e-47], N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.5e-12], N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.5 \cdot 10^{-120}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq -1.22 \cdot 10^{-213}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 5 \cdot 10^{-309}:\\
\;\;\;\;\frac{1}{\frac{c}{\frac{b}{z}}}\\
\mathbf{elif}\;a \leq 1.2 \cdot 10^{-185}:\\
\;\;\;\;\frac{\frac{y \cdot \left(9 \cdot x\right)}{z}}{c}\\
\mathbf{elif}\;a \leq 4.1 \cdot 10^{-47}:\\
\;\;\;\;b \cdot \frac{\frac{1}{c}}{z}\\
\mathbf{elif}\;a \leq 2.5 \cdot 10^{-12}:\\
\;\;\;\;\frac{9 \cdot y}{z} \cdot \frac{x}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -1.50000000000000005e-120Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -1.50000000000000005e-120 < a < -1.22e-213Initial program 88.9%
associate-+l-88.9%
*-commutative88.9%
associate-*r*94.2%
*-commutative94.2%
associate-+l-94.2%
*-commutative94.2%
associate-*r*88.9%
*-commutative88.9%
associate-*l*88.9%
associate-*l*94.2%
Simplified94.2%
Taylor expanded in x around inf 51.0%
if -1.22e-213 < a < 4.9999999999999995e-309Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*84.2%
*-commutative84.2%
associate-*l*84.2%
associate-*l*99.6%
Simplified99.6%
Taylor expanded in b around inf 62.5%
*-commutative62.5%
Simplified62.5%
clear-num62.3%
inv-pow62.3%
*-commutative62.3%
Applied egg-rr62.3%
unpow-162.3%
associate-/l*57.5%
Simplified57.5%
if 4.9999999999999995e-309 < a < 1.2000000000000001e-185Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.9%
associate-*l*92.1%
Simplified92.1%
associate-+l-92.1%
div-sub88.0%
*-commutative88.0%
associate-*l*88.1%
associate-*l*88.1%
fma-neg88.1%
Applied egg-rr88.1%
associate-*r*88.0%
times-frac80.2%
fma-udef80.2%
unsub-neg80.2%
*-commutative80.2%
*-commutative80.2%
associate-*l*80.2%
*-commutative80.2%
Simplified80.2%
Taylor expanded in c around 0 99.8%
Taylor expanded in x around inf 61.3%
associate-*r/61.3%
associate-*r*61.2%
Simplified61.2%
if 1.2000000000000001e-185 < a < 4.10000000000000002e-47Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*79.9%
*-commutative79.9%
associate-*l*79.8%
associate-*l*79.9%
Simplified79.9%
Taylor expanded in b around inf 51.6%
*-commutative51.6%
Simplified51.6%
div-inv51.8%
*-commutative51.8%
Applied egg-rr51.8%
expm1-log1p-u38.5%
expm1-udef26.1%
*-commutative26.1%
Applied egg-rr26.1%
expm1-def38.5%
expm1-log1p51.8%
*-commutative51.8%
associate-/r*53.8%
Simplified53.8%
if 4.10000000000000002e-47 < a < 2.49999999999999985e-12Initial program 56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-+l-56.4%
*-commutative56.4%
associate-*r*56.4%
*-commutative56.4%
associate-*l*56.4%
associate-*l*56.4%
Simplified56.4%
Taylor expanded in x around inf 23.5%
associate-*r/23.5%
*-commutative23.5%
associate-*r*23.5%
*-commutative23.5%
times-frac32.1%
Simplified32.1%
if 2.49999999999999985e-12 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*70.8%
*-commutative70.8%
associate-+l-70.8%
*-commutative70.8%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.6%
associate-*l*77.6%
Simplified77.6%
associate-+l-77.6%
div-sub69.1%
*-commutative69.1%
associate-*l*69.1%
associate-*l*69.1%
fma-neg69.1%
Applied egg-rr69.1%
associate-*r*69.1%
times-frac66.4%
fma-udef66.4%
unsub-neg66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l*66.4%
*-commutative66.4%
Simplified66.4%
Taylor expanded in z around inf 43.5%
*-commutative43.5%
associate-*l/56.0%
*-commutative56.0%
Simplified56.0%
Final simplification54.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ (* 9.0 (/ x (/ z y))) (* t (* a -4.0))) c)))
(if (<= t -7.8e+210)
t_1
(if (<= t -1.05e+178)
(/ (/ (+ b (* y (* 9.0 x))) z) c)
(if (<= t -2e+87)
t_1
(if (<= t -2.15e-122)
(/ (- (/ b z) (* 4.0 (* a t))) c)
(if (<= t 68000000000.0)
(/ (+ b (* 9.0 (* y x))) (* z c))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
double tmp;
if (t <= -7.8e+210) {
tmp = t_1;
} else if (t <= -1.05e+178) {
tmp = ((b + (y * (9.0 * x))) / z) / c;
} else if (t <= -2e+87) {
tmp = t_1;
} else if (t <= -2.15e-122) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 68000000000.0) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = ((9.0d0 * (x / (z / y))) + (t * (a * (-4.0d0)))) / c
if (t <= (-7.8d+210)) then
tmp = t_1
else if (t <= (-1.05d+178)) then
tmp = ((b + (y * (9.0d0 * x))) / z) / c
else if (t <= (-2d+87)) then
tmp = t_1
else if (t <= (-2.15d-122)) then
tmp = ((b / z) - (4.0d0 * (a * t))) / c
else if (t <= 68000000000.0d0) then
tmp = (b + (9.0d0 * (y * x))) / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
double tmp;
if (t <= -7.8e+210) {
tmp = t_1;
} else if (t <= -1.05e+178) {
tmp = ((b + (y * (9.0 * x))) / z) / c;
} else if (t <= -2e+87) {
tmp = t_1;
} else if (t <= -2.15e-122) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 68000000000.0) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c tmp = 0 if t <= -7.8e+210: tmp = t_1 elif t <= -1.05e+178: tmp = ((b + (y * (9.0 * x))) / z) / c elif t <= -2e+87: tmp = t_1 elif t <= -2.15e-122: tmp = ((b / z) - (4.0 * (a * t))) / c elif t <= 68000000000.0: tmp = (b + (9.0 * (y * x))) / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(9.0 * Float64(x / Float64(z / y))) + Float64(t * Float64(a * -4.0))) / c) tmp = 0.0 if (t <= -7.8e+210) tmp = t_1; elseif (t <= -1.05e+178) tmp = Float64(Float64(Float64(b + Float64(y * Float64(9.0 * x))) / z) / c); elseif (t <= -2e+87) tmp = t_1; elseif (t <= -2.15e-122) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(a * t))) / c); elseif (t <= 68000000000.0) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
tmp = 0.0;
if (t <= -7.8e+210)
tmp = t_1;
elseif (t <= -1.05e+178)
tmp = ((b + (y * (9.0 * x))) / z) / c;
elseif (t <= -2e+87)
tmp = t_1;
elseif (t <= -2.15e-122)
tmp = ((b / z) - (4.0 * (a * t))) / c;
elseif (t <= 68000000000.0)
tmp = (b + (9.0 * (y * x))) / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(9.0 * N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[t, -7.8e+210], t$95$1, If[LessEqual[t, -1.05e+178], N[(N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -2e+87], t$95$1, If[LessEqual[t, -2.15e-122], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, 68000000000.0], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{9 \cdot \frac{x}{\frac{z}{y}} + t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{if}\;t \leq -7.8 \cdot 10^{+210}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq -1.05 \cdot 10^{+178}:\\
\;\;\;\;\frac{\frac{b + y \cdot \left(9 \cdot x\right)}{z}}{c}\\
\mathbf{elif}\;t \leq -2 \cdot 10^{+87}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq -2.15 \cdot 10^{-122}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{elif}\;t \leq 68000000000:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -7.8e210 or -1.0499999999999999e178 < t < -1.9999999999999999e87Initial program 62.5%
associate-+l-62.5%
*-commutative62.5%
associate-*r*67.4%
*-commutative67.4%
associate-+l-67.4%
*-commutative67.4%
associate-*r*62.5%
*-commutative62.5%
associate-*l*62.5%
associate-*l*67.5%
Simplified67.5%
associate-+l-67.5%
div-sub65.0%
*-commutative65.0%
associate-*l*65.0%
associate-*l*65.0%
fma-neg65.0%
Applied egg-rr65.0%
associate-*r*65.0%
times-frac60.5%
fma-udef60.5%
unsub-neg60.5%
*-commutative60.5%
*-commutative60.5%
associate-*l*60.5%
*-commutative60.5%
Simplified60.5%
Taylor expanded in c around 0 83.5%
*-commutative83.5%
*-un-lft-identity83.5%
times-frac86.1%
Applied egg-rr86.1%
Taylor expanded in b around 0 79.0%
cancel-sign-sub-inv79.0%
associate-/l*81.5%
metadata-eval81.5%
associate-*r*81.5%
*-commutative81.5%
*-commutative81.5%
Simplified81.5%
if -7.8e210 < t < -1.0499999999999999e178Initial program 71.3%
associate-+l-71.3%
*-commutative71.3%
associate-*r*85.5%
*-commutative85.5%
associate-+l-85.5%
*-commutative85.5%
associate-*r*71.3%
*-commutative71.3%
associate-*l*71.3%
associate-*l*85.5%
Simplified85.5%
associate-+l-85.5%
div-sub71.2%
*-commutative71.2%
associate-*l*71.2%
associate-*l*71.2%
fma-neg71.2%
Applied egg-rr71.2%
associate-*r*71.2%
times-frac85.7%
fma-udef85.7%
unsub-neg85.7%
*-commutative85.7%
*-commutative85.7%
associate-*l*85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in c around 0 86.3%
Taylor expanded in z around 0 71.9%
associate-*r*71.9%
Simplified71.9%
if -1.9999999999999999e87 < t < -2.15000000000000009e-122Initial program 74.9%
associate-+l-74.9%
*-commutative74.9%
associate-*r*74.8%
*-commutative74.8%
associate-+l-74.8%
*-commutative74.8%
associate-*r*74.9%
*-commutative74.9%
associate-*l*74.9%
associate-*l*74.9%
Simplified74.9%
associate-+l-74.9%
div-sub74.4%
*-commutative74.4%
associate-*l*74.5%
associate-*l*74.5%
fma-neg74.5%
Applied egg-rr74.5%
associate-*r*74.4%
times-frac75.3%
fma-udef75.3%
unsub-neg75.3%
*-commutative75.3%
*-commutative75.3%
associate-*l*75.3%
*-commutative75.3%
Simplified75.3%
Taylor expanded in c around 0 84.7%
Taylor expanded in x around 0 82.5%
if -2.15000000000000009e-122 < t < 6.8e10Initial program 87.8%
associate-+l-87.8%
*-commutative87.8%
associate-*r*82.0%
*-commutative82.0%
associate-+l-82.0%
*-commutative82.0%
associate-*r*87.8%
*-commutative87.8%
associate-*l*87.9%
associate-*l*87.9%
Simplified87.9%
Taylor expanded in x around inf 82.3%
if 6.8e10 < t Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*83.5%
*-commutative83.5%
associate-+l-83.5%
*-commutative83.5%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.5%
associate-*l*82.0%
Simplified82.0%
associate-+l-82.0%
div-sub72.7%
*-commutative72.7%
associate-*l*72.8%
associate-*l*72.8%
fma-neg72.8%
Applied egg-rr72.8%
associate-*r*72.7%
times-frac69.8%
fma-udef69.8%
unsub-neg69.8%
*-commutative69.8%
*-commutative69.8%
associate-*l*69.8%
*-commutative69.8%
Simplified69.8%
Taylor expanded in z around inf 50.4%
*-commutative50.4%
associate-*l/53.3%
*-commutative53.3%
Simplified53.3%
Final simplification74.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 4.0 (* a t))))
(if (<= t -2.52e+213)
(/ (+ (* 9.0 (/ x (/ z y))) (* t (* a -4.0))) c)
(if (<= t -1.05e+178)
(/ (/ (+ b (* y (* 9.0 x))) z) c)
(if (<= t -2.8e+87)
(/ (- (* 9.0 (/ (* y x) z)) t_1) c)
(if (<= t -3.9e-118)
(/ (- (/ b z) t_1) c)
(if (<= t 1.16e+24)
(/ (+ b (* 9.0 (* y x))) (* z c))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 4.0 * (a * t);
double tmp;
if (t <= -2.52e+213) {
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
} else if (t <= -1.05e+178) {
tmp = ((b + (y * (9.0 * x))) / z) / c;
} else if (t <= -2.8e+87) {
tmp = ((9.0 * ((y * x) / z)) - t_1) / c;
} else if (t <= -3.9e-118) {
tmp = ((b / z) - t_1) / c;
} else if (t <= 1.16e+24) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 4.0d0 * (a * t)
if (t <= (-2.52d+213)) then
tmp = ((9.0d0 * (x / (z / y))) + (t * (a * (-4.0d0)))) / c
else if (t <= (-1.05d+178)) then
tmp = ((b + (y * (9.0d0 * x))) / z) / c
else if (t <= (-2.8d+87)) then
tmp = ((9.0d0 * ((y * x) / z)) - t_1) / c
else if (t <= (-3.9d-118)) then
tmp = ((b / z) - t_1) / c
else if (t <= 1.16d+24) then
tmp = (b + (9.0d0 * (y * x))) / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 4.0 * (a * t);
double tmp;
if (t <= -2.52e+213) {
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
} else if (t <= -1.05e+178) {
tmp = ((b + (y * (9.0 * x))) / z) / c;
} else if (t <= -2.8e+87) {
tmp = ((9.0 * ((y * x) / z)) - t_1) / c;
} else if (t <= -3.9e-118) {
tmp = ((b / z) - t_1) / c;
} else if (t <= 1.16e+24) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 4.0 * (a * t) tmp = 0 if t <= -2.52e+213: tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c elif t <= -1.05e+178: tmp = ((b + (y * (9.0 * x))) / z) / c elif t <= -2.8e+87: tmp = ((9.0 * ((y * x) / z)) - t_1) / c elif t <= -3.9e-118: tmp = ((b / z) - t_1) / c elif t <= 1.16e+24: tmp = (b + (9.0 * (y * x))) / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(4.0 * Float64(a * t)) tmp = 0.0 if (t <= -2.52e+213) tmp = Float64(Float64(Float64(9.0 * Float64(x / Float64(z / y))) + Float64(t * Float64(a * -4.0))) / c); elseif (t <= -1.05e+178) tmp = Float64(Float64(Float64(b + Float64(y * Float64(9.0 * x))) / z) / c); elseif (t <= -2.8e+87) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y * x) / z)) - t_1) / c); elseif (t <= -3.9e-118) tmp = Float64(Float64(Float64(b / z) - t_1) / c); elseif (t <= 1.16e+24) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 4.0 * (a * t);
tmp = 0.0;
if (t <= -2.52e+213)
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
elseif (t <= -1.05e+178)
tmp = ((b + (y * (9.0 * x))) / z) / c;
elseif (t <= -2.8e+87)
tmp = ((9.0 * ((y * x) / z)) - t_1) / c;
elseif (t <= -3.9e-118)
tmp = ((b / z) - t_1) / c;
elseif (t <= 1.16e+24)
tmp = (b + (9.0 * (y * x))) / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.52e+213], N[(N[(N[(9.0 * N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -1.05e+178], N[(N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -2.8e+87], N[(N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -3.9e-118], N[(N[(N[(b / z), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, 1.16e+24], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;t \leq -2.52 \cdot 10^{+213}:\\
\;\;\;\;\frac{9 \cdot \frac{x}{\frac{z}{y}} + t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;t \leq -1.05 \cdot 10^{+178}:\\
\;\;\;\;\frac{\frac{b + y \cdot \left(9 \cdot x\right)}{z}}{c}\\
\mathbf{elif}\;t \leq -2.8 \cdot 10^{+87}:\\
\;\;\;\;\frac{9 \cdot \frac{y \cdot x}{z} - t\_1}{c}\\
\mathbf{elif}\;t \leq -3.9 \cdot 10^{-118}:\\
\;\;\;\;\frac{\frac{b}{z} - t\_1}{c}\\
\mathbf{elif}\;t \leq 1.16 \cdot 10^{+24}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -2.5200000000000001e213Initial program 54.6%
associate-+l-54.6%
*-commutative54.6%
associate-*r*59.7%
*-commutative59.7%
associate-+l-59.7%
*-commutative59.7%
associate-*r*54.6%
*-commutative54.6%
associate-*l*54.6%
associate-*l*59.7%
Simplified59.7%
associate-+l-59.7%
div-sub55.2%
*-commutative55.2%
associate-*l*55.1%
associate-*l*55.1%
fma-neg55.1%
Applied egg-rr55.1%
associate-*r*55.2%
times-frac64.7%
fma-udef64.7%
unsub-neg64.7%
*-commutative64.7%
*-commutative64.7%
associate-*l*64.7%
*-commutative64.7%
Simplified64.7%
Taylor expanded in c around 0 77.4%
*-commutative77.4%
*-un-lft-identity77.4%
times-frac82.3%
Applied egg-rr82.3%
Taylor expanded in b around 0 82.0%
cancel-sign-sub-inv82.0%
associate-/l*86.9%
metadata-eval86.9%
associate-*r*86.9%
*-commutative86.9%
*-commutative86.9%
Simplified86.9%
if -2.5200000000000001e213 < t < -1.0499999999999999e178Initial program 71.3%
associate-+l-71.3%
*-commutative71.3%
associate-*r*85.5%
*-commutative85.5%
associate-+l-85.5%
*-commutative85.5%
associate-*r*71.3%
*-commutative71.3%
associate-*l*71.3%
associate-*l*85.5%
Simplified85.5%
associate-+l-85.5%
div-sub71.2%
*-commutative71.2%
associate-*l*71.2%
associate-*l*71.2%
fma-neg71.2%
Applied egg-rr71.2%
associate-*r*71.2%
times-frac85.7%
fma-udef85.7%
unsub-neg85.7%
*-commutative85.7%
*-commutative85.7%
associate-*l*85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in c around 0 86.3%
Taylor expanded in z around 0 71.9%
associate-*r*71.9%
Simplified71.9%
if -1.0499999999999999e178 < t < -2.80000000000000015e87Initial program 71.2%
associate-+l-71.2%
*-commutative71.2%
associate-*r*76.0%
*-commutative76.0%
associate-+l-76.0%
*-commutative76.0%
associate-*r*71.2%
*-commutative71.2%
associate-*l*71.2%
associate-*l*76.0%
Simplified76.0%
associate-+l-76.0%
div-sub75.9%
*-commutative75.9%
associate-*l*75.9%
associate-*l*75.9%
fma-neg75.9%
Applied egg-rr75.9%
associate-*r*75.9%
times-frac55.9%
fma-udef55.9%
unsub-neg55.9%
*-commutative55.9%
*-commutative55.9%
associate-*l*55.9%
*-commutative55.9%
Simplified55.9%
Taylor expanded in c around 0 90.2%
Taylor expanded in b around 0 75.7%
if -2.80000000000000015e87 < t < -3.90000000000000001e-118Initial program 74.3%
associate-+l-74.3%
*-commutative74.3%
associate-*r*74.1%
*-commutative74.1%
associate-+l-74.1%
*-commutative74.1%
associate-*r*74.3%
*-commutative74.3%
associate-*l*74.3%
associate-*l*74.2%
Simplified74.2%
associate-+l-74.2%
div-sub73.8%
*-commutative73.8%
associate-*l*73.9%
associate-*l*73.9%
fma-neg73.9%
Applied egg-rr73.9%
associate-*r*73.8%
times-frac74.7%
fma-udef74.7%
unsub-neg74.7%
*-commutative74.7%
*-commutative74.7%
associate-*l*74.7%
*-commutative74.7%
Simplified74.7%
Taylor expanded in c around 0 84.3%
Taylor expanded in x around 0 82.0%
if -3.90000000000000001e-118 < t < 1.16000000000000005e24Initial program 88.1%
associate-+l-88.1%
*-commutative88.1%
associate-*r*82.5%
*-commutative82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*88.1%
*-commutative88.1%
associate-*l*88.2%
associate-*l*88.2%
Simplified88.2%
Taylor expanded in x around inf 81.8%
if 1.16000000000000005e24 < t Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*82.9%
*-commutative82.9%
associate-+l-82.9%
*-commutative82.9%
associate-*r*76.8%
*-commutative76.8%
associate-*l*76.8%
associate-*l*81.4%
Simplified81.4%
associate-+l-81.4%
div-sub71.9%
*-commutative71.9%
associate-*l*71.9%
associate-*l*71.9%
fma-neg71.9%
Applied egg-rr71.9%
associate-*r*71.9%
times-frac70.4%
fma-udef70.4%
unsub-neg70.4%
*-commutative70.4%
*-commutative70.4%
associate-*l*70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in z around inf 51.9%
*-commutative51.9%
associate-*l/54.9%
*-commutative54.9%
Simplified54.9%
Final simplification74.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 4.0 (* a t))))
(if (<= t -2.7e+206)
(/ (+ (* 9.0 (/ x (/ z y))) (* t (* a -4.0))) c)
(if (<= t -7.6e+177)
(+ (* (/ (* 9.0 y) z) (/ x c)) (/ (/ b c) z))
(if (<= t -3.9e+87)
(/ (- (* 9.0 (/ (* y x) z)) t_1) c)
(if (<= t -2.7e-121)
(/ (- (/ b z) t_1) c)
(if (<= t 5.9e+23)
(/ (+ b (* 9.0 (* y x))) (* z c))
(* -4.0 (* t (/ a c))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 4.0 * (a * t);
double tmp;
if (t <= -2.7e+206) {
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
} else if (t <= -7.6e+177) {
tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z);
} else if (t <= -3.9e+87) {
tmp = ((9.0 * ((y * x) / z)) - t_1) / c;
} else if (t <= -2.7e-121) {
tmp = ((b / z) - t_1) / c;
} else if (t <= 5.9e+23) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 4.0d0 * (a * t)
if (t <= (-2.7d+206)) then
tmp = ((9.0d0 * (x / (z / y))) + (t * (a * (-4.0d0)))) / c
else if (t <= (-7.6d+177)) then
tmp = (((9.0d0 * y) / z) * (x / c)) + ((b / c) / z)
else if (t <= (-3.9d+87)) then
tmp = ((9.0d0 * ((y * x) / z)) - t_1) / c
else if (t <= (-2.7d-121)) then
tmp = ((b / z) - t_1) / c
else if (t <= 5.9d+23) then
tmp = (b + (9.0d0 * (y * x))) / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 4.0 * (a * t);
double tmp;
if (t <= -2.7e+206) {
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
} else if (t <= -7.6e+177) {
tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z);
} else if (t <= -3.9e+87) {
tmp = ((9.0 * ((y * x) / z)) - t_1) / c;
} else if (t <= -2.7e-121) {
tmp = ((b / z) - t_1) / c;
} else if (t <= 5.9e+23) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 4.0 * (a * t) tmp = 0 if t <= -2.7e+206: tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c elif t <= -7.6e+177: tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z) elif t <= -3.9e+87: tmp = ((9.0 * ((y * x) / z)) - t_1) / c elif t <= -2.7e-121: tmp = ((b / z) - t_1) / c elif t <= 5.9e+23: tmp = (b + (9.0 * (y * x))) / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(4.0 * Float64(a * t)) tmp = 0.0 if (t <= -2.7e+206) tmp = Float64(Float64(Float64(9.0 * Float64(x / Float64(z / y))) + Float64(t * Float64(a * -4.0))) / c); elseif (t <= -7.6e+177) tmp = Float64(Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)) + Float64(Float64(b / c) / z)); elseif (t <= -3.9e+87) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y * x) / z)) - t_1) / c); elseif (t <= -2.7e-121) tmp = Float64(Float64(Float64(b / z) - t_1) / c); elseif (t <= 5.9e+23) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 4.0 * (a * t);
tmp = 0.0;
if (t <= -2.7e+206)
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
elseif (t <= -7.6e+177)
tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z);
elseif (t <= -3.9e+87)
tmp = ((9.0 * ((y * x) / z)) - t_1) / c;
elseif (t <= -2.7e-121)
tmp = ((b / z) - t_1) / c;
elseif (t <= 5.9e+23)
tmp = (b + (9.0 * (y * x))) / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.7e+206], N[(N[(N[(9.0 * N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -7.6e+177], N[(N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision] + N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -3.9e+87], N[(N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -2.7e-121], N[(N[(N[(b / z), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, 5.9e+23], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;t \leq -2.7 \cdot 10^{+206}:\\
\;\;\;\;\frac{9 \cdot \frac{x}{\frac{z}{y}} + t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;t \leq -7.6 \cdot 10^{+177}:\\
\;\;\;\;\frac{9 \cdot y}{z} \cdot \frac{x}{c} + \frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;t \leq -3.9 \cdot 10^{+87}:\\
\;\;\;\;\frac{9 \cdot \frac{y \cdot x}{z} - t\_1}{c}\\
\mathbf{elif}\;t \leq -2.7 \cdot 10^{-121}:\\
\;\;\;\;\frac{\frac{b}{z} - t\_1}{c}\\
\mathbf{elif}\;t \leq 5.9 \cdot 10^{+23}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -2.70000000000000003e206Initial program 56.5%
associate-+l-56.5%
*-commutative56.5%
associate-*r*61.4%
*-commutative61.4%
associate-+l-61.4%
*-commutative61.4%
associate-*r*56.5%
*-commutative56.5%
associate-*l*56.5%
associate-*l*61.4%
Simplified61.4%
associate-+l-61.4%
div-sub57.1%
*-commutative57.1%
associate-*l*57.0%
associate-*l*57.0%
fma-neg57.0%
Applied egg-rr57.0%
associate-*r*57.1%
times-frac66.3%
fma-udef66.3%
unsub-neg66.3%
*-commutative66.3%
*-commutative66.3%
associate-*l*66.3%
*-commutative66.3%
Simplified66.3%
Taylor expanded in c around 0 78.3%
*-commutative78.3%
*-un-lft-identity78.3%
times-frac78.9%
Applied egg-rr78.9%
Taylor expanded in b around 0 80.1%
cancel-sign-sub-inv80.1%
associate-/l*84.8%
metadata-eval84.8%
associate-*r*84.8%
*-commutative84.8%
*-commutative84.8%
Simplified84.8%
if -2.70000000000000003e206 < t < -7.5999999999999996e177Initial program 66.8%
associate-+l-66.8%
*-commutative66.8%
associate-*r*83.3%
*-commutative83.3%
associate-+l-83.3%
*-commutative83.3%
associate-*r*66.8%
*-commutative66.8%
associate-*l*66.8%
associate-*l*83.3%
Simplified83.3%
associate-+l-83.3%
div-sub66.7%
*-commutative66.7%
associate-*l*66.7%
associate-*l*66.7%
fma-neg66.7%
Applied egg-rr66.7%
associate-*r*66.7%
times-frac83.3%
fma-udef83.3%
unsub-neg83.3%
*-commutative83.3%
*-commutative83.3%
associate-*l*83.3%
*-commutative83.3%
Simplified83.3%
Taylor expanded in z around 0 67.5%
mul-1-neg67.5%
associate-/r*67.5%
distribute-neg-frac67.5%
Simplified67.5%
if -7.5999999999999996e177 < t < -3.9000000000000002e87Initial program 71.2%
associate-+l-71.2%
*-commutative71.2%
associate-*r*76.0%
*-commutative76.0%
associate-+l-76.0%
*-commutative76.0%
associate-*r*71.2%
*-commutative71.2%
associate-*l*71.2%
associate-*l*76.0%
Simplified76.0%
associate-+l-76.0%
div-sub75.9%
*-commutative75.9%
associate-*l*75.9%
associate-*l*75.9%
fma-neg75.9%
Applied egg-rr75.9%
associate-*r*75.9%
times-frac55.9%
fma-udef55.9%
unsub-neg55.9%
*-commutative55.9%
*-commutative55.9%
associate-*l*55.9%
*-commutative55.9%
Simplified55.9%
Taylor expanded in c around 0 90.2%
Taylor expanded in b around 0 75.7%
if -3.9000000000000002e87 < t < -2.7000000000000002e-121Initial program 74.9%
associate-+l-74.9%
*-commutative74.9%
associate-*r*74.8%
*-commutative74.8%
associate-+l-74.8%
*-commutative74.8%
associate-*r*74.9%
*-commutative74.9%
associate-*l*74.9%
associate-*l*74.9%
Simplified74.9%
associate-+l-74.9%
div-sub74.4%
*-commutative74.4%
associate-*l*74.5%
associate-*l*74.5%
fma-neg74.5%
Applied egg-rr74.5%
associate-*r*74.4%
times-frac75.3%
fma-udef75.3%
unsub-neg75.3%
*-commutative75.3%
*-commutative75.3%
associate-*l*75.3%
*-commutative75.3%
Simplified75.3%
Taylor expanded in c around 0 84.7%
Taylor expanded in x around 0 82.5%
if -2.7000000000000002e-121 < t < 5.89999999999999987e23Initial program 88.0%
associate-+l-88.0%
*-commutative88.0%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
*-commutative82.3%
associate-*r*88.0%
*-commutative88.0%
associate-*l*88.1%
associate-*l*88.1%
Simplified88.1%
Taylor expanded in x around inf 82.6%
if 5.89999999999999987e23 < t Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*82.9%
*-commutative82.9%
associate-+l-82.9%
*-commutative82.9%
associate-*r*76.8%
*-commutative76.8%
associate-*l*76.8%
associate-*l*81.4%
Simplified81.4%
associate-+l-81.4%
div-sub71.9%
*-commutative71.9%
associate-*l*71.9%
associate-*l*71.9%
fma-neg71.9%
Applied egg-rr71.9%
associate-*r*71.9%
times-frac70.4%
fma-udef70.4%
unsub-neg70.4%
*-commutative70.4%
*-commutative70.4%
associate-*l*70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in z around inf 51.9%
*-commutative51.9%
associate-*l/54.9%
*-commutative54.9%
Simplified54.9%
Final simplification75.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= t -2.5e+206)
(/ (+ (* 9.0 (/ x (/ z y))) (* t (* a -4.0))) c)
(if (<= t -9.8e+175)
(+ (* (/ (* 9.0 y) z) (/ x c)) (/ (/ b c) z))
(if (<= t -1.3e+87)
(- (* 9.0 (/ (* y x) (* z c))) (* 4.0 (/ (* a t) c)))
(if (<= t -1.9e-118)
(/ (- (/ b z) (* 4.0 (* a t))) c)
(if (<= t 12000000000.0)
(/ (+ b (* 9.0 (* y x))) (* z c))
(* -4.0 (* t (/ a c)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -2.5e+206) {
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
} else if (t <= -9.8e+175) {
tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z);
} else if (t <= -1.3e+87) {
tmp = (9.0 * ((y * x) / (z * c))) - (4.0 * ((a * t) / c));
} else if (t <= -1.9e-118) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 12000000000.0) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-2.5d+206)) then
tmp = ((9.0d0 * (x / (z / y))) + (t * (a * (-4.0d0)))) / c
else if (t <= (-9.8d+175)) then
tmp = (((9.0d0 * y) / z) * (x / c)) + ((b / c) / z)
else if (t <= (-1.3d+87)) then
tmp = (9.0d0 * ((y * x) / (z * c))) - (4.0d0 * ((a * t) / c))
else if (t <= (-1.9d-118)) then
tmp = ((b / z) - (4.0d0 * (a * t))) / c
else if (t <= 12000000000.0d0) then
tmp = (b + (9.0d0 * (y * x))) / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -2.5e+206) {
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
} else if (t <= -9.8e+175) {
tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z);
} else if (t <= -1.3e+87) {
tmp = (9.0 * ((y * x) / (z * c))) - (4.0 * ((a * t) / c));
} else if (t <= -1.9e-118) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 12000000000.0) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -2.5e+206: tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c elif t <= -9.8e+175: tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z) elif t <= -1.3e+87: tmp = (9.0 * ((y * x) / (z * c))) - (4.0 * ((a * t) / c)) elif t <= -1.9e-118: tmp = ((b / z) - (4.0 * (a * t))) / c elif t <= 12000000000.0: tmp = (b + (9.0 * (y * x))) / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -2.5e+206) tmp = Float64(Float64(Float64(9.0 * Float64(x / Float64(z / y))) + Float64(t * Float64(a * -4.0))) / c); elseif (t <= -9.8e+175) tmp = Float64(Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)) + Float64(Float64(b / c) / z)); elseif (t <= -1.3e+87) tmp = Float64(Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))) - Float64(4.0 * Float64(Float64(a * t) / c))); elseif (t <= -1.9e-118) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(a * t))) / c); elseif (t <= 12000000000.0) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -2.5e+206)
tmp = ((9.0 * (x / (z / y))) + (t * (a * -4.0))) / c;
elseif (t <= -9.8e+175)
tmp = (((9.0 * y) / z) * (x / c)) + ((b / c) / z);
elseif (t <= -1.3e+87)
tmp = (9.0 * ((y * x) / (z * c))) - (4.0 * ((a * t) / c));
elseif (t <= -1.9e-118)
tmp = ((b / z) - (4.0 * (a * t))) / c;
elseif (t <= 12000000000.0)
tmp = (b + (9.0 * (y * x))) / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -2.5e+206], N[(N[(N[(9.0 * N[(x / N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -9.8e+175], N[(N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision] + N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.3e+87], N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.9e-118], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, 12000000000.0], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.5 \cdot 10^{+206}:\\
\;\;\;\;\frac{9 \cdot \frac{x}{\frac{z}{y}} + t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;t \leq -9.8 \cdot 10^{+175}:\\
\;\;\;\;\frac{9 \cdot y}{z} \cdot \frac{x}{c} + \frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;t \leq -1.3 \cdot 10^{+87}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c} - 4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;t \leq -1.9 \cdot 10^{-118}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{elif}\;t \leq 12000000000:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -2.5000000000000001e206Initial program 56.5%
associate-+l-56.5%
*-commutative56.5%
associate-*r*61.4%
*-commutative61.4%
associate-+l-61.4%
*-commutative61.4%
associate-*r*56.5%
*-commutative56.5%
associate-*l*56.5%
associate-*l*61.4%
Simplified61.4%
associate-+l-61.4%
div-sub57.1%
*-commutative57.1%
associate-*l*57.0%
associate-*l*57.0%
fma-neg57.0%
Applied egg-rr57.0%
associate-*r*57.1%
times-frac66.3%
fma-udef66.3%
unsub-neg66.3%
*-commutative66.3%
*-commutative66.3%
associate-*l*66.3%
*-commutative66.3%
Simplified66.3%
Taylor expanded in c around 0 78.3%
*-commutative78.3%
*-un-lft-identity78.3%
times-frac78.9%
Applied egg-rr78.9%
Taylor expanded in b around 0 80.1%
cancel-sign-sub-inv80.1%
associate-/l*84.8%
metadata-eval84.8%
associate-*r*84.8%
*-commutative84.8%
*-commutative84.8%
Simplified84.8%
if -2.5000000000000001e206 < t < -9.80000000000000002e175Initial program 66.8%
associate-+l-66.8%
*-commutative66.8%
associate-*r*83.3%
*-commutative83.3%
associate-+l-83.3%
*-commutative83.3%
associate-*r*66.8%
*-commutative66.8%
associate-*l*66.8%
associate-*l*83.3%
Simplified83.3%
associate-+l-83.3%
div-sub66.7%
*-commutative66.7%
associate-*l*66.7%
associate-*l*66.7%
fma-neg66.7%
Applied egg-rr66.7%
associate-*r*66.7%
times-frac83.3%
fma-udef83.3%
unsub-neg83.3%
*-commutative83.3%
*-commutative83.3%
associate-*l*83.3%
*-commutative83.3%
Simplified83.3%
Taylor expanded in z around 0 67.5%
mul-1-neg67.5%
associate-/r*67.5%
distribute-neg-frac67.5%
Simplified67.5%
if -9.80000000000000002e175 < t < -1.29999999999999999e87Initial program 71.2%
associate-+l-71.2%
*-commutative71.2%
associate-*r*76.0%
*-commutative76.0%
associate-+l-76.0%
*-commutative76.0%
associate-*r*71.2%
*-commutative71.2%
associate-*l*71.2%
associate-*l*76.0%
Simplified76.0%
associate-+l-76.0%
div-sub75.9%
*-commutative75.9%
associate-*l*75.9%
associate-*l*75.9%
fma-neg75.9%
Applied egg-rr75.9%
associate-*r*75.9%
times-frac55.9%
fma-udef55.9%
unsub-neg55.9%
*-commutative55.9%
*-commutative55.9%
associate-*l*55.9%
*-commutative55.9%
Simplified55.9%
Taylor expanded in b around 0 75.3%
if -1.29999999999999999e87 < t < -1.9e-118Initial program 74.3%
associate-+l-74.3%
*-commutative74.3%
associate-*r*74.1%
*-commutative74.1%
associate-+l-74.1%
*-commutative74.1%
associate-*r*74.3%
*-commutative74.3%
associate-*l*74.3%
associate-*l*74.2%
Simplified74.2%
associate-+l-74.2%
div-sub73.8%
*-commutative73.8%
associate-*l*73.9%
associate-*l*73.9%
fma-neg73.9%
Applied egg-rr73.9%
associate-*r*73.8%
times-frac74.7%
fma-udef74.7%
unsub-neg74.7%
*-commutative74.7%
*-commutative74.7%
associate-*l*74.7%
*-commutative74.7%
Simplified74.7%
Taylor expanded in c around 0 84.3%
Taylor expanded in x around 0 82.0%
if -1.9e-118 < t < 1.2e10Initial program 87.9%
associate-+l-87.9%
*-commutative87.9%
associate-*r*82.1%
*-commutative82.1%
associate-+l-82.1%
*-commutative82.1%
associate-*r*87.9%
*-commutative87.9%
associate-*l*88.0%
associate-*l*88.0%
Simplified88.0%
Taylor expanded in x around inf 81.5%
if 1.2e10 < t Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*83.5%
*-commutative83.5%
associate-+l-83.5%
*-commutative83.5%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.5%
associate-*l*82.0%
Simplified82.0%
associate-+l-82.0%
div-sub72.7%
*-commutative72.7%
associate-*l*72.8%
associate-*l*72.8%
fma-neg72.8%
Applied egg-rr72.8%
associate-*r*72.7%
times-frac69.8%
fma-udef69.8%
unsub-neg69.8%
*-commutative69.8%
*-commutative69.8%
associate-*l*69.8%
*-commutative69.8%
Simplified69.8%
Taylor expanded in z around inf 50.4%
*-commutative50.4%
associate-*l/53.3%
*-commutative53.3%
Simplified53.3%
Final simplification73.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -1.5e-119)
(* -4.0 (/ a (/ c t)))
(if (or (<= a 2.5e-12) (and (not (<= a 1950000000.0)) (<= a 5.1e+185)))
(/ (+ b (* 9.0 (* y x))) (* z c))
(* -4.0 (* t (/ a c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.5e-119) {
tmp = -4.0 * (a / (c / t));
} else if ((a <= 2.5e-12) || (!(a <= 1950000000.0) && (a <= 5.1e+185))) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-1.5d-119)) then
tmp = (-4.0d0) * (a / (c / t))
else if ((a <= 2.5d-12) .or. (.not. (a <= 1950000000.0d0)) .and. (a <= 5.1d+185)) then
tmp = (b + (9.0d0 * (y * x))) / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -1.5e-119) {
tmp = -4.0 * (a / (c / t));
} else if ((a <= 2.5e-12) || (!(a <= 1950000000.0) && (a <= 5.1e+185))) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -1.5e-119: tmp = -4.0 * (a / (c / t)) elif (a <= 2.5e-12) or (not (a <= 1950000000.0) and (a <= 5.1e+185)): tmp = (b + (9.0 * (y * x))) / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -1.5e-119) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif ((a <= 2.5e-12) || (!(a <= 1950000000.0) && (a <= 5.1e+185))) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -1.5e-119)
tmp = -4.0 * (a / (c / t));
elseif ((a <= 2.5e-12) || (~((a <= 1950000000.0)) && (a <= 5.1e+185)))
tmp = (b + (9.0 * (y * x))) / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1.5e-119], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[a, 2.5e-12], And[N[Not[LessEqual[a, 1950000000.0]], $MachinePrecision], LessEqual[a, 5.1e+185]]], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.5 \cdot 10^{-119}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;a \leq 2.5 \cdot 10^{-12} \lor \neg \left(a \leq 1950000000\right) \land a \leq 5.1 \cdot 10^{+185}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -1.5000000000000001e-119Initial program 78.2%
associate-+l-78.2%
*-commutative78.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*78.2%
*-commutative78.2%
associate-*l*78.2%
associate-*l*77.2%
Simplified77.2%
Taylor expanded in z around inf 54.6%
*-commutative54.6%
associate-/l*54.7%
Simplified54.7%
if -1.5000000000000001e-119 < a < 2.49999999999999985e-12 or 1.95e9 < a < 5.09999999999999996e185Initial program 80.6%
associate-+l-80.6%
*-commutative80.6%
associate-*r*84.5%
*-commutative84.5%
associate-+l-84.5%
*-commutative84.5%
associate-*r*80.6%
*-commutative80.6%
associate-*l*80.6%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in x around inf 76.7%
if 2.49999999999999985e-12 < a < 1.95e9 or 5.09999999999999996e185 < a Initial program 71.9%
associate-+l-71.9%
*-commutative71.9%
associate-*r*65.3%
*-commutative65.3%
associate-+l-65.3%
*-commutative65.3%
associate-*r*71.9%
*-commutative71.9%
associate-*l*72.0%
associate-*l*72.0%
Simplified72.0%
associate-+l-72.0%
div-sub68.4%
*-commutative68.4%
associate-*l*68.4%
associate-*l*68.4%
fma-neg68.4%
Applied egg-rr68.4%
associate-*r*68.4%
times-frac56.7%
fma-udef56.7%
unsub-neg56.7%
*-commutative56.7%
*-commutative56.7%
associate-*l*56.7%
*-commutative56.7%
Simplified56.7%
Taylor expanded in z around inf 56.1%
*-commutative56.1%
associate-*l/71.4%
*-commutative71.4%
Simplified71.4%
Final simplification67.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (* 9.0 (* y x))) (* z c))))
(if (<= t -1.6e+220)
(* -4.0 (/ a (/ c t)))
(if (<= t -1.35e+178)
t_1
(if (<= t -7.9e-118)
(/ (- (/ b z) (* 4.0 (* a t))) c)
(if (<= t 29000000000.0) t_1 (* -4.0 (* t (/ a c)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + (9.0 * (y * x))) / (z * c);
double tmp;
if (t <= -1.6e+220) {
tmp = -4.0 * (a / (c / t));
} else if (t <= -1.35e+178) {
tmp = t_1;
} else if (t <= -7.9e-118) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 29000000000.0) {
tmp = t_1;
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (b + (9.0d0 * (y * x))) / (z * c)
if (t <= (-1.6d+220)) then
tmp = (-4.0d0) * (a / (c / t))
else if (t <= (-1.35d+178)) then
tmp = t_1
else if (t <= (-7.9d-118)) then
tmp = ((b / z) - (4.0d0 * (a * t))) / c
else if (t <= 29000000000.0d0) then
tmp = t_1
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + (9.0 * (y * x))) / (z * c);
double tmp;
if (t <= -1.6e+220) {
tmp = -4.0 * (a / (c / t));
} else if (t <= -1.35e+178) {
tmp = t_1;
} else if (t <= -7.9e-118) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 29000000000.0) {
tmp = t_1;
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (b + (9.0 * (y * x))) / (z * c) tmp = 0 if t <= -1.6e+220: tmp = -4.0 * (a / (c / t)) elif t <= -1.35e+178: tmp = t_1 elif t <= -7.9e-118: tmp = ((b / z) - (4.0 * (a * t))) / c elif t <= 29000000000.0: tmp = t_1 else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)) tmp = 0.0 if (t <= -1.6e+220) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (t <= -1.35e+178) tmp = t_1; elseif (t <= -7.9e-118) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(a * t))) / c); elseif (t <= 29000000000.0) tmp = t_1; else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (b + (9.0 * (y * x))) / (z * c);
tmp = 0.0;
if (t <= -1.6e+220)
tmp = -4.0 * (a / (c / t));
elseif (t <= -1.35e+178)
tmp = t_1;
elseif (t <= -7.9e-118)
tmp = ((b / z) - (4.0 * (a * t))) / c;
elseif (t <= 29000000000.0)
tmp = t_1;
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.6e+220], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.35e+178], t$95$1, If[LessEqual[t, -7.9e-118], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, 29000000000.0], t$95$1, N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{if}\;t \leq -1.6 \cdot 10^{+220}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;t \leq -1.35 \cdot 10^{+178}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq -7.9 \cdot 10^{-118}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{elif}\;t \leq 29000000000:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -1.59999999999999994e220Initial program 52.5%
associate-+l-52.5%
*-commutative52.5%
associate-*r*57.7%
*-commutative57.7%
associate-+l-57.7%
*-commutative57.7%
associate-*r*52.5%
*-commutative52.5%
associate-*l*52.5%
associate-*l*57.8%
Simplified57.8%
Taylor expanded in z around inf 76.9%
*-commutative76.9%
associate-/l*81.2%
Simplified81.2%
if -1.59999999999999994e220 < t < -1.35000000000000009e178 or -7.9000000000000004e-118 < t < 2.9e10Initial program 86.9%
associate-+l-86.9%
*-commutative86.9%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
*-commutative82.3%
associate-*r*86.9%
*-commutative86.9%
associate-*l*86.9%
associate-*l*87.8%
Simplified87.8%
Taylor expanded in x around inf 80.9%
if -1.35000000000000009e178 < t < -7.9000000000000004e-118Initial program 73.7%
associate-+l-73.7%
*-commutative73.7%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
*-commutative75.2%
associate-*r*73.7%
*-commutative73.7%
associate-*l*73.7%
associate-*l*75.3%
Simplified75.3%
associate-+l-75.3%
div-sub74.9%
*-commutative74.9%
associate-*l*75.0%
associate-*l*75.0%
fma-neg75.0%
Applied egg-rr75.0%
associate-*r*74.9%
times-frac68.7%
fma-udef68.7%
unsub-neg68.7%
*-commutative68.7%
*-commutative68.7%
associate-*l*68.7%
*-commutative68.7%
Simplified68.7%
Taylor expanded in c around 0 86.6%
Taylor expanded in x around 0 77.8%
if 2.9e10 < t Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*83.5%
*-commutative83.5%
associate-+l-83.5%
*-commutative83.5%
associate-*r*77.5%
*-commutative77.5%
associate-*l*77.5%
associate-*l*82.0%
Simplified82.0%
associate-+l-82.0%
div-sub72.7%
*-commutative72.7%
associate-*l*72.8%
associate-*l*72.8%
fma-neg72.8%
Applied egg-rr72.8%
associate-*r*72.7%
times-frac69.8%
fma-udef69.8%
unsub-neg69.8%
*-commutative69.8%
*-commutative69.8%
associate-*l*69.8%
*-commutative69.8%
Simplified69.8%
Taylor expanded in z around inf 50.4%
*-commutative50.4%
associate-*l/53.3%
*-commutative53.3%
Simplified53.3%
Final simplification73.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= t -2.8e+220)
(* -4.0 (/ a (/ c t)))
(if (<= t -1.45e+178)
(/ (/ (+ b (* y (* 9.0 x))) z) c)
(if (<= t -3.4e-119)
(/ (- (/ b z) (* 4.0 (* a t))) c)
(if (<= t 4.2e+22)
(/ (+ b (* 9.0 (* y x))) (* z c))
(* -4.0 (* t (/ a c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -2.8e+220) {
tmp = -4.0 * (a / (c / t));
} else if (t <= -1.45e+178) {
tmp = ((b + (y * (9.0 * x))) / z) / c;
} else if (t <= -3.4e-119) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 4.2e+22) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-2.8d+220)) then
tmp = (-4.0d0) * (a / (c / t))
else if (t <= (-1.45d+178)) then
tmp = ((b + (y * (9.0d0 * x))) / z) / c
else if (t <= (-3.4d-119)) then
tmp = ((b / z) - (4.0d0 * (a * t))) / c
else if (t <= 4.2d+22) then
tmp = (b + (9.0d0 * (y * x))) / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -2.8e+220) {
tmp = -4.0 * (a / (c / t));
} else if (t <= -1.45e+178) {
tmp = ((b + (y * (9.0 * x))) / z) / c;
} else if (t <= -3.4e-119) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else if (t <= 4.2e+22) {
tmp = (b + (9.0 * (y * x))) / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -2.8e+220: tmp = -4.0 * (a / (c / t)) elif t <= -1.45e+178: tmp = ((b + (y * (9.0 * x))) / z) / c elif t <= -3.4e-119: tmp = ((b / z) - (4.0 * (a * t))) / c elif t <= 4.2e+22: tmp = (b + (9.0 * (y * x))) / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -2.8e+220) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (t <= -1.45e+178) tmp = Float64(Float64(Float64(b + Float64(y * Float64(9.0 * x))) / z) / c); elseif (t <= -3.4e-119) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(a * t))) / c); elseif (t <= 4.2e+22) tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -2.8e+220)
tmp = -4.0 * (a / (c / t));
elseif (t <= -1.45e+178)
tmp = ((b + (y * (9.0 * x))) / z) / c;
elseif (t <= -3.4e-119)
tmp = ((b / z) - (4.0 * (a * t))) / c;
elseif (t <= 4.2e+22)
tmp = (b + (9.0 * (y * x))) / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -2.8e+220], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.45e+178], N[(N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -3.4e-119], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, 4.2e+22], N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.8 \cdot 10^{+220}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;t \leq -1.45 \cdot 10^{+178}:\\
\;\;\;\;\frac{\frac{b + y \cdot \left(9 \cdot x\right)}{z}}{c}\\
\mathbf{elif}\;t \leq -3.4 \cdot 10^{-119}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{elif}\;t \leq 4.2 \cdot 10^{+22}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -2.8000000000000001e220Initial program 52.5%
associate-+l-52.5%
*-commutative52.5%
associate-*r*57.7%
*-commutative57.7%
associate-+l-57.7%
*-commutative57.7%
associate-*r*52.5%
*-commutative52.5%
associate-*l*52.5%
associate-*l*57.8%
Simplified57.8%
Taylor expanded in z around inf 76.9%
*-commutative76.9%
associate-/l*81.2%
Simplified81.2%
if -2.8000000000000001e220 < t < -1.45e178Initial program 71.3%
associate-+l-71.3%
*-commutative71.3%
associate-*r*85.5%
*-commutative85.5%
associate-+l-85.5%
*-commutative85.5%
associate-*r*71.3%
*-commutative71.3%
associate-*l*71.3%
associate-*l*85.5%
Simplified85.5%
associate-+l-85.5%
div-sub71.2%
*-commutative71.2%
associate-*l*71.2%
associate-*l*71.2%
fma-neg71.2%
Applied egg-rr71.2%
associate-*r*71.2%
times-frac85.7%
fma-udef85.7%
unsub-neg85.7%
*-commutative85.7%
*-commutative85.7%
associate-*l*85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in c around 0 86.3%
Taylor expanded in z around 0 71.9%
associate-*r*71.9%
Simplified71.9%
if -1.45e178 < t < -3.40000000000000024e-119Initial program 73.7%
associate-+l-73.7%
*-commutative73.7%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
*-commutative75.2%
associate-*r*73.7%
*-commutative73.7%
associate-*l*73.7%
associate-*l*75.3%
Simplified75.3%
associate-+l-75.3%
div-sub74.9%
*-commutative74.9%
associate-*l*75.0%
associate-*l*75.0%
fma-neg75.0%
Applied egg-rr75.0%
associate-*r*74.9%
times-frac68.7%
fma-udef68.7%
unsub-neg68.7%
*-commutative68.7%
*-commutative68.7%
associate-*l*68.7%
*-commutative68.7%
Simplified68.7%
Taylor expanded in c around 0 86.6%
Taylor expanded in x around 0 77.8%
if -3.40000000000000024e-119 < t < 4.1999999999999996e22Initial program 88.1%
associate-+l-88.1%
*-commutative88.1%
associate-*r*82.5%
*-commutative82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*88.1%
*-commutative88.1%
associate-*l*88.2%
associate-*l*88.2%
Simplified88.2%
Taylor expanded in x around inf 81.8%
if 4.1999999999999996e22 < t Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*82.9%
*-commutative82.9%
associate-+l-82.9%
*-commutative82.9%
associate-*r*76.8%
*-commutative76.8%
associate-*l*76.8%
associate-*l*81.4%
Simplified81.4%
associate-+l-81.4%
div-sub71.9%
*-commutative71.9%
associate-*l*71.9%
associate-*l*71.9%
fma-neg71.9%
Applied egg-rr71.9%
associate-*r*71.9%
times-frac70.4%
fma-udef70.4%
unsub-neg70.4%
*-commutative70.4%
*-commutative70.4%
associate-*l*70.4%
*-commutative70.4%
Simplified70.4%
Taylor expanded in z around inf 51.9%
*-commutative51.9%
associate-*l/54.9%
*-commutative54.9%
Simplified54.9%
Final simplification73.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -5.7e+69) (not (<= z 1.85e-149))) (/ (+ (* a (* t -4.0)) (/ (- b (* x (* y -9.0))) z)) c) (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -5.7e+69) || !(z <= 1.85e-149)) {
tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((z <= (-5.7d+69)) .or. (.not. (z <= 1.85d-149))) then
tmp = ((a * (t * (-4.0d0))) + ((b - (x * (y * (-9.0d0)))) / z)) / c
else
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -5.7e+69) || !(z <= 1.85e-149)) {
tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -5.7e+69) or not (z <= 1.85e-149): tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c else: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -5.7e+69) || !(z <= 1.85e-149)) tmp = Float64(Float64(Float64(a * Float64(t * -4.0)) + Float64(Float64(b - Float64(x * Float64(y * -9.0))) / z)) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -5.7e+69) || ~((z <= 1.85e-149)))
tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c;
else
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -5.7e+69], N[Not[LessEqual[z, 1.85e-149]], $MachinePrecision]], N[(N[(N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b - N[(x * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -5.7 \cdot 10^{+69} \lor \neg \left(z \leq 1.85 \cdot 10^{-149}\right):\\
\;\;\;\;\frac{a \cdot \left(t \cdot -4\right) + \frac{b - x \cdot \left(y \cdot -9\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -5.7e69 or 1.84999999999999995e-149 < z Initial program 66.9%
associate-+l-66.9%
*-commutative66.9%
associate-*r*67.5%
*-commutative67.5%
associate-+l-67.5%
*-commutative67.5%
associate-*r*66.9%
*-commutative66.9%
associate-*l*66.9%
associate-*l*71.7%
Simplified71.7%
associate-+l-71.7%
div-sub70.3%
*-commutative70.3%
associate-*l*70.3%
associate-*l*70.3%
fma-neg70.3%
Applied egg-rr70.3%
associate-*r*70.3%
times-frac70.9%
fma-udef70.9%
unsub-neg70.9%
*-commutative70.9%
*-commutative70.9%
associate-*l*70.9%
*-commutative70.9%
Simplified70.9%
Taylor expanded in c around 0 91.2%
Taylor expanded in z around -inf 91.2%
mul-1-neg91.2%
unsub-neg91.2%
*-commutative91.2%
associate-*l*91.2%
neg-mul-191.2%
unsub-neg91.2%
*-commutative91.2%
associate-*l*91.2%
Simplified91.2%
if -5.7e69 < z < 1.84999999999999995e-149Initial program 94.7%
Final simplification92.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ (* 9.0 y) z) (/ x c))))
(if (<= (* 9.0 x) -1e+85)
(- t_1 (* 4.0 (* a (/ t c))))
(if (<= (* 9.0 x) 5000000000000.0)
(/ (- (/ b z) (* 4.0 (* a t))) c)
(+ t_1 (/ (/ b c) z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((9.0 * y) / z) * (x / c);
double tmp;
if ((9.0 * x) <= -1e+85) {
tmp = t_1 - (4.0 * (a * (t / c)));
} else if ((9.0 * x) <= 5000000000000.0) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else {
tmp = t_1 + ((b / c) / z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = ((9.0d0 * y) / z) * (x / c)
if ((9.0d0 * x) <= (-1d+85)) then
tmp = t_1 - (4.0d0 * (a * (t / c)))
else if ((9.0d0 * x) <= 5000000000000.0d0) then
tmp = ((b / z) - (4.0d0 * (a * t))) / c
else
tmp = t_1 + ((b / c) / z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((9.0 * y) / z) * (x / c);
double tmp;
if ((9.0 * x) <= -1e+85) {
tmp = t_1 - (4.0 * (a * (t / c)));
} else if ((9.0 * x) <= 5000000000000.0) {
tmp = ((b / z) - (4.0 * (a * t))) / c;
} else {
tmp = t_1 + ((b / c) / z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = ((9.0 * y) / z) * (x / c) tmp = 0 if (9.0 * x) <= -1e+85: tmp = t_1 - (4.0 * (a * (t / c))) elif (9.0 * x) <= 5000000000000.0: tmp = ((b / z) - (4.0 * (a * t))) / c else: tmp = t_1 + ((b / c) / z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)) tmp = 0.0 if (Float64(9.0 * x) <= -1e+85) tmp = Float64(t_1 - Float64(4.0 * Float64(a * Float64(t / c)))); elseif (Float64(9.0 * x) <= 5000000000000.0) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(a * t))) / c); else tmp = Float64(t_1 + Float64(Float64(b / c) / z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((9.0 * y) / z) * (x / c);
tmp = 0.0;
if ((9.0 * x) <= -1e+85)
tmp = t_1 - (4.0 * (a * (t / c)));
elseif ((9.0 * x) <= 5000000000000.0)
tmp = ((b / z) - (4.0 * (a * t))) / c;
else
tmp = t_1 + ((b / c) / z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(9.0 * x), $MachinePrecision], -1e+85], N[(t$95$1 - N[(4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(9.0 * x), $MachinePrecision], 5000000000000.0], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(t$95$1 + N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{9 \cdot y}{z} \cdot \frac{x}{c}\\
\mathbf{if}\;9 \cdot x \leq -1 \cdot 10^{+85}:\\
\;\;\;\;t\_1 - 4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;9 \cdot x \leq 5000000000000:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_1 + \frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 x 9) < -1e85Initial program 70.9%
associate-+l-70.9%
*-commutative70.9%
associate-*r*76.0%
*-commutative76.0%
associate-+l-76.0%
*-commutative76.0%
associate-*r*70.9%
*-commutative70.9%
associate-*l*70.9%
associate-*l*76.4%
Simplified76.4%
associate-+l-76.4%
div-sub62.9%
*-commutative62.9%
associate-*l*62.8%
associate-*l*62.8%
fma-neg62.8%
Applied egg-rr62.8%
associate-*r*62.9%
times-frac65.8%
fma-udef65.8%
unsub-neg65.8%
*-commutative65.8%
*-commutative65.8%
associate-*l*65.8%
*-commutative65.8%
Simplified65.8%
Taylor expanded in z around inf 71.5%
expm1-log1p-u57.6%
expm1-udef52.3%
associate-/l*52.3%
Applied egg-rr52.3%
expm1-def55.1%
expm1-log1p74.1%
associate-/l*71.5%
*-rgt-identity71.5%
associate-*r/71.5%
associate-*l*74.1%
associate-*r/74.1%
*-rgt-identity74.1%
Simplified74.1%
if -1e85 < (*.f64 x 9) < 5e12Initial program 81.9%
associate-+l-81.9%
*-commutative81.9%
associate-*r*82.5%
*-commutative82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*81.9%
*-commutative81.9%
associate-*l*81.9%
associate-*l*83.2%
Simplified83.2%
associate-+l-83.2%
div-sub78.0%
*-commutative78.0%
associate-*l*78.0%
associate-*l*78.0%
fma-neg78.0%
Applied egg-rr78.0%
associate-*r*78.0%
times-frac76.0%
fma-udef76.0%
unsub-neg76.0%
*-commutative76.0%
*-commutative76.0%
associate-*l*76.0%
*-commutative76.0%
Simplified76.0%
Taylor expanded in c around 0 88.1%
Taylor expanded in x around 0 75.9%
if 5e12 < (*.f64 x 9) Initial program 75.0%
associate-+l-75.0%
*-commutative75.0%
associate-*r*71.9%
*-commutative71.9%
associate-+l-71.9%
*-commutative71.9%
associate-*r*75.0%
*-commutative75.0%
associate-*l*75.1%
associate-*l*78.2%
Simplified78.2%
associate-+l-78.2%
div-sub75.0%
*-commutative75.0%
associate-*l*75.0%
associate-*l*75.0%
fma-neg75.0%
Applied egg-rr75.0%
associate-*r*75.0%
times-frac72.0%
fma-udef72.0%
unsub-neg72.0%
*-commutative72.0%
*-commutative72.0%
associate-*l*72.0%
*-commutative72.0%
Simplified72.0%
Taylor expanded in z around 0 57.9%
mul-1-neg57.9%
associate-/r*58.9%
distribute-neg-frac58.9%
Simplified58.9%
Final simplification71.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= t -3.05e+221) (- (* (/ (* 9.0 y) z) (/ x c)) (* 4.0 (* a (/ t c)))) (/ (+ (* a (* t -4.0)) (/ (- b (* x (* y -9.0))) z)) c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -3.05e+221) {
tmp = (((9.0 * y) / z) * (x / c)) - (4.0 * (a * (t / c)));
} else {
tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-3.05d+221)) then
tmp = (((9.0d0 * y) / z) * (x / c)) - (4.0d0 * (a * (t / c)))
else
tmp = ((a * (t * (-4.0d0))) + ((b - (x * (y * (-9.0d0)))) / z)) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -3.05e+221) {
tmp = (((9.0 * y) / z) * (x / c)) - (4.0 * (a * (t / c)));
} else {
tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -3.05e+221: tmp = (((9.0 * y) / z) * (x / c)) - (4.0 * (a * (t / c))) else: tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -3.05e+221) tmp = Float64(Float64(Float64(Float64(9.0 * y) / z) * Float64(x / c)) - Float64(4.0 * Float64(a * Float64(t / c)))); else tmp = Float64(Float64(Float64(a * Float64(t * -4.0)) + Float64(Float64(b - Float64(x * Float64(y * -9.0))) / z)) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -3.05e+221)
tmp = (((9.0 * y) / z) * (x / c)) - (4.0 * (a * (t / c)));
else
tmp = ((a * (t * -4.0)) + ((b - (x * (y * -9.0))) / z)) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -3.05e+221], N[(N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b - N[(x * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -3.05 \cdot 10^{+221}:\\
\;\;\;\;\frac{9 \cdot y}{z} \cdot \frac{x}{c} - 4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(t \cdot -4\right) + \frac{b - x \cdot \left(y \cdot -9\right)}{z}}{c}\\
\end{array}
\end{array}
if t < -3.0499999999999999e221Initial program 55.1%
associate-+l-55.1%
*-commutative55.1%
associate-*r*60.6%
*-commutative60.6%
associate-+l-60.6%
*-commutative60.6%
associate-*r*55.1%
*-commutative55.1%
associate-*l*55.1%
associate-*l*60.7%
Simplified60.7%
associate-+l-60.7%
div-sub55.7%
*-commutative55.7%
associate-*l*55.7%
associate-*l*55.7%
fma-neg55.7%
Applied egg-rr55.7%
associate-*r*55.7%
times-frac66.2%
fma-udef66.2%
unsub-neg66.2%
*-commutative66.2%
*-commutative66.2%
associate-*l*66.2%
*-commutative66.2%
Simplified66.2%
Taylor expanded in z around inf 90.4%
expm1-log1p-u58.5%
expm1-udef49.2%
associate-/l*53.4%
Applied egg-rr53.4%
expm1-def62.8%
expm1-log1p95.0%
associate-/l*90.4%
*-rgt-identity90.4%
associate-*r/90.4%
associate-*l*95.0%
associate-*r/95.0%
*-rgt-identity95.0%
Simplified95.0%
if -3.0499999999999999e221 < t Initial program 80.6%
associate-+l-80.6%
*-commutative80.6%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
*-commutative80.5%
associate-*r*80.6%
*-commutative80.6%
associate-*l*80.6%
associate-*l*82.7%
Simplified82.7%
associate-+l-82.7%
div-sub76.7%
*-commutative76.7%
associate-*l*76.7%
associate-*l*76.7%
fma-neg76.7%
Applied egg-rr76.7%
associate-*r*76.7%
times-frac74.2%
fma-udef74.2%
unsub-neg74.2%
*-commutative74.2%
*-commutative74.2%
associate-*l*74.2%
*-commutative74.2%
Simplified74.2%
Taylor expanded in c around 0 89.6%
Taylor expanded in z around -inf 90.0%
mul-1-neg90.0%
unsub-neg90.0%
*-commutative90.0%
associate-*l*90.0%
neg-mul-190.0%
unsub-neg90.0%
*-commutative90.0%
associate-*l*90.0%
Simplified90.0%
Final simplification90.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -2.05e-5) (not (<= t 3.3))) (* -4.0 (* t (/ a c))) (* b (/ (/ 1.0 z) c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.05e-5) || !(t <= 3.3)) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = b * ((1.0 / z) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((t <= (-2.05d-5)) .or. (.not. (t <= 3.3d0))) then
tmp = (-4.0d0) * (t * (a / c))
else
tmp = b * ((1.0d0 / z) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.05e-5) || !(t <= 3.3)) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = b * ((1.0 / z) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -2.05e-5) or not (t <= 3.3): tmp = -4.0 * (t * (a / c)) else: tmp = b * ((1.0 / z) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -2.05e-5) || !(t <= 3.3)) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); else tmp = Float64(b * Float64(Float64(1.0 / z) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -2.05e-5) || ~((t <= 3.3)))
tmp = -4.0 * (t * (a / c));
else
tmp = b * ((1.0 / z) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -2.05e-5], N[Not[LessEqual[t, 3.3]], $MachinePrecision]], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b * N[(N[(1.0 / z), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.05 \cdot 10^{-5} \lor \neg \left(t \leq 3.3\right):\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \frac{\frac{1}{z}}{c}\\
\end{array}
\end{array}
if t < -2.05000000000000002e-5 or 3.2999999999999998 < t Initial program 72.5%
associate-+l-72.5%
*-commutative72.5%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
*-commutative77.9%
associate-*r*72.5%
*-commutative72.5%
associate-*l*72.5%
associate-*l*77.1%
Simplified77.1%
associate-+l-77.1%
div-sub70.8%
*-commutative70.8%
associate-*l*70.8%
associate-*l*70.8%
fma-neg70.8%
Applied egg-rr70.8%
associate-*r*70.8%
times-frac66.5%
fma-udef66.5%
unsub-neg66.5%
*-commutative66.5%
*-commutative66.5%
associate-*l*66.5%
*-commutative66.5%
Simplified66.5%
Taylor expanded in z around inf 55.0%
*-commutative55.0%
associate-*l/57.2%
*-commutative57.2%
Simplified57.2%
if -2.05000000000000002e-5 < t < 3.2999999999999998Initial program 84.7%
associate-+l-84.7%
*-commutative84.7%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*84.7%
*-commutative84.7%
associate-*l*84.8%
associate-*l*84.8%
Simplified84.8%
Taylor expanded in b around inf 45.2%
*-commutative45.2%
Simplified45.2%
div-inv45.2%
*-commutative45.2%
Applied egg-rr45.2%
expm1-log1p-u29.3%
expm1-udef13.8%
*-commutative13.8%
Applied egg-rr13.8%
expm1-def29.3%
expm1-log1p45.2%
associate-/r*45.8%
Simplified45.8%
Final simplification51.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= t -1.8e-5) (* -4.0 (/ a (/ c t))) (if (<= t 0.72) (* b (/ (/ 1.0 z) c)) (* -4.0 (* t (/ a c))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.8e-5) {
tmp = -4.0 * (a / (c / t));
} else if (t <= 0.72) {
tmp = b * ((1.0 / z) / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-1.8d-5)) then
tmp = (-4.0d0) * (a / (c / t))
else if (t <= 0.72d0) then
tmp = b * ((1.0d0 / z) / c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.8e-5) {
tmp = -4.0 * (a / (c / t));
} else if (t <= 0.72) {
tmp = b * ((1.0 / z) / c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.8e-5: tmp = -4.0 * (a / (c / t)) elif t <= 0.72: tmp = b * ((1.0 / z) / c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.8e-5) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (t <= 0.72) tmp = Float64(b * Float64(Float64(1.0 / z) / c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.8e-5)
tmp = -4.0 * (a / (c / t));
elseif (t <= 0.72)
tmp = b * ((1.0 / z) / c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -1.8e-5], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 0.72], N[(b * N[(N[(1.0 / z), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.8 \cdot 10^{-5}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;t \leq 0.72:\\
\;\;\;\;b \cdot \frac{\frac{1}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if t < -1.80000000000000005e-5Initial program 66.8%
associate-+l-66.8%
*-commutative66.8%
associate-*r*71.7%
*-commutative71.7%
associate-+l-71.7%
*-commutative71.7%
associate-*r*66.8%
*-commutative66.8%
associate-*l*66.8%
associate-*l*71.7%
Simplified71.7%
Taylor expanded in z around inf 60.6%
*-commutative60.6%
associate-/l*64.4%
Simplified64.4%
if -1.80000000000000005e-5 < t < 0.71999999999999997Initial program 84.7%
associate-+l-84.7%
*-commutative84.7%
associate-*r*80.0%
*-commutative80.0%
associate-+l-80.0%
*-commutative80.0%
associate-*r*84.7%
*-commutative84.7%
associate-*l*84.8%
associate-*l*84.8%
Simplified84.8%
Taylor expanded in b around inf 45.2%
*-commutative45.2%
Simplified45.2%
div-inv45.2%
*-commutative45.2%
Applied egg-rr45.2%
expm1-log1p-u29.3%
expm1-udef13.8%
*-commutative13.8%
Applied egg-rr13.8%
expm1-def29.3%
expm1-log1p45.2%
associate-/r*45.8%
Simplified45.8%
if 0.71999999999999997 < t Initial program 77.8%
associate-+l-77.8%
*-commutative77.8%
associate-*r*83.7%
*-commutative83.7%
associate-+l-83.7%
*-commutative83.7%
associate-*r*77.8%
*-commutative77.8%
associate-*l*77.8%
associate-*l*82.2%
Simplified82.2%
associate-+l-82.2%
div-sub73.1%
*-commutative73.1%
associate-*l*73.2%
associate-*l*73.2%
fma-neg73.2%
Applied egg-rr73.2%
associate-*r*73.1%
times-frac68.8%
fma-udef68.8%
unsub-neg68.8%
*-commutative68.8%
*-commutative68.8%
associate-*l*68.8%
*-commutative68.8%
Simplified68.8%
Taylor expanded in z around inf 49.7%
*-commutative49.7%
associate-*l/52.5%
*-commutative52.5%
Simplified52.5%
Final simplification52.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= y 1.82e+31) (/ (/ b z) c) (/ b (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (y <= 1.82e+31) {
tmp = (b / z) / c;
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (y <= 1.82d+31) then
tmp = (b / z) / c
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (y <= 1.82e+31) {
tmp = (b / z) / c;
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if y <= 1.82e+31: tmp = (b / z) / c else: tmp = b / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (y <= 1.82e+31) tmp = Float64(Float64(b / z) / c); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (y <= 1.82e+31)
tmp = (b / z) / c;
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[y, 1.82e+31], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.82 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if y < 1.8200000000000001e31Initial program 78.0%
associate-+l-78.0%
*-commutative78.0%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
*-commutative77.9%
associate-*r*78.0%
*-commutative78.0%
associate-*l*78.0%
associate-*l*79.9%
Simplified79.9%
associate-+l-79.9%
div-sub73.7%
*-commutative73.7%
associate-*l*73.7%
associate-*l*73.7%
fma-neg73.7%
Applied egg-rr73.7%
associate-*r*73.7%
times-frac72.5%
fma-udef72.5%
unsub-neg72.5%
*-commutative72.5%
*-commutative72.5%
associate-*l*72.5%
*-commutative72.5%
Simplified72.5%
Taylor expanded in c around 0 87.9%
Taylor expanded in b around inf 35.9%
if 1.8200000000000001e31 < y Initial program 81.6%
associate-+l-81.6%
*-commutative81.6%
associate-*r*84.1%
*-commutative84.1%
associate-+l-84.1%
*-commutative84.1%
associate-*r*81.6%
*-commutative81.6%
associate-*l*81.6%
associate-*l*86.4%
Simplified86.4%
Taylor expanded in b around inf 32.8%
*-commutative32.8%
Simplified32.8%
Final simplification35.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (* b (/ 1.0 (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b * (1.0 / (z * c));
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b * (1.0d0 / (z * c))
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b * (1.0 / (z * c));
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b * (1.0 / (z * c))
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b * Float64(1.0 / Float64(z * c))) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b * (1.0 / (z * c));
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
b \cdot \frac{1}{z \cdot c}
\end{array}
Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*79.0%
*-commutative79.0%
associate-+l-79.0%
*-commutative79.0%
associate-*r*78.6%
*-commutative78.6%
associate-*l*78.6%
associate-*l*81.0%
Simplified81.0%
Taylor expanded in b around inf 34.1%
*-commutative34.1%
Simplified34.1%
div-inv35.2%
*-commutative35.2%
Applied egg-rr35.2%
Final simplification35.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (* b (/ (/ 1.0 c) z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b * ((1.0 / c) / z);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b * ((1.0d0 / c) / z)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b * ((1.0 / c) / z);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b * ((1.0 / c) / z)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b * Float64(Float64(1.0 / c) / z)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b * ((1.0 / c) / z);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b * N[(N[(1.0 / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
b \cdot \frac{\frac{1}{c}}{z}
\end{array}
Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*79.0%
*-commutative79.0%
associate-+l-79.0%
*-commutative79.0%
associate-*r*78.6%
*-commutative78.6%
associate-*l*78.6%
associate-*l*81.0%
Simplified81.0%
Taylor expanded in b around inf 34.1%
*-commutative34.1%
Simplified34.1%
div-inv35.2%
*-commutative35.2%
Applied egg-rr35.2%
expm1-log1p-u23.9%
expm1-udef12.8%
*-commutative12.8%
Applied egg-rr12.8%
expm1-def23.9%
expm1-log1p35.2%
*-commutative35.2%
associate-/r*35.5%
Simplified35.5%
Final simplification35.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (* b (/ (/ 1.0 z) c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b * ((1.0 / z) / c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b * ((1.0d0 / z) / c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b * ((1.0 / z) / c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b * ((1.0 / z) / c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b * Float64(Float64(1.0 / z) / c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b * ((1.0 / z) / c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b * N[(N[(1.0 / z), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
b \cdot \frac{\frac{1}{z}}{c}
\end{array}
Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*79.0%
*-commutative79.0%
associate-+l-79.0%
*-commutative79.0%
associate-*r*78.6%
*-commutative78.6%
associate-*l*78.6%
associate-*l*81.0%
Simplified81.0%
Taylor expanded in b around inf 34.1%
*-commutative34.1%
Simplified34.1%
div-inv35.2%
*-commutative35.2%
Applied egg-rr35.2%
expm1-log1p-u23.9%
expm1-udef12.8%
*-commutative12.8%
Applied egg-rr12.8%
expm1-def23.9%
expm1-log1p35.2%
associate-/r*35.5%
Simplified35.5%
Final simplification35.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*79.0%
*-commutative79.0%
associate-+l-79.0%
*-commutative79.0%
associate-*r*78.6%
*-commutative78.6%
associate-*l*78.6%
associate-*l*81.0%
Simplified81.0%
Taylor expanded in b around inf 34.1%
*-commutative34.1%
Simplified34.1%
Final simplification34.1%
(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 2024039
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:herbie-target
(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)))