
(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 (if (or (<= z -1.08e+45) (not (<= z 7.8e+96))) (/ (- (+ (* 9.0 (/ (* x y) z)) (/ b z)) (* 4.0 (* a t))) c) (/ (+ b (fma x (* 9.0 y) (* t (* a (* z -4.0))))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
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.08e+45) || !(z <= 7.8e+96)) {
tmp = (((9.0 * ((x * y) / z)) + (b / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + fma(x, (9.0 * y), (t * (a * (z * -4.0))))) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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.08e+45) || !(z <= 7.8e+96)) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) + Float64(b / z)) - Float64(4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(b + fma(x, Float64(9.0 * y), Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.08e+45], N[Not[LessEqual[z, 7.8e+96]], $MachinePrecision]], N[(N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.08 \cdot 10^{+45} \lor \neg \left(z \leq 7.8 \cdot 10^{+96}\right):\\
\;\;\;\;\frac{\left(9 \cdot \frac{x \cdot y}{z} + \frac{b}{z}\right) - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \mathsf{fma}\left(x, 9 \cdot y, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.08e45 or 7.8e96 < z Initial program 47.5%
associate-+l-47.5%
*-commutative47.5%
associate-*r*51.8%
*-commutative51.8%
associate-+l-51.8%
associate-*l*51.8%
associate-*l*58.8%
*-commutative58.8%
Simplified58.8%
Taylor expanded in x around 0 76.5%
Taylor expanded in c around 0 86.5%
if -1.08e45 < z < 7.8e96Initial program 96.1%
associate-+l-96.1%
*-commutative96.1%
associate-*r*94.9%
*-commutative94.9%
associate-+l-94.9%
Simplified95.5%
Final simplification92.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* x (/ (/ y c) z)))))
(if (<= x -1.56e+106)
t_1
(if (<= x -3.2e+83)
(* -4.0 (* t (/ a c)))
(if (<= x -9.6e+55)
(* 9.0 (* (/ y z) (/ x c)))
(if (<= x -1.25e-8)
(/ b (* z c))
(if (<= x -2.7e-296)
(* -4.0 (* a (/ t c)))
(if (<= x 2.5e-189) (/ 1.0 (/ (* z c) b)) t_1))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * ((y / c) / z));
double tmp;
if (x <= -1.56e+106) {
tmp = t_1;
} else if (x <= -3.2e+83) {
tmp = -4.0 * (t * (a / c));
} else if (x <= -9.6e+55) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (x <= -1.25e-8) {
tmp = b / (z * c);
} else if (x <= -2.7e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * (x * ((y / c) / z))
if (x <= (-1.56d+106)) then
tmp = t_1
else if (x <= (-3.2d+83)) then
tmp = (-4.0d0) * (t * (a / c))
else if (x <= (-9.6d+55)) then
tmp = 9.0d0 * ((y / z) * (x / c))
else if (x <= (-1.25d-8)) then
tmp = b / (z * c)
else if (x <= (-2.7d-296)) then
tmp = (-4.0d0) * (a * (t / c))
else if (x <= 2.5d-189) then
tmp = 1.0d0 / ((z * c) / b)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * ((y / c) / z));
double tmp;
if (x <= -1.56e+106) {
tmp = t_1;
} else if (x <= -3.2e+83) {
tmp = -4.0 * (t * (a / c));
} else if (x <= -9.6e+55) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (x <= -1.25e-8) {
tmp = b / (z * c);
} else if (x <= -2.7e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * (x * ((y / c) / z)) tmp = 0 if x <= -1.56e+106: tmp = t_1 elif x <= -3.2e+83: tmp = -4.0 * (t * (a / c)) elif x <= -9.6e+55: tmp = 9.0 * ((y / z) * (x / c)) elif x <= -1.25e-8: tmp = b / (z * c) elif x <= -2.7e-296: tmp = -4.0 * (a * (t / c)) elif x <= 2.5e-189: tmp = 1.0 / ((z * c) / b) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(x * Float64(Float64(y / c) / z))) tmp = 0.0 if (x <= -1.56e+106) tmp = t_1; elseif (x <= -3.2e+83) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (x <= -9.6e+55) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); elseif (x <= -1.25e-8) tmp = Float64(b / Float64(z * c)); elseif (x <= -2.7e-296) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (x <= 2.5e-189) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * (x * ((y / c) / z));
tmp = 0.0;
if (x <= -1.56e+106)
tmp = t_1;
elseif (x <= -3.2e+83)
tmp = -4.0 * (t * (a / c));
elseif (x <= -9.6e+55)
tmp = 9.0 * ((y / z) * (x / c));
elseif (x <= -1.25e-8)
tmp = b / (z * c);
elseif (x <= -2.7e-296)
tmp = -4.0 * (a * (t / c));
elseif (x <= 2.5e-189)
tmp = 1.0 / ((z * c) / b);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(N[(y / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.56e+106], t$95$1, If[LessEqual[x, -3.2e+83], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -9.6e+55], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.25e-8], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -2.7e-296], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.5e-189], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{\frac{y}{c}}{z}\right)\\
\mathbf{if}\;x \leq -1.56 \cdot 10^{+106}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -3.2 \cdot 10^{+83}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;x \leq -9.6 \cdot 10^{+55}:\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{elif}\;x \leq -1.25 \cdot 10^{-8}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;x \leq -2.7 \cdot 10^{-296}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;x \leq 2.5 \cdot 10^{-189}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.55999999999999991e106 or 2.4999999999999999e-189 < x Initial program 76.6%
associate-+l-76.6%
*-commutative76.6%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in x around inf 49.4%
associate-/r*51.3%
associate-/l*53.2%
Simplified53.2%
associate-/l*53.8%
Applied egg-rr53.8%
if -1.55999999999999991e106 < x < -3.1999999999999999e83Initial program 100.0%
associate-+l-100.0%
*-commutative100.0%
associate-*r*99.0%
*-commutative99.0%
associate-+l-99.0%
associate-*l*99.0%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
Taylor expanded in x around 0 99.5%
Taylor expanded in c around 0 99.5%
Taylor expanded in b around 0 66.2%
Taylor expanded in x around 0 66.2%
associate-*r/66.2%
associate-*r*66.2%
associate-*l/66.7%
associate-*r/66.7%
associate-*l*66.7%
Simplified66.7%
if -3.1999999999999999e83 < x < -9.5999999999999997e55Initial program 86.7%
associate-+l-86.7%
*-commutative86.7%
associate-*r*86.7%
*-commutative86.7%
associate-+l-86.7%
associate-*l*86.7%
associate-*l*86.7%
*-commutative86.7%
Simplified86.7%
Taylor expanded in x around inf 73.7%
times-frac86.7%
Simplified86.7%
if -9.5999999999999997e55 < x < -1.2499999999999999e-8Initial program 78.9%
associate-+l-78.9%
*-commutative78.9%
associate-*r*86.2%
*-commutative86.2%
associate-+l-86.2%
associate-*l*86.2%
associate-*l*79.6%
*-commutative79.6%
Simplified79.6%
Taylor expanded in b around inf 51.8%
*-commutative51.8%
Simplified51.8%
if -1.2499999999999999e-8 < x < -2.69999999999999999e-296Initial program 84.7%
associate-+l-84.7%
*-commutative84.7%
associate-*r*85.7%
*-commutative85.7%
associate-+l-85.7%
associate-*l*85.8%
associate-*l*86.4%
*-commutative86.4%
Simplified86.4%
Taylor expanded in x around 0 87.9%
Taylor expanded in z around inf 53.3%
associate-*r/49.9%
Simplified49.9%
if -2.69999999999999999e-296 < x < 2.4999999999999999e-189Initial program 82.1%
associate-+l-82.1%
*-commutative82.1%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
associate-*l*82.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 64.8%
associate-/r*62.7%
Simplified62.7%
clear-num62.7%
inv-pow62.7%
Applied egg-rr62.7%
unpow-162.7%
associate-/r/61.0%
Simplified61.0%
associate-*l/64.8%
Applied egg-rr64.8%
Final simplification55.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (/ (* x (/ y c)) z))))
(if (<= x -1.85e+105)
t_1
(if (<= x -3.2e+83)
(* -4.0 (* t (/ a c)))
(if (<= x -3.45e+55)
(* 9.0 (* (/ y z) (/ x c)))
(if (<= x -1.75e-7)
(/ b (* z c))
(if (<= x -8.7e-296)
(* -4.0 (* a (/ t c)))
(if (<= x 2.5e-189) (/ 1.0 (/ (* z c) b)) t_1))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * (y / c)) / z);
double tmp;
if (x <= -1.85e+105) {
tmp = t_1;
} else if (x <= -3.2e+83) {
tmp = -4.0 * (t * (a / c));
} else if (x <= -3.45e+55) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (x <= -1.75e-7) {
tmp = b / (z * c);
} else if (x <= -8.7e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * ((x * (y / c)) / z)
if (x <= (-1.85d+105)) then
tmp = t_1
else if (x <= (-3.2d+83)) then
tmp = (-4.0d0) * (t * (a / c))
else if (x <= (-3.45d+55)) then
tmp = 9.0d0 * ((y / z) * (x / c))
else if (x <= (-1.75d-7)) then
tmp = b / (z * c)
else if (x <= (-8.7d-296)) then
tmp = (-4.0d0) * (a * (t / c))
else if (x <= 2.5d-189) then
tmp = 1.0d0 / ((z * c) / b)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((x * (y / c)) / z);
double tmp;
if (x <= -1.85e+105) {
tmp = t_1;
} else if (x <= -3.2e+83) {
tmp = -4.0 * (t * (a / c));
} else if (x <= -3.45e+55) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (x <= -1.75e-7) {
tmp = b / (z * c);
} else if (x <= -8.7e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((x * (y / c)) / z) tmp = 0 if x <= -1.85e+105: tmp = t_1 elif x <= -3.2e+83: tmp = -4.0 * (t * (a / c)) elif x <= -3.45e+55: tmp = 9.0 * ((y / z) * (x / c)) elif x <= -1.75e-7: tmp = b / (z * c) elif x <= -8.7e-296: tmp = -4.0 * (a * (t / c)) elif x <= 2.5e-189: tmp = 1.0 / ((z * c) / b) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(x * Float64(y / c)) / z)) tmp = 0.0 if (x <= -1.85e+105) tmp = t_1; elseif (x <= -3.2e+83) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (x <= -3.45e+55) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); elseif (x <= -1.75e-7) tmp = Float64(b / Float64(z * c)); elseif (x <= -8.7e-296) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (x <= 2.5e-189) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((x * (y / c)) / z);
tmp = 0.0;
if (x <= -1.85e+105)
tmp = t_1;
elseif (x <= -3.2e+83)
tmp = -4.0 * (t * (a / c));
elseif (x <= -3.45e+55)
tmp = 9.0 * ((y / z) * (x / c));
elseif (x <= -1.75e-7)
tmp = b / (z * c);
elseif (x <= -8.7e-296)
tmp = -4.0 * (a * (t / c));
elseif (x <= 2.5e-189)
tmp = 1.0 / ((z * c) / b);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(x * N[(y / c), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.85e+105], t$95$1, If[LessEqual[x, -3.2e+83], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.45e+55], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.75e-7], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -8.7e-296], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.5e-189], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \frac{x \cdot \frac{y}{c}}{z}\\
\mathbf{if}\;x \leq -1.85 \cdot 10^{+105}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -3.2 \cdot 10^{+83}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;x \leq -3.45 \cdot 10^{+55}:\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{elif}\;x \leq -1.75 \cdot 10^{-7}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;x \leq -8.7 \cdot 10^{-296}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;x \leq 2.5 \cdot 10^{-189}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.84999999999999992e105 or 2.4999999999999999e-189 < x Initial program 76.6%
associate-+l-76.6%
*-commutative76.6%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in x around inf 49.4%
associate-/r*51.3%
associate-/l*53.2%
Simplified53.2%
if -1.84999999999999992e105 < x < -3.1999999999999999e83Initial program 100.0%
associate-+l-100.0%
*-commutative100.0%
associate-*r*99.0%
*-commutative99.0%
associate-+l-99.0%
associate-*l*99.0%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
Taylor expanded in x around 0 99.5%
Taylor expanded in c around 0 99.5%
Taylor expanded in b around 0 66.2%
Taylor expanded in x around 0 66.2%
associate-*r/66.2%
associate-*r*66.2%
associate-*l/66.7%
associate-*r/66.7%
associate-*l*66.7%
Simplified66.7%
if -3.1999999999999999e83 < x < -3.4500000000000002e55Initial program 86.7%
associate-+l-86.7%
*-commutative86.7%
associate-*r*86.7%
*-commutative86.7%
associate-+l-86.7%
associate-*l*86.7%
associate-*l*86.7%
*-commutative86.7%
Simplified86.7%
Taylor expanded in x around inf 73.7%
times-frac86.7%
Simplified86.7%
if -3.4500000000000002e55 < x < -1.74999999999999992e-7Initial program 78.9%
associate-+l-78.9%
*-commutative78.9%
associate-*r*86.2%
*-commutative86.2%
associate-+l-86.2%
associate-*l*86.2%
associate-*l*79.6%
*-commutative79.6%
Simplified79.6%
Taylor expanded in b around inf 51.8%
*-commutative51.8%
Simplified51.8%
if -1.74999999999999992e-7 < x < -8.7e-296Initial program 84.7%
associate-+l-84.7%
*-commutative84.7%
associate-*r*85.7%
*-commutative85.7%
associate-+l-85.7%
associate-*l*85.8%
associate-*l*86.4%
*-commutative86.4%
Simplified86.4%
Taylor expanded in x around 0 87.9%
Taylor expanded in z around inf 53.3%
associate-*r/49.9%
Simplified49.9%
if -8.7e-296 < x < 2.4999999999999999e-189Initial program 82.1%
associate-+l-82.1%
*-commutative82.1%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
associate-*l*82.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 64.8%
associate-/r*62.7%
Simplified62.7%
clear-num62.7%
inv-pow62.7%
Applied egg-rr62.7%
unpow-162.7%
associate-/r/61.0%
Simplified61.0%
associate-*l/64.8%
Applied egg-rr64.8%
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
(let* ((t_1 (/ (* 9.0 (* x (/ y c))) z)))
(if (<= x -1.35e+106)
t_1
(if (<= x -3.2e+83)
(* -4.0 (* t (/ a c)))
(if (<= x -5.2e+55)
(* 9.0 (* (/ y z) (/ x c)))
(if (<= x -1.75e-9)
(/ b (* z c))
(if (<= x -2e-296)
(* -4.0 (* a (/ t c)))
(if (<= x 2.3e-189) (/ 1.0 (/ (* z c) b)) t_1))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * (x * (y / c))) / z;
double tmp;
if (x <= -1.35e+106) {
tmp = t_1;
} else if (x <= -3.2e+83) {
tmp = -4.0 * (t * (a / c));
} else if (x <= -5.2e+55) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (x <= -1.75e-9) {
tmp = b / (z * c);
} else if (x <= -2e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.3e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (9.0d0 * (x * (y / c))) / z
if (x <= (-1.35d+106)) then
tmp = t_1
else if (x <= (-3.2d+83)) then
tmp = (-4.0d0) * (t * (a / c))
else if (x <= (-5.2d+55)) then
tmp = 9.0d0 * ((y / z) * (x / c))
else if (x <= (-1.75d-9)) then
tmp = b / (z * c)
else if (x <= (-2d-296)) then
tmp = (-4.0d0) * (a * (t / c))
else if (x <= 2.3d-189) then
tmp = 1.0d0 / ((z * c) / b)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (9.0 * (x * (y / c))) / z;
double tmp;
if (x <= -1.35e+106) {
tmp = t_1;
} else if (x <= -3.2e+83) {
tmp = -4.0 * (t * (a / c));
} else if (x <= -5.2e+55) {
tmp = 9.0 * ((y / z) * (x / c));
} else if (x <= -1.75e-9) {
tmp = b / (z * c);
} else if (x <= -2e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.3e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (9.0 * (x * (y / c))) / z tmp = 0 if x <= -1.35e+106: tmp = t_1 elif x <= -3.2e+83: tmp = -4.0 * (t * (a / c)) elif x <= -5.2e+55: tmp = 9.0 * ((y / z) * (x / c)) elif x <= -1.75e-9: tmp = b / (z * c) elif x <= -2e-296: tmp = -4.0 * (a * (t / c)) elif x <= 2.3e-189: tmp = 1.0 / ((z * c) / b) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * Float64(x * Float64(y / c))) / z) tmp = 0.0 if (x <= -1.35e+106) tmp = t_1; elseif (x <= -3.2e+83) tmp = Float64(-4.0 * Float64(t * Float64(a / c))); elseif (x <= -5.2e+55) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); elseif (x <= -1.75e-9) tmp = Float64(b / Float64(z * c)); elseif (x <= -2e-296) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (x <= 2.3e-189) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (9.0 * (x * (y / c))) / z;
tmp = 0.0;
if (x <= -1.35e+106)
tmp = t_1;
elseif (x <= -3.2e+83)
tmp = -4.0 * (t * (a / c));
elseif (x <= -5.2e+55)
tmp = 9.0 * ((y / z) * (x / c));
elseif (x <= -1.75e-9)
tmp = b / (z * c);
elseif (x <= -2e-296)
tmp = -4.0 * (a * (t / c));
elseif (x <= 2.3e-189)
tmp = 1.0 / ((z * c) / b);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * N[(x * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[x, -1.35e+106], t$95$1, If[LessEqual[x, -3.2e+83], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.2e+55], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.75e-9], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -2e-296], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.3e-189], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{9 \cdot \left(x \cdot \frac{y}{c}\right)}{z}\\
\mathbf{if}\;x \leq -1.35 \cdot 10^{+106}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -3.2 \cdot 10^{+83}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;x \leq -5.2 \cdot 10^{+55}:\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{elif}\;x \leq -1.75 \cdot 10^{-9}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;x \leq -2 \cdot 10^{-296}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;x \leq 2.3 \cdot 10^{-189}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.35000000000000003e106 or 2.2999999999999998e-189 < x Initial program 76.6%
associate-+l-76.6%
*-commutative76.6%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in x around inf 49.4%
associate-/r*51.3%
associate-/l*53.2%
Simplified53.2%
associate-*r/53.2%
Applied egg-rr53.2%
if -1.35000000000000003e106 < x < -3.1999999999999999e83Initial program 100.0%
associate-+l-100.0%
*-commutative100.0%
associate-*r*99.0%
*-commutative99.0%
associate-+l-99.0%
associate-*l*99.0%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
Taylor expanded in x around 0 99.5%
Taylor expanded in c around 0 99.5%
Taylor expanded in b around 0 66.2%
Taylor expanded in x around 0 66.2%
associate-*r/66.2%
associate-*r*66.2%
associate-*l/66.7%
associate-*r/66.7%
associate-*l*66.7%
Simplified66.7%
if -3.1999999999999999e83 < x < -5.2e55Initial program 86.7%
associate-+l-86.7%
*-commutative86.7%
associate-*r*86.7%
*-commutative86.7%
associate-+l-86.7%
associate-*l*86.7%
associate-*l*86.7%
*-commutative86.7%
Simplified86.7%
Taylor expanded in x around inf 73.7%
times-frac86.7%
Simplified86.7%
if -5.2e55 < x < -1.75e-9Initial program 78.9%
associate-+l-78.9%
*-commutative78.9%
associate-*r*86.2%
*-commutative86.2%
associate-+l-86.2%
associate-*l*86.2%
associate-*l*79.6%
*-commutative79.6%
Simplified79.6%
Taylor expanded in b around inf 51.8%
*-commutative51.8%
Simplified51.8%
if -1.75e-9 < x < -2e-296Initial program 84.7%
associate-+l-84.7%
*-commutative84.7%
associate-*r*85.7%
*-commutative85.7%
associate-+l-85.7%
associate-*l*85.8%
associate-*l*86.4%
*-commutative86.4%
Simplified86.4%
Taylor expanded in x around 0 87.9%
Taylor expanded in z around inf 53.3%
associate-*r/49.9%
Simplified49.9%
if -2e-296 < x < 2.2999999999999998e-189Initial program 82.1%
associate-+l-82.1%
*-commutative82.1%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
associate-*l*82.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 64.8%
associate-/r*62.7%
Simplified62.7%
clear-num62.7%
inv-pow62.7%
Applied egg-rr62.7%
unpow-162.7%
associate-/r/61.0%
Simplified61.0%
associate-*l/64.8%
Applied egg-rr64.8%
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
(let* ((t_1 (/ (- (/ b z) (* 4.0 (* a t))) c)))
(if (<= z -9.2e-11)
t_1
(if (<= z 1.5e-22)
(/ (+ b (* y (* 9.0 x))) (* z c))
(if (or (<= z 1.15e+131) (not (<= z 2.35e+219)))
t_1
(* 9.0 (/ (* x (/ y z)) c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((b / z) - (4.0 * (a * t))) / c;
double tmp;
if (z <= -9.2e-11) {
tmp = t_1;
} else if (z <= 1.5e-22) {
tmp = (b + (y * (9.0 * x))) / (z * c);
} else if ((z <= 1.15e+131) || !(z <= 2.35e+219)) {
tmp = t_1;
} else {
tmp = 9.0 * ((x * (y / z)) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = ((b / z) - (4.0d0 * (a * t))) / c
if (z <= (-9.2d-11)) then
tmp = t_1
else if (z <= 1.5d-22) then
tmp = (b + (y * (9.0d0 * x))) / (z * c)
else if ((z <= 1.15d+131) .or. (.not. (z <= 2.35d+219))) then
tmp = t_1
else
tmp = 9.0d0 * ((x * (y / z)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((b / z) - (4.0 * (a * t))) / c;
double tmp;
if (z <= -9.2e-11) {
tmp = t_1;
} else if (z <= 1.5e-22) {
tmp = (b + (y * (9.0 * x))) / (z * c);
} else if ((z <= 1.15e+131) || !(z <= 2.35e+219)) {
tmp = t_1;
} else {
tmp = 9.0 * ((x * (y / z)) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = ((b / z) - (4.0 * (a * t))) / c tmp = 0 if z <= -9.2e-11: tmp = t_1 elif z <= 1.5e-22: tmp = (b + (y * (9.0 * x))) / (z * c) elif (z <= 1.15e+131) or not (z <= 2.35e+219): tmp = t_1 else: tmp = 9.0 * ((x * (y / z)) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(b / z) - Float64(4.0 * Float64(a * t))) / c) tmp = 0.0 if (z <= -9.2e-11) tmp = t_1; elseif (z <= 1.5e-22) tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c)); elseif ((z <= 1.15e+131) || !(z <= 2.35e+219)) tmp = t_1; else tmp = Float64(9.0 * Float64(Float64(x * Float64(y / z)) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((b / z) - (4.0 * (a * t))) / c;
tmp = 0.0;
if (z <= -9.2e-11)
tmp = t_1;
elseif (z <= 1.5e-22)
tmp = (b + (y * (9.0 * x))) / (z * c);
elseif ((z <= 1.15e+131) || ~((z <= 2.35e+219)))
tmp = t_1;
else
tmp = 9.0 * ((x * (y / z)) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(b / z), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -9.2e-11], t$95$1, If[LessEqual[z, 1.5e-22], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[z, 1.15e+131], N[Not[LessEqual[z, 2.35e+219]], $MachinePrecision]], t$95$1, N[(9.0 * N[(N[(x * N[(y / z), $MachinePrecision]), $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}
t_1 := \frac{\frac{b}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{if}\;z \leq -9.2 \cdot 10^{-11}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.5 \cdot 10^{-22}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{+131} \lor \neg \left(z \leq 2.35 \cdot 10^{+219}\right):\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;9 \cdot \frac{x \cdot \frac{y}{z}}{c}\\
\end{array}
\end{array}
if z < -9.20000000000000054e-11 or 1.5e-22 < z < 1.14999999999999996e131 or 2.35000000000000007e219 < z Initial program 62.9%
associate-+l-62.9%
*-commutative62.9%
associate-*r*65.5%
*-commutative65.5%
associate-+l-65.5%
associate-*l*65.5%
associate-*l*69.3%
*-commutative69.3%
Simplified69.3%
Taylor expanded in x around 0 84.1%
Taylor expanded in c around 0 89.3%
Taylor expanded in x around 0 74.8%
if -9.20000000000000054e-11 < z < 1.5e-22Initial program 98.6%
associate-+l-98.6%
*-commutative98.6%
associate-*r*97.0%
*-commutative97.0%
associate-+l-97.0%
associate-*l*97.0%
associate-*l*92.4%
*-commutative92.4%
Simplified92.4%
Taylor expanded in x around inf 86.3%
associate-*r*86.3%
Simplified86.3%
if 1.14999999999999996e131 < z < 2.35000000000000007e219Initial program 49.0%
associate-+l-49.0%
*-commutative49.0%
associate-*r*53.3%
*-commutative53.3%
associate-+l-53.3%
associate-*l*53.4%
associate-*l*64.1%
*-commutative64.1%
Simplified64.1%
Taylor expanded in x around 0 53.6%
Taylor expanded in c around 0 79.6%
Taylor expanded in x around inf 51.6%
associate-*r/61.7%
Simplified61.7%
associate-*r/51.6%
associate-/l*51.5%
associate-*r/61.7%
Applied egg-rr61.7%
Final simplification79.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* -4.0 (/ (* a t) c))))
(if (<= z -1.45e-10)
t_1
(if (<= z 1.1e+85)
(/ (+ b (* 9.0 (* x y))) (* z c))
(if (<= z 1.15e+131)
t_1
(if (<= z 5.1e+216)
(* 9.0 (/ (* x (/ y z)) c))
(* a (/ (* t -4.0) c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * ((a * t) / c);
double tmp;
if (z <= -1.45e-10) {
tmp = t_1;
} else if (z <= 1.1e+85) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else if (z <= 1.15e+131) {
tmp = t_1;
} else if (z <= 5.1e+216) {
tmp = 9.0 * ((x * (y / z)) / c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * ((a * t) / c)
if (z <= (-1.45d-10)) then
tmp = t_1
else if (z <= 1.1d+85) then
tmp = (b + (9.0d0 * (x * y))) / (z * c)
else if (z <= 1.15d+131) then
tmp = t_1
else if (z <= 5.1d+216) then
tmp = 9.0d0 * ((x * (y / z)) / c)
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * ((a * t) / c);
double tmp;
if (z <= -1.45e-10) {
tmp = t_1;
} else if (z <= 1.1e+85) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else if (z <= 1.15e+131) {
tmp = t_1;
} else if (z <= 5.1e+216) {
tmp = 9.0 * ((x * (y / z)) / c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * ((a * t) / c) tmp = 0 if z <= -1.45e-10: tmp = t_1 elif z <= 1.1e+85: tmp = (b + (9.0 * (x * y))) / (z * c) elif z <= 1.15e+131: tmp = t_1 elif z <= 5.1e+216: tmp = 9.0 * ((x * (y / z)) / c) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(Float64(a * t) / c)) tmp = 0.0 if (z <= -1.45e-10) tmp = t_1; elseif (z <= 1.1e+85) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); elseif (z <= 1.15e+131) tmp = t_1; elseif (z <= 5.1e+216) tmp = Float64(9.0 * Float64(Float64(x * Float64(y / z)) / c)); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * ((a * t) / c);
tmp = 0.0;
if (z <= -1.45e-10)
tmp = t_1;
elseif (z <= 1.1e+85)
tmp = (b + (9.0 * (x * y))) / (z * c);
elseif (z <= 1.15e+131)
tmp = t_1;
elseif (z <= 5.1e+216)
tmp = 9.0 * ((x * (y / z)) / c);
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.45e-10], t$95$1, If[LessEqual[z, 1.1e+85], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.15e+131], t$95$1, If[LessEqual[z, 5.1e+216], N[(9.0 * N[(N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $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}
t_1 := -4 \cdot \frac{a \cdot t}{c}\\
\mathbf{if}\;z \leq -1.45 \cdot 10^{-10}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.1 \cdot 10^{+85}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{+131}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5.1 \cdot 10^{+216}:\\
\;\;\;\;9 \cdot \frac{x \cdot \frac{y}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if z < -1.4499999999999999e-10 or 1.1000000000000001e85 < z < 1.14999999999999996e131Initial program 55.9%
associate-+l-55.9%
*-commutative55.9%
associate-*r*61.1%
*-commutative61.1%
associate-+l-61.1%
associate-*l*61.0%
associate-*l*65.8%
*-commutative65.8%
Simplified65.8%
Taylor expanded in z around inf 66.1%
*-commutative66.1%
Simplified66.1%
if -1.4499999999999999e-10 < z < 1.1000000000000001e85Initial program 97.0%
associate-+l-97.0%
*-commutative97.0%
associate-*r*95.7%
*-commutative95.7%
associate-+l-95.7%
associate-*l*95.6%
associate-*l*91.8%
*-commutative91.8%
Simplified91.8%
Taylor expanded in x around inf 83.0%
if 1.14999999999999996e131 < z < 5.1000000000000001e216Initial program 48.4%
associate-+l-48.4%
*-commutative48.4%
associate-*r*53.2%
*-commutative53.2%
associate-+l-53.2%
associate-*l*53.3%
associate-*l*65.3%
*-commutative65.3%
Simplified65.3%
Taylor expanded in x around 0 53.6%
Taylor expanded in c around 0 82.6%
Taylor expanded in x around inf 51.7%
associate-*r/63.0%
Simplified63.0%
associate-*r/51.7%
associate-/l*51.6%
associate-*r/63.0%
Applied egg-rr63.0%
if 5.1000000000000001e216 < z Initial program 52.4%
associate-+l-52.4%
*-commutative52.4%
associate-*r*51.6%
*-commutative51.6%
associate-+l-51.6%
associate-*l*51.6%
associate-*l*56.2%
*-commutative56.2%
Simplified56.2%
Taylor expanded in z around inf 67.4%
*-commutative67.4%
associate-/l*74.2%
associate-*r*74.2%
associate-*l/74.3%
Simplified74.3%
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
(let* ((t_1 (* -4.0 (/ (* a t) c))))
(if (<= z -1.45e-10)
t_1
(if (<= z 1.9e+84)
(/ (+ b (* y (* 9.0 x))) (* z c))
(if (<= z 2.2e+130)
t_1
(if (<= z 5e+216)
(* 9.0 (/ (* x (/ y z)) c))
(* a (/ (* t -4.0) c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * ((a * t) / c);
double tmp;
if (z <= -1.45e-10) {
tmp = t_1;
} else if (z <= 1.9e+84) {
tmp = (b + (y * (9.0 * x))) / (z * c);
} else if (z <= 2.2e+130) {
tmp = t_1;
} else if (z <= 5e+216) {
tmp = 9.0 * ((x * (y / z)) / c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * ((a * t) / c)
if (z <= (-1.45d-10)) then
tmp = t_1
else if (z <= 1.9d+84) then
tmp = (b + (y * (9.0d0 * x))) / (z * c)
else if (z <= 2.2d+130) then
tmp = t_1
else if (z <= 5d+216) then
tmp = 9.0d0 * ((x * (y / z)) / c)
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * ((a * t) / c);
double tmp;
if (z <= -1.45e-10) {
tmp = t_1;
} else if (z <= 1.9e+84) {
tmp = (b + (y * (9.0 * x))) / (z * c);
} else if (z <= 2.2e+130) {
tmp = t_1;
} else if (z <= 5e+216) {
tmp = 9.0 * ((x * (y / z)) / c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * ((a * t) / c) tmp = 0 if z <= -1.45e-10: tmp = t_1 elif z <= 1.9e+84: tmp = (b + (y * (9.0 * x))) / (z * c) elif z <= 2.2e+130: tmp = t_1 elif z <= 5e+216: tmp = 9.0 * ((x * (y / z)) / c) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(Float64(a * t) / c)) tmp = 0.0 if (z <= -1.45e-10) tmp = t_1; elseif (z <= 1.9e+84) tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c)); elseif (z <= 2.2e+130) tmp = t_1; elseif (z <= 5e+216) tmp = Float64(9.0 * Float64(Float64(x * Float64(y / z)) / c)); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * ((a * t) / c);
tmp = 0.0;
if (z <= -1.45e-10)
tmp = t_1;
elseif (z <= 1.9e+84)
tmp = (b + (y * (9.0 * x))) / (z * c);
elseif (z <= 2.2e+130)
tmp = t_1;
elseif (z <= 5e+216)
tmp = 9.0 * ((x * (y / z)) / c);
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.45e-10], t$95$1, If[LessEqual[z, 1.9e+84], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.2e+130], t$95$1, If[LessEqual[z, 5e+216], N[(9.0 * N[(N[(x * N[(y / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $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}
t_1 := -4 \cdot \frac{a \cdot t}{c}\\
\mathbf{if}\;z \leq -1.45 \cdot 10^{-10}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{+84}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 2.2 \cdot 10^{+130}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5 \cdot 10^{+216}:\\
\;\;\;\;9 \cdot \frac{x \cdot \frac{y}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if z < -1.4499999999999999e-10 or 1.9e84 < z < 2.19999999999999993e130Initial program 55.9%
associate-+l-55.9%
*-commutative55.9%
associate-*r*61.1%
*-commutative61.1%
associate-+l-61.1%
associate-*l*61.0%
associate-*l*65.8%
*-commutative65.8%
Simplified65.8%
Taylor expanded in z around inf 66.1%
*-commutative66.1%
Simplified66.1%
if -1.4499999999999999e-10 < z < 1.9e84Initial program 97.0%
associate-+l-97.0%
*-commutative97.0%
associate-*r*95.7%
*-commutative95.7%
associate-+l-95.7%
associate-*l*95.6%
associate-*l*91.8%
*-commutative91.8%
Simplified91.8%
Taylor expanded in x around inf 83.0%
associate-*r*83.0%
Simplified83.0%
if 2.19999999999999993e130 < z < 4.9999999999999998e216Initial program 48.4%
associate-+l-48.4%
*-commutative48.4%
associate-*r*53.2%
*-commutative53.2%
associate-+l-53.2%
associate-*l*53.3%
associate-*l*65.3%
*-commutative65.3%
Simplified65.3%
Taylor expanded in x around 0 53.6%
Taylor expanded in c around 0 82.6%
Taylor expanded in x around inf 51.7%
associate-*r/63.0%
Simplified63.0%
associate-*r/51.7%
associate-/l*51.6%
associate-*r/63.0%
Applied egg-rr63.0%
if 4.9999999999999998e216 < z Initial program 52.4%
associate-+l-52.4%
*-commutative52.4%
associate-*r*51.6%
*-commutative51.6%
associate-+l-51.6%
associate-*l*51.6%
associate-*l*56.2%
*-commutative56.2%
Simplified56.2%
Taylor expanded in z around inf 67.4%
*-commutative67.4%
associate-/l*74.2%
associate-*r*74.2%
associate-*l/74.3%
Simplified74.3%
Final simplification76.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 -1.95e+46) (not (<= z 1e-14))) (/ (- (+ (* 9.0 (/ (* x y) z)) (/ b z)) (* 4.0 (* a t))) c) (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.95e+46) || !(z <= 1e-14)) {
tmp = (((9.0 * ((x * y) / z)) + (b / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.95d+46)) .or. (.not. (z <= 1d-14))) then
tmp = (((9.0d0 * ((x * y) / z)) + (b / z)) - (4.0d0 * (a * t))) / c
else
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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.95e+46) || !(z <= 1e-14)) {
tmp = (((9.0 * ((x * y) / z)) + (b / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -1.95e+46) or not (z <= 1e-14): tmp = (((9.0 * ((x * y) / z)) + (b / z)) - (4.0 * (a * t))) / c else: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.95e+46) || !(z <= 1e-14)) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) + Float64(b / z)) - Float64(4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); end return tmp end
x, y, 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.95e+46) || ~((z <= 1e-14)))
tmp = (((9.0 * ((x * y) / z)) + (b / z)) - (4.0 * (a * t))) / c;
else
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.95e+46], N[Not[LessEqual[z, 1e-14]], $MachinePrecision]], N[(N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, 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.95 \cdot 10^{+46} \lor \neg \left(z \leq 10^{-14}\right):\\
\;\;\;\;\frac{\left(9 \cdot \frac{x \cdot y}{z} + \frac{b}{z}\right) - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.94999999999999997e46 or 9.99999999999999999e-15 < z Initial program 56.9%
associate-+l-56.9%
*-commutative56.9%
associate-*r*60.2%
*-commutative60.2%
associate-+l-60.2%
associate-*l*60.2%
associate-*l*65.5%
*-commutative65.5%
Simplified65.5%
Taylor expanded in x around 0 78.9%
Taylor expanded in c around 0 87.3%
if -1.94999999999999997e46 < z < 9.99999999999999999e-15Initial program 98.1%
Final simplification93.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 4.0 (* a t))))
(if (<= z -2.3e+56)
(/ (- (* 9.0 (/ (* x y) z)) t_1) c)
(if (<= z 1.45e+84)
(/ (+ b (- (* x (* 9.0 y)) (* (* a t) (* z 4.0)))) (* z c))
(/ (- (/ 9.0 (/ z (* x y))) t_1) 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 = 4.0 * (a * t);
double tmp;
if (z <= -2.3e+56) {
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
} else if (z <= 1.45e+84) {
tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c);
} else {
tmp = ((9.0 / (z / (x * y))) - t_1) / 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 = 4.0d0 * (a * t)
if (z <= (-2.3d+56)) then
tmp = ((9.0d0 * ((x * y) / z)) - t_1) / c
else if (z <= 1.45d+84) then
tmp = (b + ((x * (9.0d0 * y)) - ((a * t) * (z * 4.0d0)))) / (z * c)
else
tmp = ((9.0d0 / (z / (x * y))) - t_1) / 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 = 4.0 * (a * t);
double tmp;
if (z <= -2.3e+56) {
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
} else if (z <= 1.45e+84) {
tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c);
} else {
tmp = ((9.0 / (z / (x * y))) - t_1) / 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 = 4.0 * (a * t) tmp = 0 if z <= -2.3e+56: tmp = ((9.0 * ((x * y) / z)) - t_1) / c elif z <= 1.45e+84: tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c) else: tmp = ((9.0 / (z / (x * y))) - t_1) / 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(4.0 * Float64(a * t)) tmp = 0.0 if (z <= -2.3e+56) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) - t_1) / c); elseif (z <= 1.45e+84) tmp = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(a * t) * Float64(z * 4.0)))) / Float64(z * c)); else tmp = Float64(Float64(Float64(9.0 / Float64(z / Float64(x * y))) - t_1) / 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 = 4.0 * (a * t);
tmp = 0.0;
if (z <= -2.3e+56)
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
elseif (z <= 1.45e+84)
tmp = (b + ((x * (9.0 * y)) - ((a * t) * (z * 4.0)))) / (z * c);
else
tmp = ((9.0 / (z / (x * y))) - t_1) / 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[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.3e+56], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 1.45e+84], N[(N[(b + N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(a * t), $MachinePrecision] * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / N[(z / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $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 := 4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -2.3 \cdot 10^{+56}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{z} - t\_1}{c}\\
\mathbf{elif}\;z \leq 1.45 \cdot 10^{+84}:\\
\;\;\;\;\frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(a \cdot t\right) \cdot \left(z \cdot 4\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{9}{\frac{z}{x \cdot y}} - t\_1}{c}\\
\end{array}
\end{array}
if z < -2.30000000000000015e56Initial program 43.7%
associate-+l-43.7%
*-commutative43.7%
associate-*r*53.8%
*-commutative53.8%
associate-+l-53.8%
associate-*l*53.8%
associate-*l*58.6%
*-commutative58.6%
Simplified58.6%
Taylor expanded in x around 0 82.7%
Taylor expanded in c around 0 87.7%
Taylor expanded in b around 0 80.6%
if -2.30000000000000015e56 < z < 1.44999999999999994e84Initial program 96.6%
associate-+l-96.6%
*-commutative96.6%
associate-*r*95.4%
*-commutative95.4%
associate-+l-95.4%
associate-*l*95.3%
associate-*l*91.8%
*-commutative91.8%
Simplified91.8%
if 1.44999999999999994e84 < z Initial program 53.6%
associate-+l-53.6%
*-commutative53.6%
associate-*r*53.0%
*-commutative53.0%
associate-+l-53.0%
associate-*l*53.0%
associate-*l*61.0%
*-commutative61.0%
Simplified61.0%
Taylor expanded in x around 0 72.1%
Taylor expanded in c around 0 85.0%
Taylor expanded in b around 0 76.1%
clear-num76.1%
un-div-inv76.1%
Applied egg-rr76.1%
Final simplification86.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 4.0 (* a t))))
(if (<= z -1.45e+49)
(/ (- (* 9.0 (/ (* x y) z)) t_1) c)
(if (<= z 8.2e+83)
(/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))
(/ (- (/ 9.0 (/ z (* x y))) t_1) 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 = 4.0 * (a * t);
double tmp;
if (z <= -1.45e+49) {
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
} else if (z <= 8.2e+83) {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = ((9.0 / (z / (x * y))) - t_1) / 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 = 4.0d0 * (a * t)
if (z <= (-1.45d+49)) then
tmp = ((9.0d0 * ((x * y) / z)) - t_1) / c
else if (z <= 8.2d+83) then
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
else
tmp = ((9.0d0 / (z / (x * y))) - t_1) / 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 = 4.0 * (a * t);
double tmp;
if (z <= -1.45e+49) {
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
} else if (z <= 8.2e+83) {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = ((9.0 / (z / (x * y))) - t_1) / 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 = 4.0 * (a * t) tmp = 0 if z <= -1.45e+49: tmp = ((9.0 * ((x * y) / z)) - t_1) / c elif z <= 8.2e+83: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) else: tmp = ((9.0 / (z / (x * y))) - t_1) / 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(4.0 * Float64(a * t)) tmp = 0.0 if (z <= -1.45e+49) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) - t_1) / c); elseif (z <= 8.2e+83) tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); else tmp = Float64(Float64(Float64(9.0 / Float64(z / Float64(x * y))) - t_1) / 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 = 4.0 * (a * t);
tmp = 0.0;
if (z <= -1.45e+49)
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
elseif (z <= 8.2e+83)
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
else
tmp = ((9.0 / (z / (x * y))) - t_1) / 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[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.45e+49], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 8.2e+83], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / N[(z / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $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 := 4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -1.45 \cdot 10^{+49}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{z} - t\_1}{c}\\
\mathbf{elif}\;z \leq 8.2 \cdot 10^{+83}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{9}{\frac{z}{x \cdot y}} - t\_1}{c}\\
\end{array}
\end{array}
if z < -1.45e49Initial program 43.7%
associate-+l-43.7%
*-commutative43.7%
associate-*r*53.8%
*-commutative53.8%
associate-+l-53.8%
associate-*l*53.8%
associate-*l*58.6%
*-commutative58.6%
Simplified58.6%
Taylor expanded in x around 0 82.7%
Taylor expanded in c around 0 87.7%
Taylor expanded in b around 0 80.6%
if -1.45e49 < z < 8.2000000000000002e83Initial program 96.6%
if 8.2000000000000002e83 < z Initial program 53.6%
associate-+l-53.6%
*-commutative53.6%
associate-*r*53.0%
*-commutative53.0%
associate-+l-53.0%
associate-*l*53.0%
associate-*l*61.0%
*-commutative61.0%
Simplified61.0%
Taylor expanded in x around 0 72.1%
Taylor expanded in c around 0 85.0%
Taylor expanded in b around 0 76.1%
clear-num76.1%
un-div-inv76.1%
Applied egg-rr76.1%
Final simplification90.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -2.6e-13) (not (<= z 3e+55))) (/ (- (* 9.0 (/ (* x y) z)) (* 4.0 (* a t))) c) (/ (+ b (* y (* 9.0 x))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.6e-13) || !(z <= 3e+55)) {
tmp = ((9.0 * ((x * y) / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + (y * (9.0 * x))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((z <= (-2.6d-13)) .or. (.not. (z <= 3d+55))) then
tmp = ((9.0d0 * ((x * y) / z)) - (4.0d0 * (a * t))) / c
else
tmp = (b + (y * (9.0d0 * x))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.6e-13) || !(z <= 3e+55)) {
tmp = ((9.0 * ((x * y) / z)) - (4.0 * (a * t))) / c;
} else {
tmp = (b + (y * (9.0 * x))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -2.6e-13) or not (z <= 3e+55): tmp = ((9.0 * ((x * y) / z)) - (4.0 * (a * t))) / c else: tmp = (b + (y * (9.0 * x))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.6e-13) || !(z <= 3e+55)) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) - Float64(4.0 * Float64(a * t))) / c); else tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -2.6e-13) || ~((z <= 3e+55)))
tmp = ((9.0 * ((x * y) / z)) - (4.0 * (a * t))) / c;
else
tmp = (b + (y * (9.0 * x))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.6e-13], N[Not[LessEqual[z, 3e+55]], $MachinePrecision]], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.6 \cdot 10^{-13} \lor \neg \left(z \leq 3 \cdot 10^{+55}\right):\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{z} - 4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.6e-13 or 3.00000000000000017e55 < z Initial program 56.2%
associate-+l-56.2%
*-commutative56.2%
associate-*r*59.5%
*-commutative59.5%
associate-+l-59.5%
associate-*l*59.5%
associate-*l*64.9%
*-commutative64.9%
Simplified64.9%
Taylor expanded in x around 0 77.6%
Taylor expanded in c around 0 87.0%
Taylor expanded in b around 0 78.0%
if -2.6e-13 < z < 3.00000000000000017e55Initial program 98.1%
associate-+l-98.1%
*-commutative98.1%
associate-*r*96.7%
*-commutative96.7%
associate-+l-96.7%
associate-*l*96.6%
associate-*l*92.6%
*-commutative92.6%
Simplified92.6%
Taylor expanded in x around inf 83.8%
associate-*r*83.9%
Simplified83.9%
Final simplification81.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 (* 4.0 (* a t))))
(if (<= z -1.2e-13)
(/ (- (* 9.0 (/ (* x y) z)) t_1) c)
(if (<= z 7.5e+54)
(/ (+ b (* y (* 9.0 x))) (* z c))
(/ (- (/ 9.0 (/ z (* x y))) t_1) 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 = 4.0 * (a * t);
double tmp;
if (z <= -1.2e-13) {
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
} else if (z <= 7.5e+54) {
tmp = (b + (y * (9.0 * x))) / (z * c);
} else {
tmp = ((9.0 / (z / (x * y))) - t_1) / 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 = 4.0d0 * (a * t)
if (z <= (-1.2d-13)) then
tmp = ((9.0d0 * ((x * y) / z)) - t_1) / c
else if (z <= 7.5d+54) then
tmp = (b + (y * (9.0d0 * x))) / (z * c)
else
tmp = ((9.0d0 / (z / (x * y))) - t_1) / 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 = 4.0 * (a * t);
double tmp;
if (z <= -1.2e-13) {
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
} else if (z <= 7.5e+54) {
tmp = (b + (y * (9.0 * x))) / (z * c);
} else {
tmp = ((9.0 / (z / (x * y))) - t_1) / 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 = 4.0 * (a * t) tmp = 0 if z <= -1.2e-13: tmp = ((9.0 * ((x * y) / z)) - t_1) / c elif z <= 7.5e+54: tmp = (b + (y * (9.0 * x))) / (z * c) else: tmp = ((9.0 / (z / (x * y))) - t_1) / 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(4.0 * Float64(a * t)) tmp = 0.0 if (z <= -1.2e-13) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / z)) - t_1) / c); elseif (z <= 7.5e+54) tmp = Float64(Float64(b + Float64(y * Float64(9.0 * x))) / Float64(z * c)); else tmp = Float64(Float64(Float64(9.0 / Float64(z / Float64(x * y))) - t_1) / 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 = 4.0 * (a * t);
tmp = 0.0;
if (z <= -1.2e-13)
tmp = ((9.0 * ((x * y) / z)) - t_1) / c;
elseif (z <= 7.5e+54)
tmp = (b + (y * (9.0 * x))) / (z * c);
else
tmp = ((9.0 / (z / (x * y))) - t_1) / 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[(4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.2e-13], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 7.5e+54], N[(N[(b + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / N[(z / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $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 := 4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -1.2 \cdot 10^{-13}:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{z} - t\_1}{c}\\
\mathbf{elif}\;z \leq 7.5 \cdot 10^{+54}:\\
\;\;\;\;\frac{b + y \cdot \left(9 \cdot x\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{9}{\frac{z}{x \cdot y}} - t\_1}{c}\\
\end{array}
\end{array}
if z < -1.1999999999999999e-13Initial program 56.5%
associate-+l-56.5%
*-commutative56.5%
associate-*r*63.9%
*-commutative63.9%
associate-+l-63.9%
associate-*l*63.9%
associate-*l*67.5%
*-commutative67.5%
Simplified67.5%
Taylor expanded in x around 0 83.5%
Taylor expanded in c around 0 89.1%
Taylor expanded in b around 0 81.6%
if -1.1999999999999999e-13 < z < 7.50000000000000042e54Initial program 98.1%
associate-+l-98.1%
*-commutative98.1%
associate-*r*96.7%
*-commutative96.7%
associate-+l-96.7%
associate-*l*96.6%
associate-*l*92.6%
*-commutative92.6%
Simplified92.6%
Taylor expanded in x around inf 83.8%
associate-*r*83.9%
Simplified83.9%
if 7.50000000000000042e54 < z Initial program 56.0%
associate-+l-56.0%
*-commutative56.0%
associate-*r*55.4%
*-commutative55.4%
associate-+l-55.4%
associate-*l*55.4%
associate-*l*62.5%
*-commutative62.5%
Simplified62.5%
Taylor expanded in x around 0 72.2%
Taylor expanded in c around 0 85.2%
Taylor expanded in b around 0 74.6%
clear-num74.6%
un-div-inv74.7%
Applied egg-rr74.7%
Final simplification81.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 (* 9.0 (* x (/ y (* z c))))))
(if (<= x -7.8e+105)
t_1
(if (<= x -1.85e-296)
(* -4.0 (* a (/ t c)))
(if (<= x 2.5e-189) (/ 1.0 (/ (* z c) b)) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * (y / (z * c)));
double tmp;
if (x <= -7.8e+105) {
tmp = t_1;
} else if (x <= -1.85e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * (x * (y / (z * c)))
if (x <= (-7.8d+105)) then
tmp = t_1
else if (x <= (-1.85d-296)) then
tmp = (-4.0d0) * (a * (t / c))
else if (x <= 2.5d-189) then
tmp = 1.0d0 / ((z * c) / b)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * (y / (z * c)));
double tmp;
if (x <= -7.8e+105) {
tmp = t_1;
} else if (x <= -1.85e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * (x * (y / (z * c))) tmp = 0 if x <= -7.8e+105: tmp = t_1 elif x <= -1.85e-296: tmp = -4.0 * (a * (t / c)) elif x <= 2.5e-189: tmp = 1.0 / ((z * c) / b) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))) tmp = 0.0 if (x <= -7.8e+105) tmp = t_1; elseif (x <= -1.85e-296) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (x <= 2.5e-189) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * (x * (y / (z * c)));
tmp = 0.0;
if (x <= -7.8e+105)
tmp = t_1;
elseif (x <= -1.85e-296)
tmp = -4.0 * (a * (t / c));
elseif (x <= 2.5e-189)
tmp = 1.0 / ((z * c) / b);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -7.8e+105], t$95$1, If[LessEqual[x, -1.85e-296], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.5e-189], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{if}\;x \leq -7.8 \cdot 10^{+105}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -1.85 \cdot 10^{-296}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;x \leq 2.5 \cdot 10^{-189}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -7.79999999999999957e105 or 2.4999999999999999e-189 < x Initial program 76.6%
associate-+l-76.6%
*-commutative76.6%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in x around 0 71.1%
Taylor expanded in x around inf 49.4%
associate-*r/51.3%
Simplified51.3%
if -7.79999999999999957e105 < x < -1.85000000000000013e-296Initial program 84.4%
associate-+l-84.4%
*-commutative84.4%
associate-*r*86.4%
*-commutative86.4%
associate-+l-86.4%
associate-*l*86.4%
associate-*l*85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in x around 0 89.1%
Taylor expanded in z around inf 50.1%
associate-*r/46.6%
Simplified46.6%
if -1.85000000000000013e-296 < x < 2.4999999999999999e-189Initial program 82.1%
associate-+l-82.1%
*-commutative82.1%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
associate-*l*82.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 64.8%
associate-/r*62.7%
Simplified62.7%
clear-num62.7%
inv-pow62.7%
Applied egg-rr62.7%
unpow-162.7%
associate-/r/61.0%
Simplified61.0%
associate-*l/64.8%
Applied egg-rr64.8%
Final simplification51.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* x (/ (/ y c) z)))))
(if (<= x -2.4e+105)
t_1
(if (<= x -2.4e-296)
(* -4.0 (* a (/ t c)))
(if (<= x 2.5e-189) (/ 1.0 (/ (* z c) b)) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * ((y / c) / z));
double tmp;
if (x <= -2.4e+105) {
tmp = t_1;
} else if (x <= -2.4e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = 9.0d0 * (x * ((y / c) / z))
if (x <= (-2.4d+105)) then
tmp = t_1
else if (x <= (-2.4d-296)) then
tmp = (-4.0d0) * (a * (t / c))
else if (x <= 2.5d-189) then
tmp = 1.0d0 / ((z * c) / b)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * ((y / c) / z));
double tmp;
if (x <= -2.4e+105) {
tmp = t_1;
} else if (x <= -2.4e-296) {
tmp = -4.0 * (a * (t / c));
} else if (x <= 2.5e-189) {
tmp = 1.0 / ((z * c) / b);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * (x * ((y / c) / z)) tmp = 0 if x <= -2.4e+105: tmp = t_1 elif x <= -2.4e-296: tmp = -4.0 * (a * (t / c)) elif x <= 2.5e-189: tmp = 1.0 / ((z * c) / b) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(x * Float64(Float64(y / c) / z))) tmp = 0.0 if (x <= -2.4e+105) tmp = t_1; elseif (x <= -2.4e-296) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (x <= 2.5e-189) tmp = Float64(1.0 / Float64(Float64(z * c) / b)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * (x * ((y / c) / z));
tmp = 0.0;
if (x <= -2.4e+105)
tmp = t_1;
elseif (x <= -2.4e-296)
tmp = -4.0 * (a * (t / c));
elseif (x <= 2.5e-189)
tmp = 1.0 / ((z * c) / b);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(N[(y / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.4e+105], t$95$1, If[LessEqual[x, -2.4e-296], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.5e-189], N[(1.0 / N[(N[(z * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{\frac{y}{c}}{z}\right)\\
\mathbf{if}\;x \leq -2.4 \cdot 10^{+105}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -2.4 \cdot 10^{-296}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;x \leq 2.5 \cdot 10^{-189}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c}{b}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -2.39999999999999975e105 or 2.4999999999999999e-189 < x Initial program 76.6%
associate-+l-76.6%
*-commutative76.6%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
associate-*l*76.6%
associate-*l*77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in x around inf 49.4%
associate-/r*51.3%
associate-/l*53.2%
Simplified53.2%
associate-/l*53.8%
Applied egg-rr53.8%
if -2.39999999999999975e105 < x < -2.39999999999999996e-296Initial program 84.4%
associate-+l-84.4%
*-commutative84.4%
associate-*r*86.4%
*-commutative86.4%
associate-+l-86.4%
associate-*l*86.4%
associate-*l*85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in x around 0 89.1%
Taylor expanded in z around inf 50.1%
associate-*r/46.6%
Simplified46.6%
if -2.39999999999999996e-296 < x < 2.4999999999999999e-189Initial program 82.1%
associate-+l-82.1%
*-commutative82.1%
associate-*r*82.3%
*-commutative82.3%
associate-+l-82.3%
associate-*l*82.3%
associate-*l*82.3%
*-commutative82.3%
Simplified82.3%
Taylor expanded in b around inf 64.8%
associate-/r*62.7%
Simplified62.7%
clear-num62.7%
inv-pow62.7%
Applied egg-rr62.7%
unpow-162.7%
associate-/r/61.0%
Simplified61.0%
associate-*l/64.8%
Applied egg-rr64.8%
Final simplification52.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 -2.55e-14) (not (<= z 1.55e+84))) (* -4.0 (* a (/ t c))) (/ b (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.55e-14) || !(z <= 1.55e+84)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.55d-14)) .or. (.not. (z <= 1.55d+84))) then
tmp = (-4.0d0) * (a * (t / c))
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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.55e-14) || !(z <= 1.55e+84)) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -2.55e-14) or not (z <= 1.55e+84): tmp = -4.0 * (a * (t / c)) else: tmp = b / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.55e-14) || !(z <= 1.55e+84)) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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.55e-14) || ~((z <= 1.55e+84)))
tmp = -4.0 * (a * (t / c));
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.55e-14], N[Not[LessEqual[z, 1.55e+84]], $MachinePrecision]], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.55 \cdot 10^{-14} \lor \neg \left(z \leq 1.55 \cdot 10^{+84}\right):\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.5499999999999999e-14 or 1.55000000000000001e84 < z Initial program 54.6%
associate-+l-54.6%
*-commutative54.6%
associate-*r*58.2%
*-commutative58.2%
associate-+l-58.2%
associate-*l*58.2%
associate-*l*64.0%
*-commutative64.0%
Simplified64.0%
Taylor expanded in x around 0 77.7%
Taylor expanded in z around inf 58.9%
associate-*r/57.1%
Simplified57.1%
if -2.5499999999999999e-14 < z < 1.55000000000000001e84Initial program 96.9%
associate-+l-96.9%
*-commutative96.9%
associate-*r*95.6%
*-commutative95.6%
associate-+l-95.6%
associate-*l*95.6%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in b around inf 50.5%
*-commutative50.5%
Simplified50.5%
Final simplification53.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -8.2e-17) (* -4.0 (* a (/ t c))) (if (<= z 1.55e+84) (/ b (* z c)) (* a (/ (* t -4.0) c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8.2e-17) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 1.55e+84) {
tmp = b / (z * c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-8.2d-17)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= 1.55d+84) then
tmp = b / (z * c)
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8.2e-17) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 1.55e+84) {
tmp = b / (z * c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -8.2e-17: tmp = -4.0 * (a * (t / c)) elif z <= 1.55e+84: tmp = b / (z * c) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -8.2e-17) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= 1.55e+84) tmp = Float64(b / Float64(z * c)); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -8.2e-17)
tmp = -4.0 * (a * (t / c));
elseif (z <= 1.55e+84)
tmp = b / (z * c);
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -8.2e-17], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.55e+84], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $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 -8.2 \cdot 10^{-17}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq 1.55 \cdot 10^{+84}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if z < -8.2000000000000001e-17Initial program 56.5%
associate-+l-56.5%
*-commutative56.5%
associate-*r*63.9%
*-commutative63.9%
associate-+l-63.9%
associate-*l*63.9%
associate-*l*67.5%
*-commutative67.5%
Simplified67.5%
Taylor expanded in x around 0 83.5%
Taylor expanded in z around inf 60.8%
associate-*r/57.4%
Simplified57.4%
if -8.2000000000000001e-17 < z < 1.55000000000000001e84Initial program 96.9%
associate-+l-96.9%
*-commutative96.9%
associate-*r*95.6%
*-commutative95.6%
associate-+l-95.6%
associate-*l*95.6%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in b around inf 50.5%
*-commutative50.5%
Simplified50.5%
if 1.55000000000000001e84 < z Initial program 52.7%
associate-+l-52.7%
*-commutative52.7%
associate-*r*52.1%
*-commutative52.1%
associate-+l-52.1%
associate-*l*52.1%
associate-*l*60.3%
*-commutative60.3%
Simplified60.3%
Taylor expanded in z around inf 56.9%
*-commutative56.9%
associate-/l*56.8%
associate-*r*56.8%
associate-*l/56.9%
Simplified56.9%
Final simplification53.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z -2.9e-16) (* -4.0 (* a (/ t c))) (if (<= z 1.5e+84) (* b (/ 1.0 (* z c))) (* a (/ (* t -4.0) c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.9e-16) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 1.5e+84) {
tmp = b * (1.0 / (z * c));
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-2.9d-16)) then
tmp = (-4.0d0) * (a * (t / c))
else if (z <= 1.5d+84) then
tmp = b * (1.0d0 / (z * c))
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.9e-16) {
tmp = -4.0 * (a * (t / c));
} else if (z <= 1.5e+84) {
tmp = b * (1.0 / (z * c));
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -2.9e-16: tmp = -4.0 * (a * (t / c)) elif z <= 1.5e+84: tmp = b * (1.0 / (z * c)) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -2.9e-16) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (z <= 1.5e+84) tmp = Float64(b * Float64(1.0 / Float64(z * c))); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -2.9e-16)
tmp = -4.0 * (a * (t / c));
elseif (z <= 1.5e+84)
tmp = b * (1.0 / (z * c));
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -2.9e-16], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.5e+84], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $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 -2.9 \cdot 10^{-16}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;z \leq 1.5 \cdot 10^{+84}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if z < -2.8999999999999998e-16Initial program 56.5%
associate-+l-56.5%
*-commutative56.5%
associate-*r*63.9%
*-commutative63.9%
associate-+l-63.9%
associate-*l*63.9%
associate-*l*67.5%
*-commutative67.5%
Simplified67.5%
Taylor expanded in x around 0 83.5%
Taylor expanded in z around inf 60.8%
associate-*r/57.4%
Simplified57.4%
if -2.8999999999999998e-16 < z < 1.49999999999999998e84Initial program 96.9%
associate-+l-96.9%
*-commutative96.9%
associate-*r*95.6%
*-commutative95.6%
associate-+l-95.6%
associate-*l*95.6%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in x around 0 78.5%
Taylor expanded in c around 0 85.2%
Taylor expanded in b around inf 45.5%
associate-/l/50.5%
div-inv51.0%
*-commutative51.0%
Applied egg-rr51.0%
if 1.49999999999999998e84 < z Initial program 52.7%
associate-+l-52.7%
*-commutative52.7%
associate-*r*52.1%
*-commutative52.1%
associate-+l-52.1%
associate-*l*52.1%
associate-*l*60.3%
*-commutative60.3%
Simplified60.3%
Taylor expanded in z around inf 56.9%
*-commutative56.9%
associate-/l*56.8%
associate-*r*56.8%
associate-*l/56.9%
Simplified56.9%
Final simplification53.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 -8e-13) (* -4.0 (/ (* a t) c)) (if (<= z 2.3e+84) (* b (/ 1.0 (* z c))) (* a (/ (* t -4.0) c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8e-13) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 2.3e+84) {
tmp = b * (1.0 / (z * c));
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-8d-13)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (z <= 2.3d+84) then
tmp = b * (1.0d0 / (z * c))
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8e-13) {
tmp = -4.0 * ((a * t) / c);
} else if (z <= 2.3e+84) {
tmp = b * (1.0 / (z * c));
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -8e-13: tmp = -4.0 * ((a * t) / c) elif z <= 2.3e+84: tmp = b * (1.0 / (z * c)) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -8e-13) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (z <= 2.3e+84) tmp = Float64(b * Float64(1.0 / Float64(z * c))); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -8e-13)
tmp = -4.0 * ((a * t) / c);
elseif (z <= 2.3e+84)
tmp = b * (1.0 / (z * c));
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -8e-13], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.3e+84], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $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 -8 \cdot 10^{-13}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 2.3 \cdot 10^{+84}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if z < -8.0000000000000002e-13Initial program 56.5%
associate-+l-56.5%
*-commutative56.5%
associate-*r*63.9%
*-commutative63.9%
associate-+l-63.9%
associate-*l*63.9%
associate-*l*67.5%
*-commutative67.5%
Simplified67.5%
Taylor expanded in z around inf 60.8%
*-commutative60.8%
Simplified60.8%
if -8.0000000000000002e-13 < z < 2.2999999999999999e84Initial program 96.9%
associate-+l-96.9%
*-commutative96.9%
associate-*r*95.6%
*-commutative95.6%
associate-+l-95.6%
associate-*l*95.6%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in x around 0 78.5%
Taylor expanded in c around 0 85.2%
Taylor expanded in b around inf 45.5%
associate-/l/50.5%
div-inv51.0%
*-commutative51.0%
Applied egg-rr51.0%
if 2.2999999999999999e84 < z Initial program 52.7%
associate-+l-52.7%
*-commutative52.7%
associate-*r*52.1%
*-commutative52.1%
associate-+l-52.1%
associate-*l*52.1%
associate-*l*60.3%
*-commutative60.3%
Simplified60.3%
Taylor expanded in z around inf 56.9%
*-commutative56.9%
associate-/l*56.8%
associate-*r*56.8%
associate-*l/56.9%
Simplified56.9%
Final simplification54.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 79.6%
associate-+l-79.6%
*-commutative79.6%
associate-*r*80.2%
*-commutative80.2%
associate-+l-80.2%
associate-*l*80.2%
associate-*l*80.4%
*-commutative80.4%
Simplified80.4%
Taylor expanded in b around inf 36.8%
*-commutative36.8%
Simplified36.8%
Final simplification36.8%
(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 2024076
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) -1.100156740804105e-171) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 0.0) (/ (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.1708877911747488e-53) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 2.876823679546137e+130) (- (+ (* (* 9.0 (/ y c)) (/ x z)) (/ b (* c z))) (* 4.0 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.3838515042456319e+158) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (- (+ (* 9.0 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4.0 (/ (* a t) c))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))