
(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. 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 -2.4e+72) (not (<= z 3.5e+62))) (fma -4.0 (/ a (/ c t)) (fma 9.0 (* (/ x c) (/ y z)) (/ b (* z c)))) (/ 1.0 (* z (/ c (+ b (fma x (* 9.0 y) (* a (* z (* -4.0 t))))))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.4e+72) || !(z <= 3.5e+62)) {
tmp = fma(-4.0, (a / (c / t)), fma(9.0, ((x / c) * (y / z)), (b / (z * c))));
} else {
tmp = 1.0 / (z * (c / (b + fma(x, (9.0 * y), (a * (z * (-4.0 * t)))))));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.4e+72) || !(z <= 3.5e+62)) tmp = fma(-4.0, Float64(a / Float64(c / t)), fma(9.0, Float64(Float64(x / c) * Float64(y / z)), Float64(b / Float64(z * c)))); else tmp = Float64(1.0 / Float64(z * Float64(c / Float64(b + fma(x, Float64(9.0 * y), Float64(a * Float64(z * Float64(-4.0 * t)))))))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.4e+72], N[Not[LessEqual[z, 3.5e+62]], $MachinePrecision]], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(c / N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(z * N[(-4.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.4 \cdot 10^{+72} \lor \neg \left(z \leq 3.5 \cdot 10^{+62}\right):\\
\;\;\;\;\mathsf{fma}\left(-4, \frac{a}{\frac{c}{t}}, \mathsf{fma}\left(9, \frac{x}{c} \cdot \frac{y}{z}, \frac{b}{z \cdot c}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \frac{c}{b + \mathsf{fma}\left(x, 9 \cdot y, a \cdot \left(z \cdot \left(-4 \cdot t\right)\right)\right)}}\\
\end{array}
\end{array}
if z < -2.4000000000000001e72 or 3.49999999999999984e62 < z Initial program 57.2%
associate-+l-57.2%
*-commutative57.2%
associate-*r*57.2%
*-commutative57.2%
associate-+l-57.2%
*-commutative57.2%
associate-*r*57.2%
*-commutative57.2%
associate-*l*57.2%
associate-*l*63.3%
Simplified63.3%
Taylor expanded in x around 0 83.1%
cancel-sign-sub-inv83.1%
metadata-eval83.1%
+-commutative83.1%
fma-def83.1%
associate-/l*76.0%
fma-def76.0%
times-frac78.8%
*-commutative78.8%
Simplified78.8%
if -2.4000000000000001e72 < z < 3.49999999999999984e62Initial program 94.7%
associate-+l-94.7%
*-commutative94.7%
associate-*r*94.7%
*-commutative94.7%
associate-+l-94.7%
*-commutative94.7%
associate-*r*94.7%
*-commutative94.7%
associate-*l*94.7%
associate-*l*93.4%
Simplified93.4%
Applied egg-rr96.7%
*-commutative96.7%
clear-num96.7%
frac-times96.8%
metadata-eval96.8%
Applied egg-rr96.8%
Final simplification89.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -1.1e+196)
(* -4.0 (/ (* a t) c))
(if (<= z 1.1e+230)
(/ (+ b (fma x (* 9.0 y) (* z (* a (* -4.0 t))))) (* z c))
(* (/ t c) (* -4.0 a)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.1e+196) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 1.1e+230) {
tmp = (b + fma(x, (9.0 * y), (z * (a * (-4.0 * t))))) / (z * c);
} else {
tmp = (t / c) * (-4.0 * a);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.1e+196) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= 1.1e+230) tmp = Float64(Float64(b + fma(x, Float64(9.0 * y), Float64(z * Float64(a * Float64(-4.0 * t))))) / Float64(z * c)); else tmp = Float64(Float64(t / c) * Float64(-4.0 * a)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -1.1e+196], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.1e+230], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(z * N[(a * N[(-4.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.1 \cdot 10^{+196}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 1.1 \cdot 10^{+230}:\\
\;\;\;\;\frac{b + \mathsf{fma}\left(x, 9 \cdot y, z \cdot \left(a \cdot \left(-4 \cdot t\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\end{array}
\end{array}
if z < -1.09999999999999999e196Initial program 30.0%
associate-+l-30.0%
*-commutative30.0%
associate-*r*24.3%
*-commutative24.3%
associate-+l-24.3%
*-commutative24.3%
associate-*r*30.0%
*-commutative30.0%
associate-*l*30.0%
associate-*l*30.0%
Simplified30.0%
Taylor expanded in z around inf 68.1%
if -1.09999999999999999e196 < z < 1.1e230Initial program 88.3%
+-commutative88.3%
associate-+r-88.3%
*-commutative88.3%
associate-*r*88.8%
*-commutative88.8%
associate-+r-88.8%
+-commutative88.8%
Simplified90.5%
if 1.1e230 < z Initial program 35.5%
associate-+l-35.5%
*-commutative35.5%
associate-*r*35.5%
*-commutative35.5%
associate-+l-35.5%
*-commutative35.5%
associate-*r*35.5%
*-commutative35.5%
associate-*l*35.5%
associate-*l*46.4%
Simplified46.4%
Taylor expanded in z around inf 73.3%
associate-/l*62.9%
associate-*r/62.9%
*-commutative62.9%
Simplified62.9%
div-inv63.0%
clear-num63.2%
*-commutative63.2%
Applied egg-rr63.2%
Final simplification87.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c)) INFINITY) (/ (+ b (- (* x (* 9.0 y)) (* (* z 4.0) (* a t)))) (* z c)) (* (/ t c) (* -4.0 a))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (((b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c)) <= ((double) INFINITY)) {
tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
} else {
tmp = (t / c) * (-4.0 * a);
}
return tmp;
}
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (((b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c)) <= Double.POSITIVE_INFINITY) {
tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
} else {
tmp = (t / c) * (-4.0 * a);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if ((b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c)) <= math.inf: tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c) else: tmp = (t / c) * (-4.0 * a) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) <= Inf) tmp = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(z * c)); else tmp = Float64(Float64(t / c) * Float64(-4.0 * a)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (((b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c)) <= Inf)
tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
else
tmp = (t / c) * (-4.0 * a);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[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], Infinity], N[(N[(b + N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;\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} \leq \infty:\\
\;\;\;\;\frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < +inf.0Initial program 85.1%
associate-+l-85.1%
*-commutative85.1%
associate-*r*85.1%
*-commutative85.1%
associate-+l-85.1%
*-commutative85.1%
associate-*r*85.1%
*-commutative85.1%
associate-*l*85.1%
associate-*l*86.7%
Simplified86.7%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-+l-0.0%
*-commutative0.0%
associate-*r*0.4%
*-commutative0.4%
associate-+l-0.4%
*-commutative0.4%
associate-*r*0.0%
*-commutative0.0%
associate-*l*0.0%
associate-*l*0.4%
Simplified0.4%
Taylor expanded in z around inf 52.2%
associate-/l*65.3%
associate-*r/65.3%
*-commutative65.3%
Simplified65.3%
div-inv65.2%
clear-num65.3%
*-commutative65.3%
Applied egg-rr65.3%
Final simplification85.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 4.0 (* a (* z t)))) (t_2 (* (/ t c) (* -4.0 a))))
(if (<= z -2.9e+137)
t_2
(if (<= z -3.8e-104)
(/ (- b t_1) (* z c))
(if (<= z 1.8e+21)
(/ (+ b (* x (* 9.0 y))) (* z c))
(if (<= z 2.6e+178) (/ (- (* 9.0 (* x y)) t_1) (* z c)) t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 4.0 * (a * (z * t));
double t_2 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -2.9e+137) {
tmp = t_2;
} else if (z <= -3.8e-104) {
tmp = (b - t_1) / (z * c);
} else if (z <= 1.8e+21) {
tmp = (b + (x * (9.0 * y))) / (z * c);
} else if (z <= 2.6e+178) {
tmp = ((9.0 * (x * y)) - t_1) / (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.
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 * (z * t))
t_2 = (t / c) * ((-4.0d0) * a)
if (z <= (-2.9d+137)) then
tmp = t_2
else if (z <= (-3.8d-104)) then
tmp = (b - t_1) / (z * c)
else if (z <= 1.8d+21) then
tmp = (b + (x * (9.0d0 * y))) / (z * c)
else if (z <= 2.6d+178) then
tmp = ((9.0d0 * (x * y)) - t_1) / (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;
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 * (z * t));
double t_2 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -2.9e+137) {
tmp = t_2;
} else if (z <= -3.8e-104) {
tmp = (b - t_1) / (z * c);
} else if (z <= 1.8e+21) {
tmp = (b + (x * (9.0 * y))) / (z * c);
} else if (z <= 2.6e+178) {
tmp = ((9.0 * (x * y)) - t_1) / (z * c);
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 4.0 * (a * (z * t)) t_2 = (t / c) * (-4.0 * a) tmp = 0 if z <= -2.9e+137: tmp = t_2 elif z <= -3.8e-104: tmp = (b - t_1) / (z * c) elif z <= 1.8e+21: tmp = (b + (x * (9.0 * y))) / (z * c) elif z <= 2.6e+178: tmp = ((9.0 * (x * y)) - t_1) / (z * c) else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(4.0 * Float64(a * Float64(z * t))) t_2 = Float64(Float64(t / c) * Float64(-4.0 * a)) tmp = 0.0 if (z <= -2.9e+137) tmp = t_2; elseif (z <= -3.8e-104) tmp = Float64(Float64(b - t_1) / Float64(z * c)); elseif (z <= 1.8e+21) tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(z * c)); elseif (z <= 2.6e+178) tmp = Float64(Float64(Float64(9.0 * Float64(x * y)) - t_1) / Float64(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])){:}
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 * (z * t));
t_2 = (t / c) * (-4.0 * a);
tmp = 0.0;
if (z <= -2.9e+137)
tmp = t_2;
elseif (z <= -3.8e-104)
tmp = (b - t_1) / (z * c);
elseif (z <= 1.8e+21)
tmp = (b + (x * (9.0 * y))) / (z * c);
elseif (z <= 2.6e+178)
tmp = ((9.0 * (x * y)) - t_1) / (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.
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 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.9e+137], t$95$2, If[LessEqual[z, -3.8e-104], N[(N[(b - t$95$1), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.8e+21], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.6e+178], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] / N[(z * 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])\\\\
[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 \left(z \cdot t\right)\right)\\
t_2 := \frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{if}\;z \leq -2.9 \cdot 10^{+137}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -3.8 \cdot 10^{-104}:\\
\;\;\;\;\frac{b - t_1}{z \cdot c}\\
\mathbf{elif}\;z \leq 1.8 \cdot 10^{+21}:\\
\;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 2.6 \cdot 10^{+178}:\\
\;\;\;\;\frac{9 \cdot \left(x \cdot y\right) - t_1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -2.89999999999999985e137 or 2.6000000000000001e178 < z Initial program 42.9%
associate-+l-42.9%
*-commutative42.9%
associate-*r*39.4%
*-commutative39.4%
associate-+l-39.4%
*-commutative39.4%
associate-*r*42.9%
*-commutative42.9%
associate-*l*42.9%
associate-*l*48.3%
Simplified48.3%
Taylor expanded in z around inf 62.3%
associate-/l*57.0%
associate-*r/57.0%
*-commutative57.0%
Simplified57.0%
div-inv57.0%
clear-num57.2%
*-commutative57.2%
Applied egg-rr57.2%
if -2.89999999999999985e137 < z < -3.8000000000000001e-104Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*86.1%
*-commutative86.1%
associate-+l-86.1%
*-commutative86.1%
associate-*r*84.2%
*-commutative84.2%
associate-*l*84.1%
associate-*l*86.0%
Simplified86.0%
Taylor expanded in x around 0 74.1%
if -3.8000000000000001e-104 < z < 1.8e21Initial program 96.5%
associate-+l-96.5%
*-commutative96.5%
associate-*r*96.5%
*-commutative96.5%
associate-+l-96.5%
*-commutative96.5%
associate-*r*96.5%
*-commutative96.5%
associate-*l*96.5%
associate-*l*94.8%
Simplified94.8%
Taylor expanded in x around inf 89.0%
associate-*r*89.0%
*-commutative89.0%
associate-*r*89.0%
Simplified89.0%
if 1.8e21 < z < 2.6000000000000001e178Initial program 83.3%
associate-+l-83.3%
*-commutative83.3%
associate-*r*86.3%
*-commutative86.3%
associate-+l-86.3%
*-commutative86.3%
associate-*r*83.3%
*-commutative83.3%
associate-*l*83.3%
associate-*l*88.9%
Simplified88.9%
Taylor expanded in b around 0 72.3%
Final simplification76.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ t c) (* -4.0 a))))
(if (<= z -1.5e+35)
t_1
(if (<= z -2400.0)
(/ (/ b c) z)
(if (<= z -1.07e-103)
(* -4.0 (/ (* a t) c))
(if (<= z -4.25e-203)
(/ b (* z c))
(if (<= z 9e+76) (* 9.0 (* y (/ x (* z c)))) t_1)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -1.5e+35) {
tmp = t_1;
} else if (z <= -2400.0) {
tmp = (b / c) / z;
} else if (z <= -1.07e-103) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= -4.25e-203) {
tmp = b / (z * c);
} else if (z <= 9e+76) {
tmp = 9.0 * (y * (x / (z * c)));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (t / c) * ((-4.0d0) * a)
if (z <= (-1.5d+35)) then
tmp = t_1
else if (z <= (-2400.0d0)) then
tmp = (b / c) / z
else if (z <= (-1.07d-103)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (z <= (-4.25d-203)) then
tmp = b / (z * c)
else if (z <= 9d+76) then
tmp = 9.0d0 * (y * (x / (z * c)))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -1.5e+35) {
tmp = t_1;
} else if (z <= -2400.0) {
tmp = (b / c) / z;
} else if (z <= -1.07e-103) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= -4.25e-203) {
tmp = b / (z * c);
} else if (z <= 9e+76) {
tmp = 9.0 * (y * (x / (z * c)));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (t / c) * (-4.0 * a) tmp = 0 if z <= -1.5e+35: tmp = t_1 elif z <= -2400.0: tmp = (b / c) / z elif z <= -1.07e-103: tmp = -4.0 * ((a * t) / c) elif z <= -4.25e-203: tmp = b / (z * c) elif z <= 9e+76: tmp = 9.0 * (y * (x / (z * c))) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(t / c) * Float64(-4.0 * a)) tmp = 0.0 if (z <= -1.5e+35) tmp = t_1; elseif (z <= -2400.0) tmp = Float64(Float64(b / c) / z); elseif (z <= -1.07e-103) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= -4.25e-203) tmp = Float64(b / Float64(z * c)); elseif (z <= 9e+76) tmp = Float64(9.0 * Float64(y * Float64(x / Float64(z * c)))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (t / c) * (-4.0 * a);
tmp = 0.0;
if (z <= -1.5e+35)
tmp = t_1;
elseif (z <= -2400.0)
tmp = (b / c) / z;
elseif (z <= -1.07e-103)
tmp = -4.0 * ((a * t) / c);
elseif (z <= -4.25e-203)
tmp = b / (z * c);
elseif (z <= 9e+76)
tmp = 9.0 * (y * (x / (z * c)));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.5e+35], t$95$1, If[LessEqual[z, -2400.0], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, -1.07e-103], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -4.25e-203], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9e+76], N[(9.0 * N[(y * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{if}\;z \leq -1.5 \cdot 10^{+35}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -2400:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;z \leq -1.07 \cdot 10^{-103}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq -4.25 \cdot 10^{-203}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;z \leq 9 \cdot 10^{+76}:\\
\;\;\;\;9 \cdot \left(y \cdot \frac{x}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if z < -1.49999999999999995e35 or 8.9999999999999995e76 < z Initial program 56.9%
associate-+l-56.9%
*-commutative56.9%
associate-*r*57.0%
*-commutative57.0%
associate-+l-57.0%
*-commutative57.0%
associate-*r*56.9%
*-commutative56.9%
associate-*l*56.9%
associate-*l*62.8%
Simplified62.8%
Taylor expanded in z around inf 59.9%
associate-/l*57.8%
associate-*r/57.8%
*-commutative57.8%
Simplified57.8%
div-inv56.9%
clear-num57.0%
*-commutative57.0%
Applied egg-rr57.0%
if -1.49999999999999995e35 < z < -2400Initial program 89.5%
associate-+l-89.5%
*-commutative89.5%
associate-*r*89.5%
*-commutative89.5%
associate-+l-89.5%
*-commutative89.5%
associate-*r*89.5%
*-commutative89.5%
associate-*l*89.4%
associate-*l*89.4%
Simplified89.4%
Applied egg-rr99.5%
Taylor expanded in b around inf 70.8%
Taylor expanded in z around 0 70.8%
associate-/r*70.9%
Simplified70.9%
if -2400 < z < -1.07000000000000005e-103Initial program 97.3%
associate-+l-97.3%
*-commutative97.3%
associate-*r*97.3%
*-commutative97.3%
associate-+l-97.3%
*-commutative97.3%
associate-*r*97.3%
*-commutative97.3%
associate-*l*97.3%
associate-*l*97.2%
Simplified97.2%
Taylor expanded in z around inf 57.0%
if -1.07000000000000005e-103 < z < -4.25000000000000016e-203Initial program 96.1%
associate-+l-96.1%
*-commutative96.1%
associate-*r*96.1%
*-commutative96.1%
associate-+l-96.1%
*-commutative96.1%
associate-*r*96.1%
*-commutative96.1%
associate-*l*96.1%
associate-*l*95.9%
Simplified95.9%
Taylor expanded in b around inf 65.1%
*-commutative65.1%
Simplified65.1%
if -4.25000000000000016e-203 < z < 8.9999999999999995e76Initial program 96.1%
associate-+l-96.1%
*-commutative96.1%
associate-*r*96.1%
*-commutative96.1%
associate-+l-96.1%
*-commutative96.1%
associate-*r*96.1%
*-commutative96.1%
associate-*l*96.1%
associate-*l*94.2%
Simplified94.2%
Taylor expanded in x around inf 56.0%
associate-/l*55.6%
*-commutative55.6%
associate-/r/56.0%
Simplified56.0%
Final simplification57.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (* x (* 9.0 y))) (* z c))) (t_2 (* (/ t c) (* -4.0 a))))
(if (<= z -1.6e+35)
t_2
(if (<= z 6e+91)
t_1
(if (<= z 1e+137)
(* -4.0 (/ (* a t) c))
(if (<= z 1.04e+182) t_1 t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + (x * (9.0 * y))) / (z * c);
double t_2 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -1.6e+35) {
tmp = t_2;
} else if (z <= 6e+91) {
tmp = t_1;
} else if (z <= 1e+137) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 1.04e+182) {
tmp = t_1;
} 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.
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 = (b + (x * (9.0d0 * y))) / (z * c)
t_2 = (t / c) * ((-4.0d0) * a)
if (z <= (-1.6d+35)) then
tmp = t_2
else if (z <= 6d+91) then
tmp = t_1
else if (z <= 1d+137) then
tmp = (-4.0d0) * ((a * t) / c)
else if (z <= 1.04d+182) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + (x * (9.0 * y))) / (z * c);
double t_2 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -1.6e+35) {
tmp = t_2;
} else if (z <= 6e+91) {
tmp = t_1;
} else if (z <= 1e+137) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 1.04e+182) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (b + (x * (9.0 * y))) / (z * c) t_2 = (t / c) * (-4.0 * a) tmp = 0 if z <= -1.6e+35: tmp = t_2 elif z <= 6e+91: tmp = t_1 elif z <= 1e+137: tmp = -4.0 * ((a * t) / c) elif z <= 1.04e+182: tmp = t_1 else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(z * c)) t_2 = Float64(Float64(t / c) * Float64(-4.0 * a)) tmp = 0.0 if (z <= -1.6e+35) tmp = t_2; elseif (z <= 6e+91) tmp = t_1; elseif (z <= 1e+137) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= 1.04e+182) tmp = t_1; else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (b + (x * (9.0 * y))) / (z * c);
t_2 = (t / c) * (-4.0 * a);
tmp = 0.0;
if (z <= -1.6e+35)
tmp = t_2;
elseif (z <= 6e+91)
tmp = t_1;
elseif (z <= 1e+137)
tmp = -4.0 * ((a * t) / c);
elseif (z <= 1.04e+182)
tmp = t_1;
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.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.6e+35], t$95$2, If[LessEqual[z, 6e+91], t$95$1, If[LessEqual[z, 1e+137], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.04e+182], t$95$1, t$95$2]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
t_2 := \frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{if}\;z \leq -1.6 \cdot 10^{+35}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq 6 \cdot 10^{+91}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 10^{+137}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 1.04 \cdot 10^{+182}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -1.59999999999999991e35 or 1.04e182 < z Initial program 51.5%
associate-+l-51.5%
*-commutative51.5%
associate-*r*50.3%
*-commutative50.3%
associate-+l-50.3%
*-commutative50.3%
associate-*r*51.5%
*-commutative51.5%
associate-*l*51.5%
associate-*l*56.6%
Simplified56.6%
Taylor expanded in z around inf 60.4%
associate-/l*60.2%
associate-*r/60.2%
*-commutative60.2%
Simplified60.2%
div-inv60.2%
clear-num60.3%
*-commutative60.3%
Applied egg-rr60.3%
if -1.59999999999999991e35 < z < 6.00000000000000012e91 or 1e137 < z < 1.04e182Initial program 94.3%
associate-+l-94.3%
*-commutative94.3%
associate-*r*95.0%
*-commutative95.0%
associate-+l-95.0%
*-commutative95.0%
associate-*r*94.3%
*-commutative94.3%
associate-*l*94.3%
associate-*l*93.7%
Simplified93.7%
Taylor expanded in x around inf 82.1%
associate-*r*82.1%
*-commutative82.1%
associate-*r*82.1%
Simplified82.1%
if 6.00000000000000012e91 < z < 1e137Initial program 78.7%
associate-+l-78.7%
*-commutative78.7%
associate-*r*78.7%
*-commutative78.7%
associate-+l-78.7%
*-commutative78.7%
associate-*r*78.7%
*-commutative78.7%
associate-*l*78.7%
associate-*l*85.8%
Simplified85.8%
Taylor expanded in z around inf 85.1%
Final simplification75.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ t c) (* -4.0 a))))
(if (<= z -5.8e+136)
t_1
(if (<= z -9.5e-105)
(/ (- b (* 4.0 (* a (* z t)))) (* z c))
(if (<= z 1.7e+90) (/ (+ b (* x (* 9.0 y))) (* z c)) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -5.8e+136) {
tmp = t_1;
} else if (z <= -9.5e-105) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
} else if (z <= 1.7e+90) {
tmp = (b + (x * (9.0 * y))) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (t / c) * ((-4.0d0) * a)
if (z <= (-5.8d+136)) then
tmp = t_1
else if (z <= (-9.5d-105)) then
tmp = (b - (4.0d0 * (a * (z * t)))) / (z * c)
else if (z <= 1.7d+90) then
tmp = (b + (x * (9.0d0 * y))) / (z * c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (t / c) * (-4.0 * a);
double tmp;
if (z <= -5.8e+136) {
tmp = t_1;
} else if (z <= -9.5e-105) {
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
} else if (z <= 1.7e+90) {
tmp = (b + (x * (9.0 * y))) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (t / c) * (-4.0 * a) tmp = 0 if z <= -5.8e+136: tmp = t_1 elif z <= -9.5e-105: tmp = (b - (4.0 * (a * (z * t)))) / (z * c) elif z <= 1.7e+90: tmp = (b + (x * (9.0 * y))) / (z * c) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(t / c) * Float64(-4.0 * a)) tmp = 0.0 if (z <= -5.8e+136) tmp = t_1; elseif (z <= -9.5e-105) tmp = Float64(Float64(b - Float64(4.0 * Float64(a * Float64(z * t)))) / Float64(z * c)); elseif (z <= 1.7e+90) tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(z * c)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (t / c) * (-4.0 * a);
tmp = 0.0;
if (z <= -5.8e+136)
tmp = t_1;
elseif (z <= -9.5e-105)
tmp = (b - (4.0 * (a * (z * t)))) / (z * c);
elseif (z <= 1.7e+90)
tmp = (b + (x * (9.0 * y))) / (z * c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.8e+136], t$95$1, If[LessEqual[z, -9.5e-105], N[(N[(b - N[(4.0 * N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.7e+90], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{if}\;z \leq -5.8 \cdot 10^{+136}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -9.5 \cdot 10^{-105}:\\
\;\;\;\;\frac{b - 4 \cdot \left(a \cdot \left(z \cdot t\right)\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 1.7 \cdot 10^{+90}:\\
\;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if z < -5.79999999999999949e136 or 1.70000000000000009e90 < z Initial program 51.0%
associate-+l-51.0%
*-commutative51.0%
associate-*r*49.8%
*-commutative49.8%
associate-+l-49.8%
*-commutative49.8%
associate-*r*51.0%
*-commutative51.0%
associate-*l*51.0%
associate-*l*57.6%
Simplified57.6%
Taylor expanded in z around inf 61.5%
associate-/l*56.2%
associate-*r/56.2%
*-commutative56.2%
Simplified56.2%
div-inv55.0%
clear-num55.1%
*-commutative55.1%
Applied egg-rr55.1%
if -5.79999999999999949e136 < z < -9.5000000000000002e-105Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*86.1%
*-commutative86.1%
associate-+l-86.1%
*-commutative86.1%
associate-*r*84.2%
*-commutative84.2%
associate-*l*84.1%
associate-*l*86.0%
Simplified86.0%
Taylor expanded in x around 0 74.1%
if -9.5000000000000002e-105 < z < 1.70000000000000009e90Initial program 96.2%
associate-+l-96.2%
*-commutative96.2%
associate-*r*96.2%
*-commutative96.2%
associate-+l-96.2%
*-commutative96.2%
associate-*r*96.2%
*-commutative96.2%
associate-*l*96.2%
associate-*l*94.6%
Simplified94.6%
Taylor expanded in x around inf 86.5%
associate-*r*86.5%
*-commutative86.5%
associate-*r*86.5%
Simplified86.5%
Final simplification74.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= b -1800000000000.0)
(/ b (* z c))
(if (or (<= b 2.3e+98) (and (not (<= b 2.4e+140)) (<= b 4.4e+160)))
(* (/ t c) (* -4.0 a))
(/ (/ b c) z))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1800000000000.0) {
tmp = b / (z * c);
} else if ((b <= 2.3e+98) || (!(b <= 2.4e+140) && (b <= 4.4e+160))) {
tmp = (t / c) * (-4.0 * a);
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (b <= (-1800000000000.0d0)) then
tmp = b / (z * c)
else if ((b <= 2.3d+98) .or. (.not. (b <= 2.4d+140)) .and. (b <= 4.4d+160)) then
tmp = (t / c) * ((-4.0d0) * a)
else
tmp = (b / c) / z
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1800000000000.0) {
tmp = b / (z * c);
} else if ((b <= 2.3e+98) || (!(b <= 2.4e+140) && (b <= 4.4e+160))) {
tmp = (t / c) * (-4.0 * a);
} else {
tmp = (b / c) / z;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -1800000000000.0: tmp = b / (z * c) elif (b <= 2.3e+98) or (not (b <= 2.4e+140) and (b <= 4.4e+160)): tmp = (t / c) * (-4.0 * a) else: tmp = (b / c) / z return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -1800000000000.0) tmp = Float64(b / Float64(z * c)); elseif ((b <= 2.3e+98) || (!(b <= 2.4e+140) && (b <= 4.4e+160))) tmp = Float64(Float64(t / c) * Float64(-4.0 * a)); else tmp = Float64(Float64(b / c) / z); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -1800000000000.0)
tmp = b / (z * c);
elseif ((b <= 2.3e+98) || (~((b <= 2.4e+140)) && (b <= 4.4e+160)))
tmp = (t / c) * (-4.0 * a);
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -1800000000000.0], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[b, 2.3e+98], And[N[Not[LessEqual[b, 2.4e+140]], $MachinePrecision], LessEqual[b, 4.4e+160]]], N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1800000000000:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 2.3 \cdot 10^{+98} \lor \neg \left(b \leq 2.4 \cdot 10^{+140}\right) \land b \leq 4.4 \cdot 10^{+160}:\\
\;\;\;\;\frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.8e12Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*82.9%
*-commutative82.9%
associate-+l-82.9%
*-commutative82.9%
associate-*r*84.2%
*-commutative84.2%
associate-*l*84.2%
associate-*l*85.6%
Simplified85.6%
Taylor expanded in b around inf 59.3%
*-commutative59.3%
Simplified59.3%
if -1.8e12 < b < 2.30000000000000013e98 or 2.4e140 < b < 4.39999999999999984e160Initial program 80.4%
associate-+l-80.4%
*-commutative80.4%
associate-*r*80.4%
*-commutative80.4%
associate-+l-80.4%
*-commutative80.4%
associate-*r*80.4%
*-commutative80.4%
associate-*l*80.4%
associate-*l*81.0%
Simplified81.0%
Taylor expanded in z around inf 49.0%
associate-/l*46.9%
associate-*r/46.9%
*-commutative46.9%
Simplified46.9%
div-inv45.8%
clear-num45.8%
*-commutative45.8%
Applied egg-rr45.8%
if 2.30000000000000013e98 < b < 2.4e140 or 4.39999999999999984e160 < b Initial program 74.2%
associate-+l-74.2%
*-commutative74.2%
associate-*r*76.8%
*-commutative76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*74.2%
*-commutative74.2%
associate-*l*74.1%
associate-*l*79.5%
Simplified79.5%
Applied egg-rr84.5%
Taylor expanded in b around inf 79.4%
Taylor expanded in z around 0 69.3%
associate-/r*79.4%
Simplified79.4%
Final simplification54.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -5e-93)
(* -4.0 (/ (* a t) c))
(if (<= a 3e-169)
(* (/ 1.0 z) (/ b c))
(if (<= a 3400.0) (* 9.0 (* (/ y c) (/ x z))) (/ (* -4.0 a) (/ c t))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -5e-93) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 3e-169) {
tmp = (1.0 / z) * (b / c);
} else if (a <= 3400.0) {
tmp = 9.0 * ((y / c) * (x / z));
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-5d-93)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (a <= 3d-169) then
tmp = (1.0d0 / z) * (b / c)
else if (a <= 3400.0d0) then
tmp = 9.0d0 * ((y / c) * (x / z))
else
tmp = ((-4.0d0) * a) / (c / t)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -5e-93) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 3e-169) {
tmp = (1.0 / z) * (b / c);
} else if (a <= 3400.0) {
tmp = 9.0 * ((y / c) * (x / z));
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -5e-93: tmp = -4.0 * ((a * t) / c) elif a <= 3e-169: tmp = (1.0 / z) * (b / c) elif a <= 3400.0: tmp = 9.0 * ((y / c) * (x / z)) else: tmp = (-4.0 * a) / (c / t) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -5e-93) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (a <= 3e-169) tmp = Float64(Float64(1.0 / z) * Float64(b / c)); elseif (a <= 3400.0) tmp = Float64(9.0 * Float64(Float64(y / c) * Float64(x / z))); else tmp = Float64(Float64(-4.0 * a) / Float64(c / t)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -5e-93)
tmp = -4.0 * ((a * t) / c);
elseif (a <= 3e-169)
tmp = (1.0 / z) * (b / c);
elseif (a <= 3400.0)
tmp = 9.0 * ((y / c) * (x / z));
else
tmp = (-4.0 * a) / (c / t);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -5e-93], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 3e-169], N[(N[(1.0 / z), $MachinePrecision] * N[(b / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 3400.0], N[(9.0 * N[(N[(y / c), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -5 \cdot 10^{-93}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;a \leq 3 \cdot 10^{-169}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{b}{c}\\
\mathbf{elif}\;a \leq 3400:\\
\;\;\;\;9 \cdot \left(\frac{y}{c} \cdot \frac{x}{z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot a}{\frac{c}{t}}\\
\end{array}
\end{array}
if a < -4.99999999999999994e-93Initial program 77.9%
associate-+l-77.9%
*-commutative77.9%
associate-*r*73.1%
*-commutative73.1%
associate-+l-73.1%
*-commutative73.1%
associate-*r*77.9%
*-commutative77.9%
associate-*l*77.9%
associate-*l*77.9%
Simplified77.9%
Taylor expanded in z around inf 49.9%
if -4.99999999999999994e-93 < a < 2.9999999999999999e-169Initial program 85.1%
associate-+l-85.1%
*-commutative85.1%
associate-*r*91.6%
*-commutative91.6%
associate-+l-91.6%
*-commutative91.6%
associate-*r*85.1%
*-commutative85.1%
associate-*l*85.0%
associate-*l*91.5%
Simplified91.5%
Applied egg-rr85.6%
Taylor expanded in b around inf 63.8%
if 2.9999999999999999e-169 < a < 3400Initial program 68.7%
associate-+l-68.7%
*-commutative68.7%
associate-*r*71.6%
*-commutative71.6%
associate-+l-71.6%
*-commutative71.6%
associate-*r*68.7%
*-commutative68.7%
associate-*l*68.7%
associate-*l*71.6%
Simplified71.6%
Taylor expanded in x around inf 42.7%
*-commutative42.7%
times-frac48.4%
Applied egg-rr48.4%
if 3400 < a Initial program 84.8%
associate-+l-84.8%
*-commutative84.8%
associate-*r*81.9%
*-commutative81.9%
associate-+l-81.9%
*-commutative81.9%
associate-*r*84.8%
*-commutative84.8%
associate-*l*84.8%
associate-*l*81.6%
Simplified81.6%
Taylor expanded in z around inf 55.9%
associate-/l*53.0%
associate-*r/53.0%
*-commutative53.0%
Simplified53.0%
Final simplification54.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= a -4.8e-93)
(* -4.0 (/ (* a t) c))
(if (<= a 2.35e-169)
(* (/ 1.0 z) (/ b c))
(if (<= a 11000.0) (* (/ (* 9.0 x) z) (/ y c)) (/ (* -4.0 a) (/ c t))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4.8e-93) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 2.35e-169) {
tmp = (1.0 / z) * (b / c);
} else if (a <= 11000.0) {
tmp = ((9.0 * x) / z) * (y / c);
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-4.8d-93)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (a <= 2.35d-169) then
tmp = (1.0d0 / z) * (b / c)
else if (a <= 11000.0d0) then
tmp = ((9.0d0 * x) / z) * (y / c)
else
tmp = ((-4.0d0) * a) / (c / t)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4.8e-93) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 2.35e-169) {
tmp = (1.0 / z) * (b / c);
} else if (a <= 11000.0) {
tmp = ((9.0 * x) / z) * (y / c);
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -4.8e-93: tmp = -4.0 * ((a * t) / c) elif a <= 2.35e-169: tmp = (1.0 / z) * (b / c) elif a <= 11000.0: tmp = ((9.0 * x) / z) * (y / c) else: tmp = (-4.0 * a) / (c / t) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -4.8e-93) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (a <= 2.35e-169) tmp = Float64(Float64(1.0 / z) * Float64(b / c)); elseif (a <= 11000.0) tmp = Float64(Float64(Float64(9.0 * x) / z) * Float64(y / c)); else tmp = Float64(Float64(-4.0 * a) / Float64(c / t)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -4.8e-93)
tmp = -4.0 * ((a * t) / c);
elseif (a <= 2.35e-169)
tmp = (1.0 / z) * (b / c);
elseif (a <= 11000.0)
tmp = ((9.0 * x) / z) * (y / c);
else
tmp = (-4.0 * a) / (c / t);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -4.8e-93], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.35e-169], N[(N[(1.0 / z), $MachinePrecision] * N[(b / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 11000.0], N[(N[(N[(9.0 * x), $MachinePrecision] / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.8 \cdot 10^{-93}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;a \leq 2.35 \cdot 10^{-169}:\\
\;\;\;\;\frac{1}{z} \cdot \frac{b}{c}\\
\mathbf{elif}\;a \leq 11000:\\
\;\;\;\;\frac{9 \cdot x}{z} \cdot \frac{y}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot a}{\frac{c}{t}}\\
\end{array}
\end{array}
if a < -4.8000000000000002e-93Initial program 77.9%
associate-+l-77.9%
*-commutative77.9%
associate-*r*73.1%
*-commutative73.1%
associate-+l-73.1%
*-commutative73.1%
associate-*r*77.9%
*-commutative77.9%
associate-*l*77.9%
associate-*l*77.9%
Simplified77.9%
Taylor expanded in z around inf 49.9%
if -4.8000000000000002e-93 < a < 2.34999999999999995e-169Initial program 85.1%
associate-+l-85.1%
*-commutative85.1%
associate-*r*91.6%
*-commutative91.6%
associate-+l-91.6%
*-commutative91.6%
associate-*r*85.1%
*-commutative85.1%
associate-*l*85.0%
associate-*l*91.5%
Simplified91.5%
Applied egg-rr85.6%
Taylor expanded in b around inf 63.8%
if 2.34999999999999995e-169 < a < 11000Initial program 68.7%
associate-+l-68.7%
*-commutative68.7%
associate-*r*71.6%
*-commutative71.6%
associate-+l-71.6%
*-commutative71.6%
associate-*r*68.7%
*-commutative68.7%
associate-*l*68.7%
associate-*l*71.6%
Simplified71.6%
Taylor expanded in x around inf 42.7%
associate-*r/42.8%
*-commutative42.8%
Applied egg-rr42.8%
associate-*r*42.6%
times-frac45.7%
Applied egg-rr45.7%
if 11000 < a Initial program 84.8%
associate-+l-84.8%
*-commutative84.8%
associate-*r*81.9%
*-commutative81.9%
associate-+l-81.9%
*-commutative81.9%
associate-*r*84.8%
*-commutative84.8%
associate-*l*84.8%
associate-*l*81.6%
Simplified81.6%
Taylor expanded in z around inf 55.9%
associate-/l*53.0%
associate-*r/53.0%
*-commutative53.0%
Simplified53.0%
Final simplification54.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= b -1500000000000.0) (/ b (* z c)) (if (<= b 1.4e+95) (* -4.0 (/ (* a t) c)) (/ (/ b c) z))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1500000000000.0) {
tmp = b / (z * c);
} else if (b <= 1.4e+95) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (b <= (-1500000000000.0d0)) then
tmp = b / (z * c)
else if (b <= 1.4d+95) then
tmp = (-4.0d0) * ((a * t) / c)
else
tmp = (b / c) / z
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1500000000000.0) {
tmp = b / (z * c);
} else if (b <= 1.4e+95) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = (b / c) / z;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -1500000000000.0: tmp = b / (z * c) elif b <= 1.4e+95: tmp = -4.0 * ((a * t) / c) else: tmp = (b / c) / z return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -1500000000000.0) tmp = Float64(b / Float64(z * c)); elseif (b <= 1.4e+95) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); else tmp = Float64(Float64(b / c) / z); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -1500000000000.0)
tmp = b / (z * c);
elseif (b <= 1.4e+95)
tmp = -4.0 * ((a * t) / c);
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -1500000000000.0], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.4e+95], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1500000000000:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 1.4 \cdot 10^{+95}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.5e12Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*82.9%
*-commutative82.9%
associate-+l-82.9%
*-commutative82.9%
associate-*r*84.2%
*-commutative84.2%
associate-*l*84.2%
associate-*l*85.6%
Simplified85.6%
Taylor expanded in b around inf 59.3%
*-commutative59.3%
Simplified59.3%
if -1.5e12 < b < 1.3999999999999999e95Initial program 81.2%
associate-+l-81.2%
*-commutative81.2%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
*-commutative80.5%
associate-*r*81.2%
*-commutative81.2%
associate-*l*81.2%
associate-*l*81.2%
Simplified81.2%
Taylor expanded in z around inf 48.5%
if 1.3999999999999999e95 < b Initial program 73.0%
associate-+l-73.0%
*-commutative73.0%
associate-*r*77.1%
*-commutative77.1%
associate-+l-77.1%
*-commutative77.1%
associate-*r*73.0%
*-commutative73.0%
associate-*l*72.9%
associate-*l*79.2%
Simplified79.2%
Applied egg-rr81.4%
Taylor expanded in b around inf 66.9%
Taylor expanded in z around 0 60.7%
associate-/r*66.9%
Simplified66.9%
Final simplification54.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 80.5%
associate-+l-80.5%
*-commutative80.5%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
*-commutative80.5%
associate-*r*80.5%
*-commutative80.5%
associate-*l*80.5%
associate-*l*82.0%
Simplified82.0%
Taylor expanded in b around inf 37.6%
*-commutative37.6%
Simplified37.6%
Final simplification37.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ (/ b c) z))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return (b / c) / z;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = (b / c) / z
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return (b / c) / z;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return (b / c) / z
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(Float64(b / c) / z) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = (b / c) / z;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{\frac{b}{c}}{z}
\end{array}
Initial program 80.5%
associate-+l-80.5%
*-commutative80.5%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
*-commutative80.5%
associate-*r*80.5%
*-commutative80.5%
associate-*l*80.5%
associate-*l*82.0%
Simplified82.0%
Applied egg-rr82.6%
Taylor expanded in b around inf 38.3%
Taylor expanded in z around 0 37.6%
associate-/r*38.3%
Simplified38.3%
Final simplification38.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 2023334
(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)))