
(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 17 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -8e-16) (not (<= z 2000.0))) (/ (+ (* -4.0 (* a t)) (+ (* 9.0 (/ (* x y) z)) (/ b z))) c) (/ (fma x (* 9.0 y) (+ b (* t (* z (* -4.0 a))))) (* z c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8e-16) || !(z <= 2000.0)) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = fma(x, (9.0 * y), (b + (t * (z * (-4.0 * a))))) / (z * c);
}
return tmp;
}
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -8e-16) || !(z <= 2000.0)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(Float64(9.0 * Float64(Float64(x * y) / z)) + Float64(b / z))) / c); else tmp = Float64(fma(x, Float64(9.0 * y), Float64(b + Float64(t * Float64(z * Float64(-4.0 * a))))) / Float64(z * c)); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -8e-16], N[Not[LessEqual[z, 2000.0]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], 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]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8 \cdot 10^{-16} \lor \neg \left(z \leq 2000\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(9 \cdot \frac{x \cdot y}{z} + \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b + t \cdot \left(z \cdot \left(-4 \cdot a\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -7.9999999999999998e-16 or 2e3 < z Initial program 67.3%
associate-+l-67.3%
associate-*r*67.3%
associate-*r*72.6%
*-un-lft-identity72.6%
times-frac70.8%
associate--r-70.8%
fma-neg71.0%
associate-*r*65.9%
distribute-rgt-neg-in65.9%
associate-*l*65.9%
Applied egg-rr65.9%
associate-*r/74.8%
associate-*l*82.4%
Applied egg-rr82.4%
Taylor expanded in z around 0 89.7%
if -7.9999999999999998e-16 < z < 2e3Initial program 97.5%
Simplified97.6%
Final simplification94.1%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (+ b (* x (* 9.0 y)))) (t_2 (* -4.0 (* a t))))
(if (<= z -1.35e+28)
(/ (+ t_2 (/ b z)) c)
(if (<= z -6.5e-86)
(* (/ 1.0 z) (/ t_1 c))
(if (<= z -2e-152)
(/ (- b (* 4.0 (* a (* z t)))) (* z c))
(if (<= z 8.5e+31)
(/ t_1 (* z c))
(/ (+ t_2 (/ (* 9.0 x) (/ z y))) c)))))))assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b + (x * (9.0 * y));
double t_2 = -4.0 * (a * t);
double tmp;
if (z <= -1.35e+28) {
tmp = (t_2 + (b / z)) / c;
} else if (z <= -6.5e-86) {
tmp = (1.0 / z) * (t_1 / c);
} else if (z <= -2e-152) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
} else if (z <= 8.5e+31) {
tmp = t_1 / (z * c);
} else {
tmp = (t_2 + ((9.0 * x) / (z / y))) / c;
}
return tmp;
}
NOTE: x and y 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 = b + (x * (9.0d0 * y))
t_2 = (-4.0d0) * (a * t)
if (z <= (-1.35d+28)) then
tmp = (t_2 + (b / z)) / c
else if (z <= (-6.5d-86)) then
tmp = (1.0d0 / z) * (t_1 / c)
else if (z <= (-2d-152)) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c)
else if (z <= 8.5d+31) then
tmp = t_1 / (z * c)
else
tmp = (t_2 + ((9.0d0 * x) / (z / y))) / c
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b + (x * (9.0 * y));
double t_2 = -4.0 * (a * t);
double tmp;
if (z <= -1.35e+28) {
tmp = (t_2 + (b / z)) / c;
} else if (z <= -6.5e-86) {
tmp = (1.0 / z) * (t_1 / c);
} else if (z <= -2e-152) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
} else if (z <= 8.5e+31) {
tmp = t_1 / (z * c);
} else {
tmp = (t_2 + ((9.0 * x) / (z / y))) / c;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): t_1 = b + (x * (9.0 * y)) t_2 = -4.0 * (a * t) tmp = 0 if z <= -1.35e+28: tmp = (t_2 + (b / z)) / c elif z <= -6.5e-86: tmp = (1.0 / z) * (t_1 / c) elif z <= -2e-152: tmp = (b - (4.0 * (a * (z * t)))) / (z * c) elif z <= 8.5e+31: tmp = t_1 / (z * c) else: tmp = (t_2 + ((9.0 * x) / (z / y))) / c return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) t_1 = Float64(b + Float64(x * Float64(9.0 * y))) t_2 = Float64(-4.0 * Float64(a * t)) tmp = 0.0 if (z <= -1.35e+28) tmp = Float64(Float64(t_2 + Float64(b / z)) / c); elseif (z <= -6.5e-86) tmp = Float64(Float64(1.0 / z) * Float64(t_1 / c)); elseif (z <= -2e-152) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c)); elseif (z <= 8.5e+31) tmp = Float64(t_1 / Float64(z * c)); else tmp = Float64(Float64(t_2 + Float64(Float64(9.0 * x) / Float64(z / y))) / c); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = b + (x * (9.0 * y));
t_2 = -4.0 * (a * t);
tmp = 0.0;
if (z <= -1.35e+28)
tmp = (t_2 + (b / z)) / c;
elseif (z <= -6.5e-86)
tmp = (1.0 / z) * (t_1 / c);
elseif (z <= -2e-152)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
elseif (z <= 8.5e+31)
tmp = t_1 / (z * c);
else
tmp = (t_2 + ((9.0 * x) / (z / y))) / c;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.35e+28], N[(N[(t$95$2 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, -6.5e-86], N[(N[(1.0 / z), $MachinePrecision] * N[(t$95$1 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2e-152], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.5e+31], N[(t$95$1 / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 + N[(N[(9.0 * x), $MachinePrecision] / N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := b + x \cdot \left(9 \cdot y\right)\\
t_2 := -4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -1.35 \cdot 10^{+28}:\\
\;\;\;\;\frac{t_2 + \frac{b}{z}}{c}\\
\mathbf{elif}\;z \leq -6.5 \cdot 10^{-86}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{t_1}{c}\\
\mathbf{elif}\;z \leq -2 \cdot 10^{-152}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 8.5 \cdot 10^{+31}:\\
\;\;\;\;\frac{t_1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_2 + \frac{9 \cdot x}{\frac{z}{y}}}{c}\\
\end{array}
\end{array}
if z < -1.3500000000000001e28Initial program 69.1%
associate-+l-69.1%
associate-*r*69.1%
associate-*r*72.9%
*-un-lft-identity72.9%
times-frac63.2%
associate--r-63.2%
fma-neg63.5%
associate-*r*59.9%
distribute-rgt-neg-in59.9%
associate-*l*59.9%
Applied egg-rr59.9%
associate-*r/74.6%
associate-*l*81.5%
Applied egg-rr81.5%
Taylor expanded in z around 0 91.2%
Taylor expanded in x around 0 78.1%
if -1.3500000000000001e28 < z < -6.50000000000000028e-86Initial program 96.9%
associate-+l-96.9%
associate-*r*97.0%
associate-*r*92.1%
*-un-lft-identity92.1%
times-frac94.6%
associate--r-94.6%
fma-neg94.6%
associate-*r*99.6%
distribute-rgt-neg-in99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in x around inf 84.3%
*-commutative84.3%
associate-*l*84.4%
*-commutative84.4%
Simplified84.4%
if -6.50000000000000028e-86 < z < -2.00000000000000013e-152Initial program 99.6%
associate-+l-99.6%
associate-*l*99.6%
associate-*l*88.7%
Simplified88.7%
Taylor expanded in x around 0 93.8%
if -2.00000000000000013e-152 < z < 8.49999999999999947e31Initial program 96.7%
Taylor expanded in x around inf 88.2%
associate-*r*88.3%
*-commutative88.3%
associate-*r*88.3%
Simplified88.3%
if 8.49999999999999947e31 < z Initial program 55.8%
associate-+l-55.8%
associate-*r*55.7%
associate-*r*65.0%
*-un-lft-identity65.0%
times-frac71.0%
associate--r-71.0%
fma-neg71.2%
associate-*r*62.1%
distribute-rgt-neg-in62.1%
associate-*l*62.1%
Applied egg-rr62.1%
associate-*r/66.4%
associate-*l*77.6%
Applied egg-rr77.6%
Taylor expanded in z around 0 84.3%
Taylor expanded in x around inf 67.6%
associate-/l*76.6%
associate-*r/76.6%
Simplified76.6%
Final simplification83.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -2.8e+21) (not (<= z 100.0))) (/ (+ (* -4.0 (* a t)) (+ (* 9.0 (/ (* x y) z)) (/ b z))) c) (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.8e+21) || !(z <= 100.0)) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
NOTE: x and y 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.8d+21)) .or. (.not. (z <= 100.0d0))) then
tmp = (((-4.0d0) * (a * t)) + ((9.0d0 * ((x * y) / z)) + (b / z))) / c
else
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.8e+21) || !(z <= 100.0)) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -2.8e+21) or not (z <= 100.0): tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c else: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.8e+21) || !(z <= 100.0)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(Float64(9.0 * Float64(Float64(x * y) / z)) + Float64(b / z))) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -2.8e+21) || ~((z <= 100.0)))
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
else
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.8e+21], N[Not[LessEqual[z, 100.0]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.8 \cdot 10^{+21} \lor \neg \left(z \leq 100\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(9 \cdot \frac{x \cdot y}{z} + \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.8e21 or 100 < z Initial program 64.5%
associate-+l-64.5%
associate-*r*64.5%
associate-*r*70.3%
*-un-lft-identity70.3%
times-frac68.4%
associate--r-68.4%
fma-neg68.6%
associate-*r*63.1%
distribute-rgt-neg-in63.1%
associate-*l*63.1%
Applied egg-rr63.1%
associate-*r/72.7%
associate-*l*80.9%
Applied egg-rr80.9%
Taylor expanded in z around 0 88.8%
if -2.8e21 < z < 100Initial program 97.6%
Final simplification94.0%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= b -4.8e+151) (/ (+ b (* 9.0 (* x y))) (* z c)) (/ (+ (* -4.0 (* a t)) (+ (* 9.0 (/ (* x y) z)) (/ b z))) c)))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -4.8e+151) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
}
return tmp;
}
NOTE: x and y 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 <= (-4.8d+151)) then
tmp = (b + (9.0d0 * (x * y))) / (z * c)
else
tmp = (((-4.0d0) * (a * t)) + ((9.0d0 * ((x * y) / z)) + (b / z))) / c
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -4.8e+151) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -4.8e+151: tmp = (b + (9.0 * (x * y))) / (z * c) else: tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -4.8e+151) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); else tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(Float64(9.0 * Float64(Float64(x * y) / z)) + Float64(b / z))) / c); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -4.8e+151)
tmp = (b + (9.0 * (x * y))) / (z * c);
else
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -4.8e+151], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -4.8 \cdot 10^{+151}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(9 \cdot \frac{x \cdot y}{z} + \frac{b}{z}\right)}{c}\\
\end{array}
\end{array}
if b < -4.8000000000000002e151Initial program 91.8%
Taylor expanded in x around inf 84.5%
if -4.8000000000000002e151 < b Initial program 82.6%
associate-+l-82.6%
associate-*r*82.6%
associate-*r*82.4%
*-un-lft-identity82.4%
times-frac83.2%
associate--r-83.2%
fma-neg83.3%
associate-*r*83.6%
distribute-rgt-neg-in83.6%
associate-*l*83.6%
Applied egg-rr83.6%
associate-*r/82.5%
associate-*l*85.1%
Applied egg-rr85.1%
Taylor expanded in z around 0 88.9%
Final simplification88.3%
NOTE: x and y 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)) (/ b z)) c)) (t_2 (+ b (* x (* 9.0 y)))))
(if (<= z -9e+27)
t_1
(if (<= z -1.35e-85)
(* (/ 1.0 z) (/ t_2 c))
(if (<= z -2e-152)
(/ (- b (* 4.0 (* a (* z t)))) (* z c))
(if (<= z 2700.0) (/ t_2 (* z c)) t_1))))))assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((-4.0 * (a * t)) + (b / z)) / c;
double t_2 = b + (x * (9.0 * y));
double tmp;
if (z <= -9e+27) {
tmp = t_1;
} else if (z <= -1.35e-85) {
tmp = (1.0 / z) * (t_2 / c);
} else if (z <= -2e-152) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
} else if (z <= 2700.0) {
tmp = t_2 / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x and y 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 = (((-4.0d0) * (a * t)) + (b / z)) / c
t_2 = b + (x * (9.0d0 * y))
if (z <= (-9d+27)) then
tmp = t_1
else if (z <= (-1.35d-85)) then
tmp = (1.0d0 / z) * (t_2 / c)
else if (z <= (-2d-152)) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c)
else if (z <= 2700.0d0) then
tmp = t_2 / (z * c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y;
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)) + (b / z)) / c;
double t_2 = b + (x * (9.0 * y));
double tmp;
if (z <= -9e+27) {
tmp = t_1;
} else if (z <= -1.35e-85) {
tmp = (1.0 / z) * (t_2 / c);
} else if (z <= -2e-152) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
} else if (z <= 2700.0) {
tmp = t_2 / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): t_1 = ((-4.0 * (a * t)) + (b / z)) / c t_2 = b + (x * (9.0 * y)) tmp = 0 if z <= -9e+27: tmp = t_1 elif z <= -1.35e-85: tmp = (1.0 / z) * (t_2 / c) elif z <= -2e-152: tmp = (b - (4.0 * (a * (z * t)))) / (z * c) elif z <= 2700.0: tmp = t_2 / (z * c) else: tmp = t_1 return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c) t_2 = Float64(b + Float64(x * Float64(9.0 * y))) tmp = 0.0 if (z <= -9e+27) tmp = t_1; elseif (z <= -1.35e-85) tmp = Float64(Float64(1.0 / z) * Float64(t_2 / c)); elseif (z <= -2e-152) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c)); elseif (z <= 2700.0) tmp = Float64(t_2 / Float64(z * c)); else tmp = t_1; end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((-4.0 * (a * t)) + (b / z)) / c;
t_2 = b + (x * (9.0 * y));
tmp = 0.0;
if (z <= -9e+27)
tmp = t_1;
elseif (z <= -1.35e-85)
tmp = (1.0 / z) * (t_2 / c);
elseif (z <= -2e-152)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
elseif (z <= 2700.0)
tmp = t_2 / (z * c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, Block[{t$95$2 = N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -9e+27], t$95$1, If[LessEqual[z, -1.35e-85], N[(N[(1.0 / z), $MachinePrecision] * N[(t$95$2 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2e-152], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2700.0], N[(t$95$2 / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := \frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
t_2 := b + x \cdot \left(9 \cdot y\right)\\
\mathbf{if}\;z \leq -9 \cdot 10^{+27}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -1.35 \cdot 10^{-85}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{t_2}{c}\\
\mathbf{elif}\;z \leq -2 \cdot 10^{-152}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 2700:\\
\;\;\;\;\frac{t_2}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if z < -8.9999999999999998e27 or 2700 < z Initial program 64.4%
associate-+l-64.4%
associate-*r*64.4%
associate-*r*70.4%
*-un-lft-identity70.4%
times-frac67.5%
associate--r-67.5%
fma-neg67.7%
associate-*r*62.0%
distribute-rgt-neg-in62.0%
associate-*l*62.0%
Applied egg-rr62.0%
associate-*r/71.9%
associate-*l*80.4%
Applied egg-rr80.4%
Taylor expanded in z around 0 88.5%
Taylor expanded in x around 0 75.6%
if -8.9999999999999998e27 < z < -1.3500000000000001e-85Initial program 96.9%
associate-+l-96.9%
associate-*r*97.0%
associate-*r*92.1%
*-un-lft-identity92.1%
times-frac94.6%
associate--r-94.6%
fma-neg94.6%
associate-*r*99.6%
distribute-rgt-neg-in99.6%
associate-*l*99.6%
Applied egg-rr99.6%
Taylor expanded in x around inf 84.3%
*-commutative84.3%
associate-*l*84.4%
*-commutative84.4%
Simplified84.4%
if -1.3500000000000001e-85 < z < -2.00000000000000013e-152Initial program 99.6%
associate-+l-99.6%
associate-*l*99.6%
associate-*l*88.7%
Simplified88.7%
Taylor expanded in x around 0 93.8%
if -2.00000000000000013e-152 < z < 2700Initial program 96.6%
Taylor expanded in x around inf 87.9%
associate-*r*87.9%
*-commutative87.9%
associate-*r*87.9%
Simplified87.9%
Final simplification82.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.55e+28) (not (<= z 115.0))) (/ (+ (* -4.0 (* a t)) (/ b z)) c) (* (/ 1.0 z) (/ (+ b (* x (* 9.0 y))) c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.55e+28) || !(z <= 115.0)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (1.0 / z) * ((b + (x * (9.0 * y))) / c);
}
return tmp;
}
NOTE: x and y 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.55d+28)) .or. (.not. (z <= 115.0d0))) then
tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
else
tmp = (1.0d0 / z) * ((b + (x * (9.0d0 * y))) / c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.55e+28) || !(z <= 115.0)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (1.0 / z) * ((b + (x * (9.0 * y))) / c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -1.55e+28) or not (z <= 115.0): tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = (1.0 / z) * ((b + (x * (9.0 * y))) / c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.55e+28) || !(z <= 115.0)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); else tmp = Float64(Float64(1.0 / z) * Float64(Float64(b + Float64(x * Float64(9.0 * y))) / c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -1.55e+28) || ~((z <= 115.0)))
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = (1.0 / z) * ((b + (x * (9.0 * y))) / c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.55e+28], N[Not[LessEqual[z, 115.0]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(1.0 / z), $MachinePrecision] * N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.55 \cdot 10^{+28} \lor \neg \left(z \leq 115\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{b + x \cdot \left(9 \cdot y\right)}{c}\\
\end{array}
\end{array}
if z < -1.55e28 or 115 < z Initial program 64.4%
associate-+l-64.4%
associate-*r*64.4%
associate-*r*70.4%
*-un-lft-identity70.4%
times-frac67.5%
associate--r-67.5%
fma-neg67.7%
associate-*r*62.0%
distribute-rgt-neg-in62.0%
associate-*l*62.0%
Applied egg-rr62.0%
associate-*r/71.9%
associate-*l*80.4%
Applied egg-rr80.4%
Taylor expanded in z around 0 88.5%
Taylor expanded in x around 0 75.6%
if -1.55e28 < z < 115Initial program 97.0%
associate-+l-97.0%
associate-*r*97.0%
associate-*r*92.8%
*-un-lft-identity92.8%
times-frac94.0%
associate--r-94.0%
fma-neg94.0%
associate-*r*97.7%
distribute-rgt-neg-in97.7%
associate-*l*97.7%
Applied egg-rr97.7%
Taylor expanded in x around inf 84.1%
*-commutative84.1%
associate-*l*84.1%
*-commutative84.1%
Simplified84.1%
Final simplification80.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* (/ x c) (/ y z)))))
(if (<= x -5.3e+14)
t_1
(if (<= x -1.35e-117)
(* -4.0 (/ (* a t) c))
(if (<= x 7e-66) (/ b (* z c)) t_1)))))assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x / c) * (y / z));
double tmp;
if (x <= -5.3e+14) {
tmp = t_1;
} else if (x <= -1.35e-117) {
tmp = -4.0 * ((a * t) / c);
} else if (x <= 7e-66) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x / c) * (y / z))
if (x <= (-5.3d+14)) then
tmp = t_1
else if (x <= (-1.35d-117)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (x <= 7d-66) then
tmp = b / (z * c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x / c) * (y / z));
double tmp;
if (x <= -5.3e+14) {
tmp = t_1;
} else if (x <= -1.35e-117) {
tmp = -4.0 * ((a * t) / c);
} else if (x <= 7e-66) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x / c) * (y / z)) tmp = 0 if x <= -5.3e+14: tmp = t_1 elif x <= -1.35e-117: tmp = -4.0 * ((a * t) / c) elif x <= 7e-66: tmp = b / (z * c) else: tmp = t_1 return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))) tmp = 0.0 if (x <= -5.3e+14) tmp = t_1; elseif (x <= -1.35e-117) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (x <= 7e-66) tmp = Float64(b / Float64(z * c)); else tmp = t_1; end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x / c) * (y / z));
tmp = 0.0;
if (x <= -5.3e+14)
tmp = t_1;
elseif (x <= -1.35e-117)
tmp = -4.0 * ((a * t) / c);
elseif (x <= 7e-66)
tmp = b / (z * c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.3e+14], t$95$1, If[LessEqual[x, -1.35e-117], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 7e-66], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{if}\;x \leq -5.3 \cdot 10^{+14}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;x \leq -1.35 \cdot 10^{-117}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;x \leq 7 \cdot 10^{-66}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if x < -5.3e14 or 7.0000000000000001e-66 < x Initial program 83.8%
associate-+l-83.8%
associate-*r*83.8%
associate-*r*81.8%
*-un-lft-identity81.8%
times-frac82.6%
associate--r-82.6%
fma-neg82.8%
associate-*r*84.9%
distribute-rgt-neg-in84.9%
associate-*l*84.9%
Applied egg-rr84.9%
Taylor expanded in x around inf 52.6%
times-frac52.9%
Simplified52.9%
if -5.3e14 < x < -1.35000000000000001e-117Initial program 85.6%
Taylor expanded in z around inf 44.2%
if -1.35000000000000001e-117 < x < 7.0000000000000001e-66Initial program 83.4%
Taylor expanded in b around inf 50.0%
*-commutative50.0%
Simplified50.0%
Final simplification50.7%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= x -5.4e+14)
(* 9.0 (* (/ x c) (/ y z)))
(if (<= x -8e-118)
(* -4.0 (/ (* a t) c))
(if (<= x 5e-100) (/ b (* z c)) (* 9.0 (* (/ x z) (/ y c)))))))assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (x <= -5.4e+14) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (x <= -8e-118) {
tmp = -4.0 * ((a * t) / c);
} else if (x <= 5e-100) {
tmp = b / (z * c);
} else {
tmp = 9.0 * ((x / z) * (y / c));
}
return tmp;
}
NOTE: x and y 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 (x <= (-5.4d+14)) then
tmp = 9.0d0 * ((x / c) * (y / z))
else if (x <= (-8d-118)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (x <= 5d-100) then
tmp = b / (z * c)
else
tmp = 9.0d0 * ((x / z) * (y / c))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (x <= -5.4e+14) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (x <= -8e-118) {
tmp = -4.0 * ((a * t) / c);
} else if (x <= 5e-100) {
tmp = b / (z * c);
} else {
tmp = 9.0 * ((x / z) * (y / c));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if x <= -5.4e+14: tmp = 9.0 * ((x / c) * (y / z)) elif x <= -8e-118: tmp = -4.0 * ((a * t) / c) elif x <= 5e-100: tmp = b / (z * c) else: tmp = 9.0 * ((x / z) * (y / c)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (x <= -5.4e+14) tmp = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))); elseif (x <= -8e-118) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (x <= 5e-100) tmp = Float64(b / Float64(z * c)); else tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (x <= -5.4e+14)
tmp = 9.0 * ((x / c) * (y / z));
elseif (x <= -8e-118)
tmp = -4.0 * ((a * t) / c);
elseif (x <= 5e-100)
tmp = b / (z * c);
else
tmp = 9.0 * ((x / z) * (y / c));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[x, -5.4e+14], N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -8e-118], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5e-100], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5.4 \cdot 10^{+14}:\\
\;\;\;\;9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{elif}\;x \leq -8 \cdot 10^{-118}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;x \leq 5 \cdot 10^{-100}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\end{array}
\end{array}
if x < -5.4e14Initial program 79.8%
associate-+l-79.8%
associate-*r*79.8%
associate-*r*78.5%
*-un-lft-identity78.5%
times-frac79.8%
associate--r-79.8%
fma-neg80.1%
associate-*r*81.6%
distribute-rgt-neg-in81.6%
associate-*l*81.6%
Applied egg-rr81.6%
Taylor expanded in x around inf 50.0%
times-frac52.7%
Simplified52.7%
if -5.4e14 < x < -7.99999999999999988e-118Initial program 85.6%
Taylor expanded in z around inf 44.2%
if -7.99999999999999988e-118 < x < 5.0000000000000001e-100Initial program 82.2%
Taylor expanded in b around inf 51.1%
*-commutative51.1%
Simplified51.1%
if 5.0000000000000001e-100 < x Initial program 88.8%
Taylor expanded in x around inf 53.9%
*-commutative53.9%
Simplified53.9%
Taylor expanded in x around 0 53.9%
*-commutative53.9%
times-frac55.7%
Simplified55.7%
Final simplification51.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -8.6e+27) (not (<= z 190000.0))) (/ (+ (* -4.0 (* a t)) (/ b z)) c) (/ (+ b (* 9.0 (* x y))) (* z c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8.6e+27) || !(z <= 190000.0)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
NOTE: x and y 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.6d+27)) .or. (.not. (z <= 190000.0d0))) then
tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
else
tmp = (b + (9.0d0 * (x * y))) / (z * c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8.6e+27) || !(z <= 190000.0)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -8.6e+27) or not (z <= 190000.0): tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = (b + (9.0 * (x * y))) / (z * c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -8.6e+27) || !(z <= 190000.0)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -8.6e+27) || ~((z <= 190000.0)))
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = (b + (9.0 * (x * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -8.6e+27], N[Not[LessEqual[z, 190000.0]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8.6 \cdot 10^{+27} \lor \neg \left(z \leq 190000\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -8.60000000000000017e27 or 1.9e5 < z Initial program 64.4%
associate-+l-64.4%
associate-*r*64.4%
associate-*r*70.4%
*-un-lft-identity70.4%
times-frac67.5%
associate--r-67.5%
fma-neg67.7%
associate-*r*62.0%
distribute-rgt-neg-in62.0%
associate-*l*62.0%
Applied egg-rr62.0%
associate-*r/71.9%
associate-*l*80.4%
Applied egg-rr80.4%
Taylor expanded in z around 0 88.5%
Taylor expanded in x around 0 75.6%
if -8.60000000000000017e27 < z < 1.9e5Initial program 97.0%
Taylor expanded in x around inf 84.0%
Final simplification80.6%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.35e+28) (not (<= z 36.0))) (/ (+ (* -4.0 (* a t)) (/ b z)) c) (/ (+ b (* x (* 9.0 y))) (* z c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.35e+28) || !(z <= 36.0)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
NOTE: x and y 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.35d+28)) .or. (.not. (z <= 36.0d0))) 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 x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.35e+28) || !(z <= 36.0)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -1.35e+28) or not (z <= 36.0): tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = (b + (x * (9.0 * y))) / (z * c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.35e+28) || !(z <= 36.0)) 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
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -1.35e+28) || ~((z <= 36.0)))
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = (b + (x * (9.0 * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.35e+28], N[Not[LessEqual[z, 36.0]], $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}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.35 \cdot 10^{+28} \lor \neg \left(z \leq 36\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 < -1.3500000000000001e28 or 36 < z Initial program 64.4%
associate-+l-64.4%
associate-*r*64.4%
associate-*r*70.4%
*-un-lft-identity70.4%
times-frac67.5%
associate--r-67.5%
fma-neg67.7%
associate-*r*62.0%
distribute-rgt-neg-in62.0%
associate-*l*62.0%
Applied egg-rr62.0%
associate-*r/71.9%
associate-*l*80.4%
Applied egg-rr80.4%
Taylor expanded in z around 0 88.5%
Taylor expanded in x around 0 75.6%
if -1.3500000000000001e28 < z < 36Initial program 97.0%
Taylor expanded in x around inf 84.0%
associate-*r*84.0%
*-commutative84.0%
associate-*r*84.0%
Simplified84.0%
Final simplification80.6%
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= x -2.7e+89)
(* 9.0 (* (/ x c) (/ y z)))
(if (<= x 3.5e-65)
(/ (+ (* -4.0 (* a t)) (/ b z)) c)
(* 9.0 (* (/ x z) (/ y c))))))assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (x <= -2.7e+89) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (x <= 3.5e-65) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = 9.0 * ((x / z) * (y / c));
}
return tmp;
}
NOTE: x and y 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 (x <= (-2.7d+89)) then
tmp = 9.0d0 * ((x / c) * (y / z))
else if (x <= 3.5d-65) then
tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
else
tmp = 9.0d0 * ((x / z) * (y / c))
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (x <= -2.7e+89) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (x <= 3.5e-65) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = 9.0 * ((x / z) * (y / c));
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if x <= -2.7e+89: tmp = 9.0 * ((x / c) * (y / z)) elif x <= 3.5e-65: tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = 9.0 * ((x / z) * (y / c)) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (x <= -2.7e+89) tmp = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))); elseif (x <= 3.5e-65) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c); else tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (x <= -2.7e+89)
tmp = 9.0 * ((x / c) * (y / z));
elseif (x <= 3.5e-65)
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = 9.0 * ((x / z) * (y / c));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[x, -2.7e+89], N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.5e-65], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -2.7 \cdot 10^{+89}:\\
\;\;\;\;9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{elif}\;x \leq 3.5 \cdot 10^{-65}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\end{array}
\end{array}
if x < -2.7e89Initial program 78.0%
associate-+l-78.0%
associate-*r*78.1%
associate-*r*76.3%
*-un-lft-identity76.3%
times-frac76.1%
associate--r-76.1%
fma-neg76.4%
associate-*r*78.5%
distribute-rgt-neg-in78.5%
associate-*l*78.5%
Applied egg-rr78.5%
Taylor expanded in x around inf 52.7%
times-frac58.3%
Simplified58.3%
if -2.7e89 < x < 3.50000000000000005e-65Initial program 84.1%
associate-+l-84.1%
associate-*r*84.1%
associate-*r*85.7%
*-un-lft-identity85.7%
times-frac84.9%
associate--r-84.9%
fma-neg84.9%
associate-*r*82.7%
distribute-rgt-neg-in82.7%
associate-*l*82.7%
Applied egg-rr82.7%
associate-*r/85.4%
associate-*l*90.3%
Applied egg-rr90.3%
Taylor expanded in z around 0 93.0%
Taylor expanded in x around 0 75.5%
if 3.50000000000000005e-65 < x Initial program 87.8%
Taylor expanded in x around inf 55.3%
*-commutative55.3%
Simplified55.3%
Taylor expanded in x around 0 55.3%
*-commutative55.3%
times-frac57.2%
Simplified57.2%
Final simplification67.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -2.05e+24) (not (<= t 7.8e-136))) (* -4.0 (* a (/ t c))) (/ b (* z c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.05e+24) || !(t <= 7.8e-136)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((t <= (-2.05d+24)) .or. (.not. (t <= 7.8d-136))) then
tmp = (-4.0d0) * (a * (t / c))
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.05e+24) || !(t <= 7.8e-136)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -2.05e+24) or not (t <= 7.8e-136): tmp = -4.0 * (a * (t / c)) else: tmp = b / (z * c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -2.05e+24) || !(t <= 7.8e-136)) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -2.05e+24) || ~((t <= 7.8e-136)))
tmp = -4.0 * (a * (t / c));
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -2.05e+24], N[Not[LessEqual[t, 7.8e-136]], $MachinePrecision]], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.05 \cdot 10^{+24} \lor \neg \left(t \leq 7.8 \cdot 10^{-136}\right):\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if t < -2.05e24 or 7.79999999999999952e-136 < t Initial program 79.8%
associate-+l-79.8%
associate-*r*79.9%
associate-*r*79.5%
*-un-lft-identity79.5%
times-frac77.1%
associate--r-77.1%
fma-neg77.3%
associate-*r*77.8%
distribute-rgt-neg-in77.8%
associate-*l*77.8%
Applied egg-rr77.8%
associate-*r/76.5%
associate-*l*80.5%
Applied egg-rr80.5%
Taylor expanded in z around inf 47.0%
associate-*r/54.1%
Simplified54.1%
if -2.05e24 < t < 7.79999999999999952e-136Initial program 89.1%
Taylor expanded in b around inf 44.5%
*-commutative44.5%
Simplified44.5%
Final simplification49.9%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= t -1.3e+25) (* -4.0 (* a (/ t c))) (if (<= t 1.24e-135) (/ b (* z c)) (* -4.0 (/ (* a t) c)))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.3e+25) {
tmp = -4.0 * (a * (t / c));
} else if (t <= 1.24e-135) {
tmp = b / (z * c);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
NOTE: x and y 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.3d+25)) then
tmp = (-4.0d0) * (a * (t / c))
else if (t <= 1.24d-135) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * ((a * t) / c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.3e+25) {
tmp = -4.0 * (a * (t / c));
} else if (t <= 1.24e-135) {
tmp = b / (z * c);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.3e+25: tmp = -4.0 * (a * (t / c)) elif t <= 1.24e-135: tmp = b / (z * c) else: tmp = -4.0 * ((a * t) / c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.3e+25) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (t <= 1.24e-135) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.3e+25)
tmp = -4.0 * (a * (t / c));
elseif (t <= 1.24e-135)
tmp = b / (z * c);
else
tmp = -4.0 * ((a * t) / c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -1.3e+25], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.24e-135], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.3 \cdot 10^{+25}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;t \leq 1.24 \cdot 10^{-135}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if t < -1.2999999999999999e25Initial program 75.3%
associate-+l-75.3%
associate-*r*75.3%
associate-*r*79.2%
*-un-lft-identity79.2%
times-frac72.1%
associate--r-72.1%
fma-neg72.5%
associate-*r*74.1%
distribute-rgt-neg-in74.1%
associate-*l*74.1%
Applied egg-rr74.1%
associate-*r/72.3%
associate-*l*79.8%
Applied egg-rr79.8%
Taylor expanded in z around inf 48.7%
associate-*r/61.2%
Simplified61.2%
if -1.2999999999999999e25 < t < 1.24e-135Initial program 89.1%
Taylor expanded in b around inf 44.5%
*-commutative44.5%
Simplified44.5%
if 1.24e-135 < t Initial program 82.4%
Taylor expanded in z around inf 46.0%
Final simplification48.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= t -1.75e+25) (* -4.0 (/ a (/ c t))) (if (<= t 1.24e-135) (/ b (* z c)) (* -4.0 (/ (* a t) c)))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.75e+25) {
tmp = -4.0 * (a / (c / t));
} else if (t <= 1.24e-135) {
tmp = b / (z * c);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
NOTE: x and y 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.75d+25)) then
tmp = (-4.0d0) * (a / (c / t))
else if (t <= 1.24d-135) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * ((a * t) / c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.75e+25) {
tmp = -4.0 * (a / (c / t));
} else if (t <= 1.24e-135) {
tmp = b / (z * c);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.75e+25: tmp = -4.0 * (a / (c / t)) elif t <= 1.24e-135: tmp = b / (z * c) else: tmp = -4.0 * ((a * t) / c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.75e+25) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); elseif (t <= 1.24e-135) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.75e+25)
tmp = -4.0 * (a / (c / t));
elseif (t <= 1.24e-135)
tmp = b / (z * c);
else
tmp = -4.0 * ((a * t) / c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -1.75e+25], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.24e-135], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.75 \cdot 10^{+25}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{elif}\;t \leq 1.24 \cdot 10^{-135}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if t < -1.75e25Initial program 75.3%
Taylor expanded in z around inf 48.7%
*-commutative48.7%
associate-/l*61.2%
Simplified61.2%
if -1.75e25 < t < 1.24e-135Initial program 89.1%
Taylor expanded in b around inf 44.5%
*-commutative44.5%
Simplified44.5%
if 1.24e-135 < t Initial program 82.4%
Taylor expanded in z around inf 46.0%
Final simplification48.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= t -5.5e+24) (/ (* -4.0 t) (/ c a)) (if (<= t 7e-136) (/ b (* z c)) (* -4.0 (/ (* a t) c)))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -5.5e+24) {
tmp = (-4.0 * t) / (c / a);
} else if (t <= 7e-136) {
tmp = b / (z * c);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
NOTE: x and y 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 <= (-5.5d+24)) then
tmp = ((-4.0d0) * t) / (c / a)
else if (t <= 7d-136) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * ((a * t) / c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -5.5e+24) {
tmp = (-4.0 * t) / (c / a);
} else if (t <= 7e-136) {
tmp = b / (z * c);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -5.5e+24: tmp = (-4.0 * t) / (c / a) elif t <= 7e-136: tmp = b / (z * c) else: tmp = -4.0 * ((a * t) / c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -5.5e+24) tmp = Float64(Float64(-4.0 * t) / Float64(c / a)); elseif (t <= 7e-136) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -5.5e+24)
tmp = (-4.0 * t) / (c / a);
elseif (t <= 7e-136)
tmp = b / (z * c);
else
tmp = -4.0 * ((a * t) / c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -5.5e+24], N[(N[(-4.0 * t), $MachinePrecision] / N[(c / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 7e-136], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -5.5 \cdot 10^{+24}:\\
\;\;\;\;\frac{-4 \cdot t}{\frac{c}{a}}\\
\mathbf{elif}\;t \leq 7 \cdot 10^{-136}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if t < -5.5000000000000002e24Initial program 75.3%
Taylor expanded in z around inf 48.7%
associate-*r/48.7%
*-commutative48.7%
associate-*l*48.7%
associate-/l*60.8%
*-commutative60.8%
Applied egg-rr60.8%
if -5.5000000000000002e24 < t < 7.00000000000000058e-136Initial program 89.1%
Taylor expanded in b around inf 44.5%
*-commutative44.5%
Simplified44.5%
if 7.00000000000000058e-136 < t Initial program 82.4%
Taylor expanded in z around inf 46.0%
Final simplification48.4%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -2.6e+157) (/ (/ b c) z) (/ b (* z c))))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.6e+157) {
tmp = (b / c) / z;
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x and y 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.6d+157)) then
tmp = (b / c) / z
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.6e+157) {
tmp = (b / c) / z;
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -2.6e+157: tmp = (b / c) / z else: tmp = b / (z * c) return tmp
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -2.6e+157) tmp = Float64(Float64(b / c) / z); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -2.6e+157)
tmp = (b / c) / z;
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -2.6e+157], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.6 \cdot 10^{+157}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.60000000000000011e157Initial program 54.7%
associate-+l-54.7%
associate-*r*54.7%
associate-*r*61.4%
*-un-lft-identity61.4%
times-frac58.4%
associate--r-58.4%
fma-neg58.6%
associate-*r*52.4%
distribute-rgt-neg-in52.4%
associate-*l*52.4%
Applied egg-rr52.4%
associate-*r/64.1%
associate-*l*76.3%
Applied egg-rr76.3%
Taylor expanded in b around inf 9.6%
associate-/r*24.7%
Simplified24.7%
if -2.60000000000000011e157 < z Initial program 88.1%
Taylor expanded in b around inf 39.4%
*-commutative39.4%
Simplified39.4%
Final simplification37.5%
NOTE: x and y should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(x < y);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y] = sort([x, y]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y = sort([x, y]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x and y should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 83.9%
Taylor expanded in b around inf 35.7%
*-commutative35.7%
Simplified35.7%
Final simplification35.7%
(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 2023312
(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)))