
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -8.4e-13) (not (<= z 1.7e+32))) (* (fma -4.0 (* a t) (fma 9.0 (* x (/ y z)) (/ b z))) (/ 1.0 c)) (/ (- b (- (* a (* t (* z 4.0))) (* y (* 9.0 x)))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8.4e-13) || !(z <= 1.7e+32)) {
tmp = fma(-4.0, (a * t), fma(9.0, (x * (y / z)), (b / z))) * (1.0 / c);
} else {
tmp = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
}
return tmp;
}
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -8.4e-13) || !(z <= 1.7e+32)) tmp = Float64(fma(-4.0, Float64(a * t), fma(9.0, Float64(x * Float64(y / z)), Float64(b / z))) * Float64(1.0 / c)); else tmp = Float64(Float64(b - Float64(Float64(a * Float64(t * Float64(z * 4.0))) - Float64(y * Float64(9.0 * x)))) / Float64(z * c)); end return tmp end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -8.4e-13], N[Not[LessEqual[z, 1.7e+32]], $MachinePrecision]], N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(9.0 * N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision], N[(N[(b - N[(N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8.4 \cdot 10^{-13} \lor \neg \left(z \leq 1.7 \cdot 10^{+32}\right):\\
\;\;\;\;\mathsf{fma}\left(-4, a \cdot t, \mathsf{fma}\left(9, x \cdot \frac{y}{z}, \frac{b}{z}\right)\right) \cdot \frac{1}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b - \left(a \cdot \left(t \cdot \left(z \cdot 4\right)\right) - y \cdot \left(9 \cdot x\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -8.39999999999999955e-13 or 1.69999999999999989e32 < z Initial program 63.1%
associate-+l-63.1%
*-commutative63.1%
associate-*r*60.0%
*-commutative60.0%
associate-+l-60.0%
Simplified63.3%
associate-/r*76.7%
div-inv76.6%
associate-+l-76.6%
associate-*r*72.0%
associate-+l-72.0%
associate-*l*72.0%
associate-*r*76.6%
Applied egg-rr76.6%
Taylor expanded in x around 0 91.1%
cancel-sign-sub-inv91.1%
metadata-eval91.1%
+-commutative91.1%
fma-def91.1%
fma-def91.1%
associate-*r/93.4%
Simplified93.4%
if -8.39999999999999955e-13 < z < 1.69999999999999989e32Initial program 96.2%
Final simplification94.8%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (- b (- (* a (* t (* z 4.0))) (* y (* 9.0 x)))) (* z c))))
(if (<= t_1 -2e-111)
t_1
(if (<= t_1 0.0)
(* (/ (- (- (* (* a t) (* z 4.0)) (* x (* 9.0 y))) b) c) (/ -1.0 z))
(if (<= t_1 INFINITY) t_1 (* -4.0 (/ a (/ c t))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
double tmp;
if (t_1 <= -2e-111) {
tmp = t_1;
} else if (t_1 <= 0.0) {
tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / c) * (-1.0 / z);
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = -4.0 * (a / (c / t));
}
return tmp;
}
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
double tmp;
if (t_1 <= -2e-111) {
tmp = t_1;
} else if (t_1 <= 0.0) {
tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / c) * (-1.0 / z);
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_1;
} else {
tmp = -4.0 * (a / (c / t));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c) tmp = 0 if t_1 <= -2e-111: tmp = t_1 elif t_1 <= 0.0: tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / c) * (-1.0 / z) elif t_1 <= math.inf: tmp = t_1 else: tmp = -4.0 * (a / (c / t)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b - Float64(Float64(a * Float64(t * Float64(z * 4.0))) - Float64(y * Float64(9.0 * x)))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -2e-111) tmp = t_1; elseif (t_1 <= 0.0) tmp = Float64(Float64(Float64(Float64(Float64(Float64(a * t) * Float64(z * 4.0)) - Float64(x * Float64(9.0 * y))) - b) / c) * Float64(-1.0 / z)); elseif (t_1 <= Inf) tmp = t_1; else tmp = Float64(-4.0 * Float64(a / Float64(c / t))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
tmp = 0.0;
if (t_1 <= -2e-111)
tmp = t_1;
elseif (t_1 <= 0.0)
tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / c) * (-1.0 / z);
elseif (t_1 <= Inf)
tmp = t_1;
else
tmp = -4.0 * (a / (c / t));
end
tmp_2 = tmp;
end
NOTE: t and a 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[(N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-111], t$95$1, If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[(N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision] - N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision] / c), $MachinePrecision] * N[(-1.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$1, N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{b - \left(a \cdot \left(t \cdot \left(z \cdot 4\right)\right) - y \cdot \left(9 \cdot x\right)\right)}{z \cdot c}\\
\mathbf{if}\;t_1 \leq -2 \cdot 10^{-111}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t_1 \leq 0:\\
\;\;\;\;\frac{\left(\left(a \cdot t\right) \cdot \left(z \cdot 4\right) - x \cdot \left(9 \cdot y\right)\right) - b}{c} \cdot \frac{-1}{z}\\
\mathbf{elif}\;t_1 \leq \infty:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -2.00000000000000018e-111 or 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < +inf.0Initial program 92.0%
if -2.00000000000000018e-111 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < 0.0Initial program 36.5%
associate-+l-36.5%
*-commutative36.5%
associate-*r*30.1%
*-commutative30.1%
associate-+l-30.1%
Simplified36.5%
*-un-lft-identity36.5%
times-frac99.8%
associate-+l-99.8%
associate-*r*99.7%
associate-+l-99.7%
associate-*l*99.7%
associate-*r*99.8%
Applied egg-rr99.8%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-+l-0.0%
*-commutative0.0%
associate-*r*1.1%
*-commutative1.1%
associate-+l-1.1%
Simplified1.1%
Taylor expanded in z around inf 68.7%
*-commutative68.7%
associate-/l*85.7%
Simplified85.7%
Final simplification92.0%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= c -0.086) (not (<= c 3e-148))) (+ (* -4.0 (/ (* a t) c)) (/ (- (/ b c) (* -9.0 (* x (/ y c)))) z)) (* (/ (- (- (* (* a t) (* z 4.0)) (* x (* 9.0 y))) b) z) (/ -1.0 c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((c <= -0.086) || !(c <= 3e-148)) {
tmp = (-4.0 * ((a * t) / c)) + (((b / c) - (-9.0 * (x * (y / c)))) / z);
} else {
tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / z) * (-1.0 / c);
}
return tmp;
}
NOTE: t and a 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 ((c <= (-0.086d0)) .or. (.not. (c <= 3d-148))) then
tmp = ((-4.0d0) * ((a * t) / c)) + (((b / c) - ((-9.0d0) * (x * (y / c)))) / z)
else
tmp = (((((a * t) * (z * 4.0d0)) - (x * (9.0d0 * y))) - b) / z) * ((-1.0d0) / c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((c <= -0.086) || !(c <= 3e-148)) {
tmp = (-4.0 * ((a * t) / c)) + (((b / c) - (-9.0 * (x * (y / c)))) / z);
} else {
tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / z) * (-1.0 / c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (c <= -0.086) or not (c <= 3e-148): tmp = (-4.0 * ((a * t) / c)) + (((b / c) - (-9.0 * (x * (y / c)))) / z) else: tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / z) * (-1.0 / c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((c <= -0.086) || !(c <= 3e-148)) tmp = Float64(Float64(-4.0 * Float64(Float64(a * t) / c)) + Float64(Float64(Float64(b / c) - Float64(-9.0 * Float64(x * Float64(y / c)))) / z)); else tmp = Float64(Float64(Float64(Float64(Float64(Float64(a * t) * Float64(z * 4.0)) - Float64(x * Float64(9.0 * y))) - b) / z) * Float64(-1.0 / c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((c <= -0.086) || ~((c <= 3e-148)))
tmp = (-4.0 * ((a * t) / c)) + (((b / c) - (-9.0 * (x * (y / c)))) / z);
else
tmp = (((((a * t) * (z * 4.0)) - (x * (9.0 * y))) - b) / z) * (-1.0 / c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[c, -0.086], N[Not[LessEqual[c, 3e-148]], $MachinePrecision]], N[(N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(b / c), $MachinePrecision] - N[(-9.0 * N[(x * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision] - N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision] / z), $MachinePrecision] * N[(-1.0 / c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;c \leq -0.086 \lor \neg \left(c \leq 3 \cdot 10^{-148}\right):\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c} + \frac{\frac{b}{c} - -9 \cdot \left(x \cdot \frac{y}{c}\right)}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\left(a \cdot t\right) \cdot \left(z \cdot 4\right) - x \cdot \left(9 \cdot y\right)\right) - b}{z} \cdot \frac{-1}{c}\\
\end{array}
\end{array}
if c < -0.085999999999999993 or 2.99999999999999998e-148 < c Initial program 68.5%
associate-+l-68.5%
*-commutative68.5%
associate-*r*67.9%
*-commutative67.9%
associate-+l-67.9%
Simplified65.4%
associate-/r*71.1%
div-inv71.0%
associate-+l-71.0%
associate-*r*68.3%
associate-+l-68.3%
associate-*l*68.3%
associate-*r*71.0%
Applied egg-rr71.0%
Taylor expanded in x around 0 80.3%
cancel-sign-sub-inv80.3%
metadata-eval80.3%
+-commutative80.3%
fma-def80.3%
fma-def80.2%
associate-*r/80.8%
Simplified80.8%
Taylor expanded in z around -inf 85.9%
associate-*l/90.4%
mul-1-neg90.4%
unsub-neg90.4%
associate-*l/85.9%
mul-1-neg85.9%
unsub-neg85.9%
*-rgt-identity85.9%
associate-*r/85.9%
associate-*l*88.3%
associate-*r/88.3%
*-rgt-identity88.3%
Simplified88.3%
if -0.085999999999999993 < c < 2.99999999999999998e-148Initial program 94.9%
associate-+l-94.9%
*-commutative94.9%
associate-*r*93.3%
*-commutative93.3%
associate-+l-93.3%
Simplified95.8%
associate-/r*96.6%
div-inv96.6%
associate-+l-96.6%
associate-*r*94.9%
associate-+l-94.9%
associate-*l*94.9%
associate-*r*96.5%
Applied egg-rr96.5%
Final simplification91.9%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (/ (* x y) (* z c)))))
(if (<= b -5.2e+139)
(/ b (* z c))
(if (<= b -4.6e+17)
t_1
(if (<= b -7.8e-174)
(* -4.0 (/ t (/ c a)))
(if (<= b -4.8e-229)
(* y (/ 9.0 (/ c (/ x z))))
(if (<= b 8.4e-216)
(* -4.0 (* t (/ a c)))
(if (<= b 0.006)
t_1
(if (<= b 3.5e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * y) / (z * c));
double tmp;
if (b <= -5.2e+139) {
tmp = b / (z * c);
} else if (b <= -4.6e+17) {
tmp = t_1;
} else if (b <= -7.8e-174) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -4.8e-229) {
tmp = y * (9.0 / (c / (x / z)));
} else if (b <= 8.4e-216) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.006) {
tmp = t_1;
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x * y) / (z * c))
if (b <= (-5.2d+139)) then
tmp = b / (z * c)
else if (b <= (-4.6d+17)) then
tmp = t_1
else if (b <= (-7.8d-174)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-4.8d-229)) then
tmp = y * (9.0d0 / (c / (x / z)))
else if (b <= 8.4d-216) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.006d0) then
tmp = t_1
else if (b <= 3.5d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * y) / (z * c));
double tmp;
if (b <= -5.2e+139) {
tmp = b / (z * c);
} else if (b <= -4.6e+17) {
tmp = t_1;
} else if (b <= -7.8e-174) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -4.8e-229) {
tmp = y * (9.0 / (c / (x / z)));
} else if (b <= 8.4e-216) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.006) {
tmp = t_1;
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x * y) / (z * c)) tmp = 0 if b <= -5.2e+139: tmp = b / (z * c) elif b <= -4.6e+17: tmp = t_1 elif b <= -7.8e-174: tmp = -4.0 * (t / (c / a)) elif b <= -4.8e-229: tmp = y * (9.0 / (c / (x / z))) elif b <= 8.4e-216: tmp = -4.0 * (t * (a / c)) elif b <= 0.006: tmp = t_1 elif b <= 3.5e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))) tmp = 0.0 if (b <= -5.2e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -4.6e+17) tmp = t_1; elseif (b <= -7.8e-174) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -4.8e-229) tmp = Float64(y * Float64(9.0 / Float64(c / Float64(x / z)))); elseif (b <= 8.4e-216) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.006) tmp = t_1; elseif (b <= 3.5e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x * y) / (z * c));
tmp = 0.0;
if (b <= -5.2e+139)
tmp = b / (z * c);
elseif (b <= -4.6e+17)
tmp = t_1;
elseif (b <= -7.8e-174)
tmp = -4.0 * (t / (c / a));
elseif (b <= -4.8e-229)
tmp = y * (9.0 / (c / (x / z)));
elseif (b <= 8.4e-216)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.006)
tmp = t_1;
elseif (b <= 3.5e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a 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 * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -5.2e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.6e+17], t$95$1, If[LessEqual[b, -7.8e-174], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.8e-229], N[(y * N[(9.0 / N[(c / N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 8.4e-216], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.006], t$95$1, If[LessEqual[b, 3.5e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{if}\;b \leq -5.2 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -4.6 \cdot 10^{+17}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -7.8 \cdot 10^{-174}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -4.8 \cdot 10^{-229}:\\
\;\;\;\;y \cdot \frac{9}{\frac{c}{\frac{x}{z}}}\\
\mathbf{elif}\;b \leq 8.4 \cdot 10^{-216}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.006:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -5.20000000000000044e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -5.20000000000000044e139 < b < -4.6e17 or 8.4000000000000006e-216 < b < 0.0060000000000000001Initial program 87.7%
associate-+l-87.7%
*-commutative87.7%
associate-*r*86.0%
*-commutative86.0%
associate-+l-86.0%
Simplified87.9%
Taylor expanded in x around inf 66.5%
if -4.6e17 < b < -7.7999999999999997e-174Initial program 72.4%
associate-+l-72.4%
*-commutative72.4%
associate-*r*75.4%
*-commutative75.4%
associate-+l-75.4%
Simplified75.4%
associate-/r*75.7%
div-inv75.7%
associate-+l-75.7%
associate-*r*70.2%
associate-+l-70.2%
associate-*l*70.1%
associate-*r*75.6%
Applied egg-rr75.6%
Taylor expanded in z around inf 62.0%
*-commutative62.0%
associate-/l*64.7%
Simplified64.7%
if -7.7999999999999997e-174 < b < -4.8e-229Initial program 83.4%
associate-+l-83.4%
*-commutative83.4%
associate-*r*83.5%
*-commutative83.5%
associate-+l-83.5%
Simplified83.5%
associate-/r*88.6%
div-inv88.6%
associate-+l-88.6%
associate-*r*88.6%
associate-+l-88.6%
associate-*l*88.6%
associate-*r*88.7%
Applied egg-rr88.7%
Taylor expanded in x around 0 88.6%
cancel-sign-sub-inv88.6%
metadata-eval88.6%
+-commutative88.6%
fma-def88.6%
fma-def88.6%
associate-*r/83.2%
Simplified83.2%
Taylor expanded in z around -inf 74.7%
associate-*l/75.0%
mul-1-neg75.0%
unsub-neg75.0%
associate-*l/74.7%
mul-1-neg74.7%
unsub-neg74.7%
*-rgt-identity74.7%
associate-*r/74.7%
associate-*l*78.0%
associate-*r/78.0%
*-rgt-identity78.0%
Simplified78.0%
Taylor expanded in x around inf 48.6%
*-commutative48.6%
times-frac59.2%
associate-*l*59.2%
*-commutative59.2%
associate-*r/53.9%
associate-*l/59.1%
*-commutative59.1%
*-commutative59.1%
associate-/l*59.4%
Simplified59.4%
if -4.8e-229 < b < 8.4000000000000006e-216Initial program 76.7%
associate-+l-76.7%
*-commutative76.7%
associate-*r*70.9%
*-commutative70.9%
associate-+l-70.9%
Simplified65.6%
Taylor expanded in z around inf 56.1%
*-commutative56.1%
associate-/l*67.1%
Simplified67.1%
associate-/r/62.0%
Applied egg-rr62.0%
if 0.0060000000000000001 < b < 3.4999999999999999e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.4999999999999999e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification66.4%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= b -5.5e+139)
(/ b (* z c))
(if (<= b -7.8e+20)
(* (* x (/ y z)) (/ 9.0 c))
(if (<= b -4.2e-174)
(* -4.0 (/ t (/ c a)))
(if (<= b -4.4e-229)
(* y (/ 9.0 (/ c (/ x z))))
(if (<= b 5.6e-215)
(* -4.0 (* t (/ a c)))
(if (<= b 0.0046)
(* 9.0 (/ (* x y) (* z c)))
(if (<= b 3.5e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z)))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -5.5e+139) {
tmp = b / (z * c);
} else if (b <= -7.8e+20) {
tmp = (x * (y / z)) * (9.0 / c);
} else if (b <= -4.2e-174) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -4.4e-229) {
tmp = y * (9.0 / (c / (x / z)));
} else if (b <= 5.6e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.0046) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 (b <= (-5.5d+139)) then
tmp = b / (z * c)
else if (b <= (-7.8d+20)) then
tmp = (x * (y / z)) * (9.0d0 / c)
else if (b <= (-4.2d-174)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-4.4d-229)) then
tmp = y * (9.0d0 / (c / (x / z)))
else if (b <= 5.6d-215) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.0046d0) then
tmp = 9.0d0 * ((x * y) / (z * c))
else if (b <= 3.5d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -5.5e+139) {
tmp = b / (z * c);
} else if (b <= -7.8e+20) {
tmp = (x * (y / z)) * (9.0 / c);
} else if (b <= -4.2e-174) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -4.4e-229) {
tmp = y * (9.0 / (c / (x / z)));
} else if (b <= 5.6e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.0046) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -5.5e+139: tmp = b / (z * c) elif b <= -7.8e+20: tmp = (x * (y / z)) * (9.0 / c) elif b <= -4.2e-174: tmp = -4.0 * (t / (c / a)) elif b <= -4.4e-229: tmp = y * (9.0 / (c / (x / z))) elif b <= 5.6e-215: tmp = -4.0 * (t * (a / c)) elif b <= 0.0046: tmp = 9.0 * ((x * y) / (z * c)) elif b <= 3.5e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -5.5e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -7.8e+20) tmp = Float64(Float64(x * Float64(y / z)) * Float64(9.0 / c)); elseif (b <= -4.2e-174) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -4.4e-229) tmp = Float64(y * Float64(9.0 / Float64(c / Float64(x / z)))); elseif (b <= 5.6e-215) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.0046) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))); elseif (b <= 3.5e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -5.5e+139)
tmp = b / (z * c);
elseif (b <= -7.8e+20)
tmp = (x * (y / z)) * (9.0 / c);
elseif (b <= -4.2e-174)
tmp = -4.0 * (t / (c / a));
elseif (b <= -4.4e-229)
tmp = y * (9.0 / (c / (x / z)));
elseif (b <= 5.6e-215)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.0046)
tmp = 9.0 * ((x * y) / (z * c));
elseif (b <= 3.5e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -5.5e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -7.8e+20], N[(N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision] * N[(9.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.2e-174], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.4e-229], N[(y * N[(9.0 / N[(c / N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5.6e-215], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.0046], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.5e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -5.5 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -7.8 \cdot 10^{+20}:\\
\;\;\;\;\left(x \cdot \frac{y}{z}\right) \cdot \frac{9}{c}\\
\mathbf{elif}\;b \leq -4.2 \cdot 10^{-174}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -4.4 \cdot 10^{-229}:\\
\;\;\;\;y \cdot \frac{9}{\frac{c}{\frac{x}{z}}}\\
\mathbf{elif}\;b \leq 5.6 \cdot 10^{-215}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.0046:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -5.4999999999999996e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -5.4999999999999996e139 < b < -7.8e20Initial program 95.4%
associate-+l-95.4%
*-commutative95.4%
associate-*r*95.8%
*-commutative95.8%
associate-+l-95.8%
Simplified95.8%
associate-/r*99.7%
div-inv99.7%
associate-+l-99.7%
associate-*r*95.3%
associate-+l-95.3%
associate-*l*95.2%
associate-*r*99.6%
Applied egg-rr99.6%
Taylor expanded in x around inf 63.6%
associate-*r/63.6%
*-commutative63.6%
*-commutative63.6%
times-frac63.6%
associate-*r/63.6%
Simplified63.6%
if -7.8e20 < b < -4.20000000000000021e-174Initial program 72.4%
associate-+l-72.4%
*-commutative72.4%
associate-*r*75.4%
*-commutative75.4%
associate-+l-75.4%
Simplified75.4%
associate-/r*75.7%
div-inv75.7%
associate-+l-75.7%
associate-*r*70.2%
associate-+l-70.2%
associate-*l*70.1%
associate-*r*75.6%
Applied egg-rr75.6%
Taylor expanded in z around inf 62.0%
*-commutative62.0%
associate-/l*64.7%
Simplified64.7%
if -4.20000000000000021e-174 < b < -4.3999999999999998e-229Initial program 83.4%
associate-+l-83.4%
*-commutative83.4%
associate-*r*83.5%
*-commutative83.5%
associate-+l-83.5%
Simplified83.5%
associate-/r*88.6%
div-inv88.6%
associate-+l-88.6%
associate-*r*88.6%
associate-+l-88.6%
associate-*l*88.6%
associate-*r*88.7%
Applied egg-rr88.7%
Taylor expanded in x around 0 88.6%
cancel-sign-sub-inv88.6%
metadata-eval88.6%
+-commutative88.6%
fma-def88.6%
fma-def88.6%
associate-*r/83.2%
Simplified83.2%
Taylor expanded in z around -inf 74.7%
associate-*l/75.0%
mul-1-neg75.0%
unsub-neg75.0%
associate-*l/74.7%
mul-1-neg74.7%
unsub-neg74.7%
*-rgt-identity74.7%
associate-*r/74.7%
associate-*l*78.0%
associate-*r/78.0%
*-rgt-identity78.0%
Simplified78.0%
Taylor expanded in x around inf 48.6%
*-commutative48.6%
times-frac59.2%
associate-*l*59.2%
*-commutative59.2%
associate-*r/53.9%
associate-*l/59.1%
*-commutative59.1%
*-commutative59.1%
associate-/l*59.4%
Simplified59.4%
if -4.3999999999999998e-229 < b < 5.59999999999999972e-215Initial program 76.7%
associate-+l-76.7%
*-commutative76.7%
associate-*r*70.9%
*-commutative70.9%
associate-+l-70.9%
Simplified65.6%
Taylor expanded in z around inf 56.1%
*-commutative56.1%
associate-/l*67.1%
Simplified67.1%
associate-/r/62.0%
Applied egg-rr62.0%
if 5.59999999999999972e-215 < b < 0.0045999999999999999Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*79.3%
*-commutative79.3%
associate-+l-79.3%
Simplified82.5%
Taylor expanded in x around inf 68.6%
if 0.0045999999999999999 < b < 3.4999999999999999e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.4999999999999999e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification66.4%
NOTE: t and a 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 z) (/ x (/ c y)))))
(if (<= b -4.7e+139)
(/ b (* z c))
(if (<= b -9.6e+18)
t_1
(if (<= b -2.3e-177)
(* -4.0 (/ t (/ c a)))
(if (<= b -2.7e-191)
t_1
(if (<= b 4.35e-215)
(* -4.0 (* t (/ a c)))
(if (<= b 0.029)
(* 9.0 (/ (* x y) (* z c)))
(if (<= b 3.6e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 / z) * (x / (c / y));
double tmp;
if (b <= -4.7e+139) {
tmp = b / (z * c);
} else if (b <= -9.6e+18) {
tmp = t_1;
} else if (b <= -2.3e-177) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -2.7e-191) {
tmp = t_1;
} else if (b <= 4.35e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.029) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (b <= 3.6e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 / z) * (x / (c / y))
if (b <= (-4.7d+139)) then
tmp = b / (z * c)
else if (b <= (-9.6d+18)) then
tmp = t_1
else if (b <= (-2.3d-177)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-2.7d-191)) then
tmp = t_1
else if (b <= 4.35d-215) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.029d0) then
tmp = 9.0d0 * ((x * y) / (z * c))
else if (b <= 3.6d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 / z) * (x / (c / y));
double tmp;
if (b <= -4.7e+139) {
tmp = b / (z * c);
} else if (b <= -9.6e+18) {
tmp = t_1;
} else if (b <= -2.3e-177) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -2.7e-191) {
tmp = t_1;
} else if (b <= 4.35e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.029) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (b <= 3.6e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (9.0 / z) * (x / (c / y)) tmp = 0 if b <= -4.7e+139: tmp = b / (z * c) elif b <= -9.6e+18: tmp = t_1 elif b <= -2.3e-177: tmp = -4.0 * (t / (c / a)) elif b <= -2.7e-191: tmp = t_1 elif b <= 4.35e-215: tmp = -4.0 * (t * (a / c)) elif b <= 0.029: tmp = 9.0 * ((x * y) / (z * c)) elif b <= 3.6e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 / z) * Float64(x / Float64(c / y))) tmp = 0.0 if (b <= -4.7e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -9.6e+18) tmp = t_1; elseif (b <= -2.3e-177) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -2.7e-191) tmp = t_1; elseif (b <= 4.35e-215) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.029) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))); elseif (b <= 3.6e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (9.0 / z) * (x / (c / y));
tmp = 0.0;
if (b <= -4.7e+139)
tmp = b / (z * c);
elseif (b <= -9.6e+18)
tmp = t_1;
elseif (b <= -2.3e-177)
tmp = -4.0 * (t / (c / a));
elseif (b <= -2.7e-191)
tmp = t_1;
elseif (b <= 4.35e-215)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.029)
tmp = 9.0 * ((x * y) / (z * c));
elseif (b <= 3.6e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 / z), $MachinePrecision] * N[(x / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -4.7e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -9.6e+18], t$95$1, If[LessEqual[b, -2.3e-177], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -2.7e-191], t$95$1, If[LessEqual[b, 4.35e-215], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.029], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.6e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{9}{z} \cdot \frac{x}{\frac{c}{y}}\\
\mathbf{if}\;b \leq -4.7 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -9.6 \cdot 10^{+18}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -2.3 \cdot 10^{-177}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -2.7 \cdot 10^{-191}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 4.35 \cdot 10^{-215}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.029:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;b \leq 3.6 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -4.7000000000000001e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -4.7000000000000001e139 < b < -9.6e18 or -2.30000000000000022e-177 < b < -2.69999999999999999e-191Initial program 90.0%
associate-+l-90.0%
*-commutative90.0%
associate-*r*90.3%
*-commutative90.3%
associate-+l-90.3%
Simplified90.3%
associate-/r*96.4%
div-inv96.4%
associate-+l-96.4%
associate-*r*93.2%
associate-+l-93.2%
associate-*l*93.1%
associate-*r*96.3%
Applied egg-rr96.3%
Taylor expanded in x around inf 63.5%
associate-*r/63.5%
*-commutative63.5%
times-frac66.6%
associate-/l*69.8%
Simplified69.8%
if -9.6e18 < b < -2.30000000000000022e-177Initial program 73.8%
associate-+l-73.8%
*-commutative73.8%
associate-*r*76.7%
*-commutative76.7%
associate-+l-76.7%
Simplified76.7%
associate-/r*77.0%
div-inv76.9%
associate-+l-76.9%
associate-*r*71.7%
associate-+l-71.7%
associate-*l*71.6%
associate-*r*76.8%
Applied egg-rr76.8%
Taylor expanded in z around inf 61.4%
*-commutative61.4%
associate-/l*64.0%
Simplified64.0%
if -2.69999999999999999e-191 < b < 4.35000000000000009e-215Initial program 78.8%
associate-+l-78.8%
*-commutative78.8%
associate-*r*74.2%
*-commutative74.2%
associate-+l-74.2%
Simplified69.9%
Taylor expanded in z around inf 53.1%
*-commutative53.1%
associate-/l*62.0%
Simplified62.0%
associate-/r/57.9%
Applied egg-rr57.9%
if 4.35000000000000009e-215 < b < 0.0290000000000000015Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*79.3%
*-commutative79.3%
associate-+l-79.3%
Simplified82.5%
Taylor expanded in x around inf 68.6%
if 0.0290000000000000015 < b < 3.59999999999999991e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.59999999999999991e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification66.6%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ x z) (/ 9.0 (/ c y)))))
(if (<= b -1.22e+140)
(/ b (* z c))
(if (<= b -4.5e+17)
t_1
(if (<= b -8e-178)
(* -4.0 (/ t (/ c a)))
(if (<= b -3.5e-193)
t_1
(if (<= b 5.6e-215)
(* -4.0 (* t (/ a c)))
(if (<= b 0.065)
(* 9.0 (/ (* x y) (* z c)))
(if (<= b 3.5e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -1.22e+140) {
tmp = b / (z * c);
} else if (b <= -4.5e+17) {
tmp = t_1;
} else if (b <= -8e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -3.5e-193) {
tmp = t_1;
} else if (b <= 5.6e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.065) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 = (x / z) * (9.0d0 / (c / y))
if (b <= (-1.22d+140)) then
tmp = b / (z * c)
else if (b <= (-4.5d+17)) then
tmp = t_1
else if (b <= (-8d-178)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-3.5d-193)) then
tmp = t_1
else if (b <= 5.6d-215) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.065d0) then
tmp = 9.0d0 * ((x * y) / (z * c))
else if (b <= 3.5d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -1.22e+140) {
tmp = b / (z * c);
} else if (b <= -4.5e+17) {
tmp = t_1;
} else if (b <= -8e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -3.5e-193) {
tmp = t_1;
} else if (b <= 5.6e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.065) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (x / z) * (9.0 / (c / y)) tmp = 0 if b <= -1.22e+140: tmp = b / (z * c) elif b <= -4.5e+17: tmp = t_1 elif b <= -8e-178: tmp = -4.0 * (t / (c / a)) elif b <= -3.5e-193: tmp = t_1 elif b <= 5.6e-215: tmp = -4.0 * (t * (a / c)) elif b <= 0.065: tmp = 9.0 * ((x * y) / (z * c)) elif b <= 3.5e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x / z) * Float64(9.0 / Float64(c / y))) tmp = 0.0 if (b <= -1.22e+140) tmp = Float64(b / Float64(z * c)); elseif (b <= -4.5e+17) tmp = t_1; elseif (b <= -8e-178) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -3.5e-193) tmp = t_1; elseif (b <= 5.6e-215) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.065) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))); elseif (b <= 3.5e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (x / z) * (9.0 / (c / y));
tmp = 0.0;
if (b <= -1.22e+140)
tmp = b / (z * c);
elseif (b <= -4.5e+17)
tmp = t_1;
elseif (b <= -8e-178)
tmp = -4.0 * (t / (c / a));
elseif (b <= -3.5e-193)
tmp = t_1;
elseif (b <= 5.6e-215)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.065)
tmp = 9.0 * ((x * y) / (z * c));
elseif (b <= 3.5e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x / z), $MachinePrecision] * N[(9.0 / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.22e+140], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.5e+17], t$95$1, If[LessEqual[b, -8e-178], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -3.5e-193], t$95$1, If[LessEqual[b, 5.6e-215], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.065], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.5e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{x}{z} \cdot \frac{9}{\frac{c}{y}}\\
\mathbf{if}\;b \leq -1.22 \cdot 10^{+140}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -4.5 \cdot 10^{+17}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -8 \cdot 10^{-178}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -3.5 \cdot 10^{-193}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 5.6 \cdot 10^{-215}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.065:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.22e140Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -1.22e140 < b < -4.5e17 or -7.9999999999999996e-178 < b < -3.50000000000000005e-193Initial program 90.0%
associate-+l-90.0%
*-commutative90.0%
associate-*r*90.3%
*-commutative90.3%
associate-+l-90.3%
Simplified90.3%
Taylor expanded in x around inf 63.5%
associate-*r/63.5%
associate-*r*63.5%
*-commutative63.5%
associate-*r*63.5%
*-commutative63.5%
times-frac69.9%
associate-/l*69.9%
Simplified69.9%
if -4.5e17 < b < -7.9999999999999996e-178Initial program 73.8%
associate-+l-73.8%
*-commutative73.8%
associate-*r*76.7%
*-commutative76.7%
associate-+l-76.7%
Simplified76.7%
associate-/r*77.0%
div-inv76.9%
associate-+l-76.9%
associate-*r*71.7%
associate-+l-71.7%
associate-*l*71.6%
associate-*r*76.8%
Applied egg-rr76.8%
Taylor expanded in z around inf 61.4%
*-commutative61.4%
associate-/l*64.0%
Simplified64.0%
if -3.50000000000000005e-193 < b < 5.59999999999999972e-215Initial program 78.8%
associate-+l-78.8%
*-commutative78.8%
associate-*r*74.2%
*-commutative74.2%
associate-+l-74.2%
Simplified69.9%
Taylor expanded in z around inf 53.1%
*-commutative53.1%
associate-/l*62.0%
Simplified62.0%
associate-/r/57.9%
Applied egg-rr57.9%
if 5.59999999999999972e-215 < b < 0.065000000000000002Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*79.3%
*-commutative79.3%
associate-+l-79.3%
Simplified82.5%
Taylor expanded in x around inf 68.6%
if 0.065000000000000002 < b < 3.4999999999999999e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.4999999999999999e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification66.7%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ x z) (/ 9.0 (/ c y)))))
(if (<= b -4.8e+139)
(/ b (* z c))
(if (<= b -6e+19)
t_1
(if (<= b -1.5e-178)
(* -4.0 (/ t (/ c a)))
(if (<= b -2.8e-191)
t_1
(if (<= b 8.5e-216)
(* -4.0 (* t (/ a c)))
(if (<= b 0.0028)
(/ (* 9.0 (* x y)) (* z c))
(if (<= b 3.5e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -4.8e+139) {
tmp = b / (z * c);
} else if (b <= -6e+19) {
tmp = t_1;
} else if (b <= -1.5e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -2.8e-191) {
tmp = t_1;
} else if (b <= 8.5e-216) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.0028) {
tmp = (9.0 * (x * y)) / (z * c);
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 = (x / z) * (9.0d0 / (c / y))
if (b <= (-4.8d+139)) then
tmp = b / (z * c)
else if (b <= (-6d+19)) then
tmp = t_1
else if (b <= (-1.5d-178)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-2.8d-191)) then
tmp = t_1
else if (b <= 8.5d-216) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.0028d0) then
tmp = (9.0d0 * (x * y)) / (z * c)
else if (b <= 3.5d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -4.8e+139) {
tmp = b / (z * c);
} else if (b <= -6e+19) {
tmp = t_1;
} else if (b <= -1.5e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -2.8e-191) {
tmp = t_1;
} else if (b <= 8.5e-216) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.0028) {
tmp = (9.0 * (x * y)) / (z * c);
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (x / z) * (9.0 / (c / y)) tmp = 0 if b <= -4.8e+139: tmp = b / (z * c) elif b <= -6e+19: tmp = t_1 elif b <= -1.5e-178: tmp = -4.0 * (t / (c / a)) elif b <= -2.8e-191: tmp = t_1 elif b <= 8.5e-216: tmp = -4.0 * (t * (a / c)) elif b <= 0.0028: tmp = (9.0 * (x * y)) / (z * c) elif b <= 3.5e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x / z) * Float64(9.0 / Float64(c / y))) tmp = 0.0 if (b <= -4.8e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -6e+19) tmp = t_1; elseif (b <= -1.5e-178) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -2.8e-191) tmp = t_1; elseif (b <= 8.5e-216) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.0028) tmp = Float64(Float64(9.0 * Float64(x * y)) / Float64(z * c)); elseif (b <= 3.5e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (x / z) * (9.0 / (c / y));
tmp = 0.0;
if (b <= -4.8e+139)
tmp = b / (z * c);
elseif (b <= -6e+19)
tmp = t_1;
elseif (b <= -1.5e-178)
tmp = -4.0 * (t / (c / a));
elseif (b <= -2.8e-191)
tmp = t_1;
elseif (b <= 8.5e-216)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.0028)
tmp = (9.0 * (x * y)) / (z * c);
elseif (b <= 3.5e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x / z), $MachinePrecision] * N[(9.0 / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -4.8e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -6e+19], t$95$1, If[LessEqual[b, -1.5e-178], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -2.8e-191], t$95$1, If[LessEqual[b, 8.5e-216], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.0028], N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.5e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{x}{z} \cdot \frac{9}{\frac{c}{y}}\\
\mathbf{if}\;b \leq -4.8 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -6 \cdot 10^{+19}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -1.5 \cdot 10^{-178}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -2.8 \cdot 10^{-191}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 8.5 \cdot 10^{-216}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.0028:\\
\;\;\;\;\frac{9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -4.80000000000000016e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -4.80000000000000016e139 < b < -6e19 or -1.4999999999999999e-178 < b < -2.80000000000000012e-191Initial program 90.0%
associate-+l-90.0%
*-commutative90.0%
associate-*r*90.3%
*-commutative90.3%
associate-+l-90.3%
Simplified90.3%
Taylor expanded in x around inf 63.5%
associate-*r/63.5%
associate-*r*63.5%
*-commutative63.5%
associate-*r*63.5%
*-commutative63.5%
times-frac69.9%
associate-/l*69.9%
Simplified69.9%
if -6e19 < b < -1.4999999999999999e-178Initial program 73.8%
associate-+l-73.8%
*-commutative73.8%
associate-*r*76.7%
*-commutative76.7%
associate-+l-76.7%
Simplified76.7%
associate-/r*77.0%
div-inv76.9%
associate-+l-76.9%
associate-*r*71.7%
associate-+l-71.7%
associate-*l*71.6%
associate-*r*76.8%
Applied egg-rr76.8%
Taylor expanded in z around inf 61.4%
*-commutative61.4%
associate-/l*64.0%
Simplified64.0%
if -2.80000000000000012e-191 < b < 8.50000000000000003e-216Initial program 78.8%
associate-+l-78.8%
*-commutative78.8%
associate-*r*74.2%
*-commutative74.2%
associate-+l-74.2%
Simplified69.9%
Taylor expanded in z around inf 53.1%
*-commutative53.1%
associate-/l*62.0%
Simplified62.0%
associate-/r/57.9%
Applied egg-rr57.9%
if 8.50000000000000003e-216 < b < 0.00279999999999999997Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*79.3%
*-commutative79.3%
associate-+l-79.3%
Simplified82.5%
Taylor expanded in x around inf 68.6%
associate-*r/68.6%
*-commutative68.6%
Simplified68.6%
if 0.00279999999999999997 < b < 3.4999999999999999e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.4999999999999999e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification66.7%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ x z) (/ 9.0 (/ c y)))))
(if (<= b -4.7e+139)
(/ b (* z c))
(if (<= b -2.8e+20)
t_1
(if (<= b -3.5e-178)
(* -4.0 (/ t (/ c a)))
(if (<= b -5.5e-203)
t_1
(if (<= b 1.7e-238)
(* -4.0 (/ a (/ c t)))
(if (<= b 0.0028)
(/ (* 9.0 x) (* z (/ c y)))
(if (<= b 3.5e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -4.7e+139) {
tmp = b / (z * c);
} else if (b <= -2.8e+20) {
tmp = t_1;
} else if (b <= -3.5e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -5.5e-203) {
tmp = t_1;
} else if (b <= 1.7e-238) {
tmp = -4.0 * (a / (c / t));
} else if (b <= 0.0028) {
tmp = (9.0 * x) / (z * (c / y));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 = (x / z) * (9.0d0 / (c / y))
if (b <= (-4.7d+139)) then
tmp = b / (z * c)
else if (b <= (-2.8d+20)) then
tmp = t_1
else if (b <= (-3.5d-178)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-5.5d-203)) then
tmp = t_1
else if (b <= 1.7d-238) then
tmp = (-4.0d0) * (a / (c / t))
else if (b <= 0.0028d0) then
tmp = (9.0d0 * x) / (z * (c / y))
else if (b <= 3.5d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -4.7e+139) {
tmp = b / (z * c);
} else if (b <= -2.8e+20) {
tmp = t_1;
} else if (b <= -3.5e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -5.5e-203) {
tmp = t_1;
} else if (b <= 1.7e-238) {
tmp = -4.0 * (a / (c / t));
} else if (b <= 0.0028) {
tmp = (9.0 * x) / (z * (c / y));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (x / z) * (9.0 / (c / y)) tmp = 0 if b <= -4.7e+139: tmp = b / (z * c) elif b <= -2.8e+20: tmp = t_1 elif b <= -3.5e-178: tmp = -4.0 * (t / (c / a)) elif b <= -5.5e-203: tmp = t_1 elif b <= 1.7e-238: tmp = -4.0 * (a / (c / t)) elif b <= 0.0028: tmp = (9.0 * x) / (z * (c / y)) elif b <= 3.5e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x / z) * Float64(9.0 / Float64(c / y))) tmp = 0.0 if (b <= -4.7e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -2.8e+20) tmp = t_1; elseif (b <= -3.5e-178) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -5.5e-203) tmp = t_1; elseif (b <= 1.7e-238) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (b <= 0.0028) tmp = Float64(Float64(9.0 * x) / Float64(z * Float64(c / y))); elseif (b <= 3.5e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (x / z) * (9.0 / (c / y));
tmp = 0.0;
if (b <= -4.7e+139)
tmp = b / (z * c);
elseif (b <= -2.8e+20)
tmp = t_1;
elseif (b <= -3.5e-178)
tmp = -4.0 * (t / (c / a));
elseif (b <= -5.5e-203)
tmp = t_1;
elseif (b <= 1.7e-238)
tmp = -4.0 * (a / (c / t));
elseif (b <= 0.0028)
tmp = (9.0 * x) / (z * (c / y));
elseif (b <= 3.5e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x / z), $MachinePrecision] * N[(9.0 / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -4.7e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -2.8e+20], t$95$1, If[LessEqual[b, -3.5e-178], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -5.5e-203], t$95$1, If[LessEqual[b, 1.7e-238], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.0028], N[(N[(9.0 * x), $MachinePrecision] / N[(z * N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.5e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{x}{z} \cdot \frac{9}{\frac{c}{y}}\\
\mathbf{if}\;b \leq -4.7 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -2.8 \cdot 10^{+20}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -3.5 \cdot 10^{-178}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -5.5 \cdot 10^{-203}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 1.7 \cdot 10^{-238}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;b \leq 0.0028:\\
\;\;\;\;\frac{9 \cdot x}{z \cdot \frac{c}{y}}\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -4.7000000000000001e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -4.7000000000000001e139 < b < -2.8e20 or -3.49999999999999983e-178 < b < -5.5000000000000002e-203Initial program 90.0%
associate-+l-90.0%
*-commutative90.0%
associate-*r*90.3%
*-commutative90.3%
associate-+l-90.3%
Simplified90.3%
Taylor expanded in x around inf 63.5%
associate-*r/63.5%
associate-*r*63.5%
*-commutative63.5%
associate-*r*63.5%
*-commutative63.5%
times-frac69.9%
associate-/l*69.9%
Simplified69.9%
if -2.8e20 < b < -3.49999999999999983e-178Initial program 73.8%
associate-+l-73.8%
*-commutative73.8%
associate-*r*76.7%
*-commutative76.7%
associate-+l-76.7%
Simplified76.7%
associate-/r*77.0%
div-inv76.9%
associate-+l-76.9%
associate-*r*71.7%
associate-+l-71.7%
associate-*l*71.6%
associate-*r*76.8%
Applied egg-rr76.8%
Taylor expanded in z around inf 61.4%
*-commutative61.4%
associate-/l*64.0%
Simplified64.0%
if -5.5000000000000002e-203 < b < 1.69999999999999992e-238Initial program 80.7%
associate-+l-80.7%
*-commutative80.7%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
Simplified70.2%
Taylor expanded in z around inf 53.5%
*-commutative53.5%
associate-/l*64.0%
Simplified64.0%
if 1.69999999999999992e-238 < b < 0.00279999999999999997Initial program 80.2%
associate-+l-80.2%
*-commutative80.2%
associate-*r*75.1%
*-commutative75.1%
associate-+l-75.1%
Simplified80.2%
Taylor expanded in x around inf 63.4%
associate-*r/63.4%
associate-*r*63.5%
*-commutative63.5%
associate-*r*63.3%
*-commutative63.3%
times-frac63.4%
associate-/l*63.3%
Simplified63.3%
frac-times65.8%
Applied egg-rr65.8%
if 0.00279999999999999997 < b < 3.4999999999999999e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.4999999999999999e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification67.3%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ x z) (/ 9.0 (/ c y)))))
(if (<= b -6.2e+139)
(/ b (* z c))
(if (<= b -7e+20)
t_1
(if (<= b -8.2e-178)
(* -4.0 (/ t (/ c a)))
(if (<= b -1.2e-194)
t_1
(if (<= b 4.5e-240)
(* -4.0 (/ a (/ c t)))
(if (<= b 0.0062)
(/ (* 9.0 x) (/ z (/ y c)))
(if (<= b 3.5e+227)
(* -4.0 (* a (/ 1.0 (/ c t))))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -6.2e+139) {
tmp = b / (z * c);
} else if (b <= -7e+20) {
tmp = t_1;
} else if (b <= -8.2e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -1.2e-194) {
tmp = t_1;
} else if (b <= 4.5e-240) {
tmp = -4.0 * (a / (c / t));
} else if (b <= 0.0062) {
tmp = (9.0 * x) / (z / (y / c));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 = (x / z) * (9.0d0 / (c / y))
if (b <= (-6.2d+139)) then
tmp = b / (z * c)
else if (b <= (-7d+20)) then
tmp = t_1
else if (b <= (-8.2d-178)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-1.2d-194)) then
tmp = t_1
else if (b <= 4.5d-240) then
tmp = (-4.0d0) * (a / (c / t))
else if (b <= 0.0062d0) then
tmp = (9.0d0 * x) / (z / (y / c))
else if (b <= 3.5d+227) then
tmp = (-4.0d0) * (a * (1.0d0 / (c / t)))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x / z) * (9.0 / (c / y));
double tmp;
if (b <= -6.2e+139) {
tmp = b / (z * c);
} else if (b <= -7e+20) {
tmp = t_1;
} else if (b <= -8.2e-178) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -1.2e-194) {
tmp = t_1;
} else if (b <= 4.5e-240) {
tmp = -4.0 * (a / (c / t));
} else if (b <= 0.0062) {
tmp = (9.0 * x) / (z / (y / c));
} else if (b <= 3.5e+227) {
tmp = -4.0 * (a * (1.0 / (c / t)));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (x / z) * (9.0 / (c / y)) tmp = 0 if b <= -6.2e+139: tmp = b / (z * c) elif b <= -7e+20: tmp = t_1 elif b <= -8.2e-178: tmp = -4.0 * (t / (c / a)) elif b <= -1.2e-194: tmp = t_1 elif b <= 4.5e-240: tmp = -4.0 * (a / (c / t)) elif b <= 0.0062: tmp = (9.0 * x) / (z / (y / c)) elif b <= 3.5e+227: tmp = -4.0 * (a * (1.0 / (c / t))) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x / z) * Float64(9.0 / Float64(c / y))) tmp = 0.0 if (b <= -6.2e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -7e+20) tmp = t_1; elseif (b <= -8.2e-178) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -1.2e-194) tmp = t_1; elseif (b <= 4.5e-240) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (b <= 0.0062) tmp = Float64(Float64(9.0 * x) / Float64(z / Float64(y / c))); elseif (b <= 3.5e+227) tmp = Float64(-4.0 * Float64(a * Float64(1.0 / Float64(c / t)))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (x / z) * (9.0 / (c / y));
tmp = 0.0;
if (b <= -6.2e+139)
tmp = b / (z * c);
elseif (b <= -7e+20)
tmp = t_1;
elseif (b <= -8.2e-178)
tmp = -4.0 * (t / (c / a));
elseif (b <= -1.2e-194)
tmp = t_1;
elseif (b <= 4.5e-240)
tmp = -4.0 * (a / (c / t));
elseif (b <= 0.0062)
tmp = (9.0 * x) / (z / (y / c));
elseif (b <= 3.5e+227)
tmp = -4.0 * (a * (1.0 / (c / t)));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x / z), $MachinePrecision] * N[(9.0 / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -6.2e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -7e+20], t$95$1, If[LessEqual[b, -8.2e-178], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -1.2e-194], t$95$1, If[LessEqual[b, 4.5e-240], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.0062], N[(N[(9.0 * x), $MachinePrecision] / N[(z / N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.5e+227], N[(-4.0 * N[(a * N[(1.0 / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{x}{z} \cdot \frac{9}{\frac{c}{y}}\\
\mathbf{if}\;b \leq -6.2 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -7 \cdot 10^{+20}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -8.2 \cdot 10^{-178}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -1.2 \cdot 10^{-194}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 4.5 \cdot 10^{-240}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;b \leq 0.0062:\\
\;\;\;\;\frac{9 \cdot x}{\frac{z}{\frac{y}{c}}}\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+227}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{1}{\frac{c}{t}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -6.2e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -6.2e139 < b < -7e20 or -8.1999999999999998e-178 < b < -1.2e-194Initial program 90.0%
associate-+l-90.0%
*-commutative90.0%
associate-*r*90.3%
*-commutative90.3%
associate-+l-90.3%
Simplified90.3%
Taylor expanded in x around inf 63.5%
associate-*r/63.5%
associate-*r*63.5%
*-commutative63.5%
associate-*r*63.5%
*-commutative63.5%
times-frac69.9%
associate-/l*69.9%
Simplified69.9%
if -7e20 < b < -8.1999999999999998e-178Initial program 73.8%
associate-+l-73.8%
*-commutative73.8%
associate-*r*76.7%
*-commutative76.7%
associate-+l-76.7%
Simplified76.7%
associate-/r*77.0%
div-inv76.9%
associate-+l-76.9%
associate-*r*71.7%
associate-+l-71.7%
associate-*l*71.6%
associate-*r*76.8%
Applied egg-rr76.8%
Taylor expanded in z around inf 61.4%
*-commutative61.4%
associate-/l*64.0%
Simplified64.0%
if -1.2e-194 < b < 4.5000000000000001e-240Initial program 80.7%
associate-+l-80.7%
*-commutative80.7%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
Simplified70.2%
Taylor expanded in z around inf 53.5%
*-commutative53.5%
associate-/l*64.0%
Simplified64.0%
if 4.5000000000000001e-240 < b < 0.00619999999999999978Initial program 80.2%
associate-+l-80.2%
*-commutative80.2%
associate-*r*75.1%
*-commutative75.1%
associate-+l-75.1%
Simplified80.2%
associate-/r*80.3%
div-inv80.3%
associate-+l-80.3%
associate-*r*80.3%
associate-+l-80.3%
associate-*l*80.1%
associate-*r*80.1%
Applied egg-rr80.1%
Taylor expanded in x around 0 92.3%
cancel-sign-sub-inv92.3%
metadata-eval92.3%
+-commutative92.3%
fma-def92.3%
fma-def92.3%
associate-*r/94.7%
Simplified94.7%
Taylor expanded in x around inf 63.4%
associate-/l*68.3%
associate-*r/68.4%
*-commutative68.4%
*-commutative68.4%
associate-/l*65.9%
Simplified65.9%
if 0.00619999999999999978 < b < 3.4999999999999999e227Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
div-inv58.2%
Applied egg-rr58.2%
if 3.4999999999999999e227 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification67.3%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -6e+107) (not (<= z 1.5e+177))) (/ (+ (/ b z) (* -4.0 (* a t))) c) (/ (- b (- (* a (* t (* z 4.0))) (* y (* 9.0 x)))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -6e+107) || !(z <= 1.5e+177)) {
tmp = ((b / z) + (-4.0 * (a * t))) / c;
} else {
tmp = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
}
return tmp;
}
NOTE: t and a 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 <= (-6d+107)) .or. (.not. (z <= 1.5d+177))) then
tmp = ((b / z) + ((-4.0d0) * (a * t))) / c
else
tmp = (b - ((a * (t * (z * 4.0d0))) - (y * (9.0d0 * x)))) / (z * c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -6e+107) || !(z <= 1.5e+177)) {
tmp = ((b / z) + (-4.0 * (a * t))) / c;
} else {
tmp = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -6e+107) or not (z <= 1.5e+177): tmp = ((b / z) + (-4.0 * (a * t))) / c else: tmp = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -6e+107) || !(z <= 1.5e+177)) tmp = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(b - Float64(Float64(a * Float64(t * Float64(z * 4.0))) - Float64(y * Float64(9.0 * x)))) / Float64(z * c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -6e+107) || ~((z <= 1.5e+177)))
tmp = ((b / z) + (-4.0 * (a * t))) / c;
else
tmp = (b - ((a * (t * (z * 4.0))) - (y * (9.0 * x)))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -6e+107], N[Not[LessEqual[z, 1.5e+177]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b - N[(N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6 \cdot 10^{+107} \lor \neg \left(z \leq 1.5 \cdot 10^{+177}\right):\\
\;\;\;\;\frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b - \left(a \cdot \left(t \cdot \left(z \cdot 4\right)\right) - y \cdot \left(9 \cdot x\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -6.00000000000000046e107 or 1.5e177 < z Initial program 44.7%
associate-+l-44.7%
*-commutative44.7%
associate-*r*41.7%
*-commutative41.7%
associate-+l-41.7%
Simplified45.0%
associate-/r*67.6%
div-inv67.6%
associate-+l-67.6%
associate-*r*60.2%
associate-+l-60.2%
associate-*l*60.2%
associate-*r*67.5%
Applied egg-rr67.5%
Taylor expanded in x around 0 87.8%
cancel-sign-sub-inv87.8%
metadata-eval87.8%
+-commutative87.8%
fma-def87.8%
fma-def87.8%
associate-*r/92.3%
Simplified92.3%
Taylor expanded in x around 0 83.5%
if -6.00000000000000046e107 < z < 1.5e177Initial program 92.3%
Final simplification90.0%
NOTE: t and a 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 (<= z -1.05e+71)
(/ (+ t_1 (* 9.0 (/ (* x y) z))) c)
(if (<= z 2.55e+174)
(/ (- b (- (* (* a t) (* z 4.0)) (* y (* 9.0 x)))) (* z c))
(/ (+ (/ b z) t_1) c)))))assert(t < a);
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 (z <= -1.05e+71) {
tmp = (t_1 + (9.0 * ((x * y) / z))) / c;
} else if (z <= 2.55e+174) {
tmp = (b - (((a * t) * (z * 4.0)) - (y * (9.0 * x)))) / (z * c);
} else {
tmp = ((b / z) + t_1) / c;
}
return tmp;
}
NOTE: t and a 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 (z <= (-1.05d+71)) then
tmp = (t_1 + (9.0d0 * ((x * y) / z))) / c
else if (z <= 2.55d+174) then
tmp = (b - (((a * t) * (z * 4.0d0)) - (y * (9.0d0 * x)))) / (z * c)
else
tmp = ((b / z) + t_1) / c
end if
code = tmp
end function
assert t < a;
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 (z <= -1.05e+71) {
tmp = (t_1 + (9.0 * ((x * y) / z))) / c;
} else if (z <= 2.55e+174) {
tmp = (b - (((a * t) * (z * 4.0)) - (y * (9.0 * x)))) / (z * c);
} else {
tmp = ((b / z) + t_1) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * (a * t) tmp = 0 if z <= -1.05e+71: tmp = (t_1 + (9.0 * ((x * y) / z))) / c elif z <= 2.55e+174: tmp = (b - (((a * t) * (z * 4.0)) - (y * (9.0 * x)))) / (z * c) else: tmp = ((b / z) + t_1) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(a * t)) tmp = 0.0 if (z <= -1.05e+71) tmp = Float64(Float64(t_1 + Float64(9.0 * Float64(Float64(x * y) / z))) / c); elseif (z <= 2.55e+174) tmp = Float64(Float64(b - Float64(Float64(Float64(a * t) * Float64(z * 4.0)) - Float64(y * Float64(9.0 * x)))) / Float64(z * c)); else tmp = Float64(Float64(Float64(b / z) + t_1) / c); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * (a * t);
tmp = 0.0;
if (z <= -1.05e+71)
tmp = (t_1 + (9.0 * ((x * y) / z))) / c;
elseif (z <= 2.55e+174)
tmp = (b - (((a * t) * (z * 4.0)) - (y * (9.0 * x)))) / (z * c);
else
tmp = ((b / z) + t_1) / c;
end
tmp_2 = tmp;
end
NOTE: t and a 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[z, -1.05e+71], N[(N[(t$95$1 + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.55e+174], N[(N[(b - N[(N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / z), $MachinePrecision] + t$95$1), $MachinePrecision] / c), $MachinePrecision]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -1.05 \cdot 10^{+71}:\\
\;\;\;\;\frac{t_1 + 9 \cdot \frac{x \cdot y}{z}}{c}\\
\mathbf{elif}\;z \leq 2.55 \cdot 10^{+174}:\\
\;\;\;\;\frac{b - \left(\left(a \cdot t\right) \cdot \left(z \cdot 4\right) - y \cdot \left(9 \cdot x\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z} + t_1}{c}\\
\end{array}
\end{array}
if z < -1.04999999999999995e71Initial program 52.1%
associate-+l-52.1%
*-commutative52.1%
associate-*r*46.1%
*-commutative46.1%
associate-+l-46.1%
Simplified50.6%
associate-/r*71.1%
div-inv71.1%
associate-+l-71.1%
associate-*r*64.9%
associate-+l-64.9%
associate-*l*64.9%
associate-*r*71.1%
Applied egg-rr71.1%
Taylor expanded in x around 0 87.3%
cancel-sign-sub-inv87.3%
metadata-eval87.3%
+-commutative87.3%
fma-def87.3%
fma-def87.4%
associate-*r/91.5%
Simplified91.5%
Taylor expanded in b around 0 77.3%
if -1.04999999999999995e71 < z < 2.5499999999999999e174Initial program 92.9%
associate-+l-92.9%
*-commutative92.9%
associate-*r*92.9%
*-commutative92.9%
associate-+l-92.9%
Simplified90.8%
if 2.5499999999999999e174 < z Initial program 46.9%
associate-+l-46.9%
*-commutative46.9%
associate-*r*46.8%
*-commutative46.8%
associate-+l-46.8%
Simplified50.2%
associate-/r*67.6%
div-inv67.5%
associate-+l-67.5%
associate-*r*61.1%
associate-+l-61.1%
associate-*l*61.1%
associate-*r*67.5%
Applied egg-rr67.5%
Taylor expanded in x around 0 93.0%
cancel-sign-sub-inv93.0%
metadata-eval93.0%
+-commutative93.0%
fma-def93.0%
fma-def93.0%
associate-*r/96.4%
Simplified96.4%
Taylor expanded in x around 0 93.2%
Final simplification88.6%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (/ (* x y) (* z c)))))
(if (<= b -7.4e+142)
(/ b (* z c))
(if (<= b -2.85e+17)
t_1
(if (<= b -3.25e-170)
(* -4.0 (/ t (/ c a)))
(if (<= b -4.8e-229)
(* y (/ 9.0 (/ c (/ x z))))
(if (<= b 8.5e-216)
(* -4.0 (* t (/ a c)))
(if (<= b 0.0048)
t_1
(if (<= b 2.1e+228)
(* -4.0 (/ a (/ c t)))
(/ (/ b c) z))))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * y) / (z * c));
double tmp;
if (b <= -7.4e+142) {
tmp = b / (z * c);
} else if (b <= -2.85e+17) {
tmp = t_1;
} else if (b <= -3.25e-170) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -4.8e-229) {
tmp = y * (9.0 / (c / (x / z)));
} else if (b <= 8.5e-216) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.0048) {
tmp = t_1;
} else if (b <= 2.1e+228) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x * y) / (z * c))
if (b <= (-7.4d+142)) then
tmp = b / (z * c)
else if (b <= (-2.85d+17)) then
tmp = t_1
else if (b <= (-3.25d-170)) then
tmp = (-4.0d0) * (t / (c / a))
else if (b <= (-4.8d-229)) then
tmp = y * (9.0d0 / (c / (x / z)))
else if (b <= 8.5d-216) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.0048d0) then
tmp = t_1
else if (b <= 2.1d+228) then
tmp = (-4.0d0) * (a / (c / t))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * y) / (z * c));
double tmp;
if (b <= -7.4e+142) {
tmp = b / (z * c);
} else if (b <= -2.85e+17) {
tmp = t_1;
} else if (b <= -3.25e-170) {
tmp = -4.0 * (t / (c / a));
} else if (b <= -4.8e-229) {
tmp = y * (9.0 / (c / (x / z)));
} else if (b <= 8.5e-216) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.0048) {
tmp = t_1;
} else if (b <= 2.1e+228) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x * y) / (z * c)) tmp = 0 if b <= -7.4e+142: tmp = b / (z * c) elif b <= -2.85e+17: tmp = t_1 elif b <= -3.25e-170: tmp = -4.0 * (t / (c / a)) elif b <= -4.8e-229: tmp = y * (9.0 / (c / (x / z))) elif b <= 8.5e-216: tmp = -4.0 * (t * (a / c)) elif b <= 0.0048: tmp = t_1 elif b <= 2.1e+228: tmp = -4.0 * (a / (c / t)) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))) tmp = 0.0 if (b <= -7.4e+142) tmp = Float64(b / Float64(z * c)); elseif (b <= -2.85e+17) tmp = t_1; elseif (b <= -3.25e-170) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); elseif (b <= -4.8e-229) tmp = Float64(y * Float64(9.0 / Float64(c / Float64(x / z)))); elseif (b <= 8.5e-216) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.0048) tmp = t_1; elseif (b <= 2.1e+228) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x * y) / (z * c));
tmp = 0.0;
if (b <= -7.4e+142)
tmp = b / (z * c);
elseif (b <= -2.85e+17)
tmp = t_1;
elseif (b <= -3.25e-170)
tmp = -4.0 * (t / (c / a));
elseif (b <= -4.8e-229)
tmp = y * (9.0 / (c / (x / z)));
elseif (b <= 8.5e-216)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.0048)
tmp = t_1;
elseif (b <= 2.1e+228)
tmp = -4.0 * (a / (c / t));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a 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 * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -7.4e+142], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -2.85e+17], t$95$1, If[LessEqual[b, -3.25e-170], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -4.8e-229], N[(y * N[(9.0 / N[(c / N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 8.5e-216], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.0048], t$95$1, If[LessEqual[b, 2.1e+228], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{if}\;b \leq -7.4 \cdot 10^{+142}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -2.85 \cdot 10^{+17}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -3.25 \cdot 10^{-170}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{elif}\;b \leq -4.8 \cdot 10^{-229}:\\
\;\;\;\;y \cdot \frac{9}{\frac{c}{\frac{x}{z}}}\\
\mathbf{elif}\;b \leq 8.5 \cdot 10^{-216}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.0048:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 2.1 \cdot 10^{+228}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -7.3999999999999995e142Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -7.3999999999999995e142 < b < -2.85e17 or 8.50000000000000003e-216 < b < 0.00479999999999999958Initial program 87.7%
associate-+l-87.7%
*-commutative87.7%
associate-*r*86.0%
*-commutative86.0%
associate-+l-86.0%
Simplified87.9%
Taylor expanded in x around inf 66.5%
if -2.85e17 < b < -3.25000000000000018e-170Initial program 72.4%
associate-+l-72.4%
*-commutative72.4%
associate-*r*75.4%
*-commutative75.4%
associate-+l-75.4%
Simplified75.4%
associate-/r*75.7%
div-inv75.7%
associate-+l-75.7%
associate-*r*70.2%
associate-+l-70.2%
associate-*l*70.1%
associate-*r*75.6%
Applied egg-rr75.6%
Taylor expanded in z around inf 62.0%
*-commutative62.0%
associate-/l*64.7%
Simplified64.7%
if -3.25000000000000018e-170 < b < -4.8e-229Initial program 83.4%
associate-+l-83.4%
*-commutative83.4%
associate-*r*83.5%
*-commutative83.5%
associate-+l-83.5%
Simplified83.5%
associate-/r*88.6%
div-inv88.6%
associate-+l-88.6%
associate-*r*88.6%
associate-+l-88.6%
associate-*l*88.6%
associate-*r*88.7%
Applied egg-rr88.7%
Taylor expanded in x around 0 88.6%
cancel-sign-sub-inv88.6%
metadata-eval88.6%
+-commutative88.6%
fma-def88.6%
fma-def88.6%
associate-*r/83.2%
Simplified83.2%
Taylor expanded in z around -inf 74.7%
associate-*l/75.0%
mul-1-neg75.0%
unsub-neg75.0%
associate-*l/74.7%
mul-1-neg74.7%
unsub-neg74.7%
*-rgt-identity74.7%
associate-*r/74.7%
associate-*l*78.0%
associate-*r/78.0%
*-rgt-identity78.0%
Simplified78.0%
Taylor expanded in x around inf 48.6%
*-commutative48.6%
times-frac59.2%
associate-*l*59.2%
*-commutative59.2%
associate-*r/53.9%
associate-*l/59.1%
*-commutative59.1%
*-commutative59.1%
associate-/l*59.4%
Simplified59.4%
if -4.8e-229 < b < 8.50000000000000003e-216Initial program 76.7%
associate-+l-76.7%
*-commutative76.7%
associate-*r*70.9%
*-commutative70.9%
associate-+l-70.9%
Simplified65.6%
Taylor expanded in z around inf 56.1%
*-commutative56.1%
associate-/l*67.1%
Simplified67.1%
associate-/r/62.0%
Applied egg-rr62.0%
if 0.00479999999999999958 < b < 2.09999999999999994e228Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
if 2.09999999999999994e228 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification66.4%
NOTE: t and a 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 (or (<= b -3.15e+90) (not (<= b 1.1e+17)))
(/ (+ (/ b z) t_1) c)
(/ (+ t_1 (* 9.0 (/ (* x y) z))) c))))assert(t < a);
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 ((b <= -3.15e+90) || !(b <= 1.1e+17)) {
tmp = ((b / z) + t_1) / c;
} else {
tmp = (t_1 + (9.0 * ((x * y) / z))) / c;
}
return tmp;
}
NOTE: t and a 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 ((b <= (-3.15d+90)) .or. (.not. (b <= 1.1d+17))) then
tmp = ((b / z) + t_1) / c
else
tmp = (t_1 + (9.0d0 * ((x * y) / z))) / c
end if
code = tmp
end function
assert t < a;
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 ((b <= -3.15e+90) || !(b <= 1.1e+17)) {
tmp = ((b / z) + t_1) / c;
} else {
tmp = (t_1 + (9.0 * ((x * y) / z))) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * (a * t) tmp = 0 if (b <= -3.15e+90) or not (b <= 1.1e+17): tmp = ((b / z) + t_1) / c else: tmp = (t_1 + (9.0 * ((x * y) / z))) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(a * t)) tmp = 0.0 if ((b <= -3.15e+90) || !(b <= 1.1e+17)) tmp = Float64(Float64(Float64(b / z) + t_1) / c); else tmp = Float64(Float64(t_1 + Float64(9.0 * Float64(Float64(x * y) / z))) / c); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * (a * t);
tmp = 0.0;
if ((b <= -3.15e+90) || ~((b <= 1.1e+17)))
tmp = ((b / z) + t_1) / c;
else
tmp = (t_1 + (9.0 * ((x * y) / z))) / c;
end
tmp_2 = tmp;
end
NOTE: t and a 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[Or[LessEqual[b, -3.15e+90], N[Not[LessEqual[b, 1.1e+17]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] + t$95$1), $MachinePrecision] / c), $MachinePrecision], N[(N[(t$95$1 + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;b \leq -3.15 \cdot 10^{+90} \lor \neg \left(b \leq 1.1 \cdot 10^{+17}\right):\\
\;\;\;\;\frac{\frac{b}{z} + t_1}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1 + 9 \cdot \frac{x \cdot y}{z}}{c}\\
\end{array}
\end{array}
if b < -3.15e90 or 1.1e17 < b Initial program 79.9%
associate-+l-79.9%
*-commutative79.9%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified79.9%
associate-/r*84.4%
div-inv84.3%
associate-+l-84.3%
associate-*r*81.9%
associate-+l-81.9%
associate-*l*81.9%
associate-*r*84.3%
Applied egg-rr84.3%
Taylor expanded in x around 0 86.7%
cancel-sign-sub-inv86.7%
metadata-eval86.7%
+-commutative86.7%
fma-def86.7%
fma-def86.7%
associate-*r/87.5%
Simplified87.5%
Taylor expanded in x around 0 84.2%
if -3.15e90 < b < 1.1e17Initial program 80.4%
associate-+l-80.4%
*-commutative80.4%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified77.9%
associate-/r*80.7%
div-inv80.6%
associate-+l-80.6%
associate-*r*78.5%
associate-+l-78.5%
associate-*l*78.4%
associate-*r*80.6%
Applied egg-rr80.6%
Taylor expanded in x around 0 87.9%
cancel-sign-sub-inv87.9%
metadata-eval87.9%
+-commutative87.9%
fma-def87.9%
fma-def87.9%
associate-*r/86.5%
Simplified86.5%
Taylor expanded in b around 0 86.0%
Final simplification85.2%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (/ (* x y) (* z c)))))
(if (<= b -4.8e+139)
(/ b (* z c))
(if (<= b -2.4e+18)
t_1
(if (<= b 5.6e-215)
(* -4.0 (* t (/ a c)))
(if (<= b 0.049)
t_1
(if (<= b 2.1e+228) (* -4.0 (/ a (/ c t))) (/ (/ b c) z))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * y) / (z * c));
double tmp;
if (b <= -4.8e+139) {
tmp = b / (z * c);
} else if (b <= -2.4e+18) {
tmp = t_1;
} else if (b <= 5.6e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.049) {
tmp = t_1;
} else if (b <= 2.1e+228) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x * y) / (z * c))
if (b <= (-4.8d+139)) then
tmp = b / (z * c)
else if (b <= (-2.4d+18)) then
tmp = t_1
else if (b <= 5.6d-215) then
tmp = (-4.0d0) * (t * (a / c))
else if (b <= 0.049d0) then
tmp = t_1
else if (b <= 2.1d+228) then
tmp = (-4.0d0) * (a / (c / t))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * y) / (z * c));
double tmp;
if (b <= -4.8e+139) {
tmp = b / (z * c);
} else if (b <= -2.4e+18) {
tmp = t_1;
} else if (b <= 5.6e-215) {
tmp = -4.0 * (t * (a / c));
} else if (b <= 0.049) {
tmp = t_1;
} else if (b <= 2.1e+228) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x * y) / (z * c)) tmp = 0 if b <= -4.8e+139: tmp = b / (z * c) elif b <= -2.4e+18: tmp = t_1 elif b <= 5.6e-215: tmp = -4.0 * (t * (a / c)) elif b <= 0.049: tmp = t_1 elif b <= 2.1e+228: tmp = -4.0 * (a / (c / t)) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))) tmp = 0.0 if (b <= -4.8e+139) tmp = Float64(b / Float64(z * c)); elseif (b <= -2.4e+18) tmp = t_1; elseif (b <= 5.6e-215) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (b <= 0.049) tmp = t_1; elseif (b <= 2.1e+228) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x * y) / (z * c));
tmp = 0.0;
if (b <= -4.8e+139)
tmp = b / (z * c);
elseif (b <= -2.4e+18)
tmp = t_1;
elseif (b <= 5.6e-215)
tmp = -4.0 * (t * (a / c));
elseif (b <= 0.049)
tmp = t_1;
elseif (b <= 2.1e+228)
tmp = -4.0 * (a / (c / t));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a 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 * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -4.8e+139], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, -2.4e+18], t$95$1, If[LessEqual[b, 5.6e-215], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.049], t$95$1, If[LessEqual[b, 2.1e+228], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{if}\;b \leq -4.8 \cdot 10^{+139}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq -2.4 \cdot 10^{+18}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 5.6 \cdot 10^{-215}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;b \leq 0.049:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq 2.1 \cdot 10^{+228}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -4.80000000000000016e139Initial program 77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*79.7%
*-commutative79.7%
associate-+l-79.7%
Simplified80.0%
Taylor expanded in b around inf 74.2%
*-commutative74.2%
Simplified74.2%
if -4.80000000000000016e139 < b < -2.4e18 or 5.59999999999999972e-215 < b < 0.049000000000000002Initial program 87.7%
associate-+l-87.7%
*-commutative87.7%
associate-*r*86.0%
*-commutative86.0%
associate-+l-86.0%
Simplified87.9%
Taylor expanded in x around inf 66.5%
if -2.4e18 < b < 5.59999999999999972e-215Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*75.4%
*-commutative75.4%
associate-+l-75.4%
Simplified73.4%
Taylor expanded in z around inf 54.3%
*-commutative54.3%
associate-/l*60.7%
Simplified60.7%
associate-/r/58.6%
Applied egg-rr58.6%
if 0.049000000000000002 < b < 2.09999999999999994e228Initial program 82.2%
associate-+l-82.2%
*-commutative82.2%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
Simplified77.0%
Taylor expanded in z around inf 51.4%
*-commutative51.4%
associate-/l*58.2%
Simplified58.2%
if 2.09999999999999994e228 < b Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
Simplified80.5%
Taylor expanded in b around inf 72.4%
associate-/r*87.4%
Simplified87.4%
Final simplification65.1%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -4e-131) (not (<= z 1.05e+21))) (/ (+ (/ b z) (* -4.0 (* a t))) c) (/ (+ b (* 9.0 (* x y))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -4e-131) || !(z <= 1.05e+21)) {
tmp = ((b / z) + (-4.0 * (a * t))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
NOTE: t and a 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 <= (-4d-131)) .or. (.not. (z <= 1.05d+21))) then
tmp = ((b / z) + ((-4.0d0) * (a * t))) / c
else
tmp = (b + (9.0d0 * (x * y))) / (z * c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -4e-131) || !(z <= 1.05e+21)) {
tmp = ((b / z) + (-4.0 * (a * t))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -4e-131) or not (z <= 1.05e+21): tmp = ((b / z) + (-4.0 * (a * t))) / c else: tmp = (b + (9.0 * (x * y))) / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -4e-131) || !(z <= 1.05e+21)) tmp = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -4e-131) || ~((z <= 1.05e+21)))
tmp = ((b / z) + (-4.0 * (a * t))) / c;
else
tmp = (b + (9.0 * (x * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -4e-131], N[Not[LessEqual[z, 1.05e+21]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4 \cdot 10^{-131} \lor \neg \left(z \leq 1.05 \cdot 10^{+21}\right):\\
\;\;\;\;\frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -3.9999999999999999e-131 or 1.05e21 < z Initial program 70.2%
associate-+l-70.2%
*-commutative70.2%
associate-*r*67.8%
*-commutative67.8%
associate-+l-67.8%
Simplified69.2%
associate-/r*79.4%
div-inv79.3%
associate-+l-79.3%
associate-*r*75.6%
associate-+l-75.6%
associate-*l*75.5%
associate-*r*79.3%
Applied egg-rr79.3%
Taylor expanded in x around 0 90.9%
cancel-sign-sub-inv90.9%
metadata-eval90.9%
+-commutative90.9%
fma-def90.9%
fma-def90.9%
associate-*r/92.8%
Simplified92.8%
Taylor expanded in x around 0 79.1%
if -3.9999999999999999e-131 < z < 1.05e21Initial program 95.1%
associate-+l-95.1%
*-commutative95.1%
associate-*r*96.1%
*-commutative96.1%
associate-+l-96.1%
Simplified93.3%
Taylor expanded in x around inf 86.6%
Final simplification82.1%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= y -1.6e-45)
(/ (* 9.0 x) (* z (/ c y)))
(if (<= y 1.15e+213)
(/ (+ (/ b z) (* -4.0 (* a t))) c)
(* (/ 9.0 z) (/ x (/ c y))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (y <= -1.6e-45) {
tmp = (9.0 * x) / (z * (c / y));
} else if (y <= 1.15e+213) {
tmp = ((b / z) + (-4.0 * (a * t))) / c;
} else {
tmp = (9.0 / z) * (x / (c / y));
}
return tmp;
}
NOTE: t and a 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.6d-45)) then
tmp = (9.0d0 * x) / (z * (c / y))
else if (y <= 1.15d+213) then
tmp = ((b / z) + ((-4.0d0) * (a * t))) / c
else
tmp = (9.0d0 / z) * (x / (c / y))
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (y <= -1.6e-45) {
tmp = (9.0 * x) / (z * (c / y));
} else if (y <= 1.15e+213) {
tmp = ((b / z) + (-4.0 * (a * t))) / c;
} else {
tmp = (9.0 / z) * (x / (c / y));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if y <= -1.6e-45: tmp = (9.0 * x) / (z * (c / y)) elif y <= 1.15e+213: tmp = ((b / z) + (-4.0 * (a * t))) / c else: tmp = (9.0 / z) * (x / (c / y)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (y <= -1.6e-45) tmp = Float64(Float64(9.0 * x) / Float64(z * Float64(c / y))); elseif (y <= 1.15e+213) tmp = Float64(Float64(Float64(b / z) + Float64(-4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(9.0 / z) * Float64(x / Float64(c / y))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (y <= -1.6e-45)
tmp = (9.0 * x) / (z * (c / y));
elseif (y <= 1.15e+213)
tmp = ((b / z) + (-4.0 * (a * t))) / c;
else
tmp = (9.0 / z) * (x / (c / y));
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[y, -1.6e-45], N[(N[(9.0 * x), $MachinePrecision] / N[(z * N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.15e+213], N[(N[(N[(b / z), $MachinePrecision] + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(9.0 / z), $MachinePrecision] * N[(x / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.6 \cdot 10^{-45}:\\
\;\;\;\;\frac{9 \cdot x}{z \cdot \frac{c}{y}}\\
\mathbf{elif}\;y \leq 1.15 \cdot 10^{+213}:\\
\;\;\;\;\frac{\frac{b}{z} + -4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{9}{z} \cdot \frac{x}{\frac{c}{y}}\\
\end{array}
\end{array}
if y < -1.60000000000000004e-45Initial program 83.9%
associate-+l-83.9%
*-commutative83.9%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
Simplified82.5%
Taylor expanded in x around inf 53.5%
associate-*r/53.5%
associate-*r*53.5%
*-commutative53.5%
associate-*r*53.4%
*-commutative53.4%
times-frac57.4%
associate-/l*57.4%
Simplified57.4%
frac-times59.9%
Applied egg-rr59.9%
if -1.60000000000000004e-45 < y < 1.14999999999999999e213Initial program 78.4%
associate-+l-78.4%
*-commutative78.4%
associate-*r*77.4%
*-commutative77.4%
associate-+l-77.4%
Simplified78.0%
associate-/r*83.8%
div-inv83.7%
associate-+l-83.7%
associate-*r*81.0%
associate-+l-81.0%
associate-*l*80.9%
associate-*r*83.7%
Applied egg-rr83.7%
Taylor expanded in x around 0 92.0%
cancel-sign-sub-inv92.0%
metadata-eval92.0%
+-commutative92.0%
fma-def92.0%
fma-def92.0%
associate-*r/91.4%
Simplified91.4%
Taylor expanded in x around 0 74.7%
if 1.14999999999999999e213 < y Initial program 83.4%
associate-+l-83.4%
*-commutative83.4%
associate-*r*83.2%
*-commutative83.2%
associate-+l-83.2%
Simplified75.4%
associate-/r*79.7%
div-inv79.8%
associate-+l-79.8%
associate-*r*84.0%
associate-+l-84.0%
associate-*l*84.0%
associate-*r*79.8%
Applied egg-rr79.8%
Taylor expanded in x around inf 75.4%
associate-*r/75.5%
*-commutative75.5%
times-frac79.5%
associate-/l*79.9%
Simplified79.9%
Final simplification71.7%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= b -1.6e+90) (/ b (* z c)) (if (<= b 2.3e+168) (* -4.0 (/ t (/ c a))) (/ (/ b c) z))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1.6e+90) {
tmp = b / (z * c);
} else if (b <= 2.3e+168) {
tmp = -4.0 * (t / (c / a));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 (b <= (-1.6d+90)) then
tmp = b / (z * c)
else if (b <= 2.3d+168) then
tmp = (-4.0d0) * (t / (c / a))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1.6e+90) {
tmp = b / (z * c);
} else if (b <= 2.3e+168) {
tmp = -4.0 * (t / (c / a));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -1.6e+90: tmp = b / (z * c) elif b <= 2.3e+168: tmp = -4.0 * (t / (c / a)) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -1.6e+90) tmp = Float64(b / Float64(z * c)); elseif (b <= 2.3e+168) tmp = Float64(-4.0 * Float64(t / Float64(c / a))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -1.6e+90)
tmp = b / (z * c);
elseif (b <= 2.3e+168)
tmp = -4.0 * (t / (c / a));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -1.6e+90], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.3e+168], N[(-4.0 * N[(t / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.6 \cdot 10^{+90}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 2.3 \cdot 10^{+168}:\\
\;\;\;\;-4 \cdot \frac{t}{\frac{c}{a}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.59999999999999999e90Initial program 79.1%
associate-+l-79.1%
*-commutative79.1%
associate-*r*81.4%
*-commutative81.4%
associate-+l-81.4%
Simplified81.7%
Taylor expanded in b around inf 72.3%
*-commutative72.3%
Simplified72.3%
if -1.59999999999999999e90 < b < 2.2999999999999999e168Initial program 82.0%
associate-+l-82.0%
*-commutative82.0%
associate-*r*79.9%
*-commutative79.9%
associate-+l-79.9%
Simplified78.9%
associate-/r*80.7%
div-inv80.6%
associate-+l-80.6%
associate-*r*79.5%
associate-+l-79.5%
associate-*l*79.4%
associate-*r*80.6%
Applied egg-rr80.6%
Taylor expanded in z around inf 49.0%
*-commutative49.0%
associate-/l*51.9%
Simplified51.9%
if 2.2999999999999999e168 < b Initial program 73.2%
associate-+l-73.2%
*-commutative73.2%
associate-*r*73.2%
*-commutative73.2%
associate-+l-73.2%
Simplified75.5%
Taylor expanded in b around inf 66.0%
associate-/r*75.1%
Simplified75.1%
Final simplification58.9%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= b -1.52e+90) (/ b (* z c)) (if (<= b 3.4e+184) (* -4.0 (* t (/ a c))) (/ (/ b c) z))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1.52e+90) {
tmp = b / (z * c);
} else if (b <= 3.4e+184) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: t and a 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 (b <= (-1.52d+90)) then
tmp = b / (z * c)
else if (b <= 3.4d+184) then
tmp = (-4.0d0) * (t * (a / c))
else
tmp = (b / c) / z
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1.52e+90) {
tmp = b / (z * c);
} else if (b <= 3.4e+184) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = (b / c) / z;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -1.52e+90: tmp = b / (z * c) elif b <= 3.4e+184: tmp = -4.0 * (t * (a / c)) else: tmp = (b / c) / z return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -1.52e+90) tmp = Float64(b / Float64(z * c)); elseif (b <= 3.4e+184) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); else tmp = Float64(Float64(b / c) / z); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -1.52e+90)
tmp = b / (z * c);
elseif (b <= 3.4e+184)
tmp = -4.0 * (t * (a / c));
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -1.52e+90], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.4e+184], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.52 \cdot 10^{+90}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 3.4 \cdot 10^{+184}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.52000000000000009e90Initial program 79.1%
associate-+l-79.1%
*-commutative79.1%
associate-*r*81.4%
*-commutative81.4%
associate-+l-81.4%
Simplified81.7%
Taylor expanded in b around inf 72.3%
*-commutative72.3%
Simplified72.3%
if -1.52000000000000009e90 < b < 3.4000000000000002e184Initial program 81.3%
associate-+l-81.3%
*-commutative81.3%
associate-*r*79.2%
*-commutative79.2%
associate-+l-79.2%
Simplified78.3%
Taylor expanded in z around inf 49.1%
*-commutative49.1%
associate-/l*53.3%
Simplified53.3%
associate-/r/52.3%
Applied egg-rr52.3%
if 3.4000000000000002e184 < b Initial program 75.7%
associate-+l-75.7%
*-commutative75.7%
associate-*r*75.7%
*-commutative75.7%
associate-+l-75.7%
Simplified78.2%
Taylor expanded in b around inf 67.6%
associate-/r*77.8%
Simplified77.8%
Final simplification59.2%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: t and a 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 t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): return b / (z * c)
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
t, a = num2cell(sort([t, a])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: t and a 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}
[t, a] = \mathsf{sort}([t, a])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 80.2%
associate-+l-80.2%
*-commutative80.2%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified78.8%
Taylor expanded in b around inf 35.2%
*-commutative35.2%
Simplified35.2%
Final simplification35.2%
(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 2023283
(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)))