
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
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 (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (/ (+ (* x (* 9.0 y)) (- b (* (* a t) (* z 4.0)))) (* z c))))
(if (<= t_1 -5e+144)
t_2
(if (<= t_1 1e+68)
(*
(/ 1.0 z)
(+ (* -4.0 (/ (* a (* z t)) c)) (+ (* 9.0 (/ (* x y) c)) (/ b c))))
(if (<= t_1 INFINITY) t_2 (* -4.0 (* a (/ t c))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = ((x * (9.0 * y)) + (b - ((a * t) * (z * 4.0)))) / (z * c);
double tmp;
if (t_1 <= -5e+144) {
tmp = t_2;
} else if (t_1 <= 1e+68) {
tmp = (1.0 / z) * ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c)));
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = -4.0 * (a * (t / c));
}
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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = ((x * (9.0 * y)) + (b - ((a * t) * (z * 4.0)))) / (z * c);
double tmp;
if (t_1 <= -5e+144) {
tmp = t_2;
} else if (t_1 <= 1e+68) {
tmp = (1.0 / z) * ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c)));
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_2;
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c) t_2 = ((x * (9.0 * y)) + (b - ((a * t) * (z * 4.0)))) / (z * c) tmp = 0 if t_1 <= -5e+144: tmp = t_2 elif t_1 <= 1e+68: tmp = (1.0 / z) * ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c))) elif t_1 <= math.inf: tmp = t_2 else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = Float64(Float64(Float64(x * Float64(9.0 * y)) + Float64(b - Float64(Float64(a * t) * Float64(z * 4.0)))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -5e+144) tmp = t_2; elseif (t_1 <= 1e+68) tmp = Float64(Float64(1.0 / z) * Float64(Float64(-4.0 * Float64(Float64(a * Float64(z * t)) / c)) + Float64(Float64(9.0 * Float64(Float64(x * y) / c)) + Float64(b / c)))); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(-4.0 * Float64(a * Float64(t / c))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
t_2 = ((x * (9.0 * y)) + (b - ((a * t) * (z * 4.0)))) / (z * c);
tmp = 0.0;
if (t_1 <= -5e+144)
tmp = t_2;
elseif (t_1 <= 1e+68)
tmp = (1.0 / z) * ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c)));
elseif (t_1 <= Inf)
tmp = t_2;
else
tmp = -4.0 * (a * (t / 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[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] + N[(b - N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+144], t$95$2, If[LessEqual[t$95$1, 1e+68], N[(N[(1.0 / z), $MachinePrecision] * N[(N[(-4.0 * N[(N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \frac{x \cdot \left(9 \cdot y\right) + \left(b - \left(a \cdot t\right) \cdot \left(z \cdot 4\right)\right)}{z \cdot c}\\
\mathbf{if}\;t_1 \leq -5 \cdot 10^{+144}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t_1 \leq 10^{+68}:\\
\;\;\;\;\frac{1}{z} \cdot \left(-4 \cdot \frac{a \cdot \left(z \cdot t\right)}{c} + \left(9 \cdot \frac{x \cdot y}{c} + \frac{b}{c}\right)\right)\\
\mathbf{elif}\;t_1 \leq \infty:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -4.9999999999999999e144 or 9.99999999999999953e67 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < +inf.0Initial program 83.1%
associate-+l-83.1%
associate-*l*83.1%
associate-*l*87.3%
Simplified87.3%
if -4.9999999999999999e144 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < 9.99999999999999953e67Initial program 87.5%
associate-+l-87.5%
associate-*r*87.6%
associate-*r*85.2%
*-un-lft-identity85.2%
times-frac96.3%
associate--r-96.3%
fma-neg96.3%
associate-*r*98.6%
distribute-rgt-neg-in98.6%
associate-*l*98.6%
Applied egg-rr98.6%
Taylor expanded in x around 0 98.7%
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%
associate-*l*0.0%
associate-*l*1.3%
Simplified1.3%
Taylor expanded in x around 0 6.2%
Taylor expanded in b around 0 60.5%
Taylor expanded in a around inf 60.5%
associate-*r/86.9%
Simplified86.9%
Final simplification90.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
(if (<= z -3e+115)
(/ (+ (* -4.0 (* a t)) (/ b z)) c)
(if (<= z 8.2e+91)
(* (/ 1.0 z) (/ (+ b (fma x (* 9.0 y) (* a (* z (* t (- 4.0)))))) c))
(- (+ (/ b (* z c)) (* 9.0 (/ (* x y) (* z c)))) (* 4.0 (/ (* a t) c))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3e+115) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else if (z <= 8.2e+91) {
tmp = (1.0 / z) * ((b + fma(x, (9.0 * y), (a * (z * (t * -4.0))))) / c);
} else {
tmp = ((b / (z * c)) + (9.0 * ((x * y) / (z * c)))) - (4.0 * ((a * t) / c));
}
return tmp;
}
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3e+115) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); elseif (z <= 8.2e+91) tmp = Float64(Float64(1.0 / z) * Float64(Float64(b + fma(x, Float64(9.0 * y), Float64(a * Float64(z * Float64(t * Float64(-4.0)))))) / c)); else tmp = Float64(Float64(Float64(b / Float64(z * c)) + Float64(9.0 * Float64(Float64(x * y) / Float64(z * c)))) - Float64(4.0 * Float64(Float64(a * t) / 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[LessEqual[z, -3e+115], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 8.2e+91], N[(N[(1.0 / z), $MachinePrecision] * N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(z * N[(t * (-4.0)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{+115}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{elif}\;z \leq 8.2 \cdot 10^{+91}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{b + \mathsf{fma}\left(x, 9 \cdot y, a \cdot \left(z \cdot \left(t \cdot \left(-4\right)\right)\right)\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{b}{z \cdot c} + 9 \cdot \frac{x \cdot y}{z \cdot c}\right) - 4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if z < -3e115Initial program 50.0%
associate-+l-50.0%
associate-*l*50.0%
associate-*l*62.2%
Simplified62.2%
Taylor expanded in x around 0 47.5%
Taylor expanded in b around 0 87.0%
Taylor expanded in c around 0 92.4%
if -3e115 < z < 8.2000000000000005e91Initial program 92.5%
associate-+l-92.5%
associate-*r*92.6%
associate-*r*91.5%
*-un-lft-identity91.5%
times-frac93.3%
associate--r-93.3%
fma-neg93.3%
associate-*r*94.4%
distribute-rgt-neg-in94.4%
associate-*l*94.4%
Applied egg-rr94.4%
if 8.2000000000000005e91 < z Initial program 51.3%
Taylor expanded in x around 0 75.8%
Final simplification90.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 (<= z -3.1e+119)
(/ (+ (* -4.0 (* a t)) (/ b z)) c)
(if (<= z 1.42e+91)
(/ (fma x (* 9.0 y) (+ b (* t (* z (* -4.0 a))))) (* z c))
(- (+ (/ b (* z c)) (* 9.0 (/ (* x y) (* z c)))) (* 4.0 (/ (* a t) c))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3.1e+119) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else if (z <= 1.42e+91) {
tmp = fma(x, (9.0 * y), (b + (t * (z * (-4.0 * a))))) / (z * c);
} else {
tmp = ((b / (z * c)) + (9.0 * ((x * y) / (z * c)))) - (4.0 * ((a * t) / c));
}
return tmp;
}
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3.1e+119) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); elseif (z <= 1.42e+91) tmp = Float64(fma(x, Float64(9.0 * y), Float64(b + Float64(t * Float64(z * Float64(-4.0 * a))))) / Float64(z * c)); else tmp = Float64(Float64(Float64(b / Float64(z * c)) + Float64(9.0 * Float64(Float64(x * y) / Float64(z * c)))) - Float64(4.0 * Float64(Float64(a * t) / 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[LessEqual[z, -3.1e+119], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 1.42e+91], N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(b + N[(t * N[(z * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.1 \cdot 10^{+119}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{elif}\;z \leq 1.42 \cdot 10^{+91}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b + t \cdot \left(z \cdot \left(-4 \cdot a\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{b}{z \cdot c} + 9 \cdot \frac{x \cdot y}{z \cdot c}\right) - 4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if z < -3.09999999999999995e119Initial program 48.8%
associate-+l-48.8%
associate-*l*48.8%
associate-*l*61.3%
Simplified61.3%
Taylor expanded in x around 0 46.2%
Taylor expanded in b around 0 86.7%
Taylor expanded in c around 0 92.3%
if -3.09999999999999995e119 < z < 1.41999999999999995e91Initial program 92.5%
Simplified92.1%
if 1.41999999999999995e91 < z Initial program 51.3%
Taylor expanded in x around 0 75.8%
Final simplification89.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 (<= z -1.6e+118)
(/ (+ (* -4.0 (* a t)) (/ b z)) c)
(if (<= z 8.5e+90)
(/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))
(- (+ (/ b (* z c)) (* 9.0 (/ (* x y) (* z c)))) (* 4.0 (/ (* a t) c))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.6e+118) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else if (z <= 8.5e+90) {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = ((b / (z * c)) + (9.0 * ((x * y) / (z * c)))) - (4.0 * ((a * t) / 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 <= (-1.6d+118)) then
tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
else if (z <= 8.5d+90) then
tmp = (b + ((y * (x * 9.0d0)) - (a * (t * (z * 4.0d0))))) / (z * c)
else
tmp = ((b / (z * c)) + (9.0d0 * ((x * y) / (z * c)))) - (4.0d0 * ((a * t) / 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 <= -1.6e+118) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else if (z <= 8.5e+90) {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = ((b / (z * c)) + (9.0 * ((x * y) / (z * c)))) - (4.0 * ((a * t) / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -1.6e+118: tmp = ((-4.0 * (a * t)) + (b / z)) / c elif z <= 8.5e+90: tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c) else: tmp = ((b / (z * c)) + (9.0 * ((x * y) / (z * c)))) - (4.0 * ((a * t) / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.6e+118) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); elseif (z <= 8.5e+90) tmp = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); else tmp = Float64(Float64(Float64(b / Float64(z * c)) + Float64(9.0 * Float64(Float64(x * y) / Float64(z * c)))) - Float64(4.0 * Float64(Float64(a * t) / 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 <= -1.6e+118)
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
elseif (z <= 8.5e+90)
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
else
tmp = ((b / (z * c)) + (9.0 * ((x * y) / (z * c)))) - (4.0 * ((a * t) / 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[LessEqual[z, -1.6e+118], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 8.5e+90], N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.6 \cdot 10^{+118}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{elif}\;z \leq 8.5 \cdot 10^{+90}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{b}{z \cdot c} + 9 \cdot \frac{x \cdot y}{z \cdot c}\right) - 4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if z < -1.60000000000000008e118Initial program 48.8%
associate-+l-48.8%
associate-*l*48.8%
associate-*l*61.3%
Simplified61.3%
Taylor expanded in x around 0 46.2%
Taylor expanded in b around 0 86.7%
Taylor expanded in c around 0 92.3%
if -1.60000000000000008e118 < z < 8.5000000000000002e90Initial program 92.5%
if 8.5000000000000002e90 < z Initial program 51.3%
Taylor expanded in x around 0 75.8%
Final simplification89.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 c) (/ y z)))) (t_2 (/ (/ b c) z)))
(if (<= t -9e+130)
(* -4.0 (/ a (/ c t)))
(if (<= t -7.5e+77)
t_1
(if (<= t -1.3e+29)
(* -4.0 (* a (/ t c)))
(if (<= t -1.26e-129)
t_2
(if (<= t -4.8e-211)
t_1
(if (<= t -1.6e-260)
t_2
(if (<= t 1.05e-188) t_1 (* (/ a c) (/ t -0.25)))))))))))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 / c) * (y / z));
double t_2 = (b / c) / z;
double tmp;
if (t <= -9e+130) {
tmp = -4.0 * (a / (c / t));
} else if (t <= -7.5e+77) {
tmp = t_1;
} else if (t <= -1.3e+29) {
tmp = -4.0 * (a * (t / c));
} else if (t <= -1.26e-129) {
tmp = t_2;
} else if (t <= -4.8e-211) {
tmp = t_1;
} else if (t <= -1.6e-260) {
tmp = t_2;
} else if (t <= 1.05e-188) {
tmp = t_1;
} else {
tmp = (a / c) * (t / -0.25);
}
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) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * ((x / c) * (y / z))
t_2 = (b / c) / z
if (t <= (-9d+130)) then
tmp = (-4.0d0) * (a / (c / t))
else if (t <= (-7.5d+77)) then
tmp = t_1
else if (t <= (-1.3d+29)) then
tmp = (-4.0d0) * (a * (t / c))
else if (t <= (-1.26d-129)) then
tmp = t_2
else if (t <= (-4.8d-211)) then
tmp = t_1
else if (t <= (-1.6d-260)) then
tmp = t_2
else if (t <= 1.05d-188) then
tmp = t_1
else
tmp = (a / c) * (t / (-0.25d0))
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 / c) * (y / z));
double t_2 = (b / c) / z;
double tmp;
if (t <= -9e+130) {
tmp = -4.0 * (a / (c / t));
} else if (t <= -7.5e+77) {
tmp = t_1;
} else if (t <= -1.3e+29) {
tmp = -4.0 * (a * (t / c));
} else if (t <= -1.26e-129) {
tmp = t_2;
} else if (t <= -4.8e-211) {
tmp = t_1;
} else if (t <= -1.6e-260) {
tmp = t_2;
} else if (t <= 1.05e-188) {
tmp = t_1;
} else {
tmp = (a / c) * (t / -0.25);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x / c) * (y / z)) t_2 = (b / c) / z tmp = 0 if t <= -9e+130: tmp = -4.0 * (a / (c / t)) elif t <= -7.5e+77: tmp = t_1 elif t <= -1.3e+29: tmp = -4.0 * (a * (t / c)) elif t <= -1.26e-129: tmp = t_2 elif t <= -4.8e-211: tmp = t_1 elif t <= -1.6e-260: tmp = t_2 elif t <= 1.05e-188: tmp = t_1 else: tmp = (a / c) * (t / -0.25) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))) t_2 = Float64(Float64(b / c) / z) tmp = 0.0 if (t <= -9e+130) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (t <= -7.5e+77) tmp = t_1; elseif (t <= -1.3e+29) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (t <= -1.26e-129) tmp = t_2; elseif (t <= -4.8e-211) tmp = t_1; elseif (t <= -1.6e-260) tmp = t_2; elseif (t <= 1.05e-188) tmp = t_1; else tmp = Float64(Float64(a / c) * Float64(t / -0.25)); 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 / c) * (y / z));
t_2 = (b / c) / z;
tmp = 0.0;
if (t <= -9e+130)
tmp = -4.0 * (a / (c / t));
elseif (t <= -7.5e+77)
tmp = t_1;
elseif (t <= -1.3e+29)
tmp = -4.0 * (a * (t / c));
elseif (t <= -1.26e-129)
tmp = t_2;
elseif (t <= -4.8e-211)
tmp = t_1;
elseif (t <= -1.6e-260)
tmp = t_2;
elseif (t <= 1.05e-188)
tmp = t_1;
else
tmp = (a / c) * (t / -0.25);
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 / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t, -9e+130], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -7.5e+77], t$95$1, If[LessEqual[t, -1.3e+29], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.26e-129], t$95$2, If[LessEqual[t, -4.8e-211], t$95$1, If[LessEqual[t, -1.6e-260], t$95$2, If[LessEqual[t, 1.05e-188], t$95$1, N[(N[(a / c), $MachinePrecision] * N[(t / -0.25), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
t_2 := \frac{\frac{b}{c}}{z}\\
\mathbf{if}\;t \leq -9 \cdot 10^{+130}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;t \leq -7.5 \cdot 10^{+77}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -1.3 \cdot 10^{+29}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;t \leq -1.26 \cdot 10^{-129}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq -4.8 \cdot 10^{-211}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -1.6 \cdot 10^{-260}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq 1.05 \cdot 10^{-188}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \frac{t}{-0.25}\\
\end{array}
\end{array}
if t < -9.00000000000000078e130Initial program 59.2%
Taylor expanded in z around inf 59.9%
*-commutative59.9%
associate-/l*77.6%
Simplified77.6%
if -9.00000000000000078e130 < t < -7.49999999999999955e77 or -1.2599999999999999e-129 < t < -4.8000000000000004e-211 or -1.59999999999999997e-260 < t < 1.05e-188Initial program 80.6%
Taylor expanded in x around inf 45.0%
*-commutative45.0%
Simplified45.0%
Taylor expanded in x around 0 45.0%
times-frac48.8%
Simplified48.8%
if -7.49999999999999955e77 < t < -1.3e29Initial program 54.9%
associate-+l-54.9%
associate-*l*54.9%
associate-*l*63.7%
Simplified63.7%
Taylor expanded in x around 0 54.9%
Taylor expanded in b around 0 82.4%
Taylor expanded in a around inf 38.1%
associate-*r/72.8%
Simplified72.8%
if -1.3e29 < t < -1.2599999999999999e-129 or -4.8000000000000004e-211 < t < -1.59999999999999997e-260Initial program 92.2%
associate-+l-92.2%
associate-*r*92.3%
associate-*r*92.3%
*-un-lft-identity92.3%
times-frac95.0%
associate--r-95.0%
fma-neg95.0%
associate-*r*95.0%
distribute-rgt-neg-in95.0%
associate-*l*95.0%
Applied egg-rr95.0%
Taylor expanded in x around 0 87.2%
Taylor expanded in b around inf 59.1%
associate-/r*61.8%
Simplified61.8%
if 1.05e-188 < t Initial program 78.7%
associate-+l-78.7%
associate-*r*78.8%
associate-*r*82.2%
clear-num82.0%
inv-pow82.0%
associate--r-82.0%
fma-neg83.2%
associate-*r*79.8%
distribute-rgt-neg-in79.8%
associate-*l*79.8%
Applied egg-rr79.8%
Simplified82.0%
Taylor expanded in z around inf 47.3%
*-commutative47.3%
*-commutative47.3%
associate-*l/47.3%
*-commutative47.3%
Simplified47.3%
times-frac47.6%
Applied egg-rr47.6%
inv-pow47.6%
unpow-prod-down47.7%
inv-pow47.7%
clear-num47.7%
Applied egg-rr47.7%
unpow-147.7%
associate-*r/47.7%
*-rgt-identity47.7%
associate-/r*48.3%
associate-*r/48.3%
associate-/l*47.3%
times-frac47.8%
Simplified47.8%
Final simplification55.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 (if (or (<= z -2.3e+118) (not (<= z 8.6e+58))) (/ (+ (* -4.0 (* a t)) (/ b z)) c) (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* 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 <= -2.3e+118) || !(z <= 8.6e+58)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (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 <= (-2.3d+118)) .or. (.not. (z <= 8.6d+58))) then
tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
else
tmp = (b + ((y * (x * 9.0d0)) - (a * (t * (z * 4.0d0))))) / (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 <= -2.3e+118) || !(z <= 8.6e+58)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -2.3e+118) or not (z <= 8.6e+58): tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.3e+118) || !(z <= 8.6e+58)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / 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 <= -2.3e+118) || ~((z <= 8.6e+58)))
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (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, -2.3e+118], N[Not[LessEqual[z, 8.6e+58]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $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 -2.3 \cdot 10^{+118} \lor \neg \left(z \leq 8.6 \cdot 10^{+58}\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.30000000000000016e118 or 8.59999999999999982e58 < z Initial program 51.2%
associate-+l-51.2%
associate-*l*51.2%
associate-*l*59.0%
Simplified59.0%
Taylor expanded in x around 0 45.8%
Taylor expanded in b around 0 75.8%
Taylor expanded in c around 0 81.5%
if -2.30000000000000016e118 < z < 8.59999999999999982e58Initial program 93.4%
Final simplification89.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 z) (/ y c)))))
(if (<= z -8.2e-29)
(/ (* a (* -4.0 t)) c)
(if (<= z -3.8e-157)
t_1
(if (<= z -5.5e-249)
(/ 1.0 (/ (* z c) b))
(if (<= z 6e-274)
t_1
(if (<= z 1.95e-16) (/ b (* z c)) (* -4.0 (* a (/ t c))))))))))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 / z) * (y / c));
double tmp;
if (z <= -8.2e-29) {
tmp = (a * (-4.0 * t)) / c;
} else if (z <= -3.8e-157) {
tmp = t_1;
} else if (z <= -5.5e-249) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 6e-274) {
tmp = t_1;
} else if (z <= 1.95e-16) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 = 9.0d0 * ((x / z) * (y / c))
if (z <= (-8.2d-29)) then
tmp = (a * ((-4.0d0) * t)) / c
else if (z <= (-3.8d-157)) then
tmp = t_1
else if (z <= (-5.5d-249)) then
tmp = 1.0d0 / ((z * c) / b)
else if (z <= 6d-274) then
tmp = t_1
else if (z <= 1.95d-16) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 = 9.0 * ((x / z) * (y / c));
double tmp;
if (z <= -8.2e-29) {
tmp = (a * (-4.0 * t)) / c;
} else if (z <= -3.8e-157) {
tmp = t_1;
} else if (z <= -5.5e-249) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 6e-274) {
tmp = t_1;
} else if (z <= 1.95e-16) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x / z) * (y / c)) tmp = 0 if z <= -8.2e-29: tmp = (a * (-4.0 * t)) / c elif z <= -3.8e-157: tmp = t_1 elif z <= -5.5e-249: tmp = 1.0 / ((z * c) / b) elif z <= 6e-274: tmp = t_1 elif z <= 1.95e-16: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))) tmp = 0.0 if (z <= -8.2e-29) tmp = Float64(Float64(a * Float64(-4.0 * t)) / c); elseif (z <= -3.8e-157) tmp = t_1; elseif (z <= -5.5e-249) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); elseif (z <= 6e-274) tmp = t_1; elseif (z <= 1.95e-16) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / c))); 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 / z) * (y / c));
tmp = 0.0;
if (z <= -8.2e-29)
tmp = (a * (-4.0 * t)) / c;
elseif (z <= -3.8e-157)
tmp = t_1;
elseif (z <= -5.5e-249)
tmp = 1.0 / ((z * c) / b);
elseif (z <= 6e-274)
tmp = t_1;
elseif (z <= 1.95e-16)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -8.2e-29], N[(N[(a * N[(-4.0 * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, -3.8e-157], t$95$1, If[LessEqual[z, -5.5e-249], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6e-274], t$95$1, If[LessEqual[z, 1.95e-16], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{if}\;z \leq -8.2 \cdot 10^{-29}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t\right)}{c}\\
\mathbf{elif}\;z \leq -3.8 \cdot 10^{-157}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -5.5 \cdot 10^{-249}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{elif}\;z \leq 6 \cdot 10^{-274}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 1.95 \cdot 10^{-16}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -8.1999999999999996e-29Initial program 72.5%
Taylor expanded in z around inf 60.5%
associate-*r/60.5%
*-commutative60.5%
associate-*r*60.5%
Simplified60.5%
if -8.1999999999999996e-29 < z < -3.8000000000000002e-157 or -5.49999999999999999e-249 < z < 5.99999999999999954e-274Initial program 95.7%
Taylor expanded in x around inf 63.8%
*-commutative63.8%
Simplified63.8%
Taylor expanded in x around 0 63.8%
*-commutative63.8%
times-frac67.8%
Simplified67.8%
if -3.8000000000000002e-157 < z < -5.49999999999999999e-249Initial program 93.9%
associate-+l-93.9%
associate-*r*94.0%
associate-*r*94.0%
clear-num94.1%
inv-pow94.1%
associate--r-94.1%
fma-neg94.1%
associate-*r*94.1%
distribute-rgt-neg-in94.1%
associate-*l*94.1%
Applied egg-rr94.1%
Simplified94.0%
Taylor expanded in b around inf 75.4%
if 5.99999999999999954e-274 < z < 1.94999999999999989e-16Initial program 91.7%
Taylor expanded in b around inf 58.8%
*-commutative58.8%
Simplified58.8%
if 1.94999999999999989e-16 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification62.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
(if (<= z -1.75e-28)
(/ (* a (* -4.0 t)) c)
(if (<= z -1.2e-156)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= z -3.9e-249)
(/ 1.0 (/ (* z c) b))
(if (<= z 3.6e-181)
(* 9.0 (/ (* x y) (* z c)))
(if (<= z 3.35e-18) (/ b (* z c)) (* -4.0 (* a (/ t c)))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.75e-28) {
tmp = (a * (-4.0 * t)) / c;
} else if (z <= -1.2e-156) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (z <= -3.9e-249) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 3.6e-181) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (z <= 3.35e-18) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 <= (-1.75d-28)) then
tmp = (a * ((-4.0d0) * t)) / c
else if (z <= (-1.2d-156)) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (z <= (-3.9d-249)) then
tmp = 1.0d0 / ((z * c) / b)
else if (z <= 3.6d-181) then
tmp = 9.0d0 * ((x * y) / (z * c))
else if (z <= 3.35d-18) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 <= -1.75e-28) {
tmp = (a * (-4.0 * t)) / c;
} else if (z <= -1.2e-156) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (z <= -3.9e-249) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 3.6e-181) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (z <= 3.35e-18) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -1.75e-28: tmp = (a * (-4.0 * t)) / c elif z <= -1.2e-156: tmp = 9.0 * ((x / z) * (y / c)) elif z <= -3.9e-249: tmp = 1.0 / ((z * c) / b) elif z <= 3.6e-181: tmp = 9.0 * ((x * y) / (z * c)) elif z <= 3.35e-18: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.75e-28) tmp = Float64(Float64(a * Float64(-4.0 * t)) / c); elseif (z <= -1.2e-156) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (z <= -3.9e-249) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); elseif (z <= 3.6e-181) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))); elseif (z <= 3.35e-18) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / 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 <= -1.75e-28)
tmp = (a * (-4.0 * t)) / c;
elseif (z <= -1.2e-156)
tmp = 9.0 * ((x / z) * (y / c));
elseif (z <= -3.9e-249)
tmp = 1.0 / ((z * c) / b);
elseif (z <= 3.6e-181)
tmp = 9.0 * ((x * y) / (z * c));
elseif (z <= 3.35e-18)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[LessEqual[z, -1.75e-28], N[(N[(a * N[(-4.0 * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, -1.2e-156], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -3.9e-249], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.6e-181], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.35e-18], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{-28}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t\right)}{c}\\
\mathbf{elif}\;z \leq -1.2 \cdot 10^{-156}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;z \leq -3.9 \cdot 10^{-249}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{elif}\;z \leq 3.6 \cdot 10^{-181}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;z \leq 3.35 \cdot 10^{-18}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -1.75e-28Initial program 72.5%
Taylor expanded in z around inf 60.5%
associate-*r/60.5%
*-commutative60.5%
associate-*r*60.5%
Simplified60.5%
if -1.75e-28 < z < -1.2e-156Initial program 92.4%
Taylor expanded in x around inf 58.5%
*-commutative58.5%
Simplified58.5%
Taylor expanded in x around 0 58.5%
*-commutative58.5%
times-frac66.0%
Simplified66.0%
if -1.2e-156 < z < -3.8999999999999999e-249Initial program 93.9%
associate-+l-93.9%
associate-*r*94.0%
associate-*r*94.0%
clear-num94.1%
inv-pow94.1%
associate--r-94.1%
fma-neg94.1%
associate-*r*94.1%
distribute-rgt-neg-in94.1%
associate-*l*94.1%
Applied egg-rr94.1%
Simplified94.0%
Taylor expanded in b around inf 75.4%
if -3.8999999999999999e-249 < z < 3.5999999999999999e-181Initial program 97.3%
Taylor expanded in x around inf 67.1%
*-commutative67.1%
Simplified67.1%
if 3.5999999999999999e-181 < z < 3.3499999999999999e-18Initial program 90.4%
Taylor expanded in b around inf 59.6%
*-commutative59.6%
Simplified59.6%
if 3.3499999999999999e-18 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification63.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
(if (<= z -3.2e-29)
(* (* a t) (/ 1.0 (* c -0.25)))
(if (<= z -5.5e-158)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= z -7.4e-246)
(/ 1.0 (/ (* z c) b))
(if (<= z 1.4e-181)
(* 9.0 (/ (* x y) (* z c)))
(if (<= z 1.85e-17) (/ b (* z c)) (* -4.0 (* a (/ t c)))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3.2e-29) {
tmp = (a * t) * (1.0 / (c * -0.25));
} else if (z <= -5.5e-158) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (z <= -7.4e-246) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 1.4e-181) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (z <= 1.85e-17) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 <= (-3.2d-29)) then
tmp = (a * t) * (1.0d0 / (c * (-0.25d0)))
else if (z <= (-5.5d-158)) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (z <= (-7.4d-246)) then
tmp = 1.0d0 / ((z * c) / b)
else if (z <= 1.4d-181) then
tmp = 9.0d0 * ((x * y) / (z * c))
else if (z <= 1.85d-17) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 <= -3.2e-29) {
tmp = (a * t) * (1.0 / (c * -0.25));
} else if (z <= -5.5e-158) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (z <= -7.4e-246) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 1.4e-181) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (z <= 1.85e-17) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -3.2e-29: tmp = (a * t) * (1.0 / (c * -0.25)) elif z <= -5.5e-158: tmp = 9.0 * ((x / z) * (y / c)) elif z <= -7.4e-246: tmp = 1.0 / ((z * c) / b) elif z <= 1.4e-181: tmp = 9.0 * ((x * y) / (z * c)) elif z <= 1.85e-17: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3.2e-29) tmp = Float64(Float64(a * t) * Float64(1.0 / Float64(c * -0.25))); elseif (z <= -5.5e-158) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (z <= -7.4e-246) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); elseif (z <= 1.4e-181) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))); elseif (z <= 1.85e-17) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / 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 <= -3.2e-29)
tmp = (a * t) * (1.0 / (c * -0.25));
elseif (z <= -5.5e-158)
tmp = 9.0 * ((x / z) * (y / c));
elseif (z <= -7.4e-246)
tmp = 1.0 / ((z * c) / b);
elseif (z <= 1.4e-181)
tmp = 9.0 * ((x * y) / (z * c));
elseif (z <= 1.85e-17)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[LessEqual[z, -3.2e-29], N[(N[(a * t), $MachinePrecision] * N[(1.0 / N[(c * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -5.5e-158], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -7.4e-246], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.4e-181], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.85e-17], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.2 \cdot 10^{-29}:\\
\;\;\;\;\left(a \cdot t\right) \cdot \frac{1}{c \cdot -0.25}\\
\mathbf{elif}\;z \leq -5.5 \cdot 10^{-158}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;z \leq -7.4 \cdot 10^{-246}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{elif}\;z \leq 1.4 \cdot 10^{-181}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;z \leq 1.85 \cdot 10^{-17}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -3.2e-29Initial program 72.5%
associate-+l-72.5%
associate-*r*72.5%
associate-*r*78.7%
clear-num78.6%
inv-pow78.6%
associate--r-78.6%
fma-neg78.6%
associate-*r*72.4%
distribute-rgt-neg-in72.4%
associate-*l*72.4%
Applied egg-rr72.4%
Simplified78.6%
Taylor expanded in z around inf 60.3%
*-commutative60.3%
*-commutative60.3%
associate-*l/60.3%
*-commutative60.3%
Simplified60.3%
associate-/r/60.5%
Applied egg-rr60.5%
if -3.2e-29 < z < -5.50000000000000025e-158Initial program 92.4%
Taylor expanded in x around inf 58.5%
*-commutative58.5%
Simplified58.5%
Taylor expanded in x around 0 58.5%
*-commutative58.5%
times-frac66.0%
Simplified66.0%
if -5.50000000000000025e-158 < z < -7.4e-246Initial program 93.9%
associate-+l-93.9%
associate-*r*94.0%
associate-*r*94.0%
clear-num94.1%
inv-pow94.1%
associate--r-94.1%
fma-neg94.1%
associate-*r*94.1%
distribute-rgt-neg-in94.1%
associate-*l*94.1%
Applied egg-rr94.1%
Simplified94.0%
Taylor expanded in b around inf 75.4%
if -7.4e-246 < z < 1.39999999999999993e-181Initial program 97.3%
Taylor expanded in x around inf 67.1%
*-commutative67.1%
Simplified67.1%
if 1.39999999999999993e-181 < z < 1.8499999999999999e-17Initial program 90.4%
Taylor expanded in b around inf 59.6%
*-commutative59.6%
Simplified59.6%
if 1.8499999999999999e-17 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification63.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
(if (<= z -1.45e-28)
(* (* a t) (/ 1.0 (* c -0.25)))
(if (<= z -2.9e-158)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= z -1.02e-244)
(/ 1.0 (/ (* z c) b))
(if (<= z 6.6e-183)
(/ (* 9.0 (* x y)) (* z c))
(if (<= z 2.55e-17) (/ b (* z c)) (* -4.0 (* a (/ t c)))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.45e-28) {
tmp = (a * t) * (1.0 / (c * -0.25));
} else if (z <= -2.9e-158) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (z <= -1.02e-244) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 6.6e-183) {
tmp = (9.0 * (x * y)) / (z * c);
} else if (z <= 2.55e-17) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 <= (-1.45d-28)) then
tmp = (a * t) * (1.0d0 / (c * (-0.25d0)))
else if (z <= (-2.9d-158)) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (z <= (-1.02d-244)) then
tmp = 1.0d0 / ((z * c) / b)
else if (z <= 6.6d-183) then
tmp = (9.0d0 * (x * y)) / (z * c)
else if (z <= 2.55d-17) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 <= -1.45e-28) {
tmp = (a * t) * (1.0 / (c * -0.25));
} else if (z <= -2.9e-158) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (z <= -1.02e-244) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 6.6e-183) {
tmp = (9.0 * (x * y)) / (z * c);
} else if (z <= 2.55e-17) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -1.45e-28: tmp = (a * t) * (1.0 / (c * -0.25)) elif z <= -2.9e-158: tmp = 9.0 * ((x / z) * (y / c)) elif z <= -1.02e-244: tmp = 1.0 / ((z * c) / b) elif z <= 6.6e-183: tmp = (9.0 * (x * y)) / (z * c) elif z <= 2.55e-17: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.45e-28) tmp = Float64(Float64(a * t) * Float64(1.0 / Float64(c * -0.25))); elseif (z <= -2.9e-158) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (z <= -1.02e-244) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); elseif (z <= 6.6e-183) tmp = Float64(Float64(9.0 * Float64(x * y)) / Float64(z * c)); elseif (z <= 2.55e-17) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / 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 <= -1.45e-28)
tmp = (a * t) * (1.0 / (c * -0.25));
elseif (z <= -2.9e-158)
tmp = 9.0 * ((x / z) * (y / c));
elseif (z <= -1.02e-244)
tmp = 1.0 / ((z * c) / b);
elseif (z <= 6.6e-183)
tmp = (9.0 * (x * y)) / (z * c);
elseif (z <= 2.55e-17)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[LessEqual[z, -1.45e-28], N[(N[(a * t), $MachinePrecision] * N[(1.0 / N[(c * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.9e-158], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.02e-244], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.6e-183], N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.55e-17], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.45 \cdot 10^{-28}:\\
\;\;\;\;\left(a \cdot t\right) \cdot \frac{1}{c \cdot -0.25}\\
\mathbf{elif}\;z \leq -2.9 \cdot 10^{-158}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;z \leq -1.02 \cdot 10^{-244}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{elif}\;z \leq 6.6 \cdot 10^{-183}:\\
\;\;\;\;\frac{9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 2.55 \cdot 10^{-17}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -1.45000000000000006e-28Initial program 72.5%
associate-+l-72.5%
associate-*r*72.5%
associate-*r*78.7%
clear-num78.6%
inv-pow78.6%
associate--r-78.6%
fma-neg78.6%
associate-*r*72.4%
distribute-rgt-neg-in72.4%
associate-*l*72.4%
Applied egg-rr72.4%
Simplified78.6%
Taylor expanded in z around inf 60.3%
*-commutative60.3%
*-commutative60.3%
associate-*l/60.3%
*-commutative60.3%
Simplified60.3%
associate-/r/60.5%
Applied egg-rr60.5%
if -1.45000000000000006e-28 < z < -2.8999999999999998e-158Initial program 92.4%
Taylor expanded in x around inf 58.5%
*-commutative58.5%
Simplified58.5%
Taylor expanded in x around 0 58.5%
*-commutative58.5%
times-frac66.0%
Simplified66.0%
if -2.8999999999999998e-158 < z < -1.02000000000000006e-244Initial program 93.9%
associate-+l-93.9%
associate-*r*94.0%
associate-*r*94.0%
clear-num94.1%
inv-pow94.1%
associate--r-94.1%
fma-neg94.1%
associate-*r*94.1%
distribute-rgt-neg-in94.1%
associate-*l*94.1%
Applied egg-rr94.1%
Simplified94.0%
Taylor expanded in b around inf 75.4%
if -1.02000000000000006e-244 < z < 6.5999999999999999e-183Initial program 97.3%
Taylor expanded in x around inf 67.1%
*-commutative67.1%
Simplified67.1%
associate-*r/67.3%
Applied egg-rr67.3%
if 6.5999999999999999e-183 < z < 2.5500000000000001e-17Initial program 90.4%
Taylor expanded in b around inf 59.6%
*-commutative59.6%
Simplified59.6%
if 2.5500000000000001e-17 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification63.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 (<= z -1.75e-29)
(* (* a t) (/ 1.0 (* c -0.25)))
(if (<= z -1.45e-183)
(* (/ 1.0 z) (* 9.0 (/ x (/ c y))))
(if (<= z -1.46e-248)
(/ 1.0 (/ (* z c) b))
(if (<= z 9.5e-183)
(/ (* 9.0 (* x y)) (* z c))
(if (<= z 5.6e-18) (/ b (* z c)) (* -4.0 (* a (/ t c)))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.75e-29) {
tmp = (a * t) * (1.0 / (c * -0.25));
} else if (z <= -1.45e-183) {
tmp = (1.0 / z) * (9.0 * (x / (c / y)));
} else if (z <= -1.46e-248) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 9.5e-183) {
tmp = (9.0 * (x * y)) / (z * c);
} else if (z <= 5.6e-18) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 <= (-1.75d-29)) then
tmp = (a * t) * (1.0d0 / (c * (-0.25d0)))
else if (z <= (-1.45d-183)) then
tmp = (1.0d0 / z) * (9.0d0 * (x / (c / y)))
else if (z <= (-1.46d-248)) then
tmp = 1.0d0 / ((z * c) / b)
else if (z <= 9.5d-183) then
tmp = (9.0d0 * (x * y)) / (z * c)
else if (z <= 5.6d-18) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 <= -1.75e-29) {
tmp = (a * t) * (1.0 / (c * -0.25));
} else if (z <= -1.45e-183) {
tmp = (1.0 / z) * (9.0 * (x / (c / y)));
} else if (z <= -1.46e-248) {
tmp = 1.0 / ((z * c) / b);
} else if (z <= 9.5e-183) {
tmp = (9.0 * (x * y)) / (z * c);
} else if (z <= 5.6e-18) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -1.75e-29: tmp = (a * t) * (1.0 / (c * -0.25)) elif z <= -1.45e-183: tmp = (1.0 / z) * (9.0 * (x / (c / y))) elif z <= -1.46e-248: tmp = 1.0 / ((z * c) / b) elif z <= 9.5e-183: tmp = (9.0 * (x * y)) / (z * c) elif z <= 5.6e-18: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.75e-29) tmp = Float64(Float64(a * t) * Float64(1.0 / Float64(c * -0.25))); elseif (z <= -1.45e-183) tmp = Float64(Float64(1.0 / z) * Float64(9.0 * Float64(x / Float64(c / y)))); elseif (z <= -1.46e-248) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); elseif (z <= 9.5e-183) tmp = Float64(Float64(9.0 * Float64(x * y)) / Float64(z * c)); elseif (z <= 5.6e-18) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / 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 <= -1.75e-29)
tmp = (a * t) * (1.0 / (c * -0.25));
elseif (z <= -1.45e-183)
tmp = (1.0 / z) * (9.0 * (x / (c / y)));
elseif (z <= -1.46e-248)
tmp = 1.0 / ((z * c) / b);
elseif (z <= 9.5e-183)
tmp = (9.0 * (x * y)) / (z * c);
elseif (z <= 5.6e-18)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[LessEqual[z, -1.75e-29], N[(N[(a * t), $MachinePrecision] * N[(1.0 / N[(c * -0.25), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.45e-183], N[(N[(1.0 / z), $MachinePrecision] * N[(9.0 * N[(x / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.46e-248], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9.5e-183], N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.6e-18], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{-29}:\\
\;\;\;\;\left(a \cdot t\right) \cdot \frac{1}{c \cdot -0.25}\\
\mathbf{elif}\;z \leq -1.45 \cdot 10^{-183}:\\
\;\;\;\;\frac{1}{z} \cdot \left(9 \cdot \frac{x}{\frac{c}{y}}\right)\\
\mathbf{elif}\;z \leq -1.46 \cdot 10^{-248}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{elif}\;z \leq 9.5 \cdot 10^{-183}:\\
\;\;\;\;\frac{9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 5.6 \cdot 10^{-18}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -1.7499999999999999e-29Initial program 72.5%
associate-+l-72.5%
associate-*r*72.5%
associate-*r*78.7%
clear-num78.6%
inv-pow78.6%
associate--r-78.6%
fma-neg78.6%
associate-*r*72.4%
distribute-rgt-neg-in72.4%
associate-*l*72.4%
Applied egg-rr72.4%
Simplified78.6%
Taylor expanded in z around inf 60.3%
*-commutative60.3%
*-commutative60.3%
associate-*l/60.3%
*-commutative60.3%
Simplified60.3%
associate-/r/60.5%
Applied egg-rr60.5%
if -1.7499999999999999e-29 < z < -1.45e-183Initial program 90.2%
associate-+l-90.2%
associate-*r*90.2%
associate-*r*90.2%
*-un-lft-identity90.2%
times-frac90.1%
associate--r-90.1%
fma-neg90.1%
associate-*r*90.1%
distribute-rgt-neg-in90.1%
associate-*l*90.1%
Applied egg-rr90.1%
Taylor expanded in x around inf 57.5%
associate-/l*67.0%
Simplified67.0%
if -1.45e-183 < z < -1.4599999999999999e-248Initial program 99.7%
associate-+l-99.7%
associate-*r*99.7%
associate-*r*99.7%
clear-num99.9%
inv-pow99.9%
associate--r-99.9%
fma-neg99.9%
associate-*r*99.9%
distribute-rgt-neg-in99.9%
associate-*l*99.9%
Applied egg-rr99.9%
Simplified99.9%
Taylor expanded in b around inf 83.7%
if -1.4599999999999999e-248 < z < 9.5000000000000008e-183Initial program 97.3%
Taylor expanded in x around inf 67.1%
*-commutative67.1%
Simplified67.1%
associate-*r/67.3%
Applied egg-rr67.3%
if 9.5000000000000008e-183 < z < 5.60000000000000025e-18Initial program 90.4%
Taylor expanded in b around inf 59.6%
*-commutative59.6%
Simplified59.6%
if 5.60000000000000025e-18 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification63.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 (if (or (<= y -3.2e+16) (not (<= y 3.1e+166))) (* (/ 1.0 z) (* 9.0 (/ x (/ c y)))) (/ (+ (* -4.0 (* a t)) (/ b z)) c)))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((y <= -3.2e+16) || !(y <= 3.1e+166)) {
tmp = (1.0 / z) * (9.0 * (x / (c / y)));
} else {
tmp = ((-4.0 * (a * t)) + (b / 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 ((y <= (-3.2d+16)) .or. (.not. (y <= 3.1d+166))) then
tmp = (1.0d0 / z) * (9.0d0 * (x / (c / y)))
else
tmp = (((-4.0d0) * (a * t)) + (b / 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 ((y <= -3.2e+16) || !(y <= 3.1e+166)) {
tmp = (1.0 / z) * (9.0 * (x / (c / y)));
} else {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (y <= -3.2e+16) or not (y <= 3.1e+166): tmp = (1.0 / z) * (9.0 * (x / (c / y))) else: tmp = ((-4.0 * (a * t)) + (b / z)) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((y <= -3.2e+16) || !(y <= 3.1e+166)) tmp = Float64(Float64(1.0 / z) * Float64(9.0 * Float64(x / Float64(c / y)))); else tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / 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 ((y <= -3.2e+16) || ~((y <= 3.1e+166)))
tmp = (1.0 / z) * (9.0 * (x / (c / y)));
else
tmp = ((-4.0 * (a * t)) + (b / 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[y, -3.2e+16], N[Not[LessEqual[y, 3.1e+166]], $MachinePrecision]], N[(N[(1.0 / z), $MachinePrecision] * N[(9.0 * N[(x / N[(c / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.2 \cdot 10^{+16} \lor \neg \left(y \leq 3.1 \cdot 10^{+166}\right):\\
\;\;\;\;\frac{1}{z} \cdot \left(9 \cdot \frac{x}{\frac{c}{y}}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\end{array}
\end{array}
if y < -3.2e16 or 3.09999999999999983e166 < y Initial program 76.6%
associate-+l-76.6%
associate-*r*76.7%
associate-*r*77.9%
*-un-lft-identity77.9%
times-frac80.4%
associate--r-80.4%
fma-neg81.8%
associate-*r*81.8%
distribute-rgt-neg-in81.8%
associate-*l*81.8%
Applied egg-rr81.8%
Taylor expanded in x around inf 57.2%
associate-/l*65.6%
Simplified65.6%
if -3.2e16 < y < 3.09999999999999983e166Initial program 79.5%
associate-+l-79.5%
associate-*l*79.5%
associate-*l*81.9%
Simplified81.9%
Taylor expanded in x around 0 67.2%
Taylor expanded in b around 0 78.6%
Taylor expanded in c around 0 76.6%
Final simplification73.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 (if (or (<= z -6.4e-24) (not (<= z 3e+57))) (/ (+ (* -4.0 (* a t)) (/ b z)) c) (/ (+ b (* x (* 9.0 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 <= -6.4e-24) || !(z <= 3e+57)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (x * (9.0 * 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 <= (-6.4d-24)) .or. (.not. (z <= 3d+57))) then
tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
else
tmp = (b + (x * (9.0d0 * 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 <= -6.4e-24) || !(z <= 3e+57)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -6.4e-24) or not (z <= 3e+57): tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = (b + (x * (9.0 * y))) / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -6.4e-24) || !(z <= 3e+57)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); else tmp = Float64(Float64(b + Float64(x * Float64(9.0 * 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 <= -6.4e-24) || ~((z <= 3e+57)))
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = (b + (x * (9.0 * 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, -6.4e-24], N[Not[LessEqual[z, 3e+57]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * 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 -6.4 \cdot 10^{-24} \lor \neg \left(z \leq 3 \cdot 10^{+57}\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -6.40000000000000025e-24 or 3e57 < z Initial program 64.7%
associate-+l-64.7%
associate-*l*64.7%
associate-*l*70.1%
Simplified70.1%
Taylor expanded in x around 0 54.2%
Taylor expanded in b around 0 75.7%
Taylor expanded in c around 0 79.7%
if -6.40000000000000025e-24 < z < 3e57Initial program 93.0%
Taylor expanded in x around inf 83.2%
associate-*r*83.1%
*-commutative83.1%
associate-*r*83.2%
Simplified83.2%
Final simplification81.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 (or (<= t -1.24e+29) (not (<= t 5.8e-118))) (* -4.0 (* a (/ t c))) (/ b (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -1.24e+29) || !(t <= 5.8e-118)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (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 ((t <= (-1.24d+29)) .or. (.not. (t <= 5.8d-118))) then
tmp = (-4.0d0) * (a * (t / c))
else
tmp = b / (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 ((t <= -1.24e+29) || !(t <= 5.8e-118)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -1.24e+29) or not (t <= 5.8e-118): tmp = -4.0 * (a * (t / c)) else: tmp = b / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -1.24e+29) || !(t <= 5.8e-118)) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); else tmp = Float64(b / 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 ((t <= -1.24e+29) || ~((t <= 5.8e-118)))
tmp = -4.0 * (a * (t / c));
else
tmp = b / (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[t, -1.24e+29], N[Not[LessEqual[t, 5.8e-118]], $MachinePrecision]], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.24 \cdot 10^{+29} \lor \neg \left(t \leq 5.8 \cdot 10^{-118}\right):\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if t < -1.24e29 or 5.79999999999999961e-118 < t Initial program 68.9%
associate-+l-68.9%
associate-*l*68.9%
associate-*l*72.7%
Simplified72.7%
Taylor expanded in x around 0 53.3%
Taylor expanded in b around 0 68.9%
Taylor expanded in a around inf 51.3%
associate-*r/59.8%
Simplified59.8%
if -1.24e29 < t < 5.79999999999999961e-118Initial program 89.4%
Taylor expanded in b around inf 50.3%
*-commutative50.3%
Simplified50.3%
Final simplification55.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 (<= z -8.4e-10) (* (/ a c) (/ t -0.25)) (if (<= z 2.05e-15) (/ b (* z c)) (* -4.0 (* a (/ t 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-10) {
tmp = (a / c) * (t / -0.25);
} else if (z <= 2.05e-15) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 <= (-8.4d-10)) then
tmp = (a / c) * (t / (-0.25d0))
else if (z <= 2.05d-15) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 <= -8.4e-10) {
tmp = (a / c) * (t / -0.25);
} else if (z <= 2.05e-15) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -8.4e-10: tmp = (a / c) * (t / -0.25) elif z <= 2.05e-15: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -8.4e-10) tmp = Float64(Float64(a / c) * Float64(t / -0.25)); elseif (z <= 2.05e-15) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / 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 <= -8.4e-10)
tmp = (a / c) * (t / -0.25);
elseif (z <= 2.05e-15)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[LessEqual[z, -8.4e-10], N[(N[(a / c), $MachinePrecision] * N[(t / -0.25), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.05e-15], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8.4 \cdot 10^{-10}:\\
\;\;\;\;\frac{a}{c} \cdot \frac{t}{-0.25}\\
\mathbf{elif}\;z \leq 2.05 \cdot 10^{-15}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -8.3999999999999999e-10Initial program 68.8%
associate-+l-68.8%
associate-*r*68.8%
associate-*r*75.8%
clear-num75.7%
inv-pow75.7%
associate--r-75.7%
fma-neg75.7%
associate-*r*68.7%
distribute-rgt-neg-in68.7%
associate-*l*68.7%
Applied egg-rr68.7%
Simplified75.7%
Taylor expanded in z around inf 62.9%
*-commutative62.9%
*-commutative62.9%
associate-*l/62.9%
*-commutative62.9%
Simplified62.9%
times-frac59.4%
Applied egg-rr59.4%
inv-pow59.4%
unpow-prod-down59.6%
inv-pow59.6%
clear-num59.6%
Applied egg-rr59.6%
unpow-159.6%
associate-*r/59.7%
*-rgt-identity59.7%
associate-/r*57.4%
associate-*r/57.4%
associate-/l*63.1%
times-frac59.7%
Simplified59.7%
if -8.3999999999999999e-10 < z < 2.05000000000000018e-15Initial program 94.2%
Taylor expanded in b around inf 52.8%
*-commutative52.8%
Simplified52.8%
if 2.05000000000000018e-15 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification57.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 (if (<= z -6.2e-10) (/ (* a (* -4.0 t)) c) (if (<= z 3.2e-11) (/ b (* z c)) (* -4.0 (* a (/ t c))))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -6.2e-10) {
tmp = (a * (-4.0 * t)) / c;
} else if (z <= 3.2e-11) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / 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 <= (-6.2d-10)) then
tmp = (a * ((-4.0d0) * t)) / c
else if (z <= 3.2d-11) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / 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 <= -6.2e-10) {
tmp = (a * (-4.0 * t)) / c;
} else if (z <= 3.2e-11) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -6.2e-10: tmp = (a * (-4.0 * t)) / c elif z <= 3.2e-11: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -6.2e-10) tmp = Float64(Float64(a * Float64(-4.0 * t)) / c); elseif (z <= 3.2e-11) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / 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 <= -6.2e-10)
tmp = (a * (-4.0 * t)) / c;
elseif (z <= 3.2e-11)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / 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[LessEqual[z, -6.2e-10], N[(N[(a * N[(-4.0 * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 3.2e-11], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6.2 \cdot 10^{-10}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t\right)}{c}\\
\mathbf{elif}\;z \leq 3.2 \cdot 10^{-11}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -6.2000000000000003e-10Initial program 68.8%
Taylor expanded in z around inf 63.1%
associate-*r/63.1%
*-commutative63.1%
associate-*r*63.1%
Simplified63.1%
if -6.2000000000000003e-10 < z < 3.19999999999999994e-11Initial program 94.2%
Taylor expanded in b around inf 52.8%
*-commutative52.8%
Simplified52.8%
if 3.19999999999999994e-11 < z Initial program 61.5%
associate-+l-61.5%
associate-*l*61.5%
associate-*l*64.5%
Simplified64.5%
Taylor expanded in x around 0 45.7%
Taylor expanded in b around 0 62.0%
Taylor expanded in a around inf 51.7%
associate-*r/62.3%
Simplified62.3%
Final simplification58.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 (/ 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 78.6%
Taylor expanded in b around inf 38.4%
*-commutative38.4%
Simplified38.4%
Final simplification38.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 (/ (/ b c) z))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
return (b / c) / z;
}
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 / c) / z
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 / c) / z;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): return (b / c) / z
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) return Float64(Float64(b / c) / z) end
t, a = num2cell(sort([t, a])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = (b / c) / z;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\frac{\frac{b}{c}}{z}
\end{array}
Initial program 78.6%
associate-+l-78.6%
associate-*r*78.6%
associate-*r*80.6%
*-un-lft-identity80.6%
times-frac83.5%
associate--r-83.5%
fma-neg83.9%
associate-*r*81.6%
distribute-rgt-neg-in81.6%
associate-*l*81.6%
Applied egg-rr81.6%
Taylor expanded in x around 0 76.1%
Taylor expanded in b around inf 38.4%
associate-/r*39.0%
Simplified39.0%
Final simplification39.0%
(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 2023310
(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)))