
(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 (- INFINITY))
(* z (+ (* -4.5 (/ t a)) (* 0.5 (* x (/ y (* z a))))))
(if (<= t_1 1e+279)
(/ (- (* x y) (* 9.0 (* z t))) (* a 2.0))
(- (* 0.5 (* x (/ y a))) (* 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 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = z * ((-4.5 * (t / a)) + (0.5 * (x * (y / (z * a)))));
} else if (t_1 <= 1e+279) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = (0.5 * (x * (y / a))) - (t * (4.5 * (z / a)));
}
return tmp;
}
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 <= -Double.POSITIVE_INFINITY) {
tmp = z * ((-4.5 * (t / a)) + (0.5 * (x * (y / (z * a)))));
} else if (t_1 <= 1e+279) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = (0.5 * (x * (y / a))) - (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 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_1 <= -math.inf: tmp = z * ((-4.5 * (t / a)) + (0.5 * (x * (y / (z * a))))) elif t_1 <= 1e+279: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = (0.5 * (x * (y / a))) - (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(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(z * Float64(Float64(-4.5 * Float64(t / a)) + Float64(0.5 * Float64(x * Float64(y / Float64(z * a)))))); elseif (t_1 <= 1e+279) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(0.5 * Float64(x * Float64(y / a))) - 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 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_1 <= -Inf)
tmp = z * ((-4.5 * (t / a)) + (0.5 * (x * (y / (z * a)))));
elseif (t_1 <= 1e+279)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = (0.5 * (x * (y / a))) - (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[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(z * N[(N[(-4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(x * N[(y / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+279], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t * N[(4.5 * N[(z / a), $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 -\infty:\\
\;\;\;\;z \cdot \left(-4.5 \cdot \frac{t}{a} + 0.5 \cdot \left(x \cdot \frac{y}{z \cdot a}\right)\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+279}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right) - t \cdot \left(4.5 \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0Initial program 67.6%
cancel-sign-sub-inv67.6%
fma-define67.6%
distribute-rgt-neg-in67.6%
associate-*r*67.6%
distribute-lft-neg-in67.6%
*-commutative67.6%
distribute-rgt-neg-in67.6%
metadata-eval67.6%
Simplified67.6%
Taylor expanded in z around inf 92.1%
associate-/l*92.2%
*-commutative92.2%
Applied egg-rr92.2%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.00000000000000006e279Initial program 99.2%
cancel-sign-sub-inv99.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%
fma-neg99.2%
*-commutative99.2%
associate-*l*99.2%
Applied egg-rr99.2%
if 1.00000000000000006e279 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 74.2%
cancel-sign-sub-inv74.2%
fma-define74.2%
distribute-rgt-neg-in74.2%
associate-*r*76.6%
distribute-lft-neg-in76.6%
*-commutative76.6%
distribute-rgt-neg-in76.6%
metadata-eval76.6%
Simplified76.6%
*-commutative76.6%
associate-*r*74.2%
metadata-eval74.2%
distribute-rgt-neg-in74.2%
distribute-lft-neg-in74.2%
fma-neg74.2%
div-sub66.7%
sub-neg66.7%
*-commutative66.7%
associate-/r*66.7%
associate-*r/66.7%
div-inv66.7%
metadata-eval66.7%
associate-*l*69.1%
associate-/l*76.1%
Applied egg-rr76.1%
sub-neg76.1%
*-commutative76.1%
*-commutative76.1%
times-frac76.1%
metadata-eval76.1%
cancel-sign-sub-inv76.1%
distribute-lft-neg-in76.1%
distribute-rgt-neg-in76.1%
*-commutative76.1%
cancel-sign-sub-inv76.1%
associate-*r*76.1%
*-commutative76.1%
associate-*r/76.1%
associate-/l*92.4%
*-commutative92.4%
associate-*r*92.4%
associate-/l*80.6%
*-commutative80.6%
associate-/l*89.9%
associate-*r*89.9%
*-commutative89.9%
Simplified89.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 9.0) t) 1e+256) (/ (- (* x y) (* 9.0 (* z t))) (* a 2.0)) (* -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) {
double tmp;
if (((z * 9.0) * t) <= 1e+256) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = -4.5 * (t * (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) :: tmp
if (((z * 9.0d0) * t) <= 1d+256) then
tmp = ((x * y) - (9.0d0 * (z * t))) / (a * 2.0d0)
else
tmp = (-4.5d0) * (t * (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 tmp;
if (((z * 9.0) * t) <= 1e+256) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = -4.5 * (t * (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): tmp = 0 if ((z * 9.0) * t) <= 1e+256: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = -4.5 * (t * (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) tmp = 0.0 if (Float64(Float64(z * 9.0) * t) <= 1e+256) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = Float64(-4.5 * Float64(t * 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)
tmp = 0.0;
if (((z * 9.0) * t) <= 1e+256)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = -4.5 * (t * (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_] := If[LessEqual[N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision], 1e+256], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], 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])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq 10^{+256}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1e256Initial program 94.9%
cancel-sign-sub-inv94.9%
fma-define94.9%
distribute-rgt-neg-in94.9%
associate-*r*95.3%
distribute-lft-neg-in95.3%
*-commutative95.3%
distribute-rgt-neg-in95.3%
metadata-eval95.3%
Simplified95.3%
*-commutative95.3%
associate-*r*94.9%
metadata-eval94.9%
distribute-rgt-neg-in94.9%
distribute-lft-neg-in94.9%
fma-neg94.9%
*-commutative94.9%
associate-*l*95.4%
Applied egg-rr95.4%
if 1e256 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 64.6%
cancel-sign-sub-inv64.6%
fma-define64.7%
distribute-rgt-neg-in64.7%
associate-*r*64.7%
distribute-lft-neg-in64.7%
*-commutative64.7%
distribute-rgt-neg-in64.7%
metadata-eval64.7%
Simplified64.7%
Taylor expanded in x around 0 64.7%
associate-/l*95.8%
Simplified95.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 4.2e+191) (/ (- (* x y) (* 9.0 (* z t))) (* a 2.0)) (- (* 0.5 (* x (/ y a))) (* 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 tmp;
if (t <= 4.2e+191) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = (0.5 * (x * (y / a))) - (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) :: tmp
if (t <= 4.2d+191) then
tmp = ((x * y) - (9.0d0 * (z * t))) / (a * 2.0d0)
else
tmp = (0.5d0 * (x * (y / a))) - (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 tmp;
if (t <= 4.2e+191) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = (0.5 * (x * (y / a))) - (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): tmp = 0 if t <= 4.2e+191: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = (0.5 * (x * (y / a))) - (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) tmp = 0.0 if (t <= 4.2e+191) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(0.5 * Float64(x * Float64(y / a))) - 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)
tmp = 0.0;
if (t <= 4.2e+191)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = (0.5 * (x * (y / a))) - (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_] := If[LessEqual[t, 4.2e+191], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t * N[(4.5 * N[(z / a), $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}
\mathbf{if}\;t \leq 4.2 \cdot 10^{+191}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right) - t \cdot \left(4.5 \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if t < 4.2000000000000001e191Initial program 93.3%
cancel-sign-sub-inv93.3%
fma-define93.3%
distribute-rgt-neg-in93.3%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
*-commutative93.7%
associate-*r*93.3%
metadata-eval93.3%
distribute-rgt-neg-in93.3%
distribute-lft-neg-in93.3%
fma-neg93.3%
*-commutative93.3%
associate-*l*93.7%
Applied egg-rr93.7%
if 4.2000000000000001e191 < t Initial program 80.3%
cancel-sign-sub-inv80.3%
fma-define80.3%
distribute-rgt-neg-in80.3%
associate-*r*80.2%
distribute-lft-neg-in80.2%
*-commutative80.2%
distribute-rgt-neg-in80.2%
metadata-eval80.2%
Simplified80.2%
*-commutative80.2%
associate-*r*80.3%
metadata-eval80.3%
distribute-rgt-neg-in80.3%
distribute-lft-neg-in80.3%
fma-neg80.3%
div-sub76.1%
sub-neg76.1%
*-commutative76.1%
associate-/r*76.1%
associate-*r/76.1%
div-inv76.1%
metadata-eval76.1%
associate-*l*76.1%
associate-/l*83.8%
Applied egg-rr83.8%
sub-neg83.8%
*-commutative83.8%
*-commutative83.8%
times-frac83.9%
metadata-eval83.9%
cancel-sign-sub-inv83.9%
distribute-lft-neg-in83.9%
distribute-rgt-neg-in83.9%
*-commutative83.9%
cancel-sign-sub-inv83.9%
associate-*r*83.9%
*-commutative83.9%
associate-*r/83.9%
associate-/l*87.6%
*-commutative87.6%
associate-*r*87.6%
associate-/l*79.9%
*-commutative79.9%
associate-/l*91.7%
associate-*r*91.6%
*-commutative91.6%
Simplified91.6%
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 (or (<= t -2.6e-62) (not (<= t 3e+150))) (* -4.5 (* t (/ z a))) (* 0.5 (* x (/ y 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.6e-62) || !(t <= 3e+150)) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = 0.5 * (x * (y / 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.6d-62)) .or. (.not. (t <= 3d+150))) then
tmp = (-4.5d0) * (t * (z / a))
else
tmp = 0.5d0 * (x * (y / 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.6e-62) || !(t <= 3e+150)) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = 0.5 * (x * (y / 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.6e-62) or not (t <= 3e+150): tmp = -4.5 * (t * (z / a)) else: tmp = 0.5 * (x * (y / 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.6e-62) || !(t <= 3e+150)) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); else tmp = Float64(0.5 * Float64(x * Float64(y / 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.6e-62) || ~((t <= 3e+150)))
tmp = -4.5 * (t * (z / a));
else
tmp = 0.5 * (x * (y / 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[Or[LessEqual[t, -2.6e-62], N[Not[LessEqual[t, 3e+150]], $MachinePrecision]], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / 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.6 \cdot 10^{-62} \lor \neg \left(t \leq 3 \cdot 10^{+150}\right):\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if t < -2.5999999999999999e-62 or 3.00000000000000012e150 < t Initial program 89.3%
cancel-sign-sub-inv89.3%
fma-define89.3%
distribute-rgt-neg-in89.3%
associate-*r*90.1%
distribute-lft-neg-in90.1%
*-commutative90.1%
distribute-rgt-neg-in90.1%
metadata-eval90.1%
Simplified90.1%
Taylor expanded in x around 0 58.8%
associate-/l*62.9%
Simplified62.9%
if -2.5999999999999999e-62 < t < 3.00000000000000012e150Initial program 94.4%
cancel-sign-sub-inv94.4%
fma-define94.4%
distribute-rgt-neg-in94.4%
associate-*r*94.4%
distribute-lft-neg-in94.4%
*-commutative94.4%
distribute-rgt-neg-in94.4%
metadata-eval94.4%
Simplified94.4%
Taylor expanded in x around inf 67.5%
associate-/l*64.7%
Simplified64.7%
Final simplification63.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 (<= t -1.2e-61) (* -4.5 (* t (/ z a))) (if (<= t 4.2e+150) (/ (* y (* x 0.5)) a) (* (/ z a) (* t -4.5)))))
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 <= -1.2e-61) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 4.2e+150) {
tmp = (y * (x * 0.5)) / a;
} else {
tmp = (z / a) * (t * -4.5);
}
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 <= (-1.2d-61)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 4.2d+150) then
tmp = (y * (x * 0.5d0)) / a
else
tmp = (z / a) * (t * (-4.5d0))
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 <= -1.2e-61) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 4.2e+150) {
tmp = (y * (x * 0.5)) / a;
} else {
tmp = (z / a) * (t * -4.5);
}
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 <= -1.2e-61: tmp = -4.5 * (t * (z / a)) elif t <= 4.2e+150: tmp = (y * (x * 0.5)) / a else: tmp = (z / a) * (t * -4.5) 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 <= -1.2e-61) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 4.2e+150) tmp = Float64(Float64(y * Float64(x * 0.5)) / a); else tmp = Float64(Float64(z / a) * Float64(t * -4.5)); 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 <= -1.2e-61)
tmp = -4.5 * (t * (z / a));
elseif (t <= 4.2e+150)
tmp = (y * (x * 0.5)) / a;
else
tmp = (z / a) * (t * -4.5);
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, -1.2e-61], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 4.2e+150], N[(N[(y * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $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 -1.2 \cdot 10^{-61}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 4.2 \cdot 10^{+150}:\\
\;\;\;\;\frac{y \cdot \left(x \cdot 0.5\right)}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if t < -1.2e-61Initial program 91.8%
cancel-sign-sub-inv91.8%
fma-define91.8%
distribute-rgt-neg-in91.8%
associate-*r*93.0%
distribute-lft-neg-in93.0%
*-commutative93.0%
distribute-rgt-neg-in93.0%
metadata-eval93.0%
Simplified93.0%
Taylor expanded in x around 0 55.5%
associate-/l*57.8%
Simplified57.8%
if -1.2e-61 < t < 4.19999999999999996e150Initial program 94.4%
associate-/l/94.4%
div-sub94.4%
associate-/l*94.4%
fma-neg94.4%
*-commutative94.4%
associate-/l*94.4%
distribute-rgt-neg-out94.4%
distribute-frac-neg94.4%
distribute-rgt-neg-in94.4%
associate-/l*94.4%
metadata-eval94.4%
metadata-eval94.4%
Simplified94.4%
Taylor expanded in x around inf 67.5%
associate-*r*67.5%
*-commutative67.5%
Simplified67.5%
if 4.19999999999999996e150 < t Initial program 83.3%
cancel-sign-sub-inv83.3%
fma-define83.3%
distribute-rgt-neg-in83.3%
associate-*r*83.2%
distribute-lft-neg-in83.2%
*-commutative83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
Simplified83.2%
Taylor expanded in x around 0 66.8%
associate-/l*75.0%
*-commutative75.0%
associate-*l*75.1%
*-commutative75.1%
associate-*l*75.2%
*-commutative75.2%
Simplified75.2%
Final simplification65.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 (if (<= t -9.2e-59) (* -4.5 (* t (/ z a))) (if (<= t 3.6e+150) (/ y (/ a (* x 0.5))) (* (/ z a) (* t -4.5)))))
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 <= -9.2e-59) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3.6e+150) {
tmp = y / (a / (x * 0.5));
} else {
tmp = (z / a) * (t * -4.5);
}
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 <= (-9.2d-59)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 3.6d+150) then
tmp = y / (a / (x * 0.5d0))
else
tmp = (z / a) * (t * (-4.5d0))
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 <= -9.2e-59) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3.6e+150) {
tmp = y / (a / (x * 0.5));
} else {
tmp = (z / a) * (t * -4.5);
}
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 <= -9.2e-59: tmp = -4.5 * (t * (z / a)) elif t <= 3.6e+150: tmp = y / (a / (x * 0.5)) else: tmp = (z / a) * (t * -4.5) 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 <= -9.2e-59) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 3.6e+150) tmp = Float64(y / Float64(a / Float64(x * 0.5))); else tmp = Float64(Float64(z / a) * Float64(t * -4.5)); 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 <= -9.2e-59)
tmp = -4.5 * (t * (z / a));
elseif (t <= 3.6e+150)
tmp = y / (a / (x * 0.5));
else
tmp = (z / a) * (t * -4.5);
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, -9.2e-59], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.6e+150], N[(y / N[(a / N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $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 -9.2 \cdot 10^{-59}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 3.6 \cdot 10^{+150}:\\
\;\;\;\;\frac{y}{\frac{a}{x \cdot 0.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if t < -9.19999999999999918e-59Initial program 91.8%
cancel-sign-sub-inv91.8%
fma-define91.8%
distribute-rgt-neg-in91.8%
associate-*r*93.0%
distribute-lft-neg-in93.0%
*-commutative93.0%
distribute-rgt-neg-in93.0%
metadata-eval93.0%
Simplified93.0%
Taylor expanded in x around 0 55.5%
associate-/l*57.8%
Simplified57.8%
if -9.19999999999999918e-59 < t < 3.59999999999999986e150Initial program 94.4%
associate-/l/94.4%
div-sub94.4%
associate-/l*94.4%
fma-neg94.4%
*-commutative94.4%
associate-/l*94.4%
distribute-rgt-neg-out94.4%
distribute-frac-neg94.4%
distribute-rgt-neg-in94.4%
associate-/l*94.4%
metadata-eval94.4%
metadata-eval94.4%
Simplified94.4%
Taylor expanded in x around inf 67.5%
associate-*r*67.5%
*-commutative67.5%
Simplified67.5%
associate-/l*63.2%
Applied egg-rr63.2%
clear-num63.1%
un-div-inv63.6%
Applied egg-rr63.6%
if 3.59999999999999986e150 < t Initial program 83.3%
cancel-sign-sub-inv83.3%
fma-define83.3%
distribute-rgt-neg-in83.3%
associate-*r*83.2%
distribute-lft-neg-in83.2%
*-commutative83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
Simplified83.2%
Taylor expanded in x around 0 66.8%
associate-/l*75.0%
*-commutative75.0%
associate-*l*75.1%
*-commutative75.1%
associate-*l*75.2%
*-commutative75.2%
Simplified75.2%
Final simplification63.3%
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 -7.2e-64) (* -4.5 (* t (/ z a))) (if (<= t 3.5e+150) (* y (/ (* x 0.5) a)) (* (/ z a) (* t -4.5)))))
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 <= -7.2e-64) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3.5e+150) {
tmp = y * ((x * 0.5) / a);
} else {
tmp = (z / a) * (t * -4.5);
}
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 <= (-7.2d-64)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 3.5d+150) then
tmp = y * ((x * 0.5d0) / a)
else
tmp = (z / a) * (t * (-4.5d0))
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 <= -7.2e-64) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3.5e+150) {
tmp = y * ((x * 0.5) / a);
} else {
tmp = (z / a) * (t * -4.5);
}
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 <= -7.2e-64: tmp = -4.5 * (t * (z / a)) elif t <= 3.5e+150: tmp = y * ((x * 0.5) / a) else: tmp = (z / a) * (t * -4.5) 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 <= -7.2e-64) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 3.5e+150) tmp = Float64(y * Float64(Float64(x * 0.5) / a)); else tmp = Float64(Float64(z / a) * Float64(t * -4.5)); 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 <= -7.2e-64)
tmp = -4.5 * (t * (z / a));
elseif (t <= 3.5e+150)
tmp = y * ((x * 0.5) / a);
else
tmp = (z / a) * (t * -4.5);
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, -7.2e-64], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.5e+150], N[(y * N[(N[(x * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $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 -7.2 \cdot 10^{-64}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 3.5 \cdot 10^{+150}:\\
\;\;\;\;y \cdot \frac{x \cdot 0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if t < -7.1999999999999996e-64Initial program 91.8%
cancel-sign-sub-inv91.8%
fma-define91.8%
distribute-rgt-neg-in91.8%
associate-*r*93.0%
distribute-lft-neg-in93.0%
*-commutative93.0%
distribute-rgt-neg-in93.0%
metadata-eval93.0%
Simplified93.0%
Taylor expanded in x around 0 55.5%
associate-/l*57.8%
Simplified57.8%
if -7.1999999999999996e-64 < t < 3.49999999999999984e150Initial program 94.4%
associate-/l/94.4%
div-sub94.4%
associate-/l*94.4%
fma-neg94.4%
*-commutative94.4%
associate-/l*94.4%
distribute-rgt-neg-out94.4%
distribute-frac-neg94.4%
distribute-rgt-neg-in94.4%
associate-/l*94.4%
metadata-eval94.4%
metadata-eval94.4%
Simplified94.4%
Taylor expanded in x around inf 67.5%
associate-*r*67.5%
*-commutative67.5%
Simplified67.5%
associate-/l*63.2%
Applied egg-rr63.2%
if 3.49999999999999984e150 < t Initial program 83.3%
cancel-sign-sub-inv83.3%
fma-define83.3%
distribute-rgt-neg-in83.3%
associate-*r*83.2%
distribute-lft-neg-in83.2%
*-commutative83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
Simplified83.2%
Taylor expanded in x around 0 66.8%
associate-/l*75.0%
*-commutative75.0%
associate-*l*75.1%
*-commutative75.1%
associate-*l*75.2%
*-commutative75.2%
Simplified75.2%
Final simplification63.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 (if (<= t -8e-59) (* -4.5 (* t (/ z a))) (if (<= t 3.3e+150) (* y (/ (* x 0.5) a)) (* 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 tmp;
if (t <= -8e-59) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3.3e+150) {
tmp = y * ((x * 0.5) / a);
} 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) :: tmp
if (t <= (-8d-59)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 3.3d+150) then
tmp = y * ((x * 0.5d0) / a)
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 tmp;
if (t <= -8e-59) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3.3e+150) {
tmp = y * ((x * 0.5) / a);
} 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): tmp = 0 if t <= -8e-59: tmp = -4.5 * (t * (z / a)) elif t <= 3.3e+150: tmp = y * ((x * 0.5) / a) 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) tmp = 0.0 if (t <= -8e-59) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 3.3e+150) tmp = Float64(y * Float64(Float64(x * 0.5) / a)); 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)
tmp = 0.0;
if (t <= -8e-59)
tmp = -4.5 * (t * (z / a));
elseif (t <= 3.3e+150)
tmp = y * ((x * 0.5) / a);
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_] := If[LessEqual[t, -8e-59], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.3e+150], N[(y * N[(N[(x * 0.5), $MachinePrecision] / a), $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}
\mathbf{if}\;t \leq -8 \cdot 10^{-59}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 3.3 \cdot 10^{+150}:\\
\;\;\;\;y \cdot \frac{x \cdot 0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if t < -8.0000000000000002e-59Initial program 91.8%
cancel-sign-sub-inv91.8%
fma-define91.8%
distribute-rgt-neg-in91.8%
associate-*r*93.0%
distribute-lft-neg-in93.0%
*-commutative93.0%
distribute-rgt-neg-in93.0%
metadata-eval93.0%
Simplified93.0%
Taylor expanded in x around 0 55.5%
associate-/l*57.8%
Simplified57.8%
if -8.0000000000000002e-59 < t < 3.29999999999999981e150Initial program 94.4%
associate-/l/94.4%
div-sub94.4%
associate-/l*94.4%
fma-neg94.4%
*-commutative94.4%
associate-/l*94.4%
distribute-rgt-neg-out94.4%
distribute-frac-neg94.4%
distribute-rgt-neg-in94.4%
associate-/l*94.4%
metadata-eval94.4%
metadata-eval94.4%
Simplified94.4%
Taylor expanded in x around inf 67.5%
associate-*r*67.5%
*-commutative67.5%
Simplified67.5%
associate-/l*63.2%
Applied egg-rr63.2%
if 3.29999999999999981e150 < t Initial program 83.3%
cancel-sign-sub-inv83.3%
fma-define83.3%
distribute-rgt-neg-in83.3%
associate-*r*83.2%
distribute-lft-neg-in83.2%
*-commutative83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
Simplified83.2%
Taylor expanded in x around 0 66.8%
associate-/l*75.0%
Simplified75.0%
Taylor expanded in t around 0 66.8%
associate-*r/75.0%
associate-*l*75.2%
*-commutative75.2%
associate-*l*75.1%
Simplified75.1%
Final simplification63.0%
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 -1.7e-59) (* -4.5 (* t (/ z a))) (if (<= t 3e+150) (* 0.5 (* x (/ y a))) (* 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 tmp;
if (t <= -1.7e-59) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3e+150) {
tmp = 0.5 * (x * (y / a));
} 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) :: tmp
if (t <= (-1.7d-59)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 3d+150) then
tmp = 0.5d0 * (x * (y / a))
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 tmp;
if (t <= -1.7e-59) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 3e+150) {
tmp = 0.5 * (x * (y / a));
} 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): tmp = 0 if t <= -1.7e-59: tmp = -4.5 * (t * (z / a)) elif t <= 3e+150: tmp = 0.5 * (x * (y / a)) 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) tmp = 0.0 if (t <= -1.7e-59) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 3e+150) tmp = Float64(0.5 * Float64(x * Float64(y / a))); 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)
tmp = 0.0;
if (t <= -1.7e-59)
tmp = -4.5 * (t * (z / a));
elseif (t <= 3e+150)
tmp = 0.5 * (x * (y / a));
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_] := If[LessEqual[t, -1.7e-59], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3e+150], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $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}
\mathbf{if}\;t \leq -1.7 \cdot 10^{-59}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 3 \cdot 10^{+150}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if t < -1.70000000000000009e-59Initial program 91.8%
cancel-sign-sub-inv91.8%
fma-define91.8%
distribute-rgt-neg-in91.8%
associate-*r*93.0%
distribute-lft-neg-in93.0%
*-commutative93.0%
distribute-rgt-neg-in93.0%
metadata-eval93.0%
Simplified93.0%
Taylor expanded in x around 0 55.5%
associate-/l*57.8%
Simplified57.8%
if -1.70000000000000009e-59 < t < 3.00000000000000012e150Initial program 94.4%
cancel-sign-sub-inv94.4%
fma-define94.4%
distribute-rgt-neg-in94.4%
associate-*r*94.4%
distribute-lft-neg-in94.4%
*-commutative94.4%
distribute-rgt-neg-in94.4%
metadata-eval94.4%
Simplified94.4%
Taylor expanded in x around inf 67.5%
associate-/l*64.7%
Simplified64.7%
if 3.00000000000000012e150 < t Initial program 83.3%
cancel-sign-sub-inv83.3%
fma-define83.3%
distribute-rgt-neg-in83.3%
associate-*r*83.2%
distribute-lft-neg-in83.2%
*-commutative83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
Simplified83.2%
Taylor expanded in x around 0 66.8%
associate-/l*75.0%
Simplified75.0%
Taylor expanded in t around 0 66.8%
associate-*r/75.0%
associate-*l*75.2%
*-commutative75.2%
associate-*l*75.1%
Simplified75.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 (* -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 92.1%
cancel-sign-sub-inv92.1%
fma-define92.1%
distribute-rgt-neg-in92.1%
associate-*r*92.5%
distribute-lft-neg-in92.5%
*-commutative92.5%
distribute-rgt-neg-in92.5%
metadata-eval92.5%
Simplified92.5%
Taylor expanded in x around 0 45.7%
associate-/l*47.0%
Simplified47.0%
(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 2024132
(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)))