
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 -2e+221)
(- (* x (/ y (* a 2.0))) (* z (/ (* 9.0 t) (* a 2.0))))
(if (<= t_1 5e+298)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(* t (+ (* -4.5 (/ z a)) (/ 0.5 (* (/ a y) (/ t x)))))))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -2e+221) {
tmp = (x * (y / (a * 2.0))) - (z * ((9.0 * t) / (a * 2.0)));
} else if (t_1 <= 5e+298) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x))));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: t_1
real(8) :: tmp
t_1 = (x * y) - ((z * 9.0d0) * t)
if (t_1 <= (-2d+221)) then
tmp = (x * (y / (a * 2.0d0))) - (z * ((9.0d0 * t) / (a * 2.0d0)))
else if (t_1 <= 5d+298) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = t * (((-4.5d0) * (z / a)) + (0.5d0 / ((a / y) * (t / x))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -2e+221) {
tmp = (x * (y / (a * 2.0))) - (z * ((9.0 * t) / (a * 2.0)));
} else if (t_1 <= 5e+298) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x))));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_1 <= -2e+221: tmp = (x * (y / (a * 2.0))) - (z * ((9.0 * t) / (a * 2.0))) elif t_1 <= 5e+298: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x)))) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= -2e+221) tmp = Float64(Float64(x * Float64(y / Float64(a * 2.0))) - Float64(z * Float64(Float64(9.0 * t) / Float64(a * 2.0)))); elseif (t_1 <= 5e+298) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(t * Float64(Float64(-4.5 * Float64(z / a)) + Float64(0.5 / Float64(Float64(a / y) * Float64(t / x))))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_1 <= -2e+221)
tmp = (x * (y / (a * 2.0))) - (z * ((9.0 * t) / (a * 2.0)));
elseif (t_1 <= 5e+298)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+221], N[(N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(z * N[(N[(9.0 * t), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+298], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 / N[(N[(a / y), $MachinePrecision] * N[(t / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+221}:\\
\;\;\;\;x \cdot \frac{y}{a \cdot 2} - z \cdot \frac{9 \cdot t}{a \cdot 2}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a} + \frac{0.5}{\frac{a}{y} \cdot \frac{t}{x}}\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -2.0000000000000001e221Initial program 80.7%
div-sub76.2%
*-commutative76.2%
div-sub80.7%
cancel-sign-sub-inv80.7%
*-commutative80.7%
fma-define80.7%
distribute-rgt-neg-in80.7%
associate-*r*80.7%
distribute-lft-neg-in80.7%
*-commutative80.7%
distribute-rgt-neg-in80.7%
metadata-eval80.7%
Simplified80.7%
*-un-lft-identity80.7%
*-un-lft-identity80.7%
*-commutative80.7%
associate-*r*80.7%
metadata-eval80.7%
distribute-rgt-neg-in80.7%
distribute-lft-neg-in80.7%
fmm-def80.7%
div-sub76.2%
associate-/l*86.6%
associate-*l*86.6%
associate-/l*92.9%
Applied egg-rr92.9%
if -2.0000000000000001e221 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 5.0000000000000003e298Initial program 99.2%
div-sub98.0%
*-commutative98.0%
div-sub99.2%
cancel-sign-sub-inv99.2%
*-commutative99.2%
fma-define99.2%
distribute-rgt-neg-in99.2%
associate-*r*99.2%
distribute-lft-neg-in99.2%
*-commutative99.2%
distribute-rgt-neg-in99.2%
metadata-eval99.2%
Simplified99.2%
*-commutative99.2%
associate-*r*99.2%
metadata-eval99.2%
distribute-rgt-neg-in99.2%
distribute-lft-neg-in99.2%
fmm-def99.2%
associate-*l*99.2%
Applied egg-rr99.2%
if 5.0000000000000003e298 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.8%
div-sub62.7%
*-commutative62.7%
div-sub67.8%
cancel-sign-sub-inv67.8%
*-commutative67.8%
fma-define73.2%
distribute-rgt-neg-in73.2%
associate-*r*73.3%
distribute-lft-neg-in73.3%
*-commutative73.3%
distribute-rgt-neg-in73.3%
metadata-eval73.3%
Simplified73.3%
Taylor expanded in t around inf 72.1%
clear-num72.1%
un-div-inv72.1%
*-commutative72.1%
times-frac82.1%
Applied egg-rr82.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 -1e+281)
(/ (- (* x (/ y a)) (* (* 9.0 t) (/ z a))) 2.0)
(if (<= t_1 5e+298)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(* t (+ (* -4.5 (/ z a)) (/ 0.5 (* (/ a y) (/ t x)))))))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -1e+281) {
tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0;
} else if (t_1 <= 5e+298) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x))));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: t_1
real(8) :: tmp
t_1 = (x * y) - ((z * 9.0d0) * t)
if (t_1 <= (-1d+281)) then
tmp = ((x * (y / a)) - ((9.0d0 * t) * (z / a))) / 2.0d0
else if (t_1 <= 5d+298) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = t * (((-4.5d0) * (z / a)) + (0.5d0 / ((a / y) * (t / x))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -1e+281) {
tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0;
} else if (t_1 <= 5e+298) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x))));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_1 <= -1e+281: tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0 elif t_1 <= 5e+298: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x)))) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= -1e+281) tmp = Float64(Float64(Float64(x * Float64(y / a)) - Float64(Float64(9.0 * t) * Float64(z / a))) / 2.0); elseif (t_1 <= 5e+298) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(t * Float64(Float64(-4.5 * Float64(z / a)) + Float64(0.5 / Float64(Float64(a / y) * Float64(t / x))))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_1 <= -1e+281)
tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0;
elseif (t_1 <= 5e+298)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = t * ((-4.5 * (z / a)) + (0.5 / ((a / y) * (t / x))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+281], N[(N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] - N[(N[(9.0 * t), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[t$95$1, 5e+298], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 / N[(N[(a / y), $MachinePrecision] * N[(t / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+281}:\\
\;\;\;\;\frac{x \cdot \frac{y}{a} - \left(9 \cdot t\right) \cdot \frac{z}{a}}{2}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+298}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a} + \frac{0.5}{\frac{a}{y} \cdot \frac{t}{x}}\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e281Initial program 68.8%
div-sub61.4%
*-commutative61.4%
div-sub68.8%
cancel-sign-sub-inv68.8%
*-commutative68.8%
fma-define68.8%
distribute-rgt-neg-in68.8%
associate-*r*68.8%
distribute-lft-neg-in68.8%
*-commutative68.8%
distribute-rgt-neg-in68.8%
metadata-eval68.8%
Simplified68.8%
*-commutative68.8%
associate-*r*68.8%
metadata-eval68.8%
distribute-rgt-neg-in68.8%
distribute-lft-neg-in68.8%
fmm-def68.8%
associate-*l*68.8%
Applied egg-rr68.8%
div-sub61.4%
*-commutative61.4%
times-frac78.3%
times-frac92.1%
Applied egg-rr92.1%
associate-*r/92.1%
associate-*r/92.1%
sub-div92.1%
Applied egg-rr92.1%
if -1e281 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 5.0000000000000003e298Initial program 99.2%
div-sub98.2%
*-commutative98.2%
div-sub99.2%
cancel-sign-sub-inv99.2%
*-commutative99.2%
fma-define99.2%
distribute-rgt-neg-in99.2%
associate-*r*99.2%
distribute-lft-neg-in99.2%
*-commutative99.2%
distribute-rgt-neg-in99.2%
metadata-eval99.2%
Simplified99.2%
*-commutative99.2%
associate-*r*99.2%
metadata-eval99.2%
distribute-rgt-neg-in99.2%
distribute-lft-neg-in99.2%
fmm-def99.2%
associate-*l*99.2%
Applied egg-rr99.2%
if 5.0000000000000003e298 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.8%
div-sub62.7%
*-commutative62.7%
div-sub67.8%
cancel-sign-sub-inv67.8%
*-commutative67.8%
fma-define73.2%
distribute-rgt-neg-in73.2%
associate-*r*73.3%
distribute-lft-neg-in73.3%
*-commutative73.3%
distribute-rgt-neg-in73.3%
metadata-eval73.3%
Simplified73.3%
Taylor expanded in t around inf 72.1%
clear-num72.1%
un-div-inv72.1%
*-commutative72.1%
times-frac82.1%
Applied egg-rr82.1%
Final simplification95.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (or (<= t_1 -1e+281) (not (<= t_1 2e+271)))
(/ (- (* x (/ y a)) (* (* 9.0 t) (/ z a))) 2.0)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -1e+281) || !(t_1 <= 2e+271)) {
tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0;
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: t_1
real(8) :: tmp
t_1 = (x * y) - ((z * 9.0d0) * t)
if ((t_1 <= (-1d+281)) .or. (.not. (t_1 <= 2d+271))) then
tmp = ((x * (y / a)) - ((9.0d0 * t) * (z / a))) / 2.0d0
else
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -1e+281) || !(t_1 <= 2e+271)) {
tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0;
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if (t_1 <= -1e+281) or not (t_1 <= 2e+271): tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0 else: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if ((t_1 <= -1e+281) || !(t_1 <= 2e+271)) tmp = Float64(Float64(Float64(x * Float64(y / a)) - Float64(Float64(9.0 * t) * Float64(z / a))) / 2.0); else tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if ((t_1 <= -1e+281) || ~((t_1 <= 2e+271)))
tmp = ((x * (y / a)) - ((9.0 * t) * (z / a))) / 2.0;
else
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+281], N[Not[LessEqual[t$95$1, 2e+271]], $MachinePrecision]], N[(N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] - N[(N[(9.0 * t), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+281} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+271}\right):\\
\;\;\;\;\frac{x \cdot \frac{y}{a} - \left(9 \cdot t\right) \cdot \frac{z}{a}}{2}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e281 or 1.99999999999999991e271 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 69.1%
div-sub63.2%
*-commutative63.2%
div-sub69.1%
cancel-sign-sub-inv69.1%
*-commutative69.1%
fma-define72.2%
distribute-rgt-neg-in72.2%
associate-*r*72.2%
distribute-lft-neg-in72.2%
*-commutative72.2%
distribute-rgt-neg-in72.2%
metadata-eval72.2%
Simplified72.2%
*-commutative72.2%
associate-*r*72.2%
metadata-eval72.2%
distribute-rgt-neg-in72.2%
distribute-lft-neg-in72.2%
fmm-def69.1%
associate-*l*69.1%
Applied egg-rr69.1%
div-sub63.2%
*-commutative63.2%
times-frac74.3%
times-frac86.5%
Applied egg-rr86.5%
associate-*r/86.5%
associate-*r/86.5%
sub-div86.5%
Applied egg-rr86.5%
if -1e281 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.99999999999999991e271Initial program 99.2%
div-sub98.2%
*-commutative98.2%
div-sub99.2%
cancel-sign-sub-inv99.2%
*-commutative99.2%
fma-define99.2%
distribute-rgt-neg-in99.2%
associate-*r*99.2%
distribute-lft-neg-in99.2%
*-commutative99.2%
distribute-rgt-neg-in99.2%
metadata-eval99.2%
Simplified99.2%
*-commutative99.2%
associate-*r*99.2%
metadata-eval99.2%
distribute-rgt-neg-in99.2%
distribute-lft-neg-in99.2%
fmm-def99.2%
associate-*l*99.2%
Applied egg-rr99.2%
Final simplification95.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* (* z 9.0) t)))
(if (<= t_1 -5e+266)
(* -4.5 (/ z (/ a t)))
(if (<= t_1 1e+276)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(* t (* -4.5 (/ z a)))))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -5e+266) {
tmp = -4.5 * (z / (a / t));
} else if (t_1 <= 1e+276) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = t * (-4.5 * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: t_1
real(8) :: tmp
t_1 = (z * 9.0d0) * t
if (t_1 <= (-5d+266)) then
tmp = (-4.5d0) * (z / (a / t))
else if (t_1 <= 1d+276) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = t * ((-4.5d0) * (z / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -5e+266) {
tmp = -4.5 * (z / (a / t));
} else if (t_1 <= 1e+276) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = t * (-4.5 * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (z * 9.0) * t tmp = 0 if t_1 <= -5e+266: tmp = -4.5 * (z / (a / t)) elif t_1 <= 1e+276: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = t * (-4.5 * (z / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(z * 9.0) * t) tmp = 0.0 if (t_1 <= -5e+266) tmp = Float64(-4.5 * Float64(z / Float64(a / t))); elseif (t_1 <= 1e+276) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(t * Float64(-4.5 * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (z * 9.0) * t;
tmp = 0.0;
if (t_1 <= -5e+266)
tmp = -4.5 * (z / (a / t));
elseif (t_1 <= 1e+276)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = t * (-4.5 * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+266], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+276], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+266}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\mathbf{elif}\;t\_1 \leq 10^{+276}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -4.9999999999999999e266Initial program 70.6%
div-sub66.3%
*-commutative66.3%
div-sub70.6%
cancel-sign-sub-inv70.6%
*-commutative70.6%
fma-define71.2%
distribute-rgt-neg-in71.2%
associate-*r*71.3%
distribute-lft-neg-in71.3%
*-commutative71.3%
distribute-rgt-neg-in71.3%
metadata-eval71.3%
Simplified71.3%
Taylor expanded in x around 0 71.2%
associate-*r/71.2%
associate-*r*71.3%
associate-*l/94.7%
associate-*r/94.6%
associate-*l*94.7%
Simplified94.7%
*-commutative94.7%
clear-num94.7%
un-div-inv94.9%
Applied egg-rr94.9%
if -4.9999999999999999e266 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.0000000000000001e276Initial program 95.9%
div-sub94.5%
*-commutative94.5%
div-sub95.9%
cancel-sign-sub-inv95.9%
*-commutative95.9%
fma-define95.9%
distribute-rgt-neg-in95.9%
associate-*r*95.9%
distribute-lft-neg-in95.9%
*-commutative95.9%
distribute-rgt-neg-in95.9%
metadata-eval95.9%
Simplified95.9%
*-commutative95.9%
associate-*r*95.9%
metadata-eval95.9%
distribute-rgt-neg-in95.9%
distribute-lft-neg-in95.9%
fmm-def95.9%
associate-*l*95.9%
Applied egg-rr95.9%
if 1.0000000000000001e276 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 60.0%
div-sub48.3%
*-commutative48.3%
div-sub60.0%
cancel-sign-sub-inv60.0%
*-commutative60.0%
fma-define71.8%
distribute-rgt-neg-in71.8%
associate-*r*71.9%
distribute-lft-neg-in71.9%
*-commutative71.9%
distribute-rgt-neg-in71.9%
metadata-eval71.9%
Simplified71.9%
Taylor expanded in x around 0 71.9%
*-commutative71.9%
associate-/l*93.9%
associate-*r*93.8%
*-commutative93.8%
Simplified93.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -2.85e+59) (* (/ z a) (* t -4.5)) (if (<= z 2.5e-99) (/ (* x y) (* a 2.0)) (* -4.5 (* z (/ t a))))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -2.85e+59) {
tmp = (z / a) * (t * -4.5);
} else if (z <= 2.5e-99) {
tmp = (x * y) / (a * 2.0);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (z <= (-2.85d+59)) then
tmp = (z / a) * (t * (-4.5d0))
else if (z <= 2.5d-99) then
tmp = (x * y) / (a * 2.0d0)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -2.85e+59) {
tmp = (z / a) * (t * -4.5);
} else if (z <= 2.5e-99) {
tmp = (x * y) / (a * 2.0);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if z <= -2.85e+59: tmp = (z / a) * (t * -4.5) elif z <= 2.5e-99: tmp = (x * y) / (a * 2.0) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -2.85e+59) tmp = Float64(Float64(z / a) * Float64(t * -4.5)); elseif (z <= 2.5e-99) tmp = Float64(Float64(x * y) / Float64(a * 2.0)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -2.85e+59)
tmp = (z / a) * (t * -4.5);
elseif (z <= 2.5e-99)
tmp = (x * y) / (a * 2.0);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -2.85e+59], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.5e-99], N[(N[(x * y), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.85 \cdot 10^{+59}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{-99}:\\
\;\;\;\;\frac{x \cdot y}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if z < -2.8500000000000001e59Initial program 86.4%
div-sub77.1%
*-commutative77.1%
div-sub86.4%
cancel-sign-sub-inv86.4%
*-commutative86.4%
fma-define86.7%
distribute-rgt-neg-in86.7%
associate-*r*86.6%
distribute-lft-neg-in86.6%
*-commutative86.6%
distribute-rgt-neg-in86.6%
metadata-eval86.6%
Simplified86.6%
Taylor expanded in a around 0 86.4%
associate-*r/86.4%
+-commutative86.4%
metadata-eval86.4%
cancel-sign-sub-inv86.4%
cancel-sign-sub-inv86.4%
metadata-eval86.4%
*-commutative86.4%
*-commutative86.4%
associate-*r*86.3%
fma-define86.6%
associate-*l/86.7%
*-commutative86.7%
fma-define86.4%
+-commutative86.4%
fma-define88.7%
Simplified88.7%
Taylor expanded in z around inf 68.1%
associate-*r/72.2%
associate-*r*72.4%
*-commutative72.4%
Simplified72.4%
if -2.8500000000000001e59 < z < 2.49999999999999985e-99Initial program 95.2%
div-sub95.2%
*-commutative95.2%
div-sub95.2%
cancel-sign-sub-inv95.2%
*-commutative95.2%
fma-define95.2%
distribute-rgt-neg-in95.2%
associate-*r*95.2%
distribute-lft-neg-in95.2%
*-commutative95.2%
distribute-rgt-neg-in95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in x around inf 75.9%
if 2.49999999999999985e-99 < z Initial program 88.0%
div-sub85.8%
*-commutative85.8%
div-sub88.0%
cancel-sign-sub-inv88.0%
*-commutative88.0%
fma-define90.2%
distribute-rgt-neg-in90.2%
associate-*r*90.3%
distribute-lft-neg-in90.3%
*-commutative90.3%
distribute-rgt-neg-in90.3%
metadata-eval90.3%
Simplified90.3%
Taylor expanded in x around 0 51.6%
associate-*r/51.5%
associate-*r*51.7%
associate-*l/54.5%
associate-*r/54.6%
associate-*l*54.5%
Simplified54.5%
Final simplification67.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -2.1e+59) (* (/ z a) (* t -4.5)) (if (<= z 1.75e-99) (* (* x y) (/ 0.5 a)) (* -4.5 (* z (/ t a))))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -2.1e+59) {
tmp = (z / a) * (t * -4.5);
} else if (z <= 1.75e-99) {
tmp = (x * y) * (0.5 / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (z <= (-2.1d+59)) then
tmp = (z / a) * (t * (-4.5d0))
else if (z <= 1.75d-99) then
tmp = (x * y) * (0.5d0 / a)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -2.1e+59) {
tmp = (z / a) * (t * -4.5);
} else if (z <= 1.75e-99) {
tmp = (x * y) * (0.5 / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if z <= -2.1e+59: tmp = (z / a) * (t * -4.5) elif z <= 1.75e-99: tmp = (x * y) * (0.5 / a) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -2.1e+59) tmp = Float64(Float64(z / a) * Float64(t * -4.5)); elseif (z <= 1.75e-99) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -2.1e+59)
tmp = (z / a) * (t * -4.5);
elseif (z <= 1.75e-99)
tmp = (x * y) * (0.5 / a);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -2.1e+59], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.75e-99], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.1 \cdot 10^{+59}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;z \leq 1.75 \cdot 10^{-99}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if z < -2.09999999999999984e59Initial program 86.4%
div-sub77.1%
*-commutative77.1%
div-sub86.4%
cancel-sign-sub-inv86.4%
*-commutative86.4%
fma-define86.7%
distribute-rgt-neg-in86.7%
associate-*r*86.6%
distribute-lft-neg-in86.6%
*-commutative86.6%
distribute-rgt-neg-in86.6%
metadata-eval86.6%
Simplified86.6%
Taylor expanded in a around 0 86.4%
associate-*r/86.4%
+-commutative86.4%
metadata-eval86.4%
cancel-sign-sub-inv86.4%
cancel-sign-sub-inv86.4%
metadata-eval86.4%
*-commutative86.4%
*-commutative86.4%
associate-*r*86.3%
fma-define86.6%
associate-*l/86.7%
*-commutative86.7%
fma-define86.4%
+-commutative86.4%
fma-define88.7%
Simplified88.7%
Taylor expanded in z around inf 68.1%
associate-*r/72.2%
associate-*r*72.4%
*-commutative72.4%
Simplified72.4%
if -2.09999999999999984e59 < z < 1.7499999999999999e-99Initial program 95.2%
div-sub95.2%
*-commutative95.2%
div-sub95.2%
cancel-sign-sub-inv95.2%
*-commutative95.2%
fma-define95.2%
distribute-rgt-neg-in95.2%
associate-*r*95.2%
distribute-lft-neg-in95.2%
*-commutative95.2%
distribute-rgt-neg-in95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in a around 0 95.2%
associate-*r/95.2%
+-commutative95.2%
metadata-eval95.2%
cancel-sign-sub-inv95.2%
cancel-sign-sub-inv95.2%
metadata-eval95.2%
*-commutative95.2%
*-commutative95.2%
associate-*r*95.2%
fma-define95.2%
associate-*l/95.1%
*-commutative95.1%
fma-define95.1%
+-commutative95.1%
fma-define95.1%
Simplified95.1%
Taylor expanded in z around 0 75.9%
if 1.7499999999999999e-99 < z Initial program 88.0%
div-sub85.8%
*-commutative85.8%
div-sub88.0%
cancel-sign-sub-inv88.0%
*-commutative88.0%
fma-define90.2%
distribute-rgt-neg-in90.2%
associate-*r*90.3%
distribute-lft-neg-in90.3%
*-commutative90.3%
distribute-rgt-neg-in90.3%
metadata-eval90.3%
Simplified90.3%
Taylor expanded in x around 0 51.6%
associate-*r/51.5%
associate-*r*51.7%
associate-*l/54.5%
associate-*r/54.6%
associate-*l*54.5%
Simplified54.5%
Final simplification67.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -4.6e+60) (* -4.5 (* t (/ z a))) (if (<= z 1.3e-99) (* (* x y) (/ 0.5 a)) (* -4.5 (* z (/ t a))))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -4.6e+60) {
tmp = -4.5 * (t * (z / a));
} else if (z <= 1.3e-99) {
tmp = (x * y) * (0.5 / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (z <= (-4.6d+60)) then
tmp = (-4.5d0) * (t * (z / a))
else if (z <= 1.3d-99) then
tmp = (x * y) * (0.5d0 / a)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -4.6e+60) {
tmp = -4.5 * (t * (z / a));
} else if (z <= 1.3e-99) {
tmp = (x * y) * (0.5 / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if z <= -4.6e+60: tmp = -4.5 * (t * (z / a)) elif z <= 1.3e-99: tmp = (x * y) * (0.5 / a) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -4.6e+60) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (z <= 1.3e-99) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -4.6e+60)
tmp = -4.5 * (t * (z / a));
elseif (z <= 1.3e-99)
tmp = (x * y) * (0.5 / a);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -4.6e+60], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.3e-99], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.6 \cdot 10^{+60}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;z \leq 1.3 \cdot 10^{-99}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if z < -4.60000000000000034e60Initial program 86.4%
div-sub77.1%
*-commutative77.1%
div-sub86.4%
cancel-sign-sub-inv86.4%
*-commutative86.4%
fma-define86.7%
distribute-rgt-neg-in86.7%
associate-*r*86.6%
distribute-lft-neg-in86.6%
*-commutative86.6%
distribute-rgt-neg-in86.6%
metadata-eval86.6%
Simplified86.6%
Taylor expanded in x around 0 68.1%
associate-/l*72.2%
Simplified72.2%
if -4.60000000000000034e60 < z < 1.30000000000000003e-99Initial program 95.2%
div-sub95.2%
*-commutative95.2%
div-sub95.2%
cancel-sign-sub-inv95.2%
*-commutative95.2%
fma-define95.2%
distribute-rgt-neg-in95.2%
associate-*r*95.2%
distribute-lft-neg-in95.2%
*-commutative95.2%
distribute-rgt-neg-in95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in a around 0 95.2%
associate-*r/95.2%
+-commutative95.2%
metadata-eval95.2%
cancel-sign-sub-inv95.2%
cancel-sign-sub-inv95.2%
metadata-eval95.2%
*-commutative95.2%
*-commutative95.2%
associate-*r*95.2%
fma-define95.2%
associate-*l/95.1%
*-commutative95.1%
fma-define95.1%
+-commutative95.1%
fma-define95.1%
Simplified95.1%
Taylor expanded in z around 0 75.9%
if 1.30000000000000003e-99 < z Initial program 88.0%
div-sub85.8%
*-commutative85.8%
div-sub88.0%
cancel-sign-sub-inv88.0%
*-commutative88.0%
fma-define90.2%
distribute-rgt-neg-in90.2%
associate-*r*90.3%
distribute-lft-neg-in90.3%
*-commutative90.3%
distribute-rgt-neg-in90.3%
metadata-eval90.3%
Simplified90.3%
Taylor expanded in x around 0 51.6%
associate-*r/51.5%
associate-*r*51.7%
associate-*l/54.5%
associate-*r/54.6%
associate-*l*54.5%
Simplified54.5%
Final simplification67.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -6.1e+63) (* -4.5 (* t (/ z a))) (if (<= z 1.05e-102) (* 0.5 (* x (/ y a))) (* -4.5 (* z (/ t a))))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -6.1e+63) {
tmp = -4.5 * (t * (z / a));
} else if (z <= 1.05e-102) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (z <= (-6.1d+63)) then
tmp = (-4.5d0) * (t * (z / a))
else if (z <= 1.05d-102) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -6.1e+63) {
tmp = -4.5 * (t * (z / a));
} else if (z <= 1.05e-102) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if z <= -6.1e+63: tmp = -4.5 * (t * (z / a)) elif z <= 1.05e-102: tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (z <= -6.1e+63) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (z <= 1.05e-102) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (z <= -6.1e+63)
tmp = -4.5 * (t * (z / a));
elseif (z <= 1.05e-102)
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -6.1e+63], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.05e-102], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6.1 \cdot 10^{+63}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;z \leq 1.05 \cdot 10^{-102}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if z < -6.09999999999999968e63Initial program 86.0%
div-sub76.5%
*-commutative76.5%
div-sub86.0%
cancel-sign-sub-inv86.0%
*-commutative86.0%
fma-define86.3%
distribute-rgt-neg-in86.3%
associate-*r*86.3%
distribute-lft-neg-in86.3%
*-commutative86.3%
distribute-rgt-neg-in86.3%
metadata-eval86.3%
Simplified86.3%
Taylor expanded in x around 0 67.3%
associate-/l*71.6%
Simplified71.6%
if -6.09999999999999968e63 < z < 1.05e-102Initial program 95.2%
div-sub95.2%
*-commutative95.2%
div-sub95.2%
cancel-sign-sub-inv95.2%
*-commutative95.2%
fma-define95.2%
distribute-rgt-neg-in95.2%
associate-*r*95.2%
distribute-lft-neg-in95.2%
*-commutative95.2%
distribute-rgt-neg-in95.2%
metadata-eval95.2%
Simplified95.2%
Taylor expanded in x around inf 75.2%
associate-/l*72.4%
Simplified72.4%
if 1.05e-102 < z Initial program 88.1%
div-sub85.9%
*-commutative85.9%
div-sub88.1%
cancel-sign-sub-inv88.1%
*-commutative88.1%
fma-define90.3%
distribute-rgt-neg-in90.3%
associate-*r*90.4%
distribute-lft-neg-in90.4%
*-commutative90.4%
distribute-rgt-neg-in90.4%
metadata-eval90.4%
Simplified90.4%
Taylor expanded in x around 0 51.0%
associate-*r/51.0%
associate-*r*51.2%
associate-*l/53.9%
associate-*r/54.0%
associate-*l*53.9%
Simplified53.9%
Final simplification65.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t 2.8e-27) (* -4.5 (* t (/ z a))) (* -4.5 (* z (/ t a)))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= 2.8e-27) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= 2.8d-27) then
tmp = (-4.5d0) * (t * (z / a))
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= 2.8e-27) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= 2.8e-27: tmp = -4.5 * (t * (z / a)) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= 2.8e-27) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= 2.8e-27)
tmp = -4.5 * (t * (z / a));
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, 2.8e-27], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2.8 \cdot 10^{-27}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if t < 2.8e-27Initial program 92.6%
div-sub89.6%
*-commutative89.6%
div-sub92.6%
cancel-sign-sub-inv92.6%
*-commutative92.6%
fma-define92.6%
distribute-rgt-neg-in92.6%
associate-*r*92.6%
distribute-lft-neg-in92.6%
*-commutative92.6%
distribute-rgt-neg-in92.6%
metadata-eval92.6%
Simplified92.6%
Taylor expanded in x around 0 41.5%
associate-/l*42.4%
Simplified42.4%
if 2.8e-27 < t Initial program 86.6%
div-sub86.6%
*-commutative86.6%
div-sub86.6%
cancel-sign-sub-inv86.6%
*-commutative86.6%
fma-define90.2%
distribute-rgt-neg-in90.2%
associate-*r*90.3%
distribute-lft-neg-in90.3%
*-commutative90.3%
distribute-rgt-neg-in90.3%
metadata-eval90.3%
Simplified90.3%
Taylor expanded in x around 0 55.5%
associate-*r/55.5%
associate-*r*55.5%
associate-*l/60.1%
associate-*r/60.2%
associate-*l*60.2%
Simplified60.2%
Final simplification46.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* t (/ z a))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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
code = (-4.5d0) * (t * (z / a))
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 91.2%
div-sub88.9%
*-commutative88.9%
div-sub91.2%
cancel-sign-sub-inv91.2%
*-commutative91.2%
fma-define92.1%
distribute-rgt-neg-in92.1%
associate-*r*92.1%
distribute-lft-neg-in92.1%
*-commutative92.1%
distribute-rgt-neg-in92.1%
metadata-eval92.1%
Simplified92.1%
Taylor expanded in x around 0 44.7%
associate-/l*45.7%
Simplified45.7%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
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) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2024186
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:alt
(! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))