
(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 19 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 (* y (* x 9.0)))
(t_2 (* 4.0 (* t a)))
(t_3 (* x (/ (+ (/ (* 9.0 y) z) (* -4.0 (* a (/ t x)))) c))))
(if (<= t_1 -2e+206)
t_3
(if (<= t_1 -1e+68)
(/ (+ b (- t_1 (* a (* (* z 4.0) t)))) (* c z))
(if (<= t_1 1e-161)
(/ (- (/ b z) t_2) c)
(if (<= t_1 2e+180)
(/ (- b (* z (- t_2 (* 9.0 (/ (* x y) z))))) (* c z))
t_3))))))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 = y * (x * 9.0);
double t_2 = 4.0 * (t * a);
double t_3 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
double tmp;
if (t_1 <= -2e+206) {
tmp = t_3;
} else if (t_1 <= -1e+68) {
tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z);
} else if (t_1 <= 1e-161) {
tmp = ((b / z) - t_2) / c;
} else if (t_1 <= 2e+180) {
tmp = (b - (z * (t_2 - (9.0 * ((x * y) / z))))) / (c * z);
} else {
tmp = t_3;
}
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) :: t_3
real(8) :: tmp
t_1 = y * (x * 9.0d0)
t_2 = 4.0d0 * (t * a)
t_3 = x * ((((9.0d0 * y) / z) + ((-4.0d0) * (a * (t / x)))) / c)
if (t_1 <= (-2d+206)) then
tmp = t_3
else if (t_1 <= (-1d+68)) then
tmp = (b + (t_1 - (a * ((z * 4.0d0) * t)))) / (c * z)
else if (t_1 <= 1d-161) then
tmp = ((b / z) - t_2) / c
else if (t_1 <= 2d+180) then
tmp = (b - (z * (t_2 - (9.0d0 * ((x * y) / z))))) / (c * z)
else
tmp = t_3
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 = y * (x * 9.0);
double t_2 = 4.0 * (t * a);
double t_3 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
double tmp;
if (t_1 <= -2e+206) {
tmp = t_3;
} else if (t_1 <= -1e+68) {
tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z);
} else if (t_1 <= 1e-161) {
tmp = ((b / z) - t_2) / c;
} else if (t_1 <= 2e+180) {
tmp = (b - (z * (t_2 - (9.0 * ((x * y) / z))))) / (c * z);
} else {
tmp = t_3;
}
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 = y * (x * 9.0) t_2 = 4.0 * (t * a) t_3 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c) tmp = 0 if t_1 <= -2e+206: tmp = t_3 elif t_1 <= -1e+68: tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z) elif t_1 <= 1e-161: tmp = ((b / z) - t_2) / c elif t_1 <= 2e+180: tmp = (b - (z * (t_2 - (9.0 * ((x * y) / z))))) / (c * z) else: tmp = t_3 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(y * Float64(x * 9.0)) t_2 = Float64(4.0 * Float64(t * a)) t_3 = Float64(x * Float64(Float64(Float64(Float64(9.0 * y) / z) + Float64(-4.0 * Float64(a * Float64(t / x)))) / c)) tmp = 0.0 if (t_1 <= -2e+206) tmp = t_3; elseif (t_1 <= -1e+68) tmp = Float64(Float64(b + Float64(t_1 - Float64(a * Float64(Float64(z * 4.0) * t)))) / Float64(c * z)); elseif (t_1 <= 1e-161) tmp = Float64(Float64(Float64(b / z) - t_2) / c); elseif (t_1 <= 2e+180) tmp = Float64(Float64(b - Float64(z * Float64(t_2 - Float64(9.0 * Float64(Float64(x * y) / z))))) / Float64(c * z)); else tmp = t_3; 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 = y * (x * 9.0);
t_2 = 4.0 * (t * a);
t_3 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
tmp = 0.0;
if (t_1 <= -2e+206)
tmp = t_3;
elseif (t_1 <= -1e+68)
tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z);
elseif (t_1 <= 1e-161)
tmp = ((b / z) - t_2) / c;
elseif (t_1 <= 2e+180)
tmp = (b - (z * (t_2 - (9.0 * ((x * y) / z))))) / (c * z);
else
tmp = t_3;
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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(x * N[(N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] + N[(-4.0 * N[(a * N[(t / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+206], t$95$3, If[LessEqual[t$95$1, -1e+68], N[(N[(b + N[(t$95$1 - N[(a * N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-161], N[(N[(N[(b / z), $MachinePrecision] - t$95$2), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 2e+180], N[(N[(b - N[(z * N[(t$95$2 - N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$3]]]]]]]
\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 := y \cdot \left(x \cdot 9\right)\\
t_2 := 4 \cdot \left(t \cdot a\right)\\
t_3 := x \cdot \frac{\frac{9 \cdot y}{z} + -4 \cdot \left(a \cdot \frac{t}{x}\right)}{c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+206}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+68}:\\
\;\;\;\;\frac{b + \left(t\_1 - a \cdot \left(\left(z \cdot 4\right) \cdot t\right)\right)}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 10^{-161}:\\
\;\;\;\;\frac{\frac{b}{z} - t\_2}{c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+180}:\\
\;\;\;\;\frac{b - z \cdot \left(t\_2 - 9 \cdot \frac{x \cdot y}{z}\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.0000000000000001e206 or 2e180 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.1%
associate-+l-70.1%
*-commutative70.1%
associate-*r*68.6%
*-commutative68.6%
associate-+l-68.6%
associate-*l*68.5%
associate-*l*70.0%
*-commutative70.0%
Simplified70.0%
Taylor expanded in x around inf 78.8%
Taylor expanded in c around 0 86.5%
Taylor expanded in b around 0 84.8%
associate-/l*87.9%
cancel-sign-sub-inv87.9%
associate-*r/87.7%
metadata-eval87.7%
associate-*r/93.7%
Simplified93.7%
if -2.0000000000000001e206 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999953e67Initial program 90.5%
if -9.99999999999999953e67 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000003e-161Initial program 75.8%
associate-+l-75.8%
*-commutative75.8%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.5%
*-commutative77.5%
Simplified77.5%
Taylor expanded in x around inf 60.5%
Taylor expanded in c around 0 69.0%
Taylor expanded in x around 0 92.9%
if 1.00000000000000003e-161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2e180Initial program 80.2%
associate-+l-80.2%
*-commutative80.2%
associate-*r*77.2%
*-commutative77.2%
associate-+l-77.2%
associate-*l*77.2%
associate-*l*84.7%
*-commutative84.7%
Simplified84.7%
Taylor expanded in z around inf 84.7%
Final simplification90.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 (<= c 4.6e+30)
(/ (- b (- (* (* z 4.0) (* t a)) (* x (* 9.0 y)))) (* c z))
(*
t
(- (/ (fma (/ 9.0 z) (* x (/ y c)) (/ b (* c z))) t) (* 4.0 (/ 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 (c <= 4.6e+30) {
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (c * z);
} else {
tmp = t * ((fma((9.0 / z), (x * (y / c)), (b / (c * z))) / t) - (4.0 * (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 (c <= 4.6e+30) tmp = Float64(Float64(b - Float64(Float64(Float64(z * 4.0) * Float64(t * a)) - Float64(x * Float64(9.0 * y)))) / Float64(c * z)); else tmp = Float64(t * Float64(Float64(fma(Float64(9.0 / z), Float64(x * Float64(y / c)), Float64(b / Float64(c * z))) / t) - Float64(4.0 * Float64(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_] := If[LessEqual[c, 4.6e+30], N[(N[(b - N[(N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(N[(N[(9.0 / z), $MachinePrecision] * N[(x * N[(y / c), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - N[(4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;c \leq 4.6 \cdot 10^{+30}:\\
\;\;\;\;\frac{b - \left(\left(z \cdot 4\right) \cdot \left(t \cdot a\right) - x \cdot \left(9 \cdot y\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(\frac{\mathsf{fma}\left(\frac{9}{z}, x \cdot \frac{y}{c}, \frac{b}{c \cdot z}\right)}{t} - 4 \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if c < 4.6e30Initial program 82.9%
associate-+l-82.9%
*-commutative82.9%
associate-*r*81.8%
*-commutative81.8%
associate-+l-81.8%
associate-*l*81.8%
associate-*l*85.6%
*-commutative85.6%
Simplified85.6%
if 4.6e30 < c Initial program 57.3%
associate-+l-57.3%
*-commutative57.3%
associate-*r*55.6%
*-commutative55.6%
associate-+l-55.6%
Simplified55.6%
Taylor expanded in t around -inf 79.8%
mul-1-neg79.8%
*-commutative79.8%
distribute-rgt-neg-in79.8%
Simplified81.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
(let* ((t_1 (* a (* c z))))
(if (<= z -3e-60)
(* a (+ (* -4.0 (/ t c)) (+ (* 9.0 (/ (* x y) t_1)) (/ b t_1))))
(if (<= z 4.2e+23)
(/ (+ b (fma x (* 9.0 y) (* t (* a (* z -4.0))))) (* c z))
(/
(* x (- (+ (* 9.0 (/ y z)) (/ b (* x z))) (* 4.0 (/ (* t a) x))))
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 = a * (c * z);
double tmp;
if (z <= -3e-60) {
tmp = a * ((-4.0 * (t / c)) + ((9.0 * ((x * y) / t_1)) + (b / t_1)));
} else if (z <= 4.2e+23) {
tmp = (b + fma(x, (9.0 * y), (t * (a * (z * -4.0))))) / (c * z);
} else {
tmp = (x * (((9.0 * (y / z)) + (b / (x * z))) - (4.0 * ((t * a) / x)))) / 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(a * Float64(c * z)) tmp = 0.0 if (z <= -3e-60) tmp = Float64(a * Float64(Float64(-4.0 * Float64(t / c)) + Float64(Float64(9.0 * Float64(Float64(x * y) / t_1)) + Float64(b / t_1)))); elseif (z <= 4.2e+23) tmp = Float64(Float64(b + fma(x, Float64(9.0 * y), Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(c * z)); else tmp = Float64(Float64(x * Float64(Float64(Float64(9.0 * Float64(y / z)) + Float64(b / Float64(x * z))) - Float64(4.0 * Float64(Float64(t * a) / x)))) / 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[(a * N[(c * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3e-60], N[(a * N[(N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] + N[(b / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.2e+23], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(N[(N[(9.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(t * a), $MachinePrecision] / x), $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 := a \cdot \left(c \cdot z\right)\\
\mathbf{if}\;z \leq -3 \cdot 10^{-60}:\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c} + \left(9 \cdot \frac{x \cdot y}{t\_1} + \frac{b}{t\_1}\right)\right)\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{+23}:\\
\;\;\;\;\frac{b + \mathsf{fma}\left(x, 9 \cdot y, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot \left(\left(9 \cdot \frac{y}{z} + \frac{b}{x \cdot z}\right) - 4 \cdot \frac{t \cdot a}{x}\right)}{c}\\
\end{array}
\end{array}
if z < -3.00000000000000019e-60Initial program 65.9%
associate-+l-65.9%
*-commutative65.9%
associate-*r*62.3%
*-commutative62.3%
associate-+l-62.3%
Simplified62.3%
Taylor expanded in a around inf 76.7%
if -3.00000000000000019e-60 < z < 4.2000000000000003e23Initial program 96.7%
associate-+l-96.7%
*-commutative96.7%
associate-*r*96.7%
*-commutative96.7%
associate-+l-96.7%
Simplified96.7%
if 4.2000000000000003e23 < z Initial program 57.9%
associate-+l-57.9%
*-commutative57.9%
associate-*r*57.4%
*-commutative57.4%
associate-+l-57.4%
associate-*l*57.4%
associate-*l*64.8%
*-commutative64.8%
Simplified64.8%
Taylor expanded in x around inf 69.2%
Taylor expanded in c around 0 80.3%
Final simplification86.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
(let* ((t_1 (* y (* x 9.0)))
(t_2 (* x (/ (+ (/ (* 9.0 y) z) (* -4.0 (* a (/ t x)))) c))))
(if (<= t_1 -2e+206)
t_2
(if (<= t_1 -1e+68)
(/ (+ b (- t_1 (* a (* (* z 4.0) t)))) (* c z))
(if (<= t_1 1e-161)
(/ (- (/ b z) (* 4.0 (* t a))) c)
(if (<= t_1 5e+173)
(/ (- b (- (* (* z 4.0) (* t a)) (* x (* 9.0 y)))) (* c z))
t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (x * 9.0);
double t_2 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
double tmp;
if (t_1 <= -2e+206) {
tmp = t_2;
} else if (t_1 <= -1e+68) {
tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z);
} else if (t_1 <= 1e-161) {
tmp = ((b / z) - (4.0 * (t * a))) / c;
} else if (t_1 <= 5e+173) {
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (c * z);
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = y * (x * 9.0d0)
t_2 = x * ((((9.0d0 * y) / z) + ((-4.0d0) * (a * (t / x)))) / c)
if (t_1 <= (-2d+206)) then
tmp = t_2
else if (t_1 <= (-1d+68)) then
tmp = (b + (t_1 - (a * ((z * 4.0d0) * t)))) / (c * z)
else if (t_1 <= 1d-161) then
tmp = ((b / z) - (4.0d0 * (t * a))) / c
else if (t_1 <= 5d+173) then
tmp = (b - (((z * 4.0d0) * (t * a)) - (x * (9.0d0 * y)))) / (c * z)
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (x * 9.0);
double t_2 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
double tmp;
if (t_1 <= -2e+206) {
tmp = t_2;
} else if (t_1 <= -1e+68) {
tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z);
} else if (t_1 <= 1e-161) {
tmp = ((b / z) - (4.0 * (t * a))) / c;
} else if (t_1 <= 5e+173) {
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (c * z);
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = y * (x * 9.0) t_2 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c) tmp = 0 if t_1 <= -2e+206: tmp = t_2 elif t_1 <= -1e+68: tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z) elif t_1 <= 1e-161: tmp = ((b / z) - (4.0 * (t * a))) / c elif t_1 <= 5e+173: tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (c * z) else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(y * Float64(x * 9.0)) t_2 = Float64(x * Float64(Float64(Float64(Float64(9.0 * y) / z) + Float64(-4.0 * Float64(a * Float64(t / x)))) / c)) tmp = 0.0 if (t_1 <= -2e+206) tmp = t_2; elseif (t_1 <= -1e+68) tmp = Float64(Float64(b + Float64(t_1 - Float64(a * Float64(Float64(z * 4.0) * t)))) / Float64(c * z)); elseif (t_1 <= 1e-161) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(t * a))) / c); elseif (t_1 <= 5e+173) tmp = Float64(Float64(b - Float64(Float64(Float64(z * 4.0) * Float64(t * a)) - Float64(x * Float64(9.0 * y)))) / Float64(c * z)); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = y * (x * 9.0);
t_2 = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
tmp = 0.0;
if (t_1 <= -2e+206)
tmp = t_2;
elseif (t_1 <= -1e+68)
tmp = (b + (t_1 - (a * ((z * 4.0) * t)))) / (c * z);
elseif (t_1 <= 1e-161)
tmp = ((b / z) - (4.0 * (t * a))) / c;
elseif (t_1 <= 5e+173)
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (c * z);
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] + N[(-4.0 * N[(a * N[(t / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+206], t$95$2, If[LessEqual[t$95$1, -1e+68], N[(N[(b + N[(t$95$1 - N[(a * N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-161], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 5e+173], N[(N[(b - N[(N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
t_2 := x \cdot \frac{\frac{9 \cdot y}{z} + -4 \cdot \left(a \cdot \frac{t}{x}\right)}{c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+206}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+68}:\\
\;\;\;\;\frac{b + \left(t\_1 - a \cdot \left(\left(z \cdot 4\right) \cdot t\right)\right)}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 10^{-161}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+173}:\\
\;\;\;\;\frac{b - \left(\left(z \cdot 4\right) \cdot \left(t \cdot a\right) - x \cdot \left(9 \cdot y\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.0000000000000001e206 or 5.00000000000000034e173 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 71.0%
associate-+l-71.0%
*-commutative71.0%
associate-*r*69.5%
*-commutative69.5%
associate-+l-69.5%
associate-*l*69.5%
associate-*l*70.9%
*-commutative70.9%
Simplified70.9%
Taylor expanded in x around inf 77.9%
Taylor expanded in c around 0 86.9%
Taylor expanded in b around 0 85.3%
associate-/l*88.2%
cancel-sign-sub-inv88.2%
associate-*r/88.1%
metadata-eval88.1%
associate-*r/93.9%
Simplified93.9%
if -2.0000000000000001e206 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999953e67Initial program 90.5%
if -9.99999999999999953e67 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000003e-161Initial program 75.8%
associate-+l-75.8%
*-commutative75.8%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.5%
*-commutative77.5%
Simplified77.5%
Taylor expanded in x around inf 60.5%
Taylor expanded in c around 0 69.0%
Taylor expanded in x around 0 92.9%
if 1.00000000000000003e-161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.00000000000000034e173Initial program 79.6%
associate-+l-79.6%
*-commutative79.6%
associate-*r*76.5%
*-commutative76.5%
associate-+l-76.5%
associate-*l*76.5%
associate-*l*84.2%
*-commutative84.2%
Simplified84.2%
Final simplification90.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
(let* ((t_1 (* a (* c z))))
(if (<= z -2.9e-60)
(* a (+ (* -4.0 (/ t c)) (+ (* 9.0 (/ (* x y) t_1)) (/ b t_1))))
(if (<= z 1e+25)
(/ (+ b (- (* y (* x 9.0)) (* a (* (* z 4.0) t)))) (* c z))
(/
(* x (- (+ (* 9.0 (/ y z)) (/ b (* x z))) (* 4.0 (/ (* t a) x))))
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 = a * (c * z);
double tmp;
if (z <= -2.9e-60) {
tmp = a * ((-4.0 * (t / c)) + ((9.0 * ((x * y) / t_1)) + (b / t_1)));
} else if (z <= 1e+25) {
tmp = (b + ((y * (x * 9.0)) - (a * ((z * 4.0) * t)))) / (c * z);
} else {
tmp = (x * (((9.0 * (y / z)) + (b / (x * z))) - (4.0 * ((t * a) / x)))) / 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 = a * (c * z)
if (z <= (-2.9d-60)) then
tmp = a * (((-4.0d0) * (t / c)) + ((9.0d0 * ((x * y) / t_1)) + (b / t_1)))
else if (z <= 1d+25) then
tmp = (b + ((y * (x * 9.0d0)) - (a * ((z * 4.0d0) * t)))) / (c * z)
else
tmp = (x * (((9.0d0 * (y / z)) + (b / (x * z))) - (4.0d0 * ((t * a) / x)))) / 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 = a * (c * z);
double tmp;
if (z <= -2.9e-60) {
tmp = a * ((-4.0 * (t / c)) + ((9.0 * ((x * y) / t_1)) + (b / t_1)));
} else if (z <= 1e+25) {
tmp = (b + ((y * (x * 9.0)) - (a * ((z * 4.0) * t)))) / (c * z);
} else {
tmp = (x * (((9.0 * (y / z)) + (b / (x * z))) - (4.0 * ((t * a) / x)))) / 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 = a * (c * z) tmp = 0 if z <= -2.9e-60: tmp = a * ((-4.0 * (t / c)) + ((9.0 * ((x * y) / t_1)) + (b / t_1))) elif z <= 1e+25: tmp = (b + ((y * (x * 9.0)) - (a * ((z * 4.0) * t)))) / (c * z) else: tmp = (x * (((9.0 * (y / z)) + (b / (x * z))) - (4.0 * ((t * a) / x)))) / 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(a * Float64(c * z)) tmp = 0.0 if (z <= -2.9e-60) tmp = Float64(a * Float64(Float64(-4.0 * Float64(t / c)) + Float64(Float64(9.0 * Float64(Float64(x * y) / t_1)) + Float64(b / t_1)))); elseif (z <= 1e+25) tmp = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(Float64(z * 4.0) * t)))) / Float64(c * z)); else tmp = Float64(Float64(x * Float64(Float64(Float64(9.0 * Float64(y / z)) + Float64(b / Float64(x * z))) - Float64(4.0 * Float64(Float64(t * a) / x)))) / 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 = a * (c * z);
tmp = 0.0;
if (z <= -2.9e-60)
tmp = a * ((-4.0 * (t / c)) + ((9.0 * ((x * y) / t_1)) + (b / t_1)));
elseif (z <= 1e+25)
tmp = (b + ((y * (x * 9.0)) - (a * ((z * 4.0) * t)))) / (c * z);
else
tmp = (x * (((9.0 * (y / z)) + (b / (x * z))) - (4.0 * ((t * a) / x)))) / 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[(a * N[(c * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.9e-60], N[(a * N[(N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] + N[(b / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1e+25], N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(N[(N[(9.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(t * a), $MachinePrecision] / x), $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 := a \cdot \left(c \cdot z\right)\\
\mathbf{if}\;z \leq -2.9 \cdot 10^{-60}:\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c} + \left(9 \cdot \frac{x \cdot y}{t\_1} + \frac{b}{t\_1}\right)\right)\\
\mathbf{elif}\;z \leq 10^{+25}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(\left(z \cdot 4\right) \cdot t\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot \left(\left(9 \cdot \frac{y}{z} + \frac{b}{x \cdot z}\right) - 4 \cdot \frac{t \cdot a}{x}\right)}{c}\\
\end{array}
\end{array}
if z < -2.8999999999999999e-60Initial program 65.9%
associate-+l-65.9%
*-commutative65.9%
associate-*r*62.3%
*-commutative62.3%
associate-+l-62.3%
Simplified62.3%
Taylor expanded in a around inf 76.7%
if -2.8999999999999999e-60 < z < 1.00000000000000009e25Initial program 96.7%
if 1.00000000000000009e25 < z Initial program 57.9%
associate-+l-57.9%
*-commutative57.9%
associate-*r*57.4%
*-commutative57.4%
associate-+l-57.4%
associate-*l*57.4%
associate-*l*64.8%
*-commutative64.8%
Simplified64.8%
Taylor expanded in x around inf 69.2%
Taylor expanded in c around 0 80.3%
Final simplification86.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 (if (or (<= z -3e+136) (not (<= z 1.4e+199))) (* a (+ (* -4.0 (/ t c)) (/ b (* a (* c z))))) (/ (- b (- (* (* z 4.0) (* t a)) (* x (* 9.0 y)))) (* 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 <= -3e+136) || !(z <= 1.4e+199)) {
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
} else {
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (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 <= (-3d+136)) .or. (.not. (z <= 1.4d+199))) then
tmp = a * (((-4.0d0) * (t / c)) + (b / (a * (c * z))))
else
tmp = (b - (((z * 4.0d0) * (t * a)) - (x * (9.0d0 * y)))) / (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 <= -3e+136) || !(z <= 1.4e+199)) {
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
} else {
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (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 <= -3e+136) or not (z <= 1.4e+199): tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z)))) else: tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (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 <= -3e+136) || !(z <= 1.4e+199)) tmp = Float64(a * Float64(Float64(-4.0 * Float64(t / c)) + Float64(b / Float64(a * Float64(c * z))))); else tmp = Float64(Float64(b - Float64(Float64(Float64(z * 4.0) * Float64(t * a)) - Float64(x * Float64(9.0 * y)))) / Float64(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 <= -3e+136) || ~((z <= 1.4e+199)))
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
else
tmp = (b - (((z * 4.0) * (t * a)) - (x * (9.0 * y)))) / (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, -3e+136], N[Not[LessEqual[z, 1.4e+199]], $MachinePrecision]], N[(a * N[(N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision] + N[(b / N[(a * N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b - N[(N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $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 -3 \cdot 10^{+136} \lor \neg \left(z \leq 1.4 \cdot 10^{+199}\right):\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c} + \frac{b}{a \cdot \left(c \cdot z\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b - \left(\left(z \cdot 4\right) \cdot \left(t \cdot a\right) - x \cdot \left(9 \cdot y\right)\right)}{c \cdot z}\\
\end{array}
\end{array}
if z < -2.99999999999999979e136 or 1.40000000000000005e199 < z Initial program 54.8%
associate-+l-54.8%
*-commutative54.8%
associate-*r*49.0%
*-commutative49.0%
associate-+l-49.0%
Simplified49.0%
Taylor expanded in x around 0 46.9%
metadata-eval46.9%
cancel-sign-sub-inv46.9%
associate-*r*46.9%
*-commutative46.9%
Simplified46.9%
Taylor expanded in a around inf 78.7%
if -2.99999999999999979e136 < z < 1.40000000000000005e199Initial program 86.0%
associate-+l-86.0%
*-commutative86.0%
associate-*r*86.5%
*-commutative86.5%
associate-+l-86.5%
associate-*l*86.5%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Final simplification84.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
(if (<= z -1.6e-60)
(* a (+ (* -4.0 (/ t c)) (/ b (* a (* c z)))))
(if (<= z 4.2e-42)
(/ (+ b (* 9.0 (* x y))) (* c z))
(/ (- (* 9.0 (/ (* x y) z)) (* 4.0 (* t 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-60) {
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
} else if (z <= 4.2e-42) {
tmp = (b + (9.0 * (x * y))) / (c * z);
} else {
tmp = ((9.0 * ((x * y) / z)) - (4.0 * (t * a))) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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-60)) then
tmp = a * (((-4.0d0) * (t / c)) + (b / (a * (c * z))))
else if (z <= 4.2d-42) then
tmp = (b + (9.0d0 * (x * y))) / (c * z)
else
tmp = ((9.0d0 * ((x * y) / z)) - (4.0d0 * (t * 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-60) {
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
} else if (z <= 4.2e-42) {
tmp = (b + (9.0 * (x * y))) / (c * z);
} else {
tmp = ((9.0 * ((x * y) / z)) - (4.0 * (t * 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-60: tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z)))) elif z <= 4.2e-42: tmp = (b + (9.0 * (x * y))) / (c * z) else: tmp = ((9.0 * ((x * y) / z)) - (4.0 * (t * 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-60) tmp = Float64(a * Float64(Float64(-4.0 * Float64(t / c)) + Float64(b / Float64(a * Float64(c * z))))); elseif (z <= 4.2e-42) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(c * z)); else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) - Float64(4.0 * Float64(t * 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-60)
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
elseif (z <= 4.2e-42)
tmp = (b + (9.0 * (x * y))) / (c * z);
else
tmp = ((9.0 * ((x * y) / z)) - (4.0 * (t * a))) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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-60], N[(a * N[(N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision] + N[(b / N[(a * N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.2e-42], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(t * a), $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^{-60}:\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c} + \frac{b}{a \cdot \left(c \cdot z\right)}\right)\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{-42}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{z} - 4 \cdot \left(t \cdot a\right)}{c}\\
\end{array}
\end{array}
if z < -1.6000000000000001e-60Initial program 65.9%
associate-+l-65.9%
*-commutative65.9%
associate-*r*62.3%
*-commutative62.3%
associate-+l-62.3%
Simplified62.3%
Taylor expanded in x around 0 55.3%
metadata-eval55.3%
cancel-sign-sub-inv55.3%
associate-*r*55.3%
*-commutative55.3%
Simplified55.3%
Taylor expanded in a around inf 69.6%
if -1.6000000000000001e-60 < z < 4.20000000000000013e-42Initial program 96.3%
associate-+l-96.3%
*-commutative96.3%
associate-*r*96.3%
*-commutative96.3%
associate-+l-96.3%
Simplified96.3%
Taylor expanded in t around 0 89.5%
if 4.20000000000000013e-42 < z Initial program 65.3%
associate-+l-65.3%
*-commutative65.3%
associate-*r*64.9%
*-commutative64.9%
associate-+l-64.9%
associate-*l*64.9%
associate-*l*71.0%
*-commutative71.0%
Simplified71.0%
Taylor expanded in z around inf 71.0%
Taylor expanded in b around 0 74.0%
Final simplification78.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -1.1e+52)
(* -4.0 (* a (/ t c)))
(if (<= z -1.2e-278)
(* b (/ (/ 1.0 z) c))
(if (<= z 2.5e-19)
(* 9.0 (/ (* x y) (* c z)))
(* -4.0 (/ 1.0 (/ c (* t a))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.1e+52) {
tmp = -4.0 * (a * (t / c));
} else if (z <= -1.2e-278) {
tmp = b * ((1.0 / z) / c);
} else if (z <= 2.5e-19) {
tmp = 9.0 * ((x * y) / (c * z));
} else {
tmp = -4.0 * (1.0 / (c / (t * a)));
}
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.1d+52)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= (-1.2d-278)) then
tmp = b * ((1.0d0 / z) / c)
else if (z <= 2.5d-19) then
tmp = 9.0d0 * ((x * y) / (c * z))
else
tmp = (-4.0d0) * (1.0d0 / (c / (t * a)))
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.1e+52) {
tmp = -4.0 * (a * (t / c));
} else if (z <= -1.2e-278) {
tmp = b * ((1.0 / z) / c);
} else if (z <= 2.5e-19) {
tmp = 9.0 * ((x * y) / (c * z));
} else {
tmp = -4.0 * (1.0 / (c / (t * a)));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -1.1e+52: tmp = -4.0 * (a * (t / c)) elif z <= -1.2e-278: tmp = b * ((1.0 / z) / c) elif z <= 2.5e-19: tmp = 9.0 * ((x * y) / (c * z)) else: tmp = -4.0 * (1.0 / (c / (t * a))) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.1e+52) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= -1.2e-278) tmp = Float64(b * Float64(Float64(1.0 / z) / c)); elseif (z <= 2.5e-19) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(c * z))); else tmp = Float64(-4.0 * Float64(1.0 / Float64(c / Float64(t * a)))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -1.1e+52)
tmp = -4.0 * (a * (t / c));
elseif (z <= -1.2e-278)
tmp = b * ((1.0 / z) / c);
elseif (z <= 2.5e-19)
tmp = 9.0 * ((x * y) / (c * z));
else
tmp = -4.0 * (1.0 / (c / (t * a)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -1.1e+52], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.2e-278], N[(b * N[(N[(1.0 / z), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.5e-19], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(1.0 / N[(c / N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.1 \cdot 10^{+52}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq -1.2 \cdot 10^{-278}:\\
\;\;\;\;b \cdot \frac{\frac{1}{z}}{c}\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{-19}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{1}{\frac{c}{t \cdot a}}\\
\end{array}
\end{array}
if z < -1.1e52Initial program 61.8%
associate-+l-61.8%
*-commutative61.8%
associate-*r*56.9%
*-commutative56.9%
associate-+l-56.9%
Simplified56.9%
Taylor expanded in t around inf 68.4%
associate-/l*69.9%
Applied egg-rr69.9%
if -1.1e52 < z < -1.2e-278Initial program 90.9%
associate-+l-90.9%
*-commutative90.9%
associate-*r*90.9%
*-commutative90.9%
associate-+l-90.9%
associate-*l*90.9%
associate-*l*90.8%
*-commutative90.8%
Simplified90.8%
Taylor expanded in x around inf 59.8%
Taylor expanded in c around 0 72.8%
Taylor expanded in b around inf 49.7%
div-inv49.6%
*-un-lft-identity49.6%
times-frac57.3%
Applied egg-rr57.3%
if -1.2e-278 < z < 2.5000000000000002e-19Initial program 95.7%
associate-+l-95.7%
*-commutative95.7%
associate-*r*95.7%
*-commutative95.7%
associate-+l-95.7%
Simplified95.6%
Taylor expanded in x around inf 56.9%
*-commutative56.9%
Simplified56.9%
if 2.5000000000000002e-19 < z Initial program 63.0%
associate-+l-63.0%
*-commutative63.0%
associate-*r*62.6%
*-commutative62.6%
associate-+l-62.6%
Simplified62.6%
Taylor expanded in t around inf 52.7%
clear-num52.8%
inv-pow52.8%
Applied egg-rr52.8%
unpow-152.8%
Simplified52.8%
Final simplification58.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 -6.8e+26)
(* -4.0 (* a (/ t c)))
(if (<= z -1.85e-279)
(* b (/ 1.0 (* c z)))
(if (<= z 9.8e-20)
(* 9.0 (/ (* x y) (* c z)))
(* -4.0 (/ 1.0 (/ c (* t a))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -6.8e+26) {
tmp = -4.0 * (a * (t / c));
} else if (z <= -1.85e-279) {
tmp = b * (1.0 / (c * z));
} else if (z <= 9.8e-20) {
tmp = 9.0 * ((x * y) / (c * z));
} else {
tmp = -4.0 * (1.0 / (c / (t * a)));
}
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 <= (-6.8d+26)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= (-1.85d-279)) then
tmp = b * (1.0d0 / (c * z))
else if (z <= 9.8d-20) then
tmp = 9.0d0 * ((x * y) / (c * z))
else
tmp = (-4.0d0) * (1.0d0 / (c / (t * a)))
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 <= -6.8e+26) {
tmp = -4.0 * (a * (t / c));
} else if (z <= -1.85e-279) {
tmp = b * (1.0 / (c * z));
} else if (z <= 9.8e-20) {
tmp = 9.0 * ((x * y) / (c * z));
} else {
tmp = -4.0 * (1.0 / (c / (t * a)));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -6.8e+26: tmp = -4.0 * (a * (t / c)) elif z <= -1.85e-279: tmp = b * (1.0 / (c * z)) elif z <= 9.8e-20: tmp = 9.0 * ((x * y) / (c * z)) else: tmp = -4.0 * (1.0 / (c / (t * a))) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -6.8e+26) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= -1.85e-279) tmp = Float64(b * Float64(1.0 / Float64(c * z))); elseif (z <= 9.8e-20) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(c * z))); else tmp = Float64(-4.0 * Float64(1.0 / Float64(c / Float64(t * a)))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -6.8e+26)
tmp = -4.0 * (a * (t / c));
elseif (z <= -1.85e-279)
tmp = b * (1.0 / (c * z));
elseif (z <= 9.8e-20)
tmp = 9.0 * ((x * y) / (c * z));
else
tmp = -4.0 * (1.0 / (c / (t * a)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -6.8e+26], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.85e-279], N[(b * N[(1.0 / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9.8e-20], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(1.0 / N[(c / N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6.8 \cdot 10^{+26}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq -1.85 \cdot 10^{-279}:\\
\;\;\;\;b \cdot \frac{1}{c \cdot z}\\
\mathbf{elif}\;z \leq 9.8 \cdot 10^{-20}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{1}{\frac{c}{t \cdot a}}\\
\end{array}
\end{array}
if z < -6.8000000000000005e26Initial program 62.7%
associate-+l-62.7%
*-commutative62.7%
associate-*r*58.1%
*-commutative58.1%
associate-+l-58.1%
Simplified58.1%
Taylor expanded in t around inf 65.8%
associate-/l*67.2%
Applied egg-rr67.2%
if -6.8000000000000005e26 < z < -1.85000000000000019e-279Initial program 91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
Simplified91.9%
Taylor expanded in b around inf 59.0%
*-commutative59.0%
Simplified59.0%
div-inv59.0%
Applied egg-rr59.0%
if -1.85000000000000019e-279 < z < 9.8000000000000003e-20Initial program 95.7%
associate-+l-95.7%
*-commutative95.7%
associate-*r*95.7%
*-commutative95.7%
associate-+l-95.7%
Simplified95.6%
Taylor expanded in x around inf 56.9%
*-commutative56.9%
Simplified56.9%
if 9.8000000000000003e-20 < z Initial program 63.0%
associate-+l-63.0%
*-commutative63.0%
associate-*r*62.6%
*-commutative62.6%
associate-+l-62.6%
Simplified62.6%
Taylor expanded in t around inf 52.7%
clear-num52.8%
inv-pow52.8%
Applied egg-rr52.8%
unpow-152.8%
Simplified52.8%
Final simplification58.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 -2.5e+28)
(* -4.0 (* a (/ t c)))
(if (<= z -2.3e-279)
(* b (/ 1.0 (* c z)))
(if (<= z 8e-18)
(* 9.0 (* x (/ y (* c z))))
(* -4.0 (/ 1.0 (/ c (* t a))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.5e+28) {
tmp = -4.0 * (a * (t / c));
} else if (z <= -2.3e-279) {
tmp = b * (1.0 / (c * z));
} else if (z <= 8e-18) {
tmp = 9.0 * (x * (y / (c * z)));
} else {
tmp = -4.0 * (1.0 / (c / (t * a)));
}
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+28)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= (-2.3d-279)) then
tmp = b * (1.0d0 / (c * z))
else if (z <= 8d-18) then
tmp = 9.0d0 * (x * (y / (c * z)))
else
tmp = (-4.0d0) * (1.0d0 / (c / (t * a)))
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+28) {
tmp = -4.0 * (a * (t / c));
} else if (z <= -2.3e-279) {
tmp = b * (1.0 / (c * z));
} else if (z <= 8e-18) {
tmp = 9.0 * (x * (y / (c * z)));
} else {
tmp = -4.0 * (1.0 / (c / (t * a)));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -2.5e+28: tmp = -4.0 * (a * (t / c)) elif z <= -2.3e-279: tmp = b * (1.0 / (c * z)) elif z <= 8e-18: tmp = 9.0 * (x * (y / (c * z))) else: tmp = -4.0 * (1.0 / (c / (t * a))) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -2.5e+28) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= -2.3e-279) tmp = Float64(b * Float64(1.0 / Float64(c * z))); elseif (z <= 8e-18) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z)))); else tmp = Float64(-4.0 * Float64(1.0 / Float64(c / Float64(t * a)))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -2.5e+28)
tmp = -4.0 * (a * (t / c));
elseif (z <= -2.3e-279)
tmp = b * (1.0 / (c * z));
elseif (z <= 8e-18)
tmp = 9.0 * (x * (y / (c * z)));
else
tmp = -4.0 * (1.0 / (c / (t * a)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -2.5e+28], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.3e-279], N[(b * N[(1.0 / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8e-18], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(1.0 / N[(c / N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.5 \cdot 10^{+28}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq -2.3 \cdot 10^{-279}:\\
\;\;\;\;b \cdot \frac{1}{c \cdot z}\\
\mathbf{elif}\;z \leq 8 \cdot 10^{-18}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{1}{\frac{c}{t \cdot a}}\\
\end{array}
\end{array}
if z < -2.49999999999999979e28Initial program 62.7%
associate-+l-62.7%
*-commutative62.7%
associate-*r*58.1%
*-commutative58.1%
associate-+l-58.1%
Simplified58.1%
Taylor expanded in t around inf 65.8%
associate-/l*67.2%
Applied egg-rr67.2%
if -2.49999999999999979e28 < z < -2.29999999999999995e-279Initial program 91.9%
associate-+l-91.9%
*-commutative91.9%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
Simplified91.9%
Taylor expanded in b around inf 59.0%
*-commutative59.0%
Simplified59.0%
div-inv59.0%
Applied egg-rr59.0%
if -2.29999999999999995e-279 < z < 8.0000000000000006e-18Initial program 95.7%
associate-+l-95.7%
*-commutative95.7%
associate-*r*95.7%
*-commutative95.7%
associate-+l-95.7%
associate-*l*95.6%
associate-*l*90.6%
*-commutative90.6%
Simplified90.6%
Taylor expanded in z around inf 84.1%
Taylor expanded in x around inf 56.9%
associate-/l*52.3%
Simplified52.3%
if 8.0000000000000006e-18 < z Initial program 63.0%
associate-+l-63.0%
*-commutative63.0%
associate-*r*62.6%
*-commutative62.6%
associate-+l-62.6%
Simplified62.6%
Taylor expanded in t around inf 52.7%
clear-num52.8%
inv-pow52.8%
Applied egg-rr52.8%
unpow-152.8%
Simplified52.8%
Final simplification57.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 (<= x -8.2e+62)
(* x (/ (+ (/ (* 9.0 y) z) (* -4.0 (* a (/ t x)))) c))
(if (<= x 2.8e-152)
(/ (- (/ b z) (* 4.0 (* t a))) c)
(/ (+ b (* 9.0 (* x y))) (* 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 (x <= -8.2e+62) {
tmp = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
} else if (x <= 2.8e-152) {
tmp = ((b / z) - (4.0 * (t * a))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (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 (x <= (-8.2d+62)) then
tmp = x * ((((9.0d0 * y) / z) + ((-4.0d0) * (a * (t / x)))) / c)
else if (x <= 2.8d-152) then
tmp = ((b / z) - (4.0d0 * (t * a))) / c
else
tmp = (b + (9.0d0 * (x * y))) / (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 (x <= -8.2e+62) {
tmp = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
} else if (x <= 2.8e-152) {
tmp = ((b / z) - (4.0 * (t * a))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (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 x <= -8.2e+62: tmp = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c) elif x <= 2.8e-152: tmp = ((b / z) - (4.0 * (t * a))) / c else: tmp = (b + (9.0 * (x * y))) / (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 (x <= -8.2e+62) tmp = Float64(x * Float64(Float64(Float64(Float64(9.0 * y) / z) + Float64(-4.0 * Float64(a * Float64(t / x)))) / c)); elseif (x <= 2.8e-152) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(t * a))) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(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 (x <= -8.2e+62)
tmp = x * ((((9.0 * y) / z) + (-4.0 * (a * (t / x)))) / c);
elseif (x <= 2.8e-152)
tmp = ((b / z) - (4.0 * (t * a))) / c;
else
tmp = (b + (9.0 * (x * y))) / (c * z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[x, -8.2e+62], N[(x * N[(N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] + N[(-4.0 * N[(a * N[(t / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.8e-152], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $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}\;x \leq -8.2 \cdot 10^{+62}:\\
\;\;\;\;x \cdot \frac{\frac{9 \cdot y}{z} + -4 \cdot \left(a \cdot \frac{t}{x}\right)}{c}\\
\mathbf{elif}\;x \leq 2.8 \cdot 10^{-152}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}\\
\end{array}
\end{array}
if x < -8.19999999999999967e62Initial program 77.0%
associate-+l-77.0%
*-commutative77.0%
associate-*r*77.0%
*-commutative77.0%
associate-+l-77.0%
associate-*l*77.0%
associate-*l*78.6%
*-commutative78.6%
Simplified78.6%
Taylor expanded in x around inf 74.9%
Taylor expanded in c around 0 82.0%
Taylor expanded in b around 0 68.6%
associate-/l*73.3%
cancel-sign-sub-inv73.3%
associate-*r/73.3%
metadata-eval73.3%
associate-*r/78.3%
Simplified78.3%
if -8.19999999999999967e62 < x < 2.79999999999999984e-152Initial program 76.9%
associate-+l-76.9%
*-commutative76.9%
associate-*r*78.4%
*-commutative78.4%
associate-+l-78.4%
associate-*l*78.5%
associate-*l*80.4%
*-commutative80.4%
Simplified80.4%
Taylor expanded in x around inf 56.1%
Taylor expanded in c around 0 71.0%
Taylor expanded in x around 0 87.2%
if 2.79999999999999984e-152 < x Initial program 77.7%
associate-+l-77.7%
*-commutative77.7%
associate-*r*72.8%
*-commutative72.8%
associate-+l-72.8%
Simplified72.8%
Taylor expanded in t around 0 65.1%
Final simplification76.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 -6.8e-20) (not (<= z 4.15e-19))) (/ (- (/ b z) (* 4.0 (* t a))) c) (/ (+ b (* 9.0 (* x y))) (* 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 <= -6.8e-20) || !(z <= 4.15e-19)) {
tmp = ((b / z) - (4.0 * (t * a))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (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 <= (-6.8d-20)) .or. (.not. (z <= 4.15d-19))) then
tmp = ((b / z) - (4.0d0 * (t * a))) / c
else
tmp = (b + (9.0d0 * (x * y))) / (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 <= -6.8e-20) || !(z <= 4.15e-19)) {
tmp = ((b / z) - (4.0 * (t * a))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (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 <= -6.8e-20) or not (z <= 4.15e-19): tmp = ((b / z) - (4.0 * (t * a))) / c else: tmp = (b + (9.0 * (x * y))) / (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 <= -6.8e-20) || !(z <= 4.15e-19)) tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(t * a))) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(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 <= -6.8e-20) || ~((z <= 4.15e-19)))
tmp = ((b / z) - (4.0 * (t * a))) / c;
else
tmp = (b + (9.0 * (x * y))) / (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, -6.8e-20], N[Not[LessEqual[z, 4.15e-19]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $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 -6.8 \cdot 10^{-20} \lor \neg \left(z \leq 4.15 \cdot 10^{-19}\right):\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}\\
\end{array}
\end{array}
if z < -6.7999999999999994e-20 or 4.1500000000000001e-19 < z Initial program 65.2%
associate-+l-65.2%
*-commutative65.2%
associate-*r*63.0%
*-commutative63.0%
associate-+l-63.0%
associate-*l*63.0%
associate-*l*70.2%
*-commutative70.2%
Simplified70.2%
Taylor expanded in x around inf 70.7%
Taylor expanded in c around 0 82.2%
Taylor expanded in x around 0 73.2%
if -6.7999999999999994e-20 < z < 4.1500000000000001e-19Initial program 94.0%
associate-+l-94.0%
*-commutative94.0%
associate-*r*94.0%
*-commutative94.0%
associate-+l-94.0%
Simplified94.0%
Taylor expanded in t around 0 86.9%
Final simplification78.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 (or (<= z -4e+73) (not (<= z 1.4e+199))) (* -4.0 (* a (/ t c))) (/ (+ b (* 9.0 (* x y))) (* 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 <= -4e+73) || !(z <= 1.4e+199)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = (b + (9.0 * (x * y))) / (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 <= (-4d+73)) .or. (.not. (z <= 1.4d+199))) then
tmp = (-4.0d0) * (a * (t / c))
else
tmp = (b + (9.0d0 * (x * y))) / (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 <= -4e+73) || !(z <= 1.4e+199)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = (b + (9.0 * (x * y))) / (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 <= -4e+73) or not (z <= 1.4e+199): tmp = -4.0 * (a * (t / c)) else: tmp = (b + (9.0 * (x * y))) / (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 <= -4e+73) || !(z <= 1.4e+199)) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(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 <= -4e+73) || ~((z <= 1.4e+199)))
tmp = -4.0 * (a * (t / c));
else
tmp = (b + (9.0 * (x * y))) / (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, -4e+73], N[Not[LessEqual[z, 1.4e+199]], $MachinePrecision]], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $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 -4 \cdot 10^{+73} \lor \neg \left(z \leq 1.4 \cdot 10^{+199}\right):\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}\\
\end{array}
\end{array}
if z < -3.99999999999999993e73 or 1.40000000000000005e199 < z Initial program 57.4%
associate-+l-57.4%
*-commutative57.4%
associate-*r*53.4%
*-commutative53.4%
associate-+l-53.4%
Simplified53.5%
Taylor expanded in t around inf 69.3%
associate-/l*70.3%
Applied egg-rr70.3%
if -3.99999999999999993e73 < z < 1.40000000000000005e199Initial program 86.4%
associate-+l-86.4%
*-commutative86.4%
associate-*r*86.4%
*-commutative86.4%
associate-+l-86.4%
Simplified86.4%
Taylor expanded in t around 0 71.8%
Final simplification71.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
(if (<= z -2.3e-60)
(* a (+ (* -4.0 (/ t c)) (/ b (* a (* c z)))))
(if (<= z 2.35e-18)
(/ (+ b (* 9.0 (* x y))) (* c z))
(/ (- (/ b z) (* 4.0 (* t 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 <= -2.3e-60) {
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
} else if (z <= 2.35e-18) {
tmp = (b + (9.0 * (x * y))) / (c * z);
} else {
tmp = ((b / z) - (4.0 * (t * a))) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.3d-60)) then
tmp = a * (((-4.0d0) * (t / c)) + (b / (a * (c * z))))
else if (z <= 2.35d-18) then
tmp = (b + (9.0d0 * (x * y))) / (c * z)
else
tmp = ((b / z) - (4.0d0 * (t * 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 <= -2.3e-60) {
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
} else if (z <= 2.35e-18) {
tmp = (b + (9.0 * (x * y))) / (c * z);
} else {
tmp = ((b / z) - (4.0 * (t * 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 <= -2.3e-60: tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z)))) elif z <= 2.35e-18: tmp = (b + (9.0 * (x * y))) / (c * z) else: tmp = ((b / z) - (4.0 * (t * 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 <= -2.3e-60) tmp = Float64(a * Float64(Float64(-4.0 * Float64(t / c)) + Float64(b / Float64(a * Float64(c * z))))); elseif (z <= 2.35e-18) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(c * z)); else tmp = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(t * 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 <= -2.3e-60)
tmp = a * ((-4.0 * (t / c)) + (b / (a * (c * z))));
elseif (z <= 2.35e-18)
tmp = (b + (9.0 * (x * y))) / (c * z);
else
tmp = ((b / z) - (4.0 * (t * a))) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -2.3e-60], N[(a * N[(N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision] + N[(b / N[(a * N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.35e-18], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(t * a), $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 -2.3 \cdot 10^{-60}:\\
\;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c} + \frac{b}{a \cdot \left(c \cdot z\right)}\right)\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{-18}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z} - 4 \cdot \left(t \cdot a\right)}{c}\\
\end{array}
\end{array}
if z < -2.3000000000000001e-60Initial program 65.9%
associate-+l-65.9%
*-commutative65.9%
associate-*r*62.3%
*-commutative62.3%
associate-+l-62.3%
Simplified62.3%
Taylor expanded in x around 0 55.3%
metadata-eval55.3%
cancel-sign-sub-inv55.3%
associate-*r*55.3%
*-commutative55.3%
Simplified55.3%
Taylor expanded in a around inf 69.6%
if -2.3000000000000001e-60 < z < 2.3499999999999998e-18Initial program 96.4%
associate-+l-96.4%
*-commutative96.4%
associate-*r*96.5%
*-commutative96.5%
associate-+l-96.5%
Simplified96.4%
Taylor expanded in t around 0 89.0%
if 2.3499999999999998e-18 < z Initial program 63.0%
associate-+l-63.0%
*-commutative63.0%
associate-*r*62.6%
*-commutative62.6%
associate-+l-62.6%
associate-*l*62.6%
associate-*l*69.1%
*-commutative69.1%
Simplified69.1%
Taylor expanded in x around inf 71.5%
Taylor expanded in c around 0 82.6%
Taylor expanded in x around 0 71.0%
Final simplification77.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 (<= b -8e+170) (not (<= b 2.1e+128))) (* (/ 1.0 z) (/ b c)) (* -4.0 (* a (/ 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 <= -8e+170) || !(b <= 2.1e+128)) {
tmp = (1.0 / z) * (b / c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-8d+170)) .or. (.not. (b <= 2.1d+128))) then
tmp = (1.0d0 / z) * (b / c)
else
tmp = (-4.0d0) * (a * (t / c))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -8e+170) || !(b <= 2.1e+128)) {
tmp = (1.0 / z) * (b / c);
} else {
tmp = -4.0 * (a * (t / c));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 <= -8e+170) or not (b <= 2.1e+128): tmp = (1.0 / z) * (b / c) else: tmp = -4.0 * (a * (t / c)) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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 <= -8e+170) || !(b <= 2.1e+128)) tmp = Float64(Float64(1.0 / z) * Float64(b / c)); else tmp = Float64(-4.0 * Float64(a * Float64(t / c))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 <= -8e+170) || ~((b <= 2.1e+128)))
tmp = (1.0 / z) * (b / c);
else
tmp = -4.0 * (a * (t / c));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -8e+170], N[Not[LessEqual[b, 2.1e+128]], $MachinePrecision]], N[(N[(1.0 / z), $MachinePrecision] * N[(b / c), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -8 \cdot 10^{+170} \lor \neg \left(b \leq 2.1 \cdot 10^{+128}\right):\\
\;\;\;\;\frac{1}{z} \cdot \frac{b}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\end{array}
\end{array}
if b < -8.00000000000000028e170 or 2.1e128 < b Initial program 79.3%
associate-+l-79.3%
*-commutative79.3%
associate-*r*80.3%
*-commutative80.3%
associate-+l-80.3%
associate-*l*80.2%
associate-*l*80.2%
*-commutative80.2%
Simplified80.2%
Taylor expanded in x around inf 69.2%
Taylor expanded in c around 0 70.5%
Taylor expanded in b around inf 61.9%
associate-/l/64.1%
*-un-lft-identity64.1%
*-commutative64.1%
times-frac73.3%
Applied egg-rr73.3%
if -8.00000000000000028e170 < b < 2.1e128Initial program 76.5%
associate-+l-76.5%
*-commutative76.5%
associate-*r*74.5%
*-commutative74.5%
associate-+l-74.5%
Simplified74.5%
Taylor expanded in t around inf 46.7%
associate-/l*48.1%
Applied egg-rr48.1%
Final simplification54.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 -3.8e+36) (not (<= z 3.55e-34))) (* -4.0 (* a (/ t c))) (/ b (* c z))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -3.8e+36) || !(z <= 3.55e-34)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (c * z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((z <= (-3.8d+36)) .or. (.not. (z <= 3.55d-34))) then
tmp = (-4.0d0) * (a * (t / c))
else
tmp = b / (c * z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -3.8e+36) || !(z <= 3.55e-34)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (c * z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -3.8e+36) or not (z <= 3.55e-34): tmp = -4.0 * (a * (t / c)) else: tmp = b / (c * z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -3.8e+36) || !(z <= 3.55e-34)) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); else tmp = Float64(b / Float64(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 <= -3.8e+36) || ~((z <= 3.55e-34)))
tmp = -4.0 * (a * (t / c));
else
tmp = b / (c * z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -3.8e+36], N[Not[LessEqual[z, 3.55e-34]], $MachinePrecision]], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(c * z), $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 -3.8 \cdot 10^{+36} \lor \neg \left(z \leq 3.55 \cdot 10^{-34}\right):\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\end{array}
\end{array}
if z < -3.80000000000000025e36 or 3.55000000000000018e-34 < z Initial program 63.7%
associate-+l-63.7%
*-commutative63.7%
associate-*r*61.4%
*-commutative61.4%
associate-+l-61.4%
Simplified61.4%
Taylor expanded in t around inf 58.2%
associate-/l*58.8%
Applied egg-rr58.8%
if -3.80000000000000025e36 < z < 3.55000000000000018e-34Initial program 93.6%
associate-+l-93.6%
*-commutative93.6%
associate-*r*93.6%
*-commutative93.6%
associate-+l-93.6%
Simplified93.6%
Taylor expanded in b around inf 48.0%
*-commutative48.0%
Simplified48.0%
Final simplification53.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.22e+32) (* -4.0 (* a (/ t c))) (if (<= z 1.06e-34) (* b (/ 1.0 (* c z))) (* -4.0 (/ (* t 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.22e+32) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 1.06e-34) {
tmp = b * (1.0 / (c * z));
} else {
tmp = -4.0 * ((t * a) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.22d+32)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= 1.06d-34) then
tmp = b * (1.0d0 / (c * z))
else
tmp = (-4.0d0) * ((t * a) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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.22e+32) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 1.06e-34) {
tmp = b * (1.0 / (c * z));
} else {
tmp = -4.0 * ((t * 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.22e+32: tmp = -4.0 * (a * (t / c)) elif z <= 1.06e-34: tmp = b * (1.0 / (c * z)) else: tmp = -4.0 * ((t * 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.22e+32) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= 1.06e-34) tmp = Float64(b * Float64(1.0 / Float64(c * z))); else tmp = Float64(-4.0 * Float64(Float64(t * 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.22e+32)
tmp = -4.0 * (a * (t / c));
elseif (z <= 1.06e-34)
tmp = b * (1.0 / (c * z));
else
tmp = -4.0 * ((t * a) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.22e+32], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.06e-34], N[(b * N[(1.0 / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(t * a), $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 -1.22 \cdot 10^{+32}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq 1.06 \cdot 10^{-34}:\\
\;\;\;\;b \cdot \frac{1}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c}\\
\end{array}
\end{array}
if z < -1.22000000000000002e32Initial program 62.7%
associate-+l-62.7%
*-commutative62.7%
associate-*r*58.1%
*-commutative58.1%
associate-+l-58.1%
Simplified58.1%
Taylor expanded in t around inf 65.8%
associate-/l*67.2%
Applied egg-rr67.2%
if -1.22000000000000002e32 < z < 1.06000000000000006e-34Initial program 93.6%
associate-+l-93.6%
*-commutative93.6%
associate-*r*93.6%
*-commutative93.6%
associate-+l-93.6%
Simplified93.6%
Taylor expanded in b around inf 48.0%
*-commutative48.0%
Simplified48.0%
div-inv48.4%
Applied egg-rr48.4%
if 1.06000000000000006e-34 < z Initial program 64.4%
associate-+l-64.4%
*-commutative64.4%
associate-*r*64.0%
*-commutative64.0%
associate-+l-64.0%
Simplified64.1%
Taylor expanded in t around inf 52.0%
Final simplification54.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 (if (<= z -4.7e+27) (* -4.0 (* a (/ t c))) (if (<= z 7.2e-33) (/ b (* c z)) (* -4.0 (/ (* t 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 <= -4.7e+27) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 7.2e-33) {
tmp = b / (c * z);
} else {
tmp = -4.0 * ((t * a) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-4.7d+27)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= 7.2d-33) then
tmp = b / (c * z)
else
tmp = (-4.0d0) * ((t * a) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -4.7e+27) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 7.2e-33) {
tmp = b / (c * z);
} else {
tmp = -4.0 * ((t * 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 <= -4.7e+27: tmp = -4.0 * (a * (t / c)) elif z <= 7.2e-33: tmp = b / (c * z) else: tmp = -4.0 * ((t * 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 <= -4.7e+27) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= 7.2e-33) tmp = Float64(b / Float64(c * z)); else tmp = Float64(-4.0 * Float64(Float64(t * 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 <= -4.7e+27)
tmp = -4.0 * (a * (t / c));
elseif (z <= 7.2e-33)
tmp = b / (c * z);
else
tmp = -4.0 * ((t * a) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -4.7e+27], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.2e-33], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(t * a), $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 -4.7 \cdot 10^{+27}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq 7.2 \cdot 10^{-33}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c}\\
\end{array}
\end{array}
if z < -4.69999999999999976e27Initial program 62.7%
associate-+l-62.7%
*-commutative62.7%
associate-*r*58.1%
*-commutative58.1%
associate-+l-58.1%
Simplified58.1%
Taylor expanded in t around inf 65.8%
associate-/l*67.2%
Applied egg-rr67.2%
if -4.69999999999999976e27 < z < 7.20000000000000068e-33Initial program 93.6%
associate-+l-93.6%
*-commutative93.6%
associate-*r*93.6%
*-commutative93.6%
associate-+l-93.6%
Simplified93.6%
Taylor expanded in b around inf 48.0%
*-commutative48.0%
Simplified48.0%
if 7.20000000000000068e-33 < z Initial program 64.4%
associate-+l-64.4%
*-commutative64.4%
associate-*r*64.0%
*-commutative64.0%
associate-+l-64.0%
Simplified64.1%
Taylor expanded in t around inf 52.0%
Final simplification53.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 (/ 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(b / Float64(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[(b / N[(c * z), $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}{c \cdot z}
\end{array}
Initial program 77.2%
associate-+l-77.2%
*-commutative77.2%
associate-*r*76.0%
*-commutative76.0%
associate-+l-76.0%
Simplified76.0%
Taylor expanded in b around inf 32.0%
*-commutative32.0%
Simplified32.0%
Final simplification32.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 2024180
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))