
(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 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -4.4e+36) (not (<= z 6.5e+38))) (/ (+ (* -4.0 (* a t)) (+ (* 9.0 (/ (* x y) z)) (/ b z))) c) (/ (+ b (fma x (* 9.0 y) (* t (* a (* z -4.0))))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -4.4e+36) || !(z <= 6.5e+38)) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (b + fma(x, (9.0 * y), (t * (a * (z * -4.0))))) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -4.4e+36) || !(z <= 6.5e+38)) 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 + fma(x, Float64(9.0 * y), Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -4.4e+36], N[Not[LessEqual[z, 6.5e+38]], $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[(x * N[(9.0 * y), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.4 \cdot 10^{+36} \lor \neg \left(z \leq 6.5 \cdot 10^{+38}\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 + \mathsf{fma}\left(x, 9 \cdot y, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -4.40000000000000001e36 or 6.5e38 < z Initial program 54.6%
+-commutative54.6%
associate-+r-54.6%
*-commutative54.6%
associate-*r*58.7%
*-commutative58.7%
associate-+r-58.7%
+-commutative58.7%
associate-*l*58.7%
associate-*l*63.9%
*-commutative63.9%
Simplified63.9%
Taylor expanded in t around inf 74.8%
Taylor expanded in c around 0 81.8%
Taylor expanded in t around 0 92.7%
if -4.40000000000000001e36 < z < 6.5e38Initial program 94.2%
Simplified91.0%
Final simplification91.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* x (/ y (* z c)))))
(t_2 (* -4.0 (/ (* a t) c)))
(t_3 (/ b (* z c))))
(if (<= z -3.7e+62)
t_2
(if (<= z -1.45e-53)
t_1
(if (<= z 6e-234)
t_3
(if (<= z 9e-125)
t_1
(if (<= z 0.00019)
t_3
(if (<= z 2.35e+126)
(* -4.0 (* t (/ a c)))
(if (<= z 1.85e+248)
(* -4.0 (* a (/ t c)))
(if (<= z 2.45e+289) (* 9.0 (/ (* x (/ y z)) c)) t_2))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * (y / (z * c)));
double t_2 = -4.0 * ((a * t) / c);
double t_3 = b / (z * c);
double tmp;
if (z <= -3.7e+62) {
tmp = t_2;
} else if (z <= -1.45e-53) {
tmp = t_1;
} else if (z <= 6e-234) {
tmp = t_3;
} else if (z <= 9e-125) {
tmp = t_1;
} else if (z <= 0.00019) {
tmp = t_3;
} else if (z <= 2.35e+126) {
tmp = -4.0 * (t * (a / c));
} else if (z <= 1.85e+248) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 2.45e+289) {
tmp = 9.0 * ((x * (y / z)) / c);
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = 9.0d0 * (x * (y / (z * c)))
t_2 = (-4.0d0) * ((a * t) / c)
t_3 = b / (z * c)
if (z <= (-3.7d+62)) then
tmp = t_2
else if (z <= (-1.45d-53)) then
tmp = t_1
else if (z <= 6d-234) then
tmp = t_3
else if (z <= 9d-125) then
tmp = t_1
else if (z <= 0.00019d0) then
tmp = t_3
else if (z <= 2.35d+126) then
tmp = (-4.0d0) * (t * (a / c))
else if (z <= 1.85d+248) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= 2.45d+289) then
tmp = 9.0d0 * ((x * (y / z)) / c)
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * (y / (z * c)));
double t_2 = -4.0 * ((a * t) / c);
double t_3 = b / (z * c);
double tmp;
if (z <= -3.7e+62) {
tmp = t_2;
} else if (z <= -1.45e-53) {
tmp = t_1;
} else if (z <= 6e-234) {
tmp = t_3;
} else if (z <= 9e-125) {
tmp = t_1;
} else if (z <= 0.00019) {
tmp = t_3;
} else if (z <= 2.35e+126) {
tmp = -4.0 * (t * (a / c));
} else if (z <= 1.85e+248) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 2.45e+289) {
tmp = 9.0 * ((x * (y / z)) / c);
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * (x * (y / (z * c))) t_2 = -4.0 * ((a * t) / c) t_3 = b / (z * c) tmp = 0 if z <= -3.7e+62: tmp = t_2 elif z <= -1.45e-53: tmp = t_1 elif z <= 6e-234: tmp = t_3 elif z <= 9e-125: tmp = t_1 elif z <= 0.00019: tmp = t_3 elif z <= 2.35e+126: tmp = -4.0 * (t * (a / c)) elif z <= 1.85e+248: tmp = -4.0 * (a * (t / c)) elif z <= 2.45e+289: tmp = 9.0 * ((x * (y / z)) / c) else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))) t_2 = Float64(-4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(b / Float64(z * c)) tmp = 0.0 if (z <= -3.7e+62) tmp = t_2; elseif (z <= -1.45e-53) tmp = t_1; elseif (z <= 6e-234) tmp = t_3; elseif (z <= 9e-125) tmp = t_1; elseif (z <= 0.00019) tmp = t_3; elseif (z <= 2.35e+126) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (z <= 1.85e+248) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= 2.45e+289) tmp = Float64(9.0 * Float64(Float64(x * Float64(y / z)) / c)); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * (x * (y / (z * c)));
t_2 = -4.0 * ((a * t) / c);
t_3 = b / (z * c);
tmp = 0.0;
if (z <= -3.7e+62)
tmp = t_2;
elseif (z <= -1.45e-53)
tmp = t_1;
elseif (z <= 6e-234)
tmp = t_3;
elseif (z <= 9e-125)
tmp = t_1;
elseif (z <= 0.00019)
tmp = t_3;
elseif (z <= 2.35e+126)
tmp = -4.0 * (t * (a / c));
elseif (z <= 1.85e+248)
tmp = -4.0 * (a * (t / c));
elseif (z <= 2.45e+289)
tmp = 9.0 * ((x * (y / z)) / c);
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.7e+62], t$95$2, If[LessEqual[z, -1.45e-53], t$95$1, If[LessEqual[z, 6e-234], t$95$3, If[LessEqual[z, 9e-125], t$95$1, If[LessEqual[z, 0.00019], t$95$3, If[LessEqual[z, 2.35e+126], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.85e+248], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.45e+289], N[(9.0 * N[(N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
t_2 := -4 \cdot \frac{a \cdot t}{c}\\
t_3 := \frac{b}{z \cdot c}\\
\mathbf{if}\;z \leq -3.7 \cdot 10^{+62}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq -1.45 \cdot 10^{-53}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 6 \cdot 10^{-234}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;z \leq 9 \cdot 10^{-125}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 0.00019:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{+126}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;z \leq 1.85 \cdot 10^{+248}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq 2.45 \cdot 10^{+289}:\\
\;\;\;\;9 \cdot \frac{x \cdot \frac{y}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if z < -3.70000000000000014e62 or 2.4500000000000002e289 < z Initial program 56.0%
+-commutative56.0%
associate-+r-56.0%
*-commutative56.0%
associate-*r*59.9%
*-commutative59.9%
associate-+r-59.9%
+-commutative59.9%
associate-*l*59.9%
associate-*l*65.6%
*-commutative65.6%
Simplified65.6%
Taylor expanded in z around inf 64.0%
if -3.70000000000000014e62 < z < -1.4499999999999999e-53 or 5.99999999999999975e-234 < z < 9.00000000000000024e-125Initial program 90.7%
+-commutative90.7%
associate-+r-90.7%
*-commutative90.7%
associate-*r*86.3%
*-commutative86.3%
associate-+r-86.3%
+-commutative86.3%
associate-*l*86.4%
associate-*l*93.1%
*-commutative93.1%
Simplified93.1%
Taylor expanded in y around -inf 72.5%
associate-*r*72.5%
*-commutative72.5%
mul-1-neg72.5%
Simplified70.1%
Taylor expanded in x around inf 59.0%
associate-/l*63.4%
Simplified63.4%
if -1.4499999999999999e-53 < z < 5.99999999999999975e-234 or 9.00000000000000024e-125 < z < 1.9000000000000001e-4Initial program 97.1%
+-commutative97.1%
associate-+r-97.1%
*-commutative97.1%
associate-*r*95.7%
*-commutative95.7%
associate-+r-95.7%
+-commutative95.7%
associate-*l*95.8%
associate-*l*95.9%
*-commutative95.9%
Simplified95.9%
Taylor expanded in b around inf 68.0%
*-commutative68.0%
Simplified68.0%
if 1.9000000000000001e-4 < z < 2.3499999999999999e126Initial program 68.1%
+-commutative68.1%
associate-+r-68.1%
*-commutative68.1%
associate-*r*71.2%
*-commutative71.2%
associate-+r-71.2%
+-commutative71.2%
associate-*l*71.2%
associate-*l*71.4%
*-commutative71.4%
Simplified71.4%
Taylor expanded in t around inf 86.7%
Taylor expanded in c around 0 80.7%
Taylor expanded in t around inf 57.8%
*-commutative57.8%
associate-/l*67.1%
Simplified67.1%
if 2.3499999999999999e126 < z < 1.8499999999999999e248Initial program 40.7%
+-commutative40.7%
associate-+r-40.7%
*-commutative40.7%
associate-*r*43.5%
*-commutative43.5%
associate-+r-43.5%
+-commutative43.5%
associate-*l*43.5%
associate-*l*49.8%
*-commutative49.8%
Simplified49.8%
Taylor expanded in z around inf 56.4%
*-commutative56.4%
associate-/l*59.6%
Simplified59.6%
if 1.8499999999999999e248 < z < 2.4500000000000002e289Initial program 62.2%
+-commutative62.2%
associate-+r-62.2%
*-commutative62.2%
associate-*r*62.5%
*-commutative62.5%
associate-+r-62.5%
+-commutative62.5%
associate-*l*62.3%
associate-*l*74.8%
*-commutative74.8%
Simplified74.8%
Taylor expanded in t around inf 49.6%
Taylor expanded in c around 0 62.6%
Taylor expanded in x around inf 51.0%
associate-/l*51.0%
associate-/l*75.2%
Applied egg-rr75.2%
Final simplification65.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* x (/ y (* z c))))) (t_2 (/ b (* z c))))
(if (<= z -4.2e+62)
(* -4.0 (/ (* a t) c))
(if (<= z -1.1e-54)
t_1
(if (<= z 1.65e-232)
t_2
(if (<= z 7e-124)
t_1
(if (<= z 0.00355)
t_2
(if (<= z 1.65e+126)
(* -4.0 (* t (/ a c)))
(* -4.0 (* a (/ t c)))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * (y / (z * c)));
double t_2 = b / (z * c);
double tmp;
if (z <= -4.2e+62) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= -1.1e-54) {
tmp = t_1;
} else if (z <= 1.65e-232) {
tmp = t_2;
} else if (z <= 7e-124) {
tmp = t_1;
} else if (z <= 0.00355) {
tmp = t_2;
} else if (z <= 1.65e+126) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * (x * (y / (z * c)))
t_2 = b / (z * c)
if (z <= (-4.2d+62)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (z <= (-1.1d-54)) then
tmp = t_1
else if (z <= 1.65d-232) then
tmp = t_2
else if (z <= 7d-124) then
tmp = t_1
else if (z <= 0.00355d0) then
tmp = t_2
else if (z <= 1.65d+126) then
tmp = (-4.0d0) * (t * (a / c))
else
tmp = (-4.0d0) * (a * (t / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * (y / (z * c)));
double t_2 = b / (z * c);
double tmp;
if (z <= -4.2e+62) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= -1.1e-54) {
tmp = t_1;
} else if (z <= 1.65e-232) {
tmp = t_2;
} else if (z <= 7e-124) {
tmp = t_1;
} else if (z <= 0.00355) {
tmp = t_2;
} else if (z <= 1.65e+126) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * (x * (y / (z * c))) t_2 = b / (z * c) tmp = 0 if z <= -4.2e+62: tmp = -4.0 * ((a * t) / c) elif z <= -1.1e-54: tmp = t_1 elif z <= 1.65e-232: tmp = t_2 elif z <= 7e-124: tmp = t_1 elif z <= 0.00355: tmp = t_2 elif z <= 1.65e+126: tmp = -4.0 * (t * (a / c)) else: tmp = -4.0 * (a * (t / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))) t_2 = Float64(b / Float64(z * c)) tmp = 0.0 if (z <= -4.2e+62) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= -1.1e-54) tmp = t_1; elseif (z <= 1.65e-232) tmp = t_2; elseif (z <= 7e-124) tmp = t_1; elseif (z <= 0.00355) tmp = t_2; elseif (z <= 1.65e+126) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); else tmp = Float64(-4.0 * Float64(a * Float64(t / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * (x * (y / (z * c)));
t_2 = b / (z * c);
tmp = 0.0;
if (z <= -4.2e+62)
tmp = -4.0 * ((a * t) / c);
elseif (z <= -1.1e-54)
tmp = t_1;
elseif (z <= 1.65e-232)
tmp = t_2;
elseif (z <= 7e-124)
tmp = t_1;
elseif (z <= 0.00355)
tmp = t_2;
elseif (z <= 1.65e+126)
tmp = -4.0 * (t * (a / c));
else
tmp = -4.0 * (a * (t / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.2e+62], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.1e-54], t$95$1, If[LessEqual[z, 1.65e-232], t$95$2, If[LessEqual[z, 7e-124], t$95$1, If[LessEqual[z, 0.00355], t$95$2, If[LessEqual[z, 1.65e+126], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
t_2 := \frac{b}{z \cdot c}\\
\mathbf{if}\;z \leq -4.2 \cdot 10^{+62}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq -1.1 \cdot 10^{-54}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.65 \cdot 10^{-232}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 7 \cdot 10^{-124}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 0.00355:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 1.65 \cdot 10^{+126}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -4.2e62Initial program 59.8%
+-commutative59.8%
associate-+r-59.8%
*-commutative59.8%
associate-*r*64.1%
*-commutative64.1%
associate-+r-64.1%
+-commutative64.1%
associate-*l*64.1%
associate-*l*70.1%
*-commutative70.1%
Simplified70.1%
Taylor expanded in z around inf 62.7%
if -4.2e62 < z < -1.1e-54 or 1.64999999999999993e-232 < z < 6.9999999999999997e-124Initial program 90.7%
+-commutative90.7%
associate-+r-90.7%
*-commutative90.7%
associate-*r*86.3%
*-commutative86.3%
associate-+r-86.3%
+-commutative86.3%
associate-*l*86.4%
associate-*l*93.1%
*-commutative93.1%
Simplified93.1%
Taylor expanded in y around -inf 72.5%
associate-*r*72.5%
*-commutative72.5%
mul-1-neg72.5%
Simplified70.1%
Taylor expanded in x around inf 59.0%
associate-/l*63.4%
Simplified63.4%
if -1.1e-54 < z < 1.64999999999999993e-232 or 6.9999999999999997e-124 < z < 0.0035500000000000002Initial program 97.1%
+-commutative97.1%
associate-+r-97.1%
*-commutative97.1%
associate-*r*95.7%
*-commutative95.7%
associate-+r-95.7%
+-commutative95.7%
associate-*l*95.8%
associate-*l*95.9%
*-commutative95.9%
Simplified95.9%
Taylor expanded in b around inf 68.0%
*-commutative68.0%
Simplified68.0%
if 0.0035500000000000002 < z < 1.65000000000000006e126Initial program 68.1%
+-commutative68.1%
associate-+r-68.1%
*-commutative68.1%
associate-*r*71.2%
*-commutative71.2%
associate-+r-71.2%
+-commutative71.2%
associate-*l*71.2%
associate-*l*71.4%
*-commutative71.4%
Simplified71.4%
Taylor expanded in t around inf 86.7%
Taylor expanded in c around 0 80.7%
Taylor expanded in t around inf 57.8%
*-commutative57.8%
associate-/l*67.1%
Simplified67.1%
if 1.65000000000000006e126 < z Initial program 40.5%
+-commutative40.5%
associate-+r-40.5%
*-commutative40.5%
associate-*r*42.3%
*-commutative42.3%
associate-+r-42.3%
+-commutative42.3%
associate-*l*42.3%
associate-*l*49.3%
*-commutative49.3%
Simplified49.3%
Taylor expanded in z around inf 51.8%
*-commutative51.8%
associate-/l*49.8%
Simplified49.8%
Final simplification62.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ (* -4.0 (* a t)) (/ b z)) c)))
(if (<= y -2.45e-60)
(* (* x (/ 9.0 z)) (/ y c))
(if (<= y 1.8e+107)
t_1
(if (<= y 4.5e+126)
(* (/ y c) (* 9.0 (/ x z)))
(if (<= y 6.4e+209) t_1 (/ (* 9.0 (/ (* x y) z)) c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((-4.0 * (a * t)) + (b / z)) / c;
double tmp;
if (y <= -2.45e-60) {
tmp = (x * (9.0 / z)) * (y / c);
} else if (y <= 1.8e+107) {
tmp = t_1;
} else if (y <= 4.5e+126) {
tmp = (y / c) * (9.0 * (x / z));
} else if (y <= 6.4e+209) {
tmp = t_1;
} else {
tmp = (9.0 * ((x * y) / z)) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (((-4.0d0) * (a * t)) + (b / z)) / c
if (y <= (-2.45d-60)) then
tmp = (x * (9.0d0 / z)) * (y / c)
else if (y <= 1.8d+107) then
tmp = t_1
else if (y <= 4.5d+126) then
tmp = (y / c) * (9.0d0 * (x / z))
else if (y <= 6.4d+209) then
tmp = t_1
else
tmp = (9.0d0 * ((x * y) / z)) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((-4.0 * (a * t)) + (b / z)) / c;
double tmp;
if (y <= -2.45e-60) {
tmp = (x * (9.0 / z)) * (y / c);
} else if (y <= 1.8e+107) {
tmp = t_1;
} else if (y <= 4.5e+126) {
tmp = (y / c) * (9.0 * (x / z));
} else if (y <= 6.4e+209) {
tmp = t_1;
} else {
tmp = (9.0 * ((x * y) / z)) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = ((-4.0 * (a * t)) + (b / z)) / c tmp = 0 if y <= -2.45e-60: tmp = (x * (9.0 / z)) * (y / c) elif y <= 1.8e+107: tmp = t_1 elif y <= 4.5e+126: tmp = (y / c) * (9.0 * (x / z)) elif y <= 6.4e+209: tmp = t_1 else: tmp = (9.0 * ((x * y) / z)) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c) tmp = 0.0 if (y <= -2.45e-60) tmp = Float64(Float64(x * Float64(9.0 / z)) * Float64(y / c)); elseif (y <= 1.8e+107) tmp = t_1; elseif (y <= 4.5e+126) tmp = Float64(Float64(y / c) * Float64(9.0 * Float64(x / z))); elseif (y <= 6.4e+209) tmp = t_1; else tmp = Float64(Float64(9.0 * Float64(Float64(x * y) / z)) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((-4.0 * (a * t)) + (b / z)) / c;
tmp = 0.0;
if (y <= -2.45e-60)
tmp = (x * (9.0 / z)) * (y / c);
elseif (y <= 1.8e+107)
tmp = t_1;
elseif (y <= 4.5e+126)
tmp = (y / c) * (9.0 * (x / z));
elseif (y <= 6.4e+209)
tmp = t_1;
else
tmp = (9.0 * ((x * y) / z)) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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]}, If[LessEqual[y, -2.45e-60], N[(N[(x * N[(9.0 / z), $MachinePrecision]), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.8e+107], t$95$1, If[LessEqual[y, 4.5e+126], N[(N[(y / c), $MachinePrecision] * N[(9.0 * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.4e+209], t$95$1, N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\
\mathbf{if}\;y \leq -2.45 \cdot 10^{-60}:\\
\;\;\;\;\left(x \cdot \frac{9}{z}\right) \cdot \frac{y}{c}\\
\mathbf{elif}\;y \leq 1.8 \cdot 10^{+107}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 4.5 \cdot 10^{+126}:\\
\;\;\;\;\frac{y}{c} \cdot \left(9 \cdot \frac{x}{z}\right)\\
\mathbf{elif}\;y \leq 6.4 \cdot 10^{+209}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{z}}{c}\\
\end{array}
\end{array}
if y < -2.44999999999999994e-60Initial program 73.0%
+-commutative73.0%
associate-+r-73.0%
*-commutative73.0%
associate-*r*74.2%
*-commutative74.2%
associate-+r-74.2%
+-commutative74.2%
associate-*l*74.3%
associate-*l*74.5%
*-commutative74.5%
Simplified74.5%
Taylor expanded in x around inf 41.7%
associate-*r/41.7%
*-commutative41.7%
times-frac44.3%
associate-/l*48.3%
associate-*r*47.2%
Simplified47.2%
if -2.44999999999999994e-60 < y < 1.7999999999999999e107 or 4.49999999999999974e126 < y < 6.3999999999999999e209Initial program 74.8%
+-commutative74.8%
associate-+r-74.8%
*-commutative74.8%
associate-*r*73.4%
*-commutative73.4%
associate-+r-73.4%
+-commutative73.4%
associate-*l*73.4%
associate-*l*79.9%
*-commutative79.9%
Simplified79.9%
Taylor expanded in t around inf 68.1%
Taylor expanded in c around 0 75.1%
Taylor expanded in t around 0 91.0%
Taylor expanded in x around 0 82.2%
if 1.7999999999999999e107 < y < 4.49999999999999974e126Initial program 78.0%
+-commutative78.0%
associate-+r-78.0%
*-commutative78.0%
associate-*r*88.4%
*-commutative88.4%
associate-+r-88.4%
+-commutative88.4%
associate-*l*88.5%
associate-*l*88.7%
*-commutative88.7%
Simplified88.7%
Taylor expanded in x around inf 66.6%
associate-*r/66.9%
*-commutative66.9%
times-frac67.0%
associate-/l*78.0%
associate-*r*78.0%
Simplified78.0%
Taylor expanded in z around 0 78.0%
if 6.3999999999999999e209 < y Initial program 60.5%
+-commutative60.5%
associate-+r-60.5%
*-commutative60.5%
associate-*r*69.6%
*-commutative69.6%
associate-+r-69.6%
+-commutative69.6%
associate-*l*69.6%
associate-*l*69.6%
*-commutative69.6%
Simplified69.6%
Taylor expanded in t around inf 68.6%
Taylor expanded in c around 0 77.4%
Taylor expanded in x around inf 82.2%
Final simplification72.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* -4.0 (* a t))) (t_2 (/ (+ t_1 (* x (* y (/ 9.0 z)))) c)))
(if (<= z -108000.0)
t_2
(if (<= z 0.016)
(/ (+ b (* x (* 9.0 y))) (* z c))
(if (<= z 1.45e+173) (/ (+ t_1 (/ b z)) c) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a * t);
double t_2 = (t_1 + (x * (y * (9.0 / z)))) / c;
double tmp;
if (z <= -108000.0) {
tmp = t_2;
} else if (z <= 0.016) {
tmp = (b + (x * (9.0 * y))) / (z * c);
} else if (z <= 1.45e+173) {
tmp = (t_1 + (b / z)) / c;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-4.0d0) * (a * t)
t_2 = (t_1 + (x * (y * (9.0d0 / z)))) / c
if (z <= (-108000.0d0)) then
tmp = t_2
else if (z <= 0.016d0) then
tmp = (b + (x * (9.0d0 * y))) / (z * c)
else if (z <= 1.45d+173) then
tmp = (t_1 + (b / z)) / c
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a * t);
double t_2 = (t_1 + (x * (y * (9.0 / z)))) / c;
double tmp;
if (z <= -108000.0) {
tmp = t_2;
} else if (z <= 0.016) {
tmp = (b + (x * (9.0 * y))) / (z * c);
} else if (z <= 1.45e+173) {
tmp = (t_1 + (b / z)) / c;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * (a * t) t_2 = (t_1 + (x * (y * (9.0 / z)))) / c tmp = 0 if z <= -108000.0: tmp = t_2 elif z <= 0.016: tmp = (b + (x * (9.0 * y))) / (z * c) elif z <= 1.45e+173: tmp = (t_1 + (b / z)) / c else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(a * t)) t_2 = Float64(Float64(t_1 + Float64(x * Float64(y * Float64(9.0 / z)))) / c) tmp = 0.0 if (z <= -108000.0) tmp = t_2; elseif (z <= 0.016) tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(z * c)); elseif (z <= 1.45e+173) tmp = Float64(Float64(t_1 + Float64(b / z)) / c); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * (a * t);
t_2 = (t_1 + (x * (y * (9.0 / z)))) / c;
tmp = 0.0;
if (z <= -108000.0)
tmp = t_2;
elseif (z <= 0.016)
tmp = (b + (x * (9.0 * y))) / (z * c);
elseif (z <= 1.45e+173)
tmp = (t_1 + (b / z)) / c;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t$95$1 + N[(x * N[(y * N[(9.0 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -108000.0], t$95$2, If[LessEqual[z, 0.016], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.45e+173], N[(N[(t$95$1 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot t\right)\\
t_2 := \frac{t\_1 + x \cdot \left(y \cdot \frac{9}{z}\right)}{c}\\
\mathbf{if}\;z \leq -108000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 0.016:\\
\;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 1.45 \cdot 10^{+173}:\\
\;\;\;\;\frac{t\_1 + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if z < -108000 or 1.45000000000000003e173 < z Initial program 55.0%
+-commutative55.0%
associate-+r-55.0%
*-commutative55.0%
associate-*r*59.2%
*-commutative59.2%
associate-+r-59.2%
+-commutative59.2%
associate-*l*59.2%
associate-*l*65.5%
*-commutative65.5%
Simplified65.5%
Taylor expanded in t around inf 74.7%
Taylor expanded in c around 0 81.3%
Taylor expanded in t around 0 92.1%
Taylor expanded in x around inf 77.9%
associate-*r/79.6%
*-commutative79.6%
associate-*r*79.6%
*-commutative79.6%
associate-*r/79.6%
*-rgt-identity79.6%
times-frac79.6%
/-rgt-identity79.6%
Simplified79.6%
if -108000 < z < 0.016Initial program 95.0%
+-commutative95.0%
associate-+r-95.0%
*-commutative95.0%
associate-*r*93.0%
*-commutative93.0%
associate-+r-93.0%
+-commutative93.0%
associate-*l*93.1%
associate-*l*94.2%
*-commutative94.2%
Simplified94.2%
Taylor expanded in x around inf 85.7%
associate-*r*85.7%
*-commutative85.7%
associate-*r*85.8%
Simplified85.8%
if 0.016 < z < 1.45000000000000003e173Initial program 69.0%
+-commutative69.0%
associate-+r-69.0%
*-commutative69.0%
associate-*r*66.7%
*-commutative66.7%
associate-+r-66.7%
+-commutative66.7%
associate-*l*66.7%
associate-*l*71.2%
*-commutative71.2%
Simplified71.2%
Taylor expanded in t around inf 79.5%
Taylor expanded in c around 0 82.0%
Taylor expanded in t around 0 93.0%
Taylor expanded in x around 0 83.6%
Final simplification82.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -20000.0) (not (<= z 4e+39))) (/ (+ (* -4.0 (* a t)) (+ (* 9.0 (/ (* x y) z)) (/ b z))) c) (/ (+ b (- (* x (* 9.0 y)) (* (* a t) (* z 4.0)))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -20000.0) || !(z <= 4e+39)) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-20000.0d0)) .or. (.not. (z <= 4d+39))) then
tmp = (((-4.0d0) * (a * t)) + ((9.0d0 * ((x * y) / z)) + (b / z))) / c
else
tmp = (b + ((x * (9.0d0 * y)) - ((a * t) * (z * 4.0d0)))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -20000.0) || !(z <= 4e+39)) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -20000.0) or not (z <= 4e+39): tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c else: tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -20000.0) || !(z <= 4e+39)) 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(x * Float64(9.0 * y)) - Float64(Float64(a * t) * Float64(z * 4.0)))) / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -20000.0) || ~((z <= 4e+39)))
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
else
tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -20000.0], N[Not[LessEqual[z, 4e+39]], $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[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -20000 \lor \neg \left(z \leq 4 \cdot 10^{+39}\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(x \cdot \left(9 \cdot y\right) - \left(a \cdot t\right) \cdot \left(z \cdot 4\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2e4 or 3.99999999999999976e39 < z Initial program 57.4%
+-commutative57.4%
associate-+r-57.4%
*-commutative57.4%
associate-*r*60.0%
*-commutative60.0%
associate-+r-60.0%
+-commutative60.0%
associate-*l*60.0%
associate-*l*66.1%
*-commutative66.1%
Simplified66.1%
Taylor expanded in t around inf 74.4%
Taylor expanded in c around 0 82.2%
Taylor expanded in t around 0 93.2%
if -2e4 < z < 3.99999999999999976e39Initial program 93.8%
+-commutative93.8%
associate-+r-93.8%
*-commutative93.8%
associate-*r*91.9%
*-commutative91.9%
associate-+r-91.9%
+-commutative91.9%
associate-*l*92.0%
associate-*l*93.0%
*-commutative93.0%
Simplified93.0%
Final simplification93.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* -4.0 (* a t))))
(if (<= b -1.05e-10)
(* b (- (/ (/ 1.0 z) c) (* 4.0 (/ (* a (/ t b)) c))))
(if (<= b 9.5e+123)
(/ (+ t_1 (* x (* y (/ 9.0 z)))) c)
(/ (+ t_1 (/ b z)) c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a * t);
double tmp;
if (b <= -1.05e-10) {
tmp = b * (((1.0 / z) / c) - (4.0 * ((a * (t / b)) / c)));
} else if (b <= 9.5e+123) {
tmp = (t_1 + (x * (y * (9.0 / z)))) / c;
} else {
tmp = (t_1 + (b / z)) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * (a * t)
if (b <= (-1.05d-10)) then
tmp = b * (((1.0d0 / z) / c) - (4.0d0 * ((a * (t / b)) / c)))
else if (b <= 9.5d+123) then
tmp = (t_1 + (x * (y * (9.0d0 / z)))) / c
else
tmp = (t_1 + (b / z)) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a * t);
double tmp;
if (b <= -1.05e-10) {
tmp = b * (((1.0 / z) / c) - (4.0 * ((a * (t / b)) / c)));
} else if (b <= 9.5e+123) {
tmp = (t_1 + (x * (y * (9.0 / z)))) / c;
} else {
tmp = (t_1 + (b / z)) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * (a * t) tmp = 0 if b <= -1.05e-10: tmp = b * (((1.0 / z) / c) - (4.0 * ((a * (t / b)) / c))) elif b <= 9.5e+123: tmp = (t_1 + (x * (y * (9.0 / z)))) / c else: tmp = (t_1 + (b / z)) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(a * t)) tmp = 0.0 if (b <= -1.05e-10) tmp = Float64(b * Float64(Float64(Float64(1.0 / z) / c) - Float64(4.0 * Float64(Float64(a * Float64(t / b)) / c)))); elseif (b <= 9.5e+123) tmp = Float64(Float64(t_1 + Float64(x * Float64(y * Float64(9.0 / z)))) / c); else tmp = Float64(Float64(t_1 + Float64(b / z)) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * (a * t);
tmp = 0.0;
if (b <= -1.05e-10)
tmp = b * (((1.0 / z) / c) - (4.0 * ((a * (t / b)) / c)));
elseif (b <= 9.5e+123)
tmp = (t_1 + (x * (y * (9.0 / z)))) / c;
else
tmp = (t_1 + (b / z)) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.05e-10], N[(b * N[(N[(N[(1.0 / z), $MachinePrecision] / c), $MachinePrecision] - N[(4.0 * N[(N[(a * N[(t / b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9.5e+123], N[(N[(t$95$1 + N[(x * N[(y * N[(9.0 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(t$95$1 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;b \leq -1.05 \cdot 10^{-10}:\\
\;\;\;\;b \cdot \left(\frac{\frac{1}{z}}{c} - 4 \cdot \frac{a \cdot \frac{t}{b}}{c}\right)\\
\mathbf{elif}\;b \leq 9.5 \cdot 10^{+123}:\\
\;\;\;\;\frac{t\_1 + x \cdot \left(y \cdot \frac{9}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1 + \frac{b}{z}}{c}\\
\end{array}
\end{array}
if b < -1.05e-10Initial program 76.0%
+-commutative76.0%
associate-+r-76.0%
*-commutative76.0%
associate-*r*75.8%
*-commutative75.8%
associate-+r-75.8%
+-commutative75.8%
associate-*l*75.8%
associate-*l*78.4%
*-commutative78.4%
Simplified78.4%
Taylor expanded in t around inf 69.3%
Taylor expanded in c around 0 67.3%
Taylor expanded in x around 0 64.9%
Taylor expanded in b around -inf 75.8%
mul-1-neg75.8%
distribute-lft-neg-in75.8%
associate-/r*77.0%
associate-/l*78.3%
associate-/l/80.1%
Simplified80.1%
if -1.05e-10 < b < 9.4999999999999996e123Initial program 71.4%
+-commutative71.4%
associate-+r-71.4%
*-commutative71.4%
associate-*r*72.5%
*-commutative72.5%
associate-+r-72.5%
+-commutative72.5%
associate-*l*72.6%
associate-*l*76.4%
*-commutative76.4%
Simplified76.4%
Taylor expanded in t around inf 74.7%
Taylor expanded in c around 0 78.6%
Taylor expanded in t around 0 90.9%
Taylor expanded in x around inf 82.9%
associate-*r/81.5%
*-commutative81.5%
associate-*r*81.5%
*-commutative81.5%
associate-*r/81.5%
*-rgt-identity81.5%
times-frac81.5%
/-rgt-identity81.5%
Simplified81.5%
if 9.4999999999999996e123 < b Initial program 73.5%
+-commutative73.5%
associate-+r-73.5%
*-commutative73.5%
associate-*r*74.1%
*-commutative74.1%
associate-+r-74.1%
+-commutative74.1%
associate-*l*74.1%
associate-*l*81.6%
*-commutative81.6%
Simplified81.6%
Taylor expanded in t around inf 57.2%
Taylor expanded in c around 0 70.8%
Taylor expanded in t around 0 94.5%
Taylor expanded in x around 0 86.9%
Final simplification81.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= c 1e+258) (/ (+ (* -4.0 (* a t)) (+ (* 9.0 (/ (* x y) z)) (/ b z))) c) (/ (* y (- (/ b (* y c)) (* -9.0 (/ x c)))) z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (c <= 1e+258) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (y * ((b / (y * c)) - (-9.0 * (x / c)))) / z;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (c <= 1d+258) then
tmp = (((-4.0d0) * (a * t)) + ((9.0d0 * ((x * y) / z)) + (b / z))) / c
else
tmp = (y * ((b / (y * c)) - ((-9.0d0) * (x / c)))) / z
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (c <= 1e+258) {
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
} else {
tmp = (y * ((b / (y * c)) - (-9.0 * (x / c)))) / z;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if c <= 1e+258: tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c else: tmp = (y * ((b / (y * c)) - (-9.0 * (x / c)))) / z return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (c <= 1e+258) 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(y * Float64(Float64(b / Float64(y * c)) - Float64(-9.0 * Float64(x / c)))) / z); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (c <= 1e+258)
tmp = ((-4.0 * (a * t)) + ((9.0 * ((x * y) / z)) + (b / z))) / c;
else
tmp = (y * ((b / (y * c)) - (-9.0 * (x / c)))) / z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[c, 1e+258], 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[(y * N[(N[(b / N[(y * c), $MachinePrecision]), $MachinePrecision] - N[(-9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;c \leq 10^{+258}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(9 \cdot \frac{x \cdot y}{z} + \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot \left(\frac{b}{y \cdot c} - -9 \cdot \frac{x}{c}\right)}{z}\\
\end{array}
\end{array}
if c < 1.00000000000000006e258Initial program 74.9%
+-commutative74.9%
associate-+r-74.9%
*-commutative74.9%
associate-*r*75.6%
*-commutative75.6%
associate-+r-75.6%
+-commutative75.6%
associate-*l*75.7%
associate-*l*79.7%
*-commutative79.7%
Simplified79.7%
Taylor expanded in t around inf 70.6%
Taylor expanded in c around 0 75.7%
Taylor expanded in t around 0 90.9%
if 1.00000000000000006e258 < c Initial program 24.2%
+-commutative24.2%
associate-+r-24.2%
*-commutative24.2%
associate-*r*24.2%
*-commutative24.2%
associate-+r-24.2%
+-commutative24.2%
associate-*l*24.2%
associate-*l*24.2%
*-commutative24.2%
Simplified24.2%
Taylor expanded in y around -inf 25.9%
associate-*r*25.9%
*-commutative25.9%
mul-1-neg25.9%
Simplified66.6%
Taylor expanded in z around 0 66.8%
associate-*r/66.8%
associate-*r*66.8%
neg-mul-166.8%
*-commutative66.8%
Simplified66.8%
Final simplification90.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.55e+15) (not (<= z 0.014))) (/ (+ (* -4.0 (* a t)) (/ b z)) c) (/ (+ b (* x (* 9.0 y))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.55e+15) || !(z <= 0.014)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((z <= (-1.55d+15)) .or. (.not. (z <= 0.014d0))) 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 && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.55e+15) || !(z <= 0.014)) {
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -1.55e+15) or not (z <= 0.014): tmp = ((-4.0 * (a * t)) + (b / z)) / c else: tmp = (b + (x * (9.0 * y))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.55e+15) || !(z <= 0.014)) 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, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -1.55e+15) || ~((z <= 0.014)))
tmp = ((-4.0 * (a * t)) + (b / z)) / c;
else
tmp = (b + (x * (9.0 * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.55e+15], N[Not[LessEqual[z, 0.014]], $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, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.55 \cdot 10^{+15} \lor \neg \left(z \leq 0.014\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.55e15 or 0.0140000000000000003 < z Initial program 58.1%
+-commutative58.1%
associate-+r-58.1%
*-commutative58.1%
associate-*r*61.2%
*-commutative61.2%
associate-+r-61.2%
+-commutative61.2%
associate-*l*61.2%
associate-*l*66.5%
*-commutative66.5%
Simplified66.5%
Taylor expanded in t around inf 75.6%
Taylor expanded in c around 0 81.1%
Taylor expanded in t around 0 92.2%
Taylor expanded in x around 0 74.1%
if -1.55e15 < z < 0.0140000000000000003Initial program 95.2%
+-commutative95.2%
associate-+r-95.2%
*-commutative95.2%
associate-*r*92.3%
*-commutative92.3%
associate-+r-92.3%
+-commutative92.3%
associate-*l*92.4%
associate-*l*94.4%
*-commutative94.4%
Simplified94.4%
Taylor expanded in x around inf 85.2%
associate-*r*85.2%
*-commutative85.2%
associate-*r*85.3%
Simplified85.3%
Final simplification78.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -360000000000.0) (not (<= z 0.0039))) (* -4.0 (* t (/ a c))) (/ b (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -360000000000.0) || !(z <= 0.0039)) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-360000000000.0d0)) .or. (.not. (z <= 0.0039d0))) then
tmp = (-4.0d0) * (t * (a / c))
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -360000000000.0) || !(z <= 0.0039)) {
tmp = -4.0 * (t * (a / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -360000000000.0) or not (z <= 0.0039): tmp = -4.0 * (t * (a / c)) else: tmp = b / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -360000000000.0) || !(z <= 0.0039)) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -360000000000.0) || ~((z <= 0.0039)))
tmp = -4.0 * (t * (a / c));
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -360000000000.0], N[Not[LessEqual[z, 0.0039]], $MachinePrecision]], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -360000000000 \lor \neg \left(z \leq 0.0039\right):\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if z < -3.6e11 or 0.0038999999999999998 < z Initial program 58.9%
+-commutative58.9%
associate-+r-58.9%
*-commutative58.9%
associate-*r*61.3%
*-commutative61.3%
associate-+r-61.3%
+-commutative61.3%
associate-*l*61.3%
associate-*l*67.1%
*-commutative67.1%
Simplified67.1%
Taylor expanded in t around inf 75.4%
Taylor expanded in c around 0 81.5%
Taylor expanded in t around inf 56.3%
*-commutative56.3%
associate-/l*56.5%
Simplified56.5%
if -3.6e11 < z < 0.0038999999999999998Initial program 95.0%
+-commutative95.0%
associate-+r-95.0%
*-commutative95.0%
associate-*r*93.0%
*-commutative93.0%
associate-+r-93.0%
+-commutative93.0%
associate-*l*93.1%
associate-*l*94.2%
*-commutative94.2%
Simplified94.2%
Taylor expanded in b around inf 55.0%
*-commutative55.0%
Simplified55.0%
Final simplification55.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -6000000000000.0) (* -4.0 (/ (* a t) c)) (if (<= z 0.00125) (/ b (* z c)) (* -4.0 (* t (/ a c))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -6000000000000.0) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 0.00125) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-6000000000000.0d0)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (z <= 0.00125d0) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -6000000000000.0) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 0.00125) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -6000000000000.0: tmp = -4.0 * ((a * t) / c) elif z <= 0.00125: tmp = b / (z * c) else: tmp = -4.0 * (t * (a / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -6000000000000.0) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= 0.00125) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -6000000000000.0)
tmp = -4.0 * ((a * t) / c);
elseif (z <= 0.00125)
tmp = b / (z * c);
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -6000000000000.0], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 0.00125], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6000000000000:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 0.00125:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if z < -6e12Initial program 65.5%
+-commutative65.5%
associate-+r-65.5%
*-commutative65.5%
associate-*r*67.9%
*-commutative67.9%
associate-+r-67.9%
+-commutative67.9%
associate-*l*67.9%
associate-*l*75.2%
*-commutative75.2%
Simplified75.2%
Taylor expanded in z around inf 58.2%
if -6e12 < z < 0.00125000000000000003Initial program 95.0%
+-commutative95.0%
associate-+r-95.0%
*-commutative95.0%
associate-*r*93.0%
*-commutative93.0%
associate-+r-93.0%
+-commutative93.0%
associate-*l*93.1%
associate-*l*94.2%
*-commutative94.2%
Simplified94.2%
Taylor expanded in b around inf 55.0%
*-commutative55.0%
Simplified55.0%
if 0.00125000000000000003 < z Initial program 51.7%
+-commutative51.7%
associate-+r-51.7%
*-commutative51.7%
associate-*r*54.1%
*-commutative54.1%
associate-+r-54.1%
+-commutative54.1%
associate-*l*54.0%
associate-*l*58.2%
*-commutative58.2%
Simplified58.2%
Taylor expanded in t around inf 75.9%
Taylor expanded in c around 0 77.6%
Taylor expanded in t around inf 54.2%
*-commutative54.2%
associate-/l*58.1%
Simplified58.1%
Final simplification56.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -49000000000.0) (* -4.0 (/ (* a t) c)) (if (<= z 0.0017) (/ b (* z c)) (* -4.0 (* a (/ t c))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -49000000000.0) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 0.0017) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-49000000000.0d0)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (z <= 0.0017d0) then
tmp = b / (z * c)
else
tmp = (-4.0d0) * (a * (t / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -49000000000.0) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 0.0017) {
tmp = b / (z * c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -49000000000.0: tmp = -4.0 * ((a * t) / c) elif z <= 0.0017: tmp = b / (z * c) else: tmp = -4.0 * (a * (t / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -49000000000.0) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= 0.0017) tmp = Float64(b / Float64(z * c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -49000000000.0)
tmp = -4.0 * ((a * t) / c);
elseif (z <= 0.0017)
tmp = b / (z * c);
else
tmp = -4.0 * (a * (t / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -49000000000.0], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 0.0017], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -49000000000:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 0.0017:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if z < -4.9e10Initial program 65.5%
+-commutative65.5%
associate-+r-65.5%
*-commutative65.5%
associate-*r*67.9%
*-commutative67.9%
associate-+r-67.9%
+-commutative67.9%
associate-*l*67.9%
associate-*l*75.2%
*-commutative75.2%
Simplified75.2%
Taylor expanded in z around inf 58.2%
if -4.9e10 < z < 0.00169999999999999991Initial program 95.0%
+-commutative95.0%
associate-+r-95.0%
*-commutative95.0%
associate-*r*93.0%
*-commutative93.0%
associate-+r-93.0%
+-commutative93.0%
associate-*l*93.1%
associate-*l*94.2%
*-commutative94.2%
Simplified94.2%
Taylor expanded in b around inf 55.0%
*-commutative55.0%
Simplified55.0%
if 0.00169999999999999991 < z Initial program 51.7%
+-commutative51.7%
associate-+r-51.7%
*-commutative51.7%
associate-*r*54.1%
*-commutative54.1%
associate-+r-54.1%
+-commutative54.1%
associate-*l*54.0%
associate-*l*58.2%
*-commutative58.2%
Simplified58.2%
Taylor expanded in z around inf 54.2%
*-commutative54.2%
associate-/l*54.3%
Simplified54.3%
Final simplification55.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 73.2%
+-commutative73.2%
associate-+r-73.2%
*-commutative73.2%
associate-*r*73.8%
*-commutative73.8%
associate-+r-73.8%
+-commutative73.8%
associate-*l*73.8%
associate-*l*77.8%
*-commutative77.8%
Simplified77.8%
Taylor expanded in b around inf 32.3%
*-commutative32.3%
Simplified32.3%
Final simplification32.3%
(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 2024059
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) -1.100156740804105e-171) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 0.0) (/ (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.1708877911747488e-53) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 2.876823679546137e+130) (- (+ (* (* 9.0 (/ y c)) (/ x z)) (/ b (* c z))) (* 4.0 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.3838515042456319e+158) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (- (+ (* 9.0 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4.0 (/ (* a t) c))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))