
(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 22 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
(let* ((t_1 (* c (* z t)))
(t_2
(/
(* y (- (* a (/ (fma -4.0 t (/ (/ b z) a)) y)) (/ (* x -9.0) z)))
c)))
(if (<= z -6.4e+52)
t_2
(if (<= z 2.5e-25)
(/ (+ (* -4.0 (/ (* a (* z t)) c)) (+ (* 9.0 (/ (* y x) c)) (/ b c))) z)
(if (<= z 1.9e+107)
(* t (+ (* -4.0 (/ a c)) (+ (* 9.0 (/ (* y x) t_1)) (/ b t_1))))
(if (<= z 1.7e+237) t_2 (/ (* a (+ (* -4.0 t) (/ b (* z a)))) 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) {
double t_1 = c * (z * t);
double t_2 = (y * ((a * (fma(-4.0, t, ((b / z) / a)) / y)) - ((x * -9.0) / z))) / c;
double tmp;
if (z <= -6.4e+52) {
tmp = t_2;
} else if (z <= 2.5e-25) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((y * x) / c)) + (b / c))) / z;
} else if (z <= 1.9e+107) {
tmp = t * ((-4.0 * (a / c)) + ((9.0 * ((y * x) / t_1)) + (b / t_1)));
} else if (z <= 1.7e+237) {
tmp = t_2;
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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(c * Float64(z * t)) t_2 = Float64(Float64(y * Float64(Float64(a * Float64(fma(-4.0, t, Float64(Float64(b / z) / a)) / y)) - Float64(Float64(x * -9.0) / z))) / c) tmp = 0.0 if (z <= -6.4e+52) tmp = t_2; elseif (z <= 2.5e-25) tmp = Float64(Float64(Float64(-4.0 * Float64(Float64(a * Float64(z * t)) / c)) + Float64(Float64(9.0 * Float64(Float64(y * x) / c)) + Float64(b / c))) / z); elseif (z <= 1.9e+107) tmp = Float64(t * Float64(Float64(-4.0 * Float64(a / c)) + Float64(Float64(9.0 * Float64(Float64(y * x) / t_1)) + Float64(b / t_1)))); elseif (z <= 1.7e+237) tmp = t_2; else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(b / Float64(z * a)))) / c); 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_] := Block[{t$95$1 = N[(c * N[(z * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * N[(N[(a * N[(N[(-4.0 * t + N[(N[(b / z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] - N[(N[(x * -9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -6.4e+52], t$95$2, If[LessEqual[z, 2.5e-25], N[(N[(N[(-4.0 * N[(N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 1.9e+107], N[(t * N[(N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] + N[(b / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.7e+237], t$95$2, N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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}
t_1 := c \cdot \left(z \cdot t\right)\\
t_2 := \frac{y \cdot \left(a \cdot \frac{\mathsf{fma}\left(-4, t, \frac{\frac{b}{z}}{a}\right)}{y} - \frac{x \cdot -9}{z}\right)}{c}\\
\mathbf{if}\;z \leq -6.4 \cdot 10^{+52}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{-25}:\\
\;\;\;\;\frac{-4 \cdot \frac{a \cdot \left(z \cdot t\right)}{c} + \left(9 \cdot \frac{y \cdot x}{c} + \frac{b}{c}\right)}{z}\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{+107}:\\
\;\;\;\;t \cdot \left(-4 \cdot \frac{a}{c} + \left(9 \cdot \frac{y \cdot x}{t\_1} + \frac{b}{t\_1}\right)\right)\\
\mathbf{elif}\;z \leq 1.7 \cdot 10^{+237}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \frac{b}{z \cdot a}\right)}{c}\\
\end{array}
\end{array}
if z < -6.4e52 or 1.8999999999999999e107 < z < 1.7000000000000002e237Initial program 52.0%
+-commutative52.0%
associate-+r-52.0%
*-commutative52.0%
associate-*r*54.9%
*-commutative54.9%
associate-+r-54.9%
+-commutative54.9%
associate-*l*54.9%
associate-*l*59.4%
*-commutative59.4%
Simplified59.4%
Taylor expanded in a around inf 65.4%
Taylor expanded in c around 0 72.6%
Taylor expanded in y around -inf 78.1%
mul-1-neg78.1%
distribute-rgt-neg-in78.1%
mul-1-neg78.1%
unsub-neg78.1%
associate-*r/78.2%
*-commutative78.2%
associate-/l*69.8%
fma-define69.8%
*-commutative69.8%
associate-/r*72.8%
Simplified72.8%
if -6.4e52 < z < 2.49999999999999981e-25Initial program 94.8%
+-commutative94.8%
associate-+r-94.8%
*-commutative94.8%
associate-*r*94.8%
*-commutative94.8%
associate-+r-94.8%
+-commutative94.8%
associate-*l*94.8%
associate-*l*88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in z around 0 95.7%
if 2.49999999999999981e-25 < z < 1.8999999999999999e107Initial program 83.0%
+-commutative83.0%
associate-+r-83.0%
*-commutative83.0%
associate-*r*78.8%
*-commutative78.8%
associate-+r-78.8%
+-commutative78.8%
associate-*l*78.8%
associate-*l*82.9%
*-commutative82.9%
Simplified82.9%
Taylor expanded in t around inf 83.3%
if 1.7000000000000002e237 < z Initial program 37.7%
+-commutative37.7%
associate-+r-37.7%
*-commutative37.7%
associate-*r*29.4%
*-commutative29.4%
associate-+r-29.4%
+-commutative29.4%
associate-*l*29.4%
associate-*l*45.5%
*-commutative45.5%
Simplified45.5%
Taylor expanded in a around inf 76.5%
Taylor expanded in c around 0 88.0%
Taylor expanded in x around 0 92.0%
Final simplification85.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 (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))))
(if (<= t_1 -1e-50)
(/ (+ b (fma x (* y 9.0) (* t (* a (* z -4.0))))) (* z c))
(if (<= t_1 0.0)
(/ (+ (* -4.0 (/ (* a (* z t)) c)) (+ (* 9.0 (/ (* y x) c)) (/ b c))) z)
(if (<= t_1 1e+305)
t_1
(/
(* a (+ (* -4.0 t) (+ (/ b (* z a)) (* 9.0 (/ (* y x) (* z a))))))
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) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -1e-50) {
tmp = (b + fma(x, (y * 9.0), (t * (a * (z * -4.0))))) / (z * c);
} else if (t_1 <= 0.0) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((y * x) / c)) + (b / c))) / z;
} else if (t_1 <= 1e+305) {
tmp = t_1;
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-50) tmp = Float64(Float64(b + fma(x, Float64(y * 9.0), Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(z * c)); elseif (t_1 <= 0.0) tmp = Float64(Float64(Float64(-4.0 * Float64(Float64(a * Float64(z * t)) / c)) + Float64(Float64(9.0 * Float64(Float64(y * x) / c)) + Float64(b / c))) / z); elseif (t_1 <= 1e+305) tmp = t_1; else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(Float64(b / Float64(z * a)) + Float64(9.0 * Float64(Float64(y * x) / Float64(z * a)))))) / c); 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-50], N[(N[(b + N[(x * N[(y * 9.0), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(-4.0 * N[(N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e+305], t$95$1, N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-50}:\\
\;\;\;\;\frac{b + \mathsf{fma}\left(x, y \cdot 9, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{-4 \cdot \frac{a \cdot \left(z \cdot t\right)}{c} + \left(9 \cdot \frac{y \cdot x}{c} + \frac{b}{c}\right)}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{+305}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \left(\frac{b}{z \cdot a} + 9 \cdot \frac{y \cdot x}{z \cdot a}\right)\right)}{c}\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -1.00000000000000001e-50Initial program 86.6%
Simplified83.3%
if -1.00000000000000001e-50 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -0.0Initial program 59.0%
+-commutative59.0%
associate-+r-59.0%
*-commutative59.0%
associate-*r*53.0%
*-commutative53.0%
associate-+r-53.0%
+-commutative53.0%
associate-*l*52.9%
associate-*l*58.9%
*-commutative58.9%
Simplified58.9%
Taylor expanded in z around 0 97.2%
if -0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < 9.9999999999999994e304Initial program 99.2%
if 9.9999999999999994e304 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) Initial program 49.9%
+-commutative49.9%
associate-+r-49.9%
*-commutative49.9%
associate-*r*58.0%
*-commutative58.0%
associate-+r-58.0%
+-commutative58.0%
associate-*l*58.0%
associate-*l*59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in a around inf 70.5%
Taylor expanded in c around 0 77.8%
Final simplification86.1%
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 (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))))
(if (<= t_1 -1e-235)
t_1
(if (<= t_1 0.0)
(/ (+ (* -4.0 (/ (* a (* z t)) c)) (/ b c)) z)
(if (<= t_1 1e+305)
t_1
(/
(* a (+ (* -4.0 t) (+ (/ b (* z a)) (* 9.0 (/ (* y x) (* z a))))))
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) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -1e-235) {
tmp = t_1;
} else if (t_1 <= 0.0) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + (b / c)) / z;
} else if (t_1 <= 1e+305) {
tmp = t_1;
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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 = (b + ((y * (x * 9.0d0)) - (a * (t * (z * 4.0d0))))) / (z * c)
if (t_1 <= (-1d-235)) then
tmp = t_1
else if (t_1 <= 0.0d0) then
tmp = (((-4.0d0) * ((a * (z * t)) / c)) + (b / c)) / z
else if (t_1 <= 1d+305) then
tmp = t_1
else
tmp = (a * (((-4.0d0) * t) + ((b / (z * a)) + (9.0d0 * ((y * x) / (z * a)))))) / c
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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -1e-235) {
tmp = t_1;
} else if (t_1 <= 0.0) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + (b / c)) / z;
} else if (t_1 <= 1e+305) {
tmp = t_1;
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c) tmp = 0 if t_1 <= -1e-235: tmp = t_1 elif t_1 <= 0.0: tmp = ((-4.0 * ((a * (z * t)) / c)) + (b / c)) / z elif t_1 <= 1e+305: tmp = t_1 else: tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c 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(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-235) tmp = t_1; elseif (t_1 <= 0.0) tmp = Float64(Float64(Float64(-4.0 * Float64(Float64(a * Float64(z * t)) / c)) + Float64(b / c)) / z); elseif (t_1 <= 1e+305) tmp = t_1; else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(Float64(b / Float64(z * a)) + Float64(9.0 * Float64(Float64(y * x) / Float64(z * a)))))) / c); 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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
tmp = 0.0;
if (t_1 <= -1e-235)
tmp = t_1;
elseif (t_1 <= 0.0)
tmp = ((-4.0 * ((a * (z * t)) / c)) + (b / c)) / z;
elseif (t_1 <= 1e+305)
tmp = t_1;
else
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * 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.
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[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-235], t$95$1, If[LessEqual[t$95$1, 0.0], N[(N[(N[(-4.0 * N[(N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e+305], t$95$1, N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-235}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{-4 \cdot \frac{a \cdot \left(z \cdot t\right)}{c} + \frac{b}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{+305}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \left(\frac{b}{z \cdot a} + 9 \cdot \frac{y \cdot x}{z \cdot a}\right)\right)}{c}\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -9.9999999999999996e-236 or -0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < 9.9999999999999994e304Initial program 91.1%
if -9.9999999999999996e-236 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -0.0Initial program 43.9%
+-commutative43.9%
associate-+r-43.9%
*-commutative43.9%
associate-*r*39.3%
*-commutative39.3%
associate-+r-39.3%
+-commutative39.3%
associate-*l*39.3%
associate-*l*43.9%
*-commutative43.9%
Simplified43.9%
Taylor expanded in z around 0 96.2%
fma-define96.2%
associate-/l*96.2%
associate-/l*92.5%
fma-define92.5%
associate-/l*92.4%
Simplified92.4%
Taylor expanded in x around 0 89.4%
if 9.9999999999999994e304 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) Initial program 49.9%
+-commutative49.9%
associate-+r-49.9%
*-commutative49.9%
associate-*r*58.0%
*-commutative58.0%
associate-+r-58.0%
+-commutative58.0%
associate-*l*58.0%
associate-*l*59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in a around inf 70.5%
Taylor expanded in c around 0 77.8%
Final simplification86.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 (* 9.0 (* (/ y z) (/ x c)))) (t_2 (* t (* a (/ -4.0 c)))))
(if (<= a -4e-119)
t_2
(if (<= a -4e-278)
t_1
(if (<= a 2.1e-185)
(* (/ b z) (/ 1.0 c))
(if (<= a 5.1e+159)
t_1
(if (<= a 1.8e+261)
t_2
(if (<= a 2.8e+287)
(* 9.0 (* x (/ y (* z c))))
(* (/ a c) (* -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 t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = t * (a * (-4.0 / c));
double tmp;
if (a <= -4e-119) {
tmp = t_2;
} else if (a <= -4e-278) {
tmp = t_1;
} else if (a <= 2.1e-185) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 5.1e+159) {
tmp = t_1;
} else if (a <= 1.8e+261) {
tmp = t_2;
} else if (a <= 2.8e+287) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = (a / c) * (-4.0 * 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * ((y / z) * (x / c))
t_2 = t * (a * ((-4.0d0) / c))
if (a <= (-4d-119)) then
tmp = t_2
else if (a <= (-4d-278)) then
tmp = t_1
else if (a <= 2.1d-185) then
tmp = (b / z) * (1.0d0 / c)
else if (a <= 5.1d+159) then
tmp = t_1
else if (a <= 1.8d+261) then
tmp = t_2
else if (a <= 2.8d+287) then
tmp = 9.0d0 * (x * (y / (z * c)))
else
tmp = (a / c) * ((-4.0d0) * 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 t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = t * (a * (-4.0 / c));
double tmp;
if (a <= -4e-119) {
tmp = t_2;
} else if (a <= -4e-278) {
tmp = t_1;
} else if (a <= 2.1e-185) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 5.1e+159) {
tmp = t_1;
} else if (a <= 1.8e+261) {
tmp = t_2;
} else if (a <= 2.8e+287) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((y / z) * (x / c)) t_2 = t * (a * (-4.0 / c)) tmp = 0 if a <= -4e-119: tmp = t_2 elif a <= -4e-278: tmp = t_1 elif a <= 2.1e-185: tmp = (b / z) * (1.0 / c) elif a <= 5.1e+159: tmp = t_1 elif a <= 1.8e+261: tmp = t_2 elif a <= 2.8e+287: tmp = 9.0 * (x * (y / (z * c))) else: tmp = (a / c) * (-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) t_1 = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))) t_2 = Float64(t * Float64(a * Float64(-4.0 / c))) tmp = 0.0 if (a <= -4e-119) tmp = t_2; elseif (a <= -4e-278) tmp = t_1; elseif (a <= 2.1e-185) tmp = Float64(Float64(b / z) * Float64(1.0 / c)); elseif (a <= 5.1e+159) tmp = t_1; elseif (a <= 1.8e+261) tmp = t_2; elseif (a <= 2.8e+287) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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)
t_1 = 9.0 * ((y / z) * (x / c));
t_2 = t * (a * (-4.0 / c));
tmp = 0.0;
if (a <= -4e-119)
tmp = t_2;
elseif (a <= -4e-278)
tmp = t_1;
elseif (a <= 2.1e-185)
tmp = (b / z) * (1.0 / c);
elseif (a <= 5.1e+159)
tmp = t_1;
elseif (a <= 1.8e+261)
tmp = t_2;
elseif (a <= 2.8e+287)
tmp = 9.0 * (x * (y / (z * c)));
else
tmp = (a / c) * (-4.0 * 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_] := Block[{t$95$1 = N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(a * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -4e-119], t$95$2, If[LessEqual[a, -4e-278], t$95$1, If[LessEqual[a, 2.1e-185], N[(N[(b / z), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.1e+159], t$95$1, If[LessEqual[a, 1.8e+261], t$95$2, If[LessEqual[a, 2.8e+287], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}
t_1 := 9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
t_2 := t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\mathbf{if}\;a \leq -4 \cdot 10^{-119}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq -4 \cdot 10^{-278}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.1 \cdot 10^{-185}:\\
\;\;\;\;\frac{b}{z} \cdot \frac{1}{c}\\
\mathbf{elif}\;a \leq 5.1 \cdot 10^{+159}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+261}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+287}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if a < -4.00000000000000005e-119 or 5.09999999999999967e159 < a < 1.80000000000000009e261Initial program 67.3%
+-commutative67.3%
associate-+r-67.3%
*-commutative67.3%
associate-*r*63.2%
*-commutative63.2%
associate-+r-63.2%
+-commutative63.2%
associate-*l*63.2%
associate-*l*66.5%
*-commutative66.5%
Simplified66.5%
Taylor expanded in t around inf 71.2%
Taylor expanded in x around 0 68.7%
Taylor expanded in a around inf 58.9%
associate-*r/58.9%
*-commutative58.9%
associate-/l*58.9%
Simplified58.9%
if -4.00000000000000005e-119 < a < -3.99999999999999975e-278 or 2.1e-185 < a < 5.09999999999999967e159Initial program 81.2%
+-commutative81.2%
associate-+r-81.2%
*-commutative81.2%
associate-*r*84.7%
*-commutative84.7%
associate-+r-84.7%
+-commutative84.7%
associate-*l*84.7%
associate-*l*83.6%
*-commutative83.6%
Simplified83.6%
Taylor expanded in x around inf 49.3%
times-frac51.5%
Applied egg-rr51.5%
if -3.99999999999999975e-278 < a < 2.1e-185Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*82.0%
*-commutative82.0%
associate-+r-82.0%
+-commutative82.0%
associate-*l*82.0%
associate-*l*82.0%
*-commutative82.0%
Simplified82.0%
Taylor expanded in b around inf 51.2%
*-commutative51.2%
Simplified51.2%
*-un-lft-identity51.2%
associate-/r*59.5%
Applied egg-rr59.5%
div-inv59.6%
Applied egg-rr59.6%
if 1.80000000000000009e261 < a < 2.80000000000000001e287Initial program 82.7%
+-commutative82.7%
associate-+r-82.7%
*-commutative82.7%
associate-*r*82.7%
*-commutative82.7%
associate-+r-82.7%
+-commutative82.7%
associate-*l*82.9%
associate-*l*34.9%
*-commutative34.9%
Simplified34.9%
Taylor expanded in z around 0 83.5%
fma-define83.5%
associate-/l*99.7%
associate-/l*83.9%
fma-define83.9%
associate-/l*83.8%
Simplified83.8%
Taylor expanded in x around inf 51.8%
associate-/l*51.6%
*-commutative51.6%
Simplified51.6%
if 2.80000000000000001e287 < a Initial program 58.8%
+-commutative58.8%
associate-+r-58.8%
*-commutative58.8%
associate-*r*45.1%
*-commutative45.1%
associate-+r-45.1%
+-commutative45.1%
associate-*l*45.1%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in z around 0 58.8%
fma-define58.8%
associate-/l*58.6%
fma-define58.6%
associate-/l*58.6%
Simplified58.6%
Taylor expanded in a around inf 99.3%
*-commutative99.3%
associate-/l*99.8%
associate-*l*99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification57.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 (* 9.0 (/ (* y x) (* z c)))) (t_2 (* t (* a (/ -4.0 c)))))
(if (<= a -3.6e-119)
t_2
(if (<= a -8e-277)
(* 9.0 (* (/ y z) (/ x c)))
(if (<= a 2.1e-185)
(* (/ b z) (/ 1.0 c))
(if (<= a 1.8e+107)
t_1
(if (<= a 1.8e+261)
t_2
(if (<= a 2.8e+287) t_1 (* (/ a c) (* -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 t_1 = 9.0 * ((y * x) / (z * c));
double t_2 = t * (a * (-4.0 / c));
double tmp;
if (a <= -3.6e-119) {
tmp = t_2;
} else if (a <= -8e-277) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (a <= 2.1e-185) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 1.8e+107) {
tmp = t_1;
} else if (a <= 1.8e+261) {
tmp = t_2;
} else if (a <= 2.8e+287) {
tmp = t_1;
} else {
tmp = (a / c) * (-4.0 * 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * ((y * x) / (z * c))
t_2 = t * (a * ((-4.0d0) / c))
if (a <= (-3.6d-119)) then
tmp = t_2
else if (a <= (-8d-277)) then
tmp = 9.0d0 * ((y / z) * (x / c))
else if (a <= 2.1d-185) then
tmp = (b / z) * (1.0d0 / c)
else if (a <= 1.8d+107) then
tmp = t_1
else if (a <= 1.8d+261) then
tmp = t_2
else if (a <= 2.8d+287) then
tmp = t_1
else
tmp = (a / c) * ((-4.0d0) * 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 t_1 = 9.0 * ((y * x) / (z * c));
double t_2 = t * (a * (-4.0 / c));
double tmp;
if (a <= -3.6e-119) {
tmp = t_2;
} else if (a <= -8e-277) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (a <= 2.1e-185) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 1.8e+107) {
tmp = t_1;
} else if (a <= 1.8e+261) {
tmp = t_2;
} else if (a <= 2.8e+287) {
tmp = t_1;
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((y * x) / (z * c)) t_2 = t * (a * (-4.0 / c)) tmp = 0 if a <= -3.6e-119: tmp = t_2 elif a <= -8e-277: tmp = 9.0 * ((y / z) * (x / c)) elif a <= 2.1e-185: tmp = (b / z) * (1.0 / c) elif a <= 1.8e+107: tmp = t_1 elif a <= 1.8e+261: tmp = t_2 elif a <= 2.8e+287: tmp = t_1 else: tmp = (a / c) * (-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) t_1 = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))) t_2 = Float64(t * Float64(a * Float64(-4.0 / c))) tmp = 0.0 if (a <= -3.6e-119) tmp = t_2; elseif (a <= -8e-277) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); elseif (a <= 2.1e-185) tmp = Float64(Float64(b / z) * Float64(1.0 / c)); elseif (a <= 1.8e+107) tmp = t_1; elseif (a <= 1.8e+261) tmp = t_2; elseif (a <= 2.8e+287) tmp = t_1; else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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)
t_1 = 9.0 * ((y * x) / (z * c));
t_2 = t * (a * (-4.0 / c));
tmp = 0.0;
if (a <= -3.6e-119)
tmp = t_2;
elseif (a <= -8e-277)
tmp = 9.0 * ((y / z) * (x / c));
elseif (a <= 2.1e-185)
tmp = (b / z) * (1.0 / c);
elseif (a <= 1.8e+107)
tmp = t_1;
elseif (a <= 1.8e+261)
tmp = t_2;
elseif (a <= 2.8e+287)
tmp = t_1;
else
tmp = (a / c) * (-4.0 * 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_] := Block[{t$95$1 = N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(a * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -3.6e-119], t$95$2, If[LessEqual[a, -8e-277], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.1e-185], N[(N[(b / z), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.8e+107], t$95$1, If[LessEqual[a, 1.8e+261], t$95$2, If[LessEqual[a, 2.8e+287], t$95$1, N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}
t_1 := 9 \cdot \frac{y \cdot x}{z \cdot c}\\
t_2 := t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\mathbf{if}\;a \leq -3.6 \cdot 10^{-119}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq -8 \cdot 10^{-277}:\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{elif}\;a \leq 2.1 \cdot 10^{-185}:\\
\;\;\;\;\frac{b}{z} \cdot \frac{1}{c}\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+107}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+261}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+287}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if a < -3.6e-119 or 1.7999999999999999e107 < a < 1.80000000000000009e261Initial program 67.4%
+-commutative67.4%
associate-+r-67.4%
*-commutative67.4%
associate-*r*63.4%
*-commutative63.4%
associate-+r-63.4%
+-commutative63.4%
associate-*l*63.4%
associate-*l*66.6%
*-commutative66.6%
Simplified66.6%
Taylor expanded in t around inf 71.0%
Taylor expanded in x around 0 68.6%
Taylor expanded in a around inf 60.0%
associate-*r/60.0%
*-commutative60.0%
associate-/l*60.0%
Simplified60.0%
if -3.6e-119 < a < -7.99999999999999975e-277Initial program 83.3%
+-commutative83.3%
associate-+r-83.3%
*-commutative83.3%
associate-*r*88.9%
*-commutative88.9%
associate-+r-88.9%
+-commutative88.9%
associate-*l*89.0%
associate-*l*89.0%
*-commutative89.0%
Simplified89.0%
Taylor expanded in x around inf 54.3%
times-frac54.2%
Applied egg-rr54.2%
if -7.99999999999999975e-277 < a < 2.1e-185Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*82.0%
*-commutative82.0%
associate-+r-82.0%
+-commutative82.0%
associate-*l*82.0%
associate-*l*82.0%
*-commutative82.0%
Simplified82.0%
Taylor expanded in b around inf 51.2%
*-commutative51.2%
Simplified51.2%
*-un-lft-identity51.2%
associate-/r*59.5%
Applied egg-rr59.5%
div-inv59.6%
Applied egg-rr59.6%
if 2.1e-185 < a < 1.7999999999999999e107 or 1.80000000000000009e261 < a < 2.80000000000000001e287Initial program 81.6%
+-commutative81.6%
associate-+r-81.6%
*-commutative81.6%
associate-*r*83.6%
*-commutative83.6%
associate-+r-83.6%
+-commutative83.6%
associate-*l*83.5%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in x around inf 47.7%
if 2.80000000000000001e287 < a Initial program 58.8%
+-commutative58.8%
associate-+r-58.8%
*-commutative58.8%
associate-*r*45.1%
*-commutative45.1%
associate-+r-45.1%
+-commutative45.1%
associate-*l*45.1%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in z around 0 58.8%
fma-define58.8%
associate-/l*58.6%
fma-define58.6%
associate-/l*58.6%
Simplified58.6%
Taylor expanded in a around inf 99.3%
*-commutative99.3%
associate-/l*99.8%
associate-*l*99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification58.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
(let* ((t_1 (* t (* a (/ -4.0 c)))))
(if (<= a -4.2e-119)
t_1
(if (<= a -9.5e-280)
(* 9.0 (* (/ y z) (/ x c)))
(if (<= a 1.3e-182)
(* (/ b z) (/ 1.0 c))
(if (<= a 5.5e+107)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 1.8e+261)
t_1
(if (<= a 2.8e+287)
(* (* x 9.0) (/ y (* z c)))
(* (/ a c) (* -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 t_1 = t * (a * (-4.0 / c));
double tmp;
if (a <= -4.2e-119) {
tmp = t_1;
} else if (a <= -9.5e-280) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (a <= 1.3e-182) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 5.5e+107) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.8e+261) {
tmp = t_1;
} else if (a <= 2.8e+287) {
tmp = (x * 9.0) * (y / (z * c));
} else {
tmp = (a / c) * (-4.0 * 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) :: t_1
real(8) :: tmp
t_1 = t * (a * ((-4.0d0) / c))
if (a <= (-4.2d-119)) then
tmp = t_1
else if (a <= (-9.5d-280)) then
tmp = 9.0d0 * ((y / z) * (x / c))
else if (a <= 1.3d-182) then
tmp = (b / z) * (1.0d0 / c)
else if (a <= 5.5d+107) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 1.8d+261) then
tmp = t_1
else if (a <= 2.8d+287) then
tmp = (x * 9.0d0) * (y / (z * c))
else
tmp = (a / c) * ((-4.0d0) * 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 t_1 = t * (a * (-4.0 / c));
double tmp;
if (a <= -4.2e-119) {
tmp = t_1;
} else if (a <= -9.5e-280) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (a <= 1.3e-182) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 5.5e+107) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.8e+261) {
tmp = t_1;
} else if (a <= 2.8e+287) {
tmp = (x * 9.0) * (y / (z * c));
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): t_1 = t * (a * (-4.0 / c)) tmp = 0 if a <= -4.2e-119: tmp = t_1 elif a <= -9.5e-280: tmp = 9.0 * ((y / z) * (x / c)) elif a <= 1.3e-182: tmp = (b / z) * (1.0 / c) elif a <= 5.5e+107: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 1.8e+261: tmp = t_1 elif a <= 2.8e+287: tmp = (x * 9.0) * (y / (z * c)) else: tmp = (a / c) * (-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) t_1 = Float64(t * Float64(a * Float64(-4.0 / c))) tmp = 0.0 if (a <= -4.2e-119) tmp = t_1; elseif (a <= -9.5e-280) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); elseif (a <= 1.3e-182) tmp = Float64(Float64(b / z) * Float64(1.0 / c)); elseif (a <= 5.5e+107) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 1.8e+261) tmp = t_1; elseif (a <= 2.8e+287) tmp = Float64(Float64(x * 9.0) * Float64(y / Float64(z * c))); else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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)
t_1 = t * (a * (-4.0 / c));
tmp = 0.0;
if (a <= -4.2e-119)
tmp = t_1;
elseif (a <= -9.5e-280)
tmp = 9.0 * ((y / z) * (x / c));
elseif (a <= 1.3e-182)
tmp = (b / z) * (1.0 / c);
elseif (a <= 5.5e+107)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 1.8e+261)
tmp = t_1;
elseif (a <= 2.8e+287)
tmp = (x * 9.0) * (y / (z * c));
else
tmp = (a / c) * (-4.0 * 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_] := Block[{t$95$1 = N[(t * N[(a * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -4.2e-119], t$95$1, If[LessEqual[a, -9.5e-280], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.3e-182], N[(N[(b / z), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.5e+107], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.8e+261], t$95$1, If[LessEqual[a, 2.8e+287], N[(N[(x * 9.0), $MachinePrecision] * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}
t_1 := t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\mathbf{if}\;a \leq -4.2 \cdot 10^{-119}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq -9.5 \cdot 10^{-280}:\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{elif}\;a \leq 1.3 \cdot 10^{-182}:\\
\;\;\;\;\frac{b}{z} \cdot \frac{1}{c}\\
\mathbf{elif}\;a \leq 5.5 \cdot 10^{+107}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+261}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+287}:\\
\;\;\;\;\left(x \cdot 9\right) \cdot \frac{y}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if a < -4.2e-119 or 5.5000000000000003e107 < a < 1.80000000000000009e261Initial program 67.4%
+-commutative67.4%
associate-+r-67.4%
*-commutative67.4%
associate-*r*63.4%
*-commutative63.4%
associate-+r-63.4%
+-commutative63.4%
associate-*l*63.4%
associate-*l*66.6%
*-commutative66.6%
Simplified66.6%
Taylor expanded in t around inf 71.0%
Taylor expanded in x around 0 68.6%
Taylor expanded in a around inf 60.0%
associate-*r/60.0%
*-commutative60.0%
associate-/l*60.0%
Simplified60.0%
if -4.2e-119 < a < -9.50000000000000082e-280Initial program 83.3%
+-commutative83.3%
associate-+r-83.3%
*-commutative83.3%
associate-*r*88.9%
*-commutative88.9%
associate-+r-88.9%
+-commutative88.9%
associate-*l*89.0%
associate-*l*89.0%
*-commutative89.0%
Simplified89.0%
Taylor expanded in x around inf 54.3%
times-frac54.2%
Applied egg-rr54.2%
if -9.50000000000000082e-280 < a < 1.30000000000000003e-182Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*82.0%
*-commutative82.0%
associate-+r-82.0%
+-commutative82.0%
associate-*l*82.0%
associate-*l*82.0%
*-commutative82.0%
Simplified82.0%
Taylor expanded in b around inf 51.2%
*-commutative51.2%
Simplified51.2%
*-un-lft-identity51.2%
associate-/r*59.5%
Applied egg-rr59.5%
div-inv59.6%
Applied egg-rr59.6%
if 1.30000000000000003e-182 < a < 5.5000000000000003e107Initial program 81.4%
+-commutative81.4%
associate-+r-81.4%
*-commutative81.4%
associate-*r*83.7%
*-commutative83.7%
associate-+r-83.7%
+-commutative83.7%
associate-*l*83.6%
associate-*l*81.5%
*-commutative81.5%
Simplified81.5%
Taylor expanded in x around inf 47.2%
if 1.80000000000000009e261 < a < 2.80000000000000001e287Initial program 82.7%
+-commutative82.7%
associate-+r-82.7%
*-commutative82.7%
associate-*r*82.7%
*-commutative82.7%
associate-+r-82.7%
+-commutative82.7%
associate-*l*82.9%
associate-*l*34.9%
*-commutative34.9%
Simplified34.9%
Taylor expanded in z around 0 83.5%
fma-define83.5%
associate-/l*99.7%
fma-define99.7%
associate-/l*99.7%
Simplified99.7%
Taylor expanded in x around inf 51.8%
associate-/l*51.6%
associate-*r*51.6%
*-commutative51.6%
Simplified51.6%
if 2.80000000000000001e287 < a Initial program 58.8%
+-commutative58.8%
associate-+r-58.8%
*-commutative58.8%
associate-*r*45.1%
*-commutative45.1%
associate-+r-45.1%
+-commutative45.1%
associate-*l*45.1%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in z around 0 58.8%
fma-define58.8%
associate-/l*58.6%
fma-define58.6%
associate-/l*58.6%
Simplified58.6%
Taylor expanded in a around inf 99.3%
*-commutative99.3%
associate-/l*99.8%
associate-*l*99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification58.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
(let* ((t_1 (* t (* a (/ -4.0 c)))))
(if (<= a -3.2e-119)
t_1
(if (<= a -1.5e-274)
(* 9.0 (* (/ y z) (/ x c)))
(if (<= a 2.7e-182)
(* (/ b z) (/ 1.0 c))
(if (<= a 1.05e+108)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 1.8e+261)
t_1
(if (<= a 2.8e+287)
(/ (* 9.0 (* y x)) (* z c))
(* (/ a c) (* -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 t_1 = t * (a * (-4.0 / c));
double tmp;
if (a <= -3.2e-119) {
tmp = t_1;
} else if (a <= -1.5e-274) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (a <= 2.7e-182) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 1.05e+108) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.8e+261) {
tmp = t_1;
} else if (a <= 2.8e+287) {
tmp = (9.0 * (y * x)) / (z * c);
} else {
tmp = (a / c) * (-4.0 * 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) :: t_1
real(8) :: tmp
t_1 = t * (a * ((-4.0d0) / c))
if (a <= (-3.2d-119)) then
tmp = t_1
else if (a <= (-1.5d-274)) then
tmp = 9.0d0 * ((y / z) * (x / c))
else if (a <= 2.7d-182) then
tmp = (b / z) * (1.0d0 / c)
else if (a <= 1.05d+108) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 1.8d+261) then
tmp = t_1
else if (a <= 2.8d+287) then
tmp = (9.0d0 * (y * x)) / (z * c)
else
tmp = (a / c) * ((-4.0d0) * 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 t_1 = t * (a * (-4.0 / c));
double tmp;
if (a <= -3.2e-119) {
tmp = t_1;
} else if (a <= -1.5e-274) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (a <= 2.7e-182) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 1.05e+108) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.8e+261) {
tmp = t_1;
} else if (a <= 2.8e+287) {
tmp = (9.0 * (y * x)) / (z * c);
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): t_1 = t * (a * (-4.0 / c)) tmp = 0 if a <= -3.2e-119: tmp = t_1 elif a <= -1.5e-274: tmp = 9.0 * ((y / z) * (x / c)) elif a <= 2.7e-182: tmp = (b / z) * (1.0 / c) elif a <= 1.05e+108: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 1.8e+261: tmp = t_1 elif a <= 2.8e+287: tmp = (9.0 * (y * x)) / (z * c) else: tmp = (a / c) * (-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) t_1 = Float64(t * Float64(a * Float64(-4.0 / c))) tmp = 0.0 if (a <= -3.2e-119) tmp = t_1; elseif (a <= -1.5e-274) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); elseif (a <= 2.7e-182) tmp = Float64(Float64(b / z) * Float64(1.0 / c)); elseif (a <= 1.05e+108) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 1.8e+261) tmp = t_1; elseif (a <= 2.8e+287) tmp = Float64(Float64(9.0 * Float64(y * x)) / Float64(z * c)); else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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)
t_1 = t * (a * (-4.0 / c));
tmp = 0.0;
if (a <= -3.2e-119)
tmp = t_1;
elseif (a <= -1.5e-274)
tmp = 9.0 * ((y / z) * (x / c));
elseif (a <= 2.7e-182)
tmp = (b / z) * (1.0 / c);
elseif (a <= 1.05e+108)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 1.8e+261)
tmp = t_1;
elseif (a <= 2.8e+287)
tmp = (9.0 * (y * x)) / (z * c);
else
tmp = (a / c) * (-4.0 * 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_] := Block[{t$95$1 = N[(t * N[(a * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -3.2e-119], t$95$1, If[LessEqual[a, -1.5e-274], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.7e-182], N[(N[(b / z), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.05e+108], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.8e+261], t$95$1, If[LessEqual[a, 2.8e+287], N[(N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}
t_1 := t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\mathbf{if}\;a \leq -3.2 \cdot 10^{-119}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq -1.5 \cdot 10^{-274}:\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{elif}\;a \leq 2.7 \cdot 10^{-182}:\\
\;\;\;\;\frac{b}{z} \cdot \frac{1}{c}\\
\mathbf{elif}\;a \leq 1.05 \cdot 10^{+108}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+261}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+287}:\\
\;\;\;\;\frac{9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if a < -3.19999999999999993e-119 or 1.05000000000000005e108 < a < 1.80000000000000009e261Initial program 67.4%
+-commutative67.4%
associate-+r-67.4%
*-commutative67.4%
associate-*r*63.4%
*-commutative63.4%
associate-+r-63.4%
+-commutative63.4%
associate-*l*63.4%
associate-*l*66.6%
*-commutative66.6%
Simplified66.6%
Taylor expanded in t around inf 71.0%
Taylor expanded in x around 0 68.6%
Taylor expanded in a around inf 60.0%
associate-*r/60.0%
*-commutative60.0%
associate-/l*60.0%
Simplified60.0%
if -3.19999999999999993e-119 < a < -1.49999999999999989e-274Initial program 83.3%
+-commutative83.3%
associate-+r-83.3%
*-commutative83.3%
associate-*r*88.9%
*-commutative88.9%
associate-+r-88.9%
+-commutative88.9%
associate-*l*89.0%
associate-*l*89.0%
*-commutative89.0%
Simplified89.0%
Taylor expanded in x around inf 54.3%
times-frac54.2%
Applied egg-rr54.2%
if -1.49999999999999989e-274 < a < 2.69999999999999999e-182Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*82.0%
*-commutative82.0%
associate-+r-82.0%
+-commutative82.0%
associate-*l*82.0%
associate-*l*82.0%
*-commutative82.0%
Simplified82.0%
Taylor expanded in b around inf 51.2%
*-commutative51.2%
Simplified51.2%
*-un-lft-identity51.2%
associate-/r*59.5%
Applied egg-rr59.5%
div-inv59.6%
Applied egg-rr59.6%
if 2.69999999999999999e-182 < a < 1.05000000000000005e108Initial program 81.4%
+-commutative81.4%
associate-+r-81.4%
*-commutative81.4%
associate-*r*83.7%
*-commutative83.7%
associate-+r-83.7%
+-commutative83.7%
associate-*l*83.6%
associate-*l*81.5%
*-commutative81.5%
Simplified81.5%
Taylor expanded in x around inf 47.2%
if 1.80000000000000009e261 < a < 2.80000000000000001e287Initial program 82.7%
+-commutative82.7%
associate-+r-82.7%
*-commutative82.7%
associate-*r*82.7%
*-commutative82.7%
associate-+r-82.7%
+-commutative82.7%
associate-*l*82.9%
associate-*l*34.9%
*-commutative34.9%
Simplified34.9%
Taylor expanded in x around inf 51.8%
associate-*r/51.8%
*-commutative51.8%
Applied egg-rr51.8%
if 2.80000000000000001e287 < a Initial program 58.8%
+-commutative58.8%
associate-+r-58.8%
*-commutative58.8%
associate-*r*45.1%
*-commutative45.1%
associate-+r-45.1%
+-commutative45.1%
associate-*l*45.1%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in z around 0 58.8%
fma-define58.8%
associate-/l*58.6%
fma-define58.6%
associate-/l*58.6%
Simplified58.6%
Taylor expanded in a around inf 99.3%
*-commutative99.3%
associate-/l*99.8%
associate-*l*99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification58.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
(let* ((t_1 (* t (* a (/ -4.0 c)))))
(if (<= a -3.9e-119)
t_1
(if (<= a -4e-278)
(/ (* 9.0 (* x (/ y z))) c)
(if (<= a 2.4e-184)
(* (/ b z) (/ 1.0 c))
(if (<= a 1.8e+107)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 1.8e+261)
t_1
(if (<= a 2.8e+287)
(/ (* 9.0 (* y x)) (* z c))
(* (/ a c) (* -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 t_1 = t * (a * (-4.0 / c));
double tmp;
if (a <= -3.9e-119) {
tmp = t_1;
} else if (a <= -4e-278) {
tmp = (9.0 * (x * (y / z))) / c;
} else if (a <= 2.4e-184) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 1.8e+107) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.8e+261) {
tmp = t_1;
} else if (a <= 2.8e+287) {
tmp = (9.0 * (y * x)) / (z * c);
} else {
tmp = (a / c) * (-4.0 * 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) :: t_1
real(8) :: tmp
t_1 = t * (a * ((-4.0d0) / c))
if (a <= (-3.9d-119)) then
tmp = t_1
else if (a <= (-4d-278)) then
tmp = (9.0d0 * (x * (y / z))) / c
else if (a <= 2.4d-184) then
tmp = (b / z) * (1.0d0 / c)
else if (a <= 1.8d+107) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 1.8d+261) then
tmp = t_1
else if (a <= 2.8d+287) then
tmp = (9.0d0 * (y * x)) / (z * c)
else
tmp = (a / c) * ((-4.0d0) * 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 t_1 = t * (a * (-4.0 / c));
double tmp;
if (a <= -3.9e-119) {
tmp = t_1;
} else if (a <= -4e-278) {
tmp = (9.0 * (x * (y / z))) / c;
} else if (a <= 2.4e-184) {
tmp = (b / z) * (1.0 / c);
} else if (a <= 1.8e+107) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.8e+261) {
tmp = t_1;
} else if (a <= 2.8e+287) {
tmp = (9.0 * (y * x)) / (z * c);
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): t_1 = t * (a * (-4.0 / c)) tmp = 0 if a <= -3.9e-119: tmp = t_1 elif a <= -4e-278: tmp = (9.0 * (x * (y / z))) / c elif a <= 2.4e-184: tmp = (b / z) * (1.0 / c) elif a <= 1.8e+107: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 1.8e+261: tmp = t_1 elif a <= 2.8e+287: tmp = (9.0 * (y * x)) / (z * c) else: tmp = (a / c) * (-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) t_1 = Float64(t * Float64(a * Float64(-4.0 / c))) tmp = 0.0 if (a <= -3.9e-119) tmp = t_1; elseif (a <= -4e-278) tmp = Float64(Float64(9.0 * Float64(x * Float64(y / z))) / c); elseif (a <= 2.4e-184) tmp = Float64(Float64(b / z) * Float64(1.0 / c)); elseif (a <= 1.8e+107) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 1.8e+261) tmp = t_1; elseif (a <= 2.8e+287) tmp = Float64(Float64(9.0 * Float64(y * x)) / Float64(z * c)); else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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)
t_1 = t * (a * (-4.0 / c));
tmp = 0.0;
if (a <= -3.9e-119)
tmp = t_1;
elseif (a <= -4e-278)
tmp = (9.0 * (x * (y / z))) / c;
elseif (a <= 2.4e-184)
tmp = (b / z) * (1.0 / c);
elseif (a <= 1.8e+107)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 1.8e+261)
tmp = t_1;
elseif (a <= 2.8e+287)
tmp = (9.0 * (y * x)) / (z * c);
else
tmp = (a / c) * (-4.0 * 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_] := Block[{t$95$1 = N[(t * N[(a * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -3.9e-119], t$95$1, If[LessEqual[a, -4e-278], N[(N[(9.0 * N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 2.4e-184], N[(N[(b / z), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.8e+107], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.8e+261], t$95$1, If[LessEqual[a, 2.8e+287], N[(N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}
t_1 := t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\mathbf{if}\;a \leq -3.9 \cdot 10^{-119}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq -4 \cdot 10^{-278}:\\
\;\;\;\;\frac{9 \cdot \left(x \cdot \frac{y}{z}\right)}{c}\\
\mathbf{elif}\;a \leq 2.4 \cdot 10^{-184}:\\
\;\;\;\;\frac{b}{z} \cdot \frac{1}{c}\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+107}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+261}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+287}:\\
\;\;\;\;\frac{9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if a < -3.8999999999999999e-119 or 1.7999999999999999e107 < a < 1.80000000000000009e261Initial program 67.4%
+-commutative67.4%
associate-+r-67.4%
*-commutative67.4%
associate-*r*63.4%
*-commutative63.4%
associate-+r-63.4%
+-commutative63.4%
associate-*l*63.4%
associate-*l*66.6%
*-commutative66.6%
Simplified66.6%
Taylor expanded in t around inf 71.0%
Taylor expanded in x around 0 68.6%
Taylor expanded in a around inf 60.0%
associate-*r/60.0%
*-commutative60.0%
associate-/l*60.0%
Simplified60.0%
if -3.8999999999999999e-119 < a < -3.99999999999999975e-278Initial program 83.3%
+-commutative83.3%
associate-+r-83.3%
*-commutative83.3%
associate-*r*88.9%
*-commutative88.9%
associate-+r-88.9%
+-commutative88.9%
associate-*l*89.0%
associate-*l*89.0%
*-commutative89.0%
Simplified89.0%
Taylor expanded in a around inf 50.1%
Taylor expanded in c around 0 60.9%
Taylor expanded in x around inf 51.8%
associate-/l*54.4%
Simplified54.4%
if -3.99999999999999975e-278 < a < 2.40000000000000024e-184Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*82.0%
*-commutative82.0%
associate-+r-82.0%
+-commutative82.0%
associate-*l*82.0%
associate-*l*82.0%
*-commutative82.0%
Simplified82.0%
Taylor expanded in b around inf 51.2%
*-commutative51.2%
Simplified51.2%
*-un-lft-identity51.2%
associate-/r*59.5%
Applied egg-rr59.5%
div-inv59.6%
Applied egg-rr59.6%
if 2.40000000000000024e-184 < a < 1.7999999999999999e107Initial program 81.4%
+-commutative81.4%
associate-+r-81.4%
*-commutative81.4%
associate-*r*83.7%
*-commutative83.7%
associate-+r-83.7%
+-commutative83.7%
associate-*l*83.6%
associate-*l*81.5%
*-commutative81.5%
Simplified81.5%
Taylor expanded in x around inf 47.2%
if 1.80000000000000009e261 < a < 2.80000000000000001e287Initial program 82.7%
+-commutative82.7%
associate-+r-82.7%
*-commutative82.7%
associate-*r*82.7%
*-commutative82.7%
associate-+r-82.7%
+-commutative82.7%
associate-*l*82.9%
associate-*l*34.9%
*-commutative34.9%
Simplified34.9%
Taylor expanded in x around inf 51.8%
associate-*r/51.8%
*-commutative51.8%
Applied egg-rr51.8%
if 2.80000000000000001e287 < a Initial program 58.8%
+-commutative58.8%
associate-+r-58.8%
*-commutative58.8%
associate-*r*45.1%
*-commutative45.1%
associate-+r-45.1%
+-commutative45.1%
associate-*l*45.1%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in z around 0 58.8%
fma-define58.8%
associate-/l*58.6%
fma-define58.6%
associate-/l*58.6%
Simplified58.6%
Taylor expanded in a around inf 99.3%
*-commutative99.3%
associate-/l*99.8%
associate-*l*99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification58.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 (<= z -1.6e+61)
(/ (* t (+ (* a -4.0) (+ (* 9.0 (/ (* y x) (* z t))) (/ b (* z t))))) c)
(if (<= z 2.6e+67)
(/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))
(/
(* a (+ (* -4.0 t) (+ (/ b (* z a)) (* 9.0 (/ (* y x) (* z a))))))
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) {
double tmp;
if (z <= -1.6e+61) {
tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c;
} else if (z <= 2.6e+67) {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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 (z <= (-1.6d+61)) then
tmp = (t * ((a * (-4.0d0)) + ((9.0d0 * ((y * x) / (z * t))) + (b / (z * t))))) / c
else if (z <= 2.6d+67) then
tmp = (b + ((y * (x * 9.0d0)) - (a * (t * (z * 4.0d0))))) / (z * c)
else
tmp = (a * (((-4.0d0) * t) + ((b / (z * a)) + (9.0d0 * ((y * x) / (z * a)))))) / c
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 (z <= -1.6e+61) {
tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c;
} else if (z <= 2.6e+67) {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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 z <= -1.6e+61: tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c elif z <= 2.6e+67: tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c) else: tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c 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.6e+61) tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + Float64(Float64(9.0 * Float64(Float64(y * x) / Float64(z * t))) + Float64(b / Float64(z * t))))) / c); elseif (z <= 2.6e+67) tmp = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(Float64(b / Float64(z * a)) + Float64(9.0 * Float64(Float64(y * x) / Float64(z * a)))))) / c); 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 (z <= -1.6e+61)
tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c;
elseif (z <= 2.6e+67)
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
else
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * 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. 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.6e+61], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.6e+67], N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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.6 \cdot 10^{+61}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4 + \left(9 \cdot \frac{y \cdot x}{z \cdot t} + \frac{b}{z \cdot t}\right)\right)}{c}\\
\mathbf{elif}\;z \leq 2.6 \cdot 10^{+67}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \left(\frac{b}{z \cdot a} + 9 \cdot \frac{y \cdot x}{z \cdot a}\right)\right)}{c}\\
\end{array}
\end{array}
if z < -1.5999999999999999e61Initial program 51.6%
+-commutative51.6%
associate-+r-51.6%
*-commutative51.6%
associate-*r*59.0%
*-commutative59.0%
associate-+r-59.0%
+-commutative59.0%
associate-*l*59.0%
associate-*l*62.8%
*-commutative62.8%
Simplified62.8%
Taylor expanded in t around inf 67.4%
Taylor expanded in c around 0 75.5%
if -1.5999999999999999e61 < z < 2.6e67Initial program 94.1%
if 2.6e67 < z Initial program 46.6%
+-commutative46.6%
associate-+r-46.6%
*-commutative46.6%
associate-*r*38.9%
*-commutative38.9%
associate-+r-38.9%
+-commutative38.9%
associate-*l*38.9%
associate-*l*49.9%
*-commutative49.9%
Simplified49.9%
Taylor expanded in a around inf 70.2%
Taylor expanded in c around 0 79.5%
Final simplification86.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 (<= z -7e+38)
(/ (* t (+ (* a -4.0) (+ (* 9.0 (/ (* y x) (* z t))) (/ b (* z t))))) c)
(if (<= z 2e-59)
(/ (+ (* -4.0 (/ (* a (* z t)) c)) (+ (* 9.0 (/ (* y x) c)) (/ b c))) z)
(/
(* a (+ (* -4.0 t) (+ (/ b (* z a)) (* 9.0 (/ (* y x) (* z a))))))
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) {
double tmp;
if (z <= -7e+38) {
tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c;
} else if (z <= 2e-59) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((y * x) / c)) + (b / c))) / z;
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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 (z <= (-7d+38)) then
tmp = (t * ((a * (-4.0d0)) + ((9.0d0 * ((y * x) / (z * t))) + (b / (z * t))))) / c
else if (z <= 2d-59) then
tmp = (((-4.0d0) * ((a * (z * t)) / c)) + ((9.0d0 * ((y * x) / c)) + (b / c))) / z
else
tmp = (a * (((-4.0d0) * t) + ((b / (z * a)) + (9.0d0 * ((y * x) / (z * a)))))) / c
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 (z <= -7e+38) {
tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c;
} else if (z <= 2e-59) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((y * x) / c)) + (b / c))) / z;
} else {
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c;
}
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 z <= -7e+38: tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c elif z <= 2e-59: tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((y * x) / c)) + (b / c))) / z else: tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * a)))))) / c 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 <= -7e+38) tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + Float64(Float64(9.0 * Float64(Float64(y * x) / Float64(z * t))) + Float64(b / Float64(z * t))))) / c); elseif (z <= 2e-59) tmp = Float64(Float64(Float64(-4.0 * Float64(Float64(a * Float64(z * t)) / c)) + Float64(Float64(9.0 * Float64(Float64(y * x) / c)) + Float64(b / c))) / z); else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(Float64(b / Float64(z * a)) + Float64(9.0 * Float64(Float64(y * x) / Float64(z * a)))))) / c); 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 (z <= -7e+38)
tmp = (t * ((a * -4.0) + ((9.0 * ((y * x) / (z * t))) + (b / (z * t))))) / c;
elseif (z <= 2e-59)
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((y * x) / c)) + (b / c))) / z;
else
tmp = (a * ((-4.0 * t) + ((b / (z * a)) + (9.0 * ((y * x) / (z * 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. 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, -7e+38], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2e-59], N[(N[(N[(-4.0 * N[(N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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 -7 \cdot 10^{+38}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4 + \left(9 \cdot \frac{y \cdot x}{z \cdot t} + \frac{b}{z \cdot t}\right)\right)}{c}\\
\mathbf{elif}\;z \leq 2 \cdot 10^{-59}:\\
\;\;\;\;\frac{-4 \cdot \frac{a \cdot \left(z \cdot t\right)}{c} + \left(9 \cdot \frac{y \cdot x}{c} + \frac{b}{c}\right)}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \left(\frac{b}{z \cdot a} + 9 \cdot \frac{y \cdot x}{z \cdot a}\right)\right)}{c}\\
\end{array}
\end{array}
if z < -7.00000000000000003e38Initial program 55.3%
+-commutative55.3%
associate-+r-55.3%
*-commutative55.3%
associate-*r*62.1%
*-commutative62.1%
associate-+r-62.1%
+-commutative62.1%
associate-*l*62.1%
associate-*l*65.7%
*-commutative65.7%
Simplified65.7%
Taylor expanded in t around inf 68.3%
Taylor expanded in c around 0 77.3%
if -7.00000000000000003e38 < z < 2.0000000000000001e-59Initial program 94.6%
+-commutative94.6%
associate-+r-94.6%
*-commutative94.6%
associate-*r*94.6%
*-commutative94.6%
associate-+r-94.6%
+-commutative94.6%
associate-*l*94.6%
associate-*l*87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around 0 95.5%
if 2.0000000000000001e-59 < z Initial program 57.2%
+-commutative57.2%
associate-+r-57.2%
*-commutative57.2%
associate-*r*51.4%
*-commutative51.4%
associate-+r-51.4%
+-commutative51.4%
associate-*l*51.3%
associate-*l*59.6%
*-commutative59.6%
Simplified59.6%
Taylor expanded in a around inf 73.7%
Taylor expanded in c around 0 82.1%
Final simplification86.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 (/ (+ b (* 9.0 (* y x))) (* z c))) (t_2 (* t (* a (/ -4.0 c)))))
(if (<= a -4.2e-119)
t_2
(if (<= a 5.1e+159)
t_1
(if (<= a 4.6e+245)
t_2
(if (<= a 2.8e+287) t_1 (* (/ a c) (* -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 t_1 = (b + (9.0 * (y * x))) / (z * c);
double t_2 = t * (a * (-4.0 / c));
double tmp;
if (a <= -4.2e-119) {
tmp = t_2;
} else if (a <= 5.1e+159) {
tmp = t_1;
} else if (a <= 4.6e+245) {
tmp = t_2;
} else if (a <= 2.8e+287) {
tmp = t_1;
} else {
tmp = (a / c) * (-4.0 * 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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (b + (9.0d0 * (y * x))) / (z * c)
t_2 = t * (a * ((-4.0d0) / c))
if (a <= (-4.2d-119)) then
tmp = t_2
else if (a <= 5.1d+159) then
tmp = t_1
else if (a <= 4.6d+245) then
tmp = t_2
else if (a <= 2.8d+287) then
tmp = t_1
else
tmp = (a / c) * ((-4.0d0) * 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 t_1 = (b + (9.0 * (y * x))) / (z * c);
double t_2 = t * (a * (-4.0 / c));
double tmp;
if (a <= -4.2e-119) {
tmp = t_2;
} else if (a <= 5.1e+159) {
tmp = t_1;
} else if (a <= 4.6e+245) {
tmp = t_2;
} else if (a <= 2.8e+287) {
tmp = t_1;
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): t_1 = (b + (9.0 * (y * x))) / (z * c) t_2 = t * (a * (-4.0 / c)) tmp = 0 if a <= -4.2e-119: tmp = t_2 elif a <= 5.1e+159: tmp = t_1 elif a <= 4.6e+245: tmp = t_2 elif a <= 2.8e+287: tmp = t_1 else: tmp = (a / c) * (-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) t_1 = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)) t_2 = Float64(t * Float64(a * Float64(-4.0 / c))) tmp = 0.0 if (a <= -4.2e-119) tmp = t_2; elseif (a <= 5.1e+159) tmp = t_1; elseif (a <= 4.6e+245) tmp = t_2; elseif (a <= 2.8e+287) tmp = t_1; else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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)
t_1 = (b + (9.0 * (y * x))) / (z * c);
t_2 = t * (a * (-4.0 / c));
tmp = 0.0;
if (a <= -4.2e-119)
tmp = t_2;
elseif (a <= 5.1e+159)
tmp = t_1;
elseif (a <= 4.6e+245)
tmp = t_2;
elseif (a <= 2.8e+287)
tmp = t_1;
else
tmp = (a / c) * (-4.0 * 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_] := Block[{t$95$1 = N[(N[(b + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(a * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -4.2e-119], t$95$2, If[LessEqual[a, 5.1e+159], t$95$1, If[LessEqual[a, 4.6e+245], t$95$2, If[LessEqual[a, 2.8e+287], t$95$1, N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}
t_1 := \frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
t_2 := t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\mathbf{if}\;a \leq -4.2 \cdot 10^{-119}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq 5.1 \cdot 10^{+159}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 4.6 \cdot 10^{+245}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+287}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if a < -4.2e-119 or 5.09999999999999967e159 < a < 4.5999999999999999e245Initial program 67.9%
+-commutative67.9%
associate-+r-67.9%
*-commutative67.9%
associate-*r*64.3%
*-commutative64.3%
associate-+r-64.3%
+-commutative64.3%
associate-*l*64.4%
associate-*l*67.0%
*-commutative67.0%
Simplified67.0%
Taylor expanded in t around inf 71.9%
Taylor expanded in x around 0 69.3%
Taylor expanded in a around inf 59.2%
associate-*r/59.2%
*-commutative59.2%
associate-/l*59.2%
Simplified59.2%
if -4.2e-119 < a < 5.09999999999999967e159 or 4.5999999999999999e245 < a < 2.80000000000000001e287Initial program 78.1%
+-commutative78.1%
associate-+r-78.1%
*-commutative78.1%
associate-*r*82.1%
*-commutative82.1%
associate-+r-82.1%
+-commutative82.1%
associate-*l*82.1%
associate-*l*79.8%
*-commutative79.8%
Simplified79.8%
Taylor expanded in x around inf 72.2%
if 2.80000000000000001e287 < a Initial program 58.8%
+-commutative58.8%
associate-+r-58.8%
*-commutative58.8%
associate-*r*45.1%
*-commutative45.1%
associate-+r-45.1%
+-commutative45.1%
associate-*l*45.1%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in z around 0 58.8%
fma-define58.8%
associate-/l*58.6%
fma-define58.6%
associate-/l*58.6%
Simplified58.6%
Taylor expanded in a around inf 99.3%
*-commutative99.3%
associate-/l*99.8%
associate-*l*99.8%
*-commutative99.8%
*-commutative99.8%
Simplified99.8%
Final simplification66.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 (<= z -5e+164)
(* (* a t) (/ -4.0 c))
(if (<= z -2.75e+141)
(* (/ b c) (/ 1.0 z))
(if (<= z -1.65e-50)
(* (/ a c) (* -4.0 t))
(if (<= z 1.65e-25)
(* 9.0 (* x (/ y (* z c))))
(* a (/ (* -4.0 t) 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) {
double tmp;
if (z <= -5e+164) {
tmp = (a * t) * (-4.0 / c);
} else if (z <= -2.75e+141) {
tmp = (b / c) * (1.0 / z);
} else if (z <= -1.65e-50) {
tmp = (a / c) * (-4.0 * t);
} else if (z <= 1.65e-25) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = a * ((-4.0 * t) / c);
}
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 (z <= (-5d+164)) then
tmp = (a * t) * ((-4.0d0) / c)
else if (z <= (-2.75d+141)) then
tmp = (b / c) * (1.0d0 / z)
else if (z <= (-1.65d-50)) then
tmp = (a / c) * ((-4.0d0) * t)
else if (z <= 1.65d-25) then
tmp = 9.0d0 * (x * (y / (z * c)))
else
tmp = a * (((-4.0d0) * t) / c)
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 (z <= -5e+164) {
tmp = (a * t) * (-4.0 / c);
} else if (z <= -2.75e+141) {
tmp = (b / c) * (1.0 / z);
} else if (z <= -1.65e-50) {
tmp = (a / c) * (-4.0 * t);
} else if (z <= 1.65e-25) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = a * ((-4.0 * t) / c);
}
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 z <= -5e+164: tmp = (a * t) * (-4.0 / c) elif z <= -2.75e+141: tmp = (b / c) * (1.0 / z) elif z <= -1.65e-50: tmp = (a / c) * (-4.0 * t) elif z <= 1.65e-25: tmp = 9.0 * (x * (y / (z * c))) else: tmp = a * ((-4.0 * t) / c) 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 <= -5e+164) tmp = Float64(Float64(a * t) * Float64(-4.0 / c)); elseif (z <= -2.75e+141) tmp = Float64(Float64(b / c) * Float64(1.0 / z)); elseif (z <= -1.65e-50) tmp = Float64(Float64(a / c) * Float64(-4.0 * t)); elseif (z <= 1.65e-25) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); else tmp = Float64(a * Float64(Float64(-4.0 * t) / c)); 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 (z <= -5e+164)
tmp = (a * t) * (-4.0 / c);
elseif (z <= -2.75e+141)
tmp = (b / c) * (1.0 / z);
elseif (z <= -1.65e-50)
tmp = (a / c) * (-4.0 * t);
elseif (z <= 1.65e-25)
tmp = 9.0 * (x * (y / (z * c)));
else
tmp = a * ((-4.0 * 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. 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, -5e+164], N[(N[(a * t), $MachinePrecision] * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.75e+141], N[(N[(b / c), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.65e-50], N[(N[(a / c), $MachinePrecision] * N[(-4.0 * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.65e-25], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(-4.0 * t), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -5 \cdot 10^{+164}:\\
\;\;\;\;\left(a \cdot t\right) \cdot \frac{-4}{c}\\
\mathbf{elif}\;z \leq -2.75 \cdot 10^{+141}:\\
\;\;\;\;\frac{b}{c} \cdot \frac{1}{z}\\
\mathbf{elif}\;z \leq -1.65 \cdot 10^{-50}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\mathbf{elif}\;z \leq 1.65 \cdot 10^{-25}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c}\\
\end{array}
\end{array}
if z < -4.9999999999999995e164Initial program 54.5%
+-commutative54.5%
associate-+r-54.5%
*-commutative54.5%
associate-*r*62.3%
*-commutative62.3%
associate-+r-62.3%
+-commutative62.3%
associate-*l*62.2%
associate-*l*65.7%
*-commutative65.7%
Simplified65.7%
Taylor expanded in a around inf 62.8%
Taylor expanded in c around 0 71.0%
Taylor expanded in a around inf 57.4%
associate-*r/57.4%
*-commutative57.4%
associate-/l*57.4%
Simplified57.4%
if -4.9999999999999995e164 < z < -2.74999999999999984e141Initial program 59.2%
+-commutative59.2%
associate-+r-59.2%
*-commutative59.2%
associate-*r*58.3%
*-commutative58.3%
associate-+r-58.3%
+-commutative58.3%
associate-*l*58.3%
associate-*l*60.0%
*-commutative60.0%
Simplified60.0%
Taylor expanded in b around inf 45.5%
associate-/r*72.2%
Simplified72.2%
div-inv72.7%
Applied egg-rr72.7%
if -2.74999999999999984e141 < z < -1.6499999999999999e-50Initial program 71.2%
+-commutative71.2%
associate-+r-71.2%
*-commutative71.2%
associate-*r*75.3%
*-commutative75.3%
associate-+r-75.3%
+-commutative75.3%
associate-*l*75.3%
associate-*l*71.3%
*-commutative71.3%
Simplified71.3%
Taylor expanded in z around 0 73.6%
fma-define73.6%
associate-/l*79.9%
fma-define79.9%
associate-/l*79.9%
Simplified79.9%
Taylor expanded in a around inf 49.7%
*-commutative49.7%
associate-/l*58.8%
associate-*l*58.8%
*-commutative58.8%
*-commutative58.8%
Simplified58.8%
if -1.6499999999999999e-50 < z < 1.6499999999999999e-25Initial program 95.7%
+-commutative95.7%
associate-+r-95.7%
*-commutative95.7%
associate-*r*95.7%
*-commutative95.7%
associate-+r-95.7%
+-commutative95.7%
associate-*l*95.6%
associate-*l*90.3%
*-commutative90.3%
Simplified90.3%
Taylor expanded in z around 0 95.6%
fma-define95.6%
associate-/l*94.5%
associate-/l*92.4%
fma-define92.4%
associate-/l*90.3%
Simplified90.3%
Taylor expanded in x around inf 59.5%
associate-/l*58.5%
*-commutative58.5%
Simplified58.5%
if 1.6499999999999999e-25 < z Initial program 56.1%
+-commutative56.1%
associate-+r-56.1%
*-commutative56.1%
associate-*r*50.2%
*-commutative50.2%
associate-+r-50.2%
+-commutative50.2%
associate-*l*50.1%
associate-*l*58.7%
*-commutative58.7%
Simplified58.7%
Taylor expanded in z around inf 60.5%
*-commutative60.5%
associate-/l*60.3%
associate-*r*60.3%
associate-*l/60.4%
Simplified60.4%
Final simplification59.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 (<= z -5.5e+65)
(* t (/ (- (/ (/ b z) t) (* a 4.0)) c))
(if (<= z 8.4e+85)
(/ (+ b (- (* x (* y 9.0)) (* (* z 4.0) (* a t)))) (* z c))
(/ (* a (+ (* -4.0 t) (/ b (* z a)))) 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) {
double tmp;
if (z <= -5.5e+65) {
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
} else if (z <= 8.4e+85) {
tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c);
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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 (z <= (-5.5d+65)) then
tmp = t * ((((b / z) / t) - (a * 4.0d0)) / c)
else if (z <= 8.4d+85) then
tmp = (b + ((x * (y * 9.0d0)) - ((z * 4.0d0) * (a * t)))) / (z * c)
else
tmp = (a * (((-4.0d0) * t) + (b / (z * a)))) / c
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 (z <= -5.5e+65) {
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
} else if (z <= 8.4e+85) {
tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c);
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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 z <= -5.5e+65: tmp = t * ((((b / z) / t) - (a * 4.0)) / c) elif z <= 8.4e+85: tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c) else: tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c 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 <= -5.5e+65) tmp = Float64(t * Float64(Float64(Float64(Float64(b / z) / t) - Float64(a * 4.0)) / c)); elseif (z <= 8.4e+85) tmp = Float64(Float64(b + Float64(Float64(x * Float64(y * 9.0)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(z * c)); else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(b / Float64(z * a)))) / c); 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 (z <= -5.5e+65)
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
elseif (z <= 8.4e+85)
tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c);
else
tmp = (a * ((-4.0 * t) + (b / (z * 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. 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, -5.5e+65], N[(t * N[(N[(N[(N[(b / z), $MachinePrecision] / t), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.4e+85], N[(N[(b + N[(N[(x * N[(y * 9.0), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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 -5.5 \cdot 10^{+65}:\\
\;\;\;\;t \cdot \frac{\frac{\frac{b}{z}}{t} - a \cdot 4}{c}\\
\mathbf{elif}\;z \leq 8.4 \cdot 10^{+85}:\\
\;\;\;\;\frac{b + \left(x \cdot \left(y \cdot 9\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \frac{b}{z \cdot a}\right)}{c}\\
\end{array}
\end{array}
if z < -5.4999999999999996e65Initial program 51.6%
+-commutative51.6%
associate-+r-51.6%
*-commutative51.6%
associate-*r*59.0%
*-commutative59.0%
associate-+r-59.0%
+-commutative59.0%
associate-*l*59.0%
associate-*l*62.8%
*-commutative62.8%
Simplified62.8%
Taylor expanded in t around inf 67.4%
Taylor expanded in x around 0 66.2%
Taylor expanded in c around -inf 70.9%
mul-1-neg70.9%
associate-/l*69.4%
distribute-rgt-neg-in69.4%
distribute-neg-frac269.4%
+-commutative69.4%
mul-1-neg69.4%
unsub-neg69.4%
*-commutative69.4%
*-commutative69.4%
associate-/r*72.5%
Simplified72.5%
if -5.4999999999999996e65 < z < 8.4000000000000004e85Initial program 94.1%
+-commutative94.1%
associate-+r-94.1%
*-commutative94.1%
associate-*r*94.1%
*-commutative94.1%
associate-+r-94.1%
+-commutative94.1%
associate-*l*94.0%
associate-*l*88.3%
*-commutative88.3%
Simplified88.3%
if 8.4000000000000004e85 < z Initial program 46.6%
+-commutative46.6%
associate-+r-46.6%
*-commutative46.6%
associate-*r*38.9%
*-commutative38.9%
associate-+r-38.9%
+-commutative38.9%
associate-*l*38.9%
associate-*l*49.9%
*-commutative49.9%
Simplified49.9%
Taylor expanded in a around inf 70.2%
Taylor expanded in c around 0 79.5%
Taylor expanded in x around 0 76.6%
Final simplification81.8%
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 -8.6e+61)
(* t (/ (- (/ (/ b z) t) (* a 4.0)) c))
(if (<= z 8.5e+74)
(/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))
(/ (* a (+ (* -4.0 t) (/ b (* z a)))) 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) {
double tmp;
if (z <= -8.6e+61) {
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
} else if (z <= 8.5e+74) {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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 (z <= (-8.6d+61)) then
tmp = t * ((((b / z) / t) - (a * 4.0d0)) / c)
else if (z <= 8.5d+74) then
tmp = (b + ((y * (x * 9.0d0)) - (a * (t * (z * 4.0d0))))) / (z * c)
else
tmp = (a * (((-4.0d0) * t) + (b / (z * a)))) / c
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 (z <= -8.6e+61) {
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
} else if (z <= 8.5e+74) {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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 z <= -8.6e+61: tmp = t * ((((b / z) / t) - (a * 4.0)) / c) elif z <= 8.5e+74: tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c) else: tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c 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 <= -8.6e+61) tmp = Float64(t * Float64(Float64(Float64(Float64(b / z) / t) - Float64(a * 4.0)) / c)); elseif (z <= 8.5e+74) tmp = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(b / Float64(z * a)))) / c); 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 (z <= -8.6e+61)
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
elseif (z <= 8.5e+74)
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
else
tmp = (a * ((-4.0 * t) + (b / (z * 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. 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, -8.6e+61], N[(t * N[(N[(N[(N[(b / z), $MachinePrecision] / t), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.5e+74], N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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 -8.6 \cdot 10^{+61}:\\
\;\;\;\;t \cdot \frac{\frac{\frac{b}{z}}{t} - a \cdot 4}{c}\\
\mathbf{elif}\;z \leq 8.5 \cdot 10^{+74}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \frac{b}{z \cdot a}\right)}{c}\\
\end{array}
\end{array}
if z < -8.6000000000000003e61Initial program 51.6%
+-commutative51.6%
associate-+r-51.6%
*-commutative51.6%
associate-*r*59.0%
*-commutative59.0%
associate-+r-59.0%
+-commutative59.0%
associate-*l*59.0%
associate-*l*62.8%
*-commutative62.8%
Simplified62.8%
Taylor expanded in t around inf 67.4%
Taylor expanded in x around 0 66.2%
Taylor expanded in c around -inf 70.9%
mul-1-neg70.9%
associate-/l*69.4%
distribute-rgt-neg-in69.4%
distribute-neg-frac269.4%
+-commutative69.4%
mul-1-neg69.4%
unsub-neg69.4%
*-commutative69.4%
*-commutative69.4%
associate-/r*72.5%
Simplified72.5%
if -8.6000000000000003e61 < z < 8.50000000000000028e74Initial program 94.1%
if 8.50000000000000028e74 < z Initial program 46.6%
+-commutative46.6%
associate-+r-46.6%
*-commutative46.6%
associate-*r*38.9%
*-commutative38.9%
associate-+r-38.9%
+-commutative38.9%
associate-*l*38.9%
associate-*l*49.9%
*-commutative49.9%
Simplified49.9%
Taylor expanded in a around inf 70.2%
Taylor expanded in c around 0 79.5%
Taylor expanded in x around 0 76.6%
Final simplification84.8%
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.5e+16) (not (<= z 3.5e+22))) (/ (* a (+ (* -4.0 t) (/ b (* z a)))) c) (/ (+ b (* 9.0 (* y x))) (* 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) {
double tmp;
if ((z <= -2.5e+16) || !(z <= 3.5e+22)) {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
} else {
tmp = (b + (9.0 * (y * x))) / (z * c);
}
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 ((z <= (-2.5d+16)) .or. (.not. (z <= 3.5d+22))) then
tmp = (a * (((-4.0d0) * t) + (b / (z * a)))) / c
else
tmp = (b + (9.0d0 * (y * x))) / (z * c)
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 ((z <= -2.5e+16) || !(z <= 3.5e+22)) {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
} else {
tmp = (b + (9.0 * (y * x))) / (z * c);
}
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 (z <= -2.5e+16) or not (z <= 3.5e+22): tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c else: tmp = (b + (9.0 * (y * x))) / (z * c) 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.5e+16) || !(z <= 3.5e+22)) tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(b / Float64(z * a)))) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(y * x))) / Float64(z * c)); 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 ((z <= -2.5e+16) || ~((z <= 3.5e+22)))
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
else
tmp = (b + (9.0 * (y * x))) / (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. 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.5e+16], N[Not[LessEqual[z, 3.5e+22]], $MachinePrecision]], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(y * x), $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])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.5 \cdot 10^{+16} \lor \neg \left(z \leq 3.5 \cdot 10^{+22}\right):\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \frac{b}{z \cdot a}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(y \cdot x\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.5e16 or 3.5e22 < z Initial program 54.9%
+-commutative54.9%
associate-+r-54.9%
*-commutative54.9%
associate-*r*54.6%
*-commutative54.6%
associate-+r-54.6%
+-commutative54.6%
associate-*l*54.6%
associate-*l*61.1%
*-commutative61.1%
Simplified61.1%
Taylor expanded in a around inf 69.7%
Taylor expanded in c around 0 77.9%
Taylor expanded in x around 0 74.1%
if -2.5e16 < z < 3.5e22Initial program 94.8%
+-commutative94.8%
associate-+r-94.8%
*-commutative94.8%
associate-*r*94.7%
*-commutative94.7%
associate-+r-94.7%
+-commutative94.7%
associate-*l*94.7%
associate-*l*88.0%
*-commutative88.0%
Simplified88.0%
Taylor expanded in x around inf 82.0%
Final simplification77.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 (if (or (<= z -8.2e+29) (not (<= z 3.4e+21))) (/ (* a (+ (* -4.0 t) (/ b (* z a)))) c) (/ (+ (* 9.0 (/ (* y x) 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 ((z <= -8.2e+29) || !(z <= 3.4e+21)) {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
} else {
tmp = ((9.0 * ((y * x) / c)) + (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 ((z <= (-8.2d+29)) .or. (.not. (z <= 3.4d+21))) then
tmp = (a * (((-4.0d0) * t) + (b / (z * a)))) / c
else
tmp = ((9.0d0 * ((y * x) / c)) + (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 ((z <= -8.2e+29) || !(z <= 3.4e+21)) {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
} else {
tmp = ((9.0 * ((y * x) / c)) + (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 (z <= -8.2e+29) or not (z <= 3.4e+21): tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c else: tmp = ((9.0 * ((y * x) / c)) + (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 ((z <= -8.2e+29) || !(z <= 3.4e+21)) tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(b / Float64(z * a)))) / c); else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y * x) / c)) + 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 ((z <= -8.2e+29) || ~((z <= 3.4e+21)))
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
else
tmp = ((9.0 * ((y * x) / c)) + (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[Or[LessEqual[z, -8.2e+29], N[Not[LessEqual[z, 3.4e+21]], $MachinePrecision]], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $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}\;z \leq -8.2 \cdot 10^{+29} \lor \neg \left(z \leq 3.4 \cdot 10^{+21}\right):\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \frac{b}{z \cdot a}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{9 \cdot \frac{y \cdot x}{c} + \frac{b}{c}}{z}\\
\end{array}
\end{array}
if z < -8.2000000000000007e29 or 3.4e21 < z Initial program 54.6%
+-commutative54.6%
associate-+r-54.6%
*-commutative54.6%
associate-*r*54.3%
*-commutative54.3%
associate-+r-54.3%
+-commutative54.3%
associate-*l*54.3%
associate-*l*60.9%
*-commutative60.9%
Simplified60.9%
Taylor expanded in a around inf 69.8%
Taylor expanded in c around 0 78.8%
Taylor expanded in x around 0 74.9%
if -8.2000000000000007e29 < z < 3.4e21Initial program 94.1%
+-commutative94.1%
associate-+r-94.1%
*-commutative94.1%
associate-*r*94.1%
*-commutative94.1%
associate-+r-94.1%
+-commutative94.1%
associate-*l*94.0%
associate-*l*87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around 0 94.0%
fma-define94.0%
associate-/l*94.8%
associate-/l*92.3%
fma-define92.3%
associate-/l*89.6%
Simplified89.6%
Taylor expanded in a around 0 81.6%
Final simplification77.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.2e+29)
(* t (/ (- (/ (/ b z) t) (* a 4.0)) c))
(if (<= z 1.2e+23)
(/ (+ (* 9.0 (/ (* y x) c)) (/ b c)) z)
(/ (* a (+ (* -4.0 t) (/ b (* z a)))) 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) {
double tmp;
if (z <= -1.2e+29) {
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
} else if (z <= 1.2e+23) {
tmp = ((9.0 * ((y * x) / c)) + (b / c)) / z;
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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 (z <= (-1.2d+29)) then
tmp = t * ((((b / z) / t) - (a * 4.0d0)) / c)
else if (z <= 1.2d+23) then
tmp = ((9.0d0 * ((y * x) / c)) + (b / c)) / z
else
tmp = (a * (((-4.0d0) * t) + (b / (z * a)))) / c
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 (z <= -1.2e+29) {
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
} else if (z <= 1.2e+23) {
tmp = ((9.0 * ((y * x) / c)) + (b / c)) / z;
} else {
tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c;
}
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 z <= -1.2e+29: tmp = t * ((((b / z) / t) - (a * 4.0)) / c) elif z <= 1.2e+23: tmp = ((9.0 * ((y * x) / c)) + (b / c)) / z else: tmp = (a * ((-4.0 * t) + (b / (z * a)))) / c 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.2e+29) tmp = Float64(t * Float64(Float64(Float64(Float64(b / z) / t) - Float64(a * 4.0)) / c)); elseif (z <= 1.2e+23) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y * x) / c)) + Float64(b / c)) / z); else tmp = Float64(Float64(a * Float64(Float64(-4.0 * t) + Float64(b / Float64(z * a)))) / c); 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 (z <= -1.2e+29)
tmp = t * ((((b / z) / t) - (a * 4.0)) / c);
elseif (z <= 1.2e+23)
tmp = ((9.0 * ((y * x) / c)) + (b / c)) / z;
else
tmp = (a * ((-4.0 * t) + (b / (z * 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. 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.2e+29], N[(t * N[(N[(N[(N[(b / z), $MachinePrecision] / t), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.2e+23], N[(N[(N[(9.0 * N[(N[(y * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(a * N[(N[(-4.0 * t), $MachinePrecision] + N[(b / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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.2 \cdot 10^{+29}:\\
\;\;\;\;t \cdot \frac{\frac{\frac{b}{z}}{t} - a \cdot 4}{c}\\
\mathbf{elif}\;z \leq 1.2 \cdot 10^{+23}:\\
\;\;\;\;\frac{9 \cdot \frac{y \cdot x}{c} + \frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{a \cdot \left(-4 \cdot t + \frac{b}{z \cdot a}\right)}{c}\\
\end{array}
\end{array}
if z < -1.2e29Initial program 57.3%
+-commutative57.3%
associate-+r-57.3%
*-commutative57.3%
associate-*r*63.8%
*-commutative63.8%
associate-+r-63.8%
+-commutative63.8%
associate-*l*63.8%
associate-*l*67.2%
*-commutative67.2%
Simplified67.2%
Taylor expanded in t around inf 69.7%
Taylor expanded in x around 0 68.7%
Taylor expanded in c around -inf 74.3%
mul-1-neg74.3%
associate-/l*72.9%
distribute-rgt-neg-in72.9%
distribute-neg-frac272.9%
+-commutative72.9%
mul-1-neg72.9%
unsub-neg72.9%
*-commutative72.9%
*-commutative72.9%
associate-/r*75.7%
Simplified75.7%
if -1.2e29 < z < 1.2e23Initial program 94.1%
+-commutative94.1%
associate-+r-94.1%
*-commutative94.1%
associate-*r*94.1%
*-commutative94.1%
associate-+r-94.1%
+-commutative94.1%
associate-*l*94.0%
associate-*l*87.5%
*-commutative87.5%
Simplified87.5%
Taylor expanded in z around 0 94.0%
fma-define94.0%
associate-/l*94.8%
associate-/l*92.3%
fma-define92.3%
associate-/l*89.6%
Simplified89.6%
Taylor expanded in a around 0 81.6%
if 1.2e23 < z Initial program 52.0%
+-commutative52.0%
associate-+r-52.0%
*-commutative52.0%
associate-*r*45.3%
*-commutative45.3%
associate-+r-45.3%
+-commutative45.3%
associate-*l*45.3%
associate-*l*54.9%
*-commutative54.9%
Simplified54.9%
Taylor expanded in a around inf 71.2%
Taylor expanded in c around 0 80.8%
Taylor expanded in x around 0 76.8%
Final simplification78.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 (or (<= b -5e+80) (not (<= b 3.6e+89))) (/ (/ b c) z) (* a (/ (* -4.0 t) 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) {
double tmp;
if ((b <= -5e+80) || !(b <= 3.6e+89)) {
tmp = (b / c) / z;
} else {
tmp = a * ((-4.0 * t) / c);
}
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 <= (-5d+80)) .or. (.not. (b <= 3.6d+89))) then
tmp = (b / c) / z
else
tmp = a * (((-4.0d0) * t) / c)
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 <= -5e+80) || !(b <= 3.6e+89)) {
tmp = (b / c) / z;
} else {
tmp = a * ((-4.0 * t) / c);
}
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 <= -5e+80) or not (b <= 3.6e+89): tmp = (b / c) / z else: tmp = a * ((-4.0 * t) / c) 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 <= -5e+80) || !(b <= 3.6e+89)) tmp = Float64(Float64(b / c) / z); else tmp = Float64(a * Float64(Float64(-4.0 * t) / c)); 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 <= -5e+80) || ~((b <= 3.6e+89)))
tmp = (b / c) / z;
else
tmp = a * ((-4.0 * 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. 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[b, -5e+80], N[Not[LessEqual[b, 3.6e+89]], $MachinePrecision]], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(a * N[(N[(-4.0 * t), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -5 \cdot 10^{+80} \lor \neg \left(b \leq 3.6 \cdot 10^{+89}\right):\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{-4 \cdot t}{c}\\
\end{array}
\end{array}
if b < -4.99999999999999961e80 or 3.6e89 < b Initial program 72.6%
+-commutative72.6%
associate-+r-72.6%
*-commutative72.6%
associate-*r*71.7%
*-commutative71.7%
associate-+r-71.7%
+-commutative71.7%
associate-*l*71.7%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in b around inf 50.9%
associate-/r*63.2%
Simplified63.2%
if -4.99999999999999961e80 < b < 3.6e89Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*73.0%
*-commutative73.0%
associate-+r-73.0%
+-commutative73.0%
associate-*l*73.0%
associate-*l*71.4%
*-commutative71.4%
Simplified71.4%
Taylor expanded in z around inf 50.3%
*-commutative50.3%
associate-/l*49.7%
associate-*r*49.7%
associate-*l/49.8%
Simplified49.8%
Final simplification55.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 (or (<= b -2.55e+82) (not (<= b 9.5e+89))) (/ (/ b c) z) (* t (* a (/ -4.0 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) {
double tmp;
if ((b <= -2.55e+82) || !(b <= 9.5e+89)) {
tmp = (b / c) / z;
} else {
tmp = t * (a * (-4.0 / c));
}
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 <= (-2.55d+82)) .or. (.not. (b <= 9.5d+89))) then
tmp = (b / c) / z
else
tmp = t * (a * ((-4.0d0) / c))
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 <= -2.55e+82) || !(b <= 9.5e+89)) {
tmp = (b / c) / z;
} else {
tmp = t * (a * (-4.0 / c));
}
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 <= -2.55e+82) or not (b <= 9.5e+89): tmp = (b / c) / z else: tmp = t * (a * (-4.0 / c)) 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 <= -2.55e+82) || !(b <= 9.5e+89)) tmp = Float64(Float64(b / c) / z); else tmp = Float64(t * Float64(a * Float64(-4.0 / c))); 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 <= -2.55e+82) || ~((b <= 9.5e+89)))
tmp = (b / c) / z;
else
tmp = t * (a * (-4.0 / 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. 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[b, -2.55e+82], N[Not[LessEqual[b, 9.5e+89]], $MachinePrecision]], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(t * N[(a * N[(-4.0 / c), $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}\;b \leq -2.55 \cdot 10^{+82} \lor \neg \left(b \leq 9.5 \cdot 10^{+89}\right):\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(a \cdot \frac{-4}{c}\right)\\
\end{array}
\end{array}
if b < -2.5500000000000001e82 or 9.5000000000000003e89 < b Initial program 72.6%
+-commutative72.6%
associate-+r-72.6%
*-commutative72.6%
associate-*r*71.7%
*-commutative71.7%
associate-+r-71.7%
+-commutative71.7%
associate-*l*71.7%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in b around inf 50.9%
associate-/r*63.2%
Simplified63.2%
if -2.5500000000000001e82 < b < 9.5000000000000003e89Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*73.0%
*-commutative73.0%
associate-+r-73.0%
+-commutative73.0%
associate-*l*73.0%
associate-*l*71.4%
*-commutative71.4%
Simplified71.4%
Taylor expanded in t around inf 72.8%
Taylor expanded in x around 0 56.6%
Taylor expanded in a around inf 53.5%
associate-*r/53.5%
*-commutative53.5%
associate-/l*53.4%
Simplified53.4%
Final simplification57.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 (or (<= b -2.9e+79) (not (<= b 7.8e+89))) (/ (/ b c) z) (* (/ a c) (* -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 ((b <= -2.9e+79) || !(b <= 7.8e+89)) {
tmp = (b / c) / z;
} else {
tmp = (a / c) * (-4.0 * 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 ((b <= (-2.9d+79)) .or. (.not. (b <= 7.8d+89))) then
tmp = (b / c) / z
else
tmp = (a / c) * ((-4.0d0) * 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 ((b <= -2.9e+79) || !(b <= 7.8e+89)) {
tmp = (b / c) / z;
} else {
tmp = (a / c) * (-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]) def code(x, y, z, t, a, b, c): tmp = 0 if (b <= -2.9e+79) or not (b <= 7.8e+89): tmp = (b / c) / z else: tmp = (a / c) * (-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 ((b <= -2.9e+79) || !(b <= 7.8e+89)) tmp = Float64(Float64(b / c) / z); else tmp = Float64(Float64(a / c) * Float64(-4.0 * 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 ((b <= -2.9e+79) || ~((b <= 7.8e+89)))
tmp = (b / c) / z;
else
tmp = (a / c) * (-4.0 * 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[Or[LessEqual[b, -2.9e+79], N[Not[LessEqual[b, 7.8e+89]], $MachinePrecision]], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(N[(a / c), $MachinePrecision] * N[(-4.0 * 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}\;b \leq -2.9 \cdot 10^{+79} \lor \neg \left(b \leq 7.8 \cdot 10^{+89}\right):\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{a}{c} \cdot \left(-4 \cdot t\right)\\
\end{array}
\end{array}
if b < -2.89999999999999992e79 or 7.80000000000000021e89 < b Initial program 72.6%
+-commutative72.6%
associate-+r-72.6%
*-commutative72.6%
associate-*r*71.7%
*-commutative71.7%
associate-+r-71.7%
+-commutative71.7%
associate-*l*71.7%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in b around inf 50.9%
associate-/r*63.2%
Simplified63.2%
if -2.89999999999999992e79 < b < 7.80000000000000021e89Initial program 72.7%
+-commutative72.7%
associate-+r-72.7%
*-commutative72.7%
associate-*r*73.0%
*-commutative73.0%
associate-+r-73.0%
+-commutative73.0%
associate-*l*73.0%
associate-*l*71.4%
*-commutative71.4%
Simplified71.4%
Taylor expanded in z around 0 76.4%
fma-define76.4%
associate-/l*80.6%
fma-define80.6%
associate-/l*79.8%
Simplified79.8%
Taylor expanded in a around inf 50.3%
*-commutative50.3%
associate-/l*53.5%
associate-*l*53.5%
*-commutative53.5%
*-commutative53.5%
Simplified53.5%
Final simplification57.3%
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 72.6%
+-commutative72.6%
associate-+r-72.6%
*-commutative72.6%
associate-*r*72.5%
*-commutative72.5%
associate-+r-72.5%
+-commutative72.5%
associate-*l*72.5%
associate-*l*73.1%
*-commutative73.1%
Simplified73.1%
Taylor expanded in b around inf 29.6%
*-commutative29.6%
Simplified29.6%
Final simplification29.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 72.6%
+-commutative72.6%
associate-+r-72.6%
*-commutative72.6%
associate-*r*72.5%
*-commutative72.5%
associate-+r-72.5%
+-commutative72.5%
associate-*l*72.5%
associate-*l*73.1%
*-commutative73.1%
Simplified73.1%
Taylor expanded in b around inf 29.6%
associate-/r*34.0%
Simplified34.0%
Final simplification34.0%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024055
(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)))