
(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 11 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.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (or (<= t_1 (- INFINITY)) (not (<= t_1 1e+264)))
(- (* (/ x a) (/ y 2.0)) (* (/ z a) (/ (* 9.0 t) 2.0)))
(/ (fma x y (* z (* t -9.0))) (* a 2.0)))))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)) || !(t_1 <= 1e+264)) {
tmp = ((x / a) * (y / 2.0)) - ((z / a) * ((9.0 * t) / 2.0));
} else {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
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)) || !(t_1 <= 1e+264)) tmp = Float64(Float64(Float64(x / a) * Float64(y / 2.0)) - Float64(Float64(z / a) * Float64(Float64(9.0 * t) / 2.0))); else tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); end return tmp end
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, (-Infinity)], N[Not[LessEqual[t$95$1, 1e+264]], $MachinePrecision]], N[(N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision] - N[(N[(z / a), $MachinePrecision] * N[(N[(9.0 * t), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[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 \lor \neg \left(t\_1 \leq 10^{+264}\right):\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2} - \frac{z}{a} \cdot \frac{9 \cdot t}{2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 1.00000000000000004e264 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 59.8%
div-sub53.9%
*-commutative53.9%
div-sub59.8%
cancel-sign-sub-inv59.8%
*-commutative59.8%
fma-define59.9%
distribute-rgt-neg-in59.9%
associate-*r*59.9%
distribute-lft-neg-in59.9%
*-commutative59.9%
distribute-rgt-neg-in59.9%
metadata-eval59.9%
Simplified59.9%
*-commutative59.9%
associate-*r*59.9%
metadata-eval59.9%
distribute-rgt-neg-in59.9%
distribute-lft-neg-in59.9%
fma-neg59.8%
associate-*l*59.8%
Applied egg-rr59.8%
div-sub53.9%
times-frac66.4%
times-frac91.0%
Applied egg-rr91.0%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.00000000000000004e264Initial program 98.3%
div-sub96.8%
*-commutative96.8%
div-sub98.3%
cancel-sign-sub-inv98.3%
*-commutative98.3%
fma-define98.3%
distribute-rgt-neg-in98.3%
associate-*r*98.3%
distribute-lft-neg-in98.3%
*-commutative98.3%
distribute-rgt-neg-in98.3%
metadata-eval98.3%
Simplified98.3%
Final simplification96.3%
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 (- INFINITY)) (not (<= t_1 1e+229)))
(- (* x (/ y (* a 2.0))) (* (* z 9.0) (/ t (* a 2.0))))
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)))))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)) || !(t_1 <= 1e+229)) {
tmp = (x * (y / (a * 2.0))) - ((z * 9.0) * (t / (a * 2.0)));
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
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) || !(t_1 <= 1e+229)) {
tmp = (x * (y / (a * 2.0))) - ((z * 9.0) * (t / (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]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if (t_1 <= -math.inf) or not (t_1 <= 1e+229): tmp = (x * (y / (a * 2.0))) - ((z * 9.0) * (t / (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]) 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)) || !(t_1 <= 1e+229)) tmp = Float64(Float64(x * Float64(y / Float64(a * 2.0))) - Float64(Float64(z * 9.0) * Float64(t / Float64(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])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if ((t_1 <= -Inf) || ~((t_1 <= 1e+229)))
tmp = (x * (y / (a * 2.0))) - ((z * 9.0) * (t / (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.
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, (-Infinity)], N[Not[LessEqual[t$95$1, 1e+229]], $MachinePrecision]], N[(N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * N[(t / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 10^{+229}\right):\\
\;\;\;\;x \cdot \frac{y}{a \cdot 2} - \left(z \cdot 9\right) \cdot \frac{t}{a \cdot 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)) < -inf.0 or 9.9999999999999999e228 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 63.0%
div-sub57.6%
associate-/l*69.1%
associate-/l*90.2%
Applied egg-rr90.2%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999999e228Initial program 98.3%
div-sub96.6%
*-commutative96.6%
div-sub98.3%
cancel-sign-sub-inv98.3%
*-commutative98.3%
fma-define98.3%
distribute-rgt-neg-in98.3%
associate-*r*98.2%
distribute-lft-neg-in98.2%
*-commutative98.2%
distribute-rgt-neg-in98.2%
metadata-eval98.2%
Simplified98.2%
*-commutative98.2%
associate-*r*98.3%
metadata-eval98.3%
distribute-rgt-neg-in98.3%
distribute-lft-neg-in98.3%
fma-neg98.3%
associate-*l*98.2%
Applied egg-rr98.2%
Final simplification95.9%
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 (- INFINITY)) (not (<= t_1 1e+264)))
(- (* (/ x a) (/ y 2.0)) (* (/ z a) (/ (* 9.0 t) 2.0)))
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)))))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)) || !(t_1 <= 1e+264)) {
tmp = ((x / a) * (y / 2.0)) - ((z / a) * ((9.0 * t) / 2.0));
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
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) || !(t_1 <= 1e+264)) {
tmp = ((x / a) * (y / 2.0)) - ((z / a) * ((9.0 * t) / 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]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if (t_1 <= -math.inf) or not (t_1 <= 1e+264): tmp = ((x / a) * (y / 2.0)) - ((z / a) * ((9.0 * t) / 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]) 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)) || !(t_1 <= 1e+264)) tmp = Float64(Float64(Float64(x / a) * Float64(y / 2.0)) - Float64(Float64(z / a) * Float64(Float64(9.0 * t) / 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])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if ((t_1 <= -Inf) || ~((t_1 <= 1e+264)))
tmp = ((x / a) * (y / 2.0)) - ((z / a) * ((9.0 * t) / 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.
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, (-Infinity)], N[Not[LessEqual[t$95$1, 1e+264]], $MachinePrecision]], N[(N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision] - N[(N[(z / a), $MachinePrecision] * N[(N[(9.0 * t), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $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])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 10^{+264}\right):\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2} - \frac{z}{a} \cdot \frac{9 \cdot t}{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)) < -inf.0 or 1.00000000000000004e264 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 59.8%
div-sub53.9%
*-commutative53.9%
div-sub59.8%
cancel-sign-sub-inv59.8%
*-commutative59.8%
fma-define59.9%
distribute-rgt-neg-in59.9%
associate-*r*59.9%
distribute-lft-neg-in59.9%
*-commutative59.9%
distribute-rgt-neg-in59.9%
metadata-eval59.9%
Simplified59.9%
*-commutative59.9%
associate-*r*59.9%
metadata-eval59.9%
distribute-rgt-neg-in59.9%
distribute-lft-neg-in59.9%
fma-neg59.8%
associate-*l*59.8%
Applied egg-rr59.8%
div-sub53.9%
times-frac66.4%
times-frac91.0%
Applied egg-rr91.0%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.00000000000000004e264Initial program 98.3%
div-sub96.8%
*-commutative96.8%
div-sub98.3%
cancel-sign-sub-inv98.3%
*-commutative98.3%
fma-define98.3%
distribute-rgt-neg-in98.3%
associate-*r*98.3%
distribute-lft-neg-in98.3%
*-commutative98.3%
distribute-rgt-neg-in98.3%
metadata-eval98.3%
Simplified98.3%
*-commutative98.3%
associate-*r*98.3%
metadata-eval98.3%
distribute-rgt-neg-in98.3%
distribute-lft-neg-in98.3%
fma-neg98.3%
associate-*l*98.3%
Applied egg-rr98.3%
Final simplification96.3%
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+289)
(* t (* (/ z a) -4.5))
(if (<= t_1 1e+244)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(/ (* z -4.5) (/ a t))))))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+289) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+244) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = (z * -4.5) / (a / t);
}
return tmp;
}
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+289)) then
tmp = t * ((z / a) * (-4.5d0))
else if (t_1 <= 1d+244) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = (z * (-4.5d0)) / (a / t)
end if
code = tmp
end function
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+289) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+244) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = (z * -4.5) / (a / t);
}
return tmp;
}
[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+289: tmp = t * ((z / a) * -4.5) elif t_1 <= 1e+244: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = (z * -4.5) / (a / t) return tmp
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+289) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (t_1 <= 1e+244) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(z * -4.5) / Float64(a / t)); end return tmp end
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+289)
tmp = t * ((z / a) * -4.5);
elseif (t_1 <= 1e+244)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = (z * -4.5) / (a / t);
end
tmp_2 = tmp;
end
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+289], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+244], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(z * -4.5), $MachinePrecision] / N[(a / t), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[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^{+289}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+244}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z \cdot -4.5}{\frac{a}{t}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -5.00000000000000031e289Initial program 59.1%
Taylor expanded in x around 0 59.1%
*-commutative59.1%
associate-*r*59.1%
Simplified59.1%
associate-/l*93.5%
times-frac93.6%
metadata-eval93.6%
Applied egg-rr93.6%
if -5.00000000000000031e289 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1.00000000000000007e244Initial program 94.7%
div-sub92.4%
*-commutative92.4%
div-sub94.7%
cancel-sign-sub-inv94.7%
*-commutative94.7%
fma-define94.7%
distribute-rgt-neg-in94.7%
associate-*r*94.6%
distribute-lft-neg-in94.6%
*-commutative94.6%
distribute-rgt-neg-in94.6%
metadata-eval94.6%
Simplified94.6%
*-commutative94.6%
associate-*r*94.7%
metadata-eval94.7%
distribute-rgt-neg-in94.7%
distribute-lft-neg-in94.7%
fma-neg94.7%
associate-*l*94.6%
Applied egg-rr94.6%
if 1.00000000000000007e244 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 46.2%
Taylor expanded in x around 0 46.5%
associate-*r/46.5%
*-commutative46.5%
associate-*r*46.5%
associate-*r/93.2%
clear-num93.3%
un-div-inv93.3%
*-commutative93.3%
Applied egg-rr93.3%
Final simplification94.4%
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 0.5) a))))
(if (<= (* x y) -1.32e+45)
t_1
(if (<= (* x y) 2e-58)
(* t (* (/ z a) -4.5))
(if (<= (* x y) 5e+228) (/ 0.5 (/ a (* x y))) t_1)))))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 * 0.5) / a);
double tmp;
if ((x * y) <= -1.32e+45) {
tmp = t_1;
} else if ((x * y) <= 2e-58) {
tmp = t * ((z / a) * -4.5);
} else if ((x * y) <= 5e+228) {
tmp = 0.5 / (a / (x * y));
} else {
tmp = t_1;
}
return tmp;
}
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 * 0.5d0) / a)
if ((x * y) <= (-1.32d+45)) then
tmp = t_1
else if ((x * y) <= 2d-58) then
tmp = t * ((z / a) * (-4.5d0))
else if ((x * y) <= 5d+228) then
tmp = 0.5d0 / (a / (x * y))
else
tmp = t_1
end if
code = tmp
end function
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 * 0.5) / a);
double tmp;
if ((x * y) <= -1.32e+45) {
tmp = t_1;
} else if ((x * y) <= 2e-58) {
tmp = t * ((z / a) * -4.5);
} else if ((x * y) <= 5e+228) {
tmp = 0.5 / (a / (x * y));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = x * ((y * 0.5) / a) tmp = 0 if (x * y) <= -1.32e+45: tmp = t_1 elif (x * y) <= 2e-58: tmp = t * ((z / a) * -4.5) elif (x * y) <= 5e+228: tmp = 0.5 / (a / (x * y)) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(x * Float64(Float64(y * 0.5) / a)) tmp = 0.0 if (Float64(x * y) <= -1.32e+45) tmp = t_1; elseif (Float64(x * y) <= 2e-58) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (Float64(x * y) <= 5e+228) tmp = Float64(0.5 / Float64(a / Float64(x * y))); else tmp = t_1; end return tmp end
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 * 0.5) / a);
tmp = 0.0;
if ((x * y) <= -1.32e+45)
tmp = t_1;
elseif ((x * y) <= 2e-58)
tmp = t * ((z / a) * -4.5);
elseif ((x * y) <= 5e+228)
tmp = 0.5 / (a / (x * y));
else
tmp = t_1;
end
tmp_2 = tmp;
end
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[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1.32e+45], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 2e-58], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+228], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot \frac{y \cdot 0.5}{a}\\
\mathbf{if}\;x \cdot y \leq -1.32 \cdot 10^{+45}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-58}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+228}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 x y) < -1.32000000000000005e45 or 5e228 < (*.f64 x y) Initial program 78.8%
Taylor expanded in x around inf 67.7%
*-commutative67.7%
associate-/l*77.8%
associate-*r*77.8%
*-commutative77.8%
associate-*r/77.8%
Simplified77.8%
if -1.32000000000000005e45 < (*.f64 x y) < 2.0000000000000001e-58Initial program 92.0%
Taylor expanded in x around 0 74.4%
*-commutative74.4%
associate-*r*74.4%
Simplified74.4%
associate-/l*75.9%
times-frac75.9%
metadata-eval75.9%
Applied egg-rr75.9%
if 2.0000000000000001e-58 < (*.f64 x y) < 5e228Initial program 91.1%
clear-num91.1%
inv-pow91.1%
*-commutative91.1%
associate-/l*91.1%
fma-neg91.1%
*-commutative91.1%
distribute-rgt-neg-in91.1%
distribute-rgt-neg-in91.1%
metadata-eval91.1%
Applied egg-rr91.1%
unpow-191.1%
associate-/r*91.1%
metadata-eval91.1%
associate-*r*91.2%
*-commutative91.2%
metadata-eval91.2%
distribute-lft-neg-in91.2%
distribute-lft-neg-in91.2%
metadata-eval91.2%
associate-*r*91.1%
*-commutative91.1%
*-commutative91.1%
Simplified91.1%
Taylor expanded in x around inf 70.1%
Final simplification75.2%
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 (<= (* x y) -1.32e+45)
(/ x (/ a (* y 0.5)))
(if (<= (* x y) 2e-58)
(* t (* (/ z a) -4.5))
(if (<= (* x y) 5e+228) (/ 0.5 (/ a (* x y))) (* x (/ (* y 0.5) 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 ((x * y) <= -1.32e+45) {
tmp = x / (a / (y * 0.5));
} else if ((x * y) <= 2e-58) {
tmp = t * ((z / a) * -4.5);
} else if ((x * y) <= 5e+228) {
tmp = 0.5 / (a / (x * y));
} else {
tmp = x * ((y * 0.5) / a);
}
return tmp;
}
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 ((x * y) <= (-1.32d+45)) then
tmp = x / (a / (y * 0.5d0))
else if ((x * y) <= 2d-58) then
tmp = t * ((z / a) * (-4.5d0))
else if ((x * y) <= 5d+228) then
tmp = 0.5d0 / (a / (x * y))
else
tmp = x * ((y * 0.5d0) / a)
end if
code = tmp
end function
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 ((x * y) <= -1.32e+45) {
tmp = x / (a / (y * 0.5));
} else if ((x * y) <= 2e-58) {
tmp = t * ((z / a) * -4.5);
} else if ((x * y) <= 5e+228) {
tmp = 0.5 / (a / (x * y));
} else {
tmp = x * ((y * 0.5) / a);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -1.32e+45: tmp = x / (a / (y * 0.5)) elif (x * y) <= 2e-58: tmp = t * ((z / a) * -4.5) elif (x * y) <= 5e+228: tmp = 0.5 / (a / (x * y)) else: tmp = x * ((y * 0.5) / a) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -1.32e+45) tmp = Float64(x / Float64(a / Float64(y * 0.5))); elseif (Float64(x * y) <= 2e-58) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (Float64(x * y) <= 5e+228) tmp = Float64(0.5 / Float64(a / Float64(x * y))); else tmp = Float64(x * Float64(Float64(y * 0.5) / a)); end return tmp end
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 ((x * y) <= -1.32e+45)
tmp = x / (a / (y * 0.5));
elseif ((x * y) <= 2e-58)
tmp = t * ((z / a) * -4.5);
elseif ((x * y) <= 5e+228)
tmp = 0.5 / (a / (x * y));
else
tmp = x * ((y * 0.5) / a);
end
tmp_2 = tmp;
end
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[(x * y), $MachinePrecision], -1.32e+45], N[(x / N[(a / N[(y * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e-58], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+228], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -1.32 \cdot 10^{+45}:\\
\;\;\;\;\frac{x}{\frac{a}{y \cdot 0.5}}\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-58}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+228}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.32000000000000005e45Initial program 83.1%
Taylor expanded in x around inf 65.4%
*-commutative65.4%
associate-/l*68.9%
associate-*r*68.9%
*-commutative68.9%
associate-*r/68.9%
Simplified68.9%
clear-num68.8%
un-div-inv69.0%
*-commutative69.0%
Applied egg-rr69.0%
if -1.32000000000000005e45 < (*.f64 x y) < 2.0000000000000001e-58Initial program 92.0%
Taylor expanded in x around 0 74.4%
*-commutative74.4%
associate-*r*74.4%
Simplified74.4%
associate-/l*75.9%
times-frac75.9%
metadata-eval75.9%
Applied egg-rr75.9%
if 2.0000000000000001e-58 < (*.f64 x y) < 5e228Initial program 91.1%
clear-num91.1%
inv-pow91.1%
*-commutative91.1%
associate-/l*91.1%
fma-neg91.1%
*-commutative91.1%
distribute-rgt-neg-in91.1%
distribute-rgt-neg-in91.1%
metadata-eval91.1%
Applied egg-rr91.1%
unpow-191.1%
associate-/r*91.1%
metadata-eval91.1%
associate-*r*91.2%
*-commutative91.2%
metadata-eval91.2%
distribute-lft-neg-in91.2%
distribute-lft-neg-in91.2%
metadata-eval91.2%
associate-*r*91.1%
*-commutative91.1%
*-commutative91.1%
Simplified91.1%
Taylor expanded in x around inf 70.1%
if 5e228 < (*.f64 x y) Initial program 71.6%
Taylor expanded in x around inf 71.6%
*-commutative71.6%
associate-/l*92.6%
associate-*r*92.6%
*-commutative92.6%
associate-*r/92.6%
Simplified92.6%
Final simplification75.2%
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 (<= (* x y) -1e+45)
(/ (* y (/ x a)) 2.0)
(if (<= (* x y) 2e-58)
(* t (* (/ z a) -4.5))
(if (<= (* x y) 5e+228) (/ 0.5 (/ a (* x y))) (* x (/ (* y 0.5) 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 ((x * y) <= -1e+45) {
tmp = (y * (x / a)) / 2.0;
} else if ((x * y) <= 2e-58) {
tmp = t * ((z / a) * -4.5);
} else if ((x * y) <= 5e+228) {
tmp = 0.5 / (a / (x * y));
} else {
tmp = x * ((y * 0.5) / a);
}
return tmp;
}
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 ((x * y) <= (-1d+45)) then
tmp = (y * (x / a)) / 2.0d0
else if ((x * y) <= 2d-58) then
tmp = t * ((z / a) * (-4.5d0))
else if ((x * y) <= 5d+228) then
tmp = 0.5d0 / (a / (x * y))
else
tmp = x * ((y * 0.5d0) / a)
end if
code = tmp
end function
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 ((x * y) <= -1e+45) {
tmp = (y * (x / a)) / 2.0;
} else if ((x * y) <= 2e-58) {
tmp = t * ((z / a) * -4.5);
} else if ((x * y) <= 5e+228) {
tmp = 0.5 / (a / (x * y));
} else {
tmp = x * ((y * 0.5) / a);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -1e+45: tmp = (y * (x / a)) / 2.0 elif (x * y) <= 2e-58: tmp = t * ((z / a) * -4.5) elif (x * y) <= 5e+228: tmp = 0.5 / (a / (x * y)) else: tmp = x * ((y * 0.5) / a) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -1e+45) tmp = Float64(Float64(y * Float64(x / a)) / 2.0); elseif (Float64(x * y) <= 2e-58) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (Float64(x * y) <= 5e+228) tmp = Float64(0.5 / Float64(a / Float64(x * y))); else tmp = Float64(x * Float64(Float64(y * 0.5) / a)); end return tmp end
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 ((x * y) <= -1e+45)
tmp = (y * (x / a)) / 2.0;
elseif ((x * y) <= 2e-58)
tmp = t * ((z / a) * -4.5);
elseif ((x * y) <= 5e+228)
tmp = 0.5 / (a / (x * y));
else
tmp = x * ((y * 0.5) / a);
end
tmp_2 = tmp;
end
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[(x * y), $MachinePrecision], -1e+45], N[(N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e-58], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+228], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+45}:\\
\;\;\;\;\frac{y \cdot \frac{x}{a}}{2}\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{-58}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+228}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -9.9999999999999993e44Initial program 83.4%
Taylor expanded in x around inf 66.1%
*-commutative66.1%
associate-/l*67.5%
associate-*r*67.5%
*-commutative67.5%
associate-*r/67.5%
Simplified67.5%
associate-*r/66.1%
associate-*l/75.3%
*-commutative75.3%
metadata-eval75.3%
div-inv75.3%
associate-*r/75.3%
Applied egg-rr75.3%
if -9.9999999999999993e44 < (*.f64 x y) < 2.0000000000000001e-58Initial program 92.0%
Taylor expanded in x around 0 74.9%
*-commutative74.9%
associate-*r*75.0%
Simplified75.0%
associate-/l*76.4%
times-frac76.4%
metadata-eval76.4%
Applied egg-rr76.4%
if 2.0000000000000001e-58 < (*.f64 x y) < 5e228Initial program 91.1%
clear-num91.1%
inv-pow91.1%
*-commutative91.1%
associate-/l*91.1%
fma-neg91.1%
*-commutative91.1%
distribute-rgt-neg-in91.1%
distribute-rgt-neg-in91.1%
metadata-eval91.1%
Applied egg-rr91.1%
unpow-191.1%
associate-/r*91.1%
metadata-eval91.1%
associate-*r*91.2%
*-commutative91.2%
metadata-eval91.2%
distribute-lft-neg-in91.2%
distribute-lft-neg-in91.2%
metadata-eval91.2%
associate-*r*91.1%
*-commutative91.1%
*-commutative91.1%
Simplified91.1%
Taylor expanded in x around inf 70.1%
if 5e228 < (*.f64 x y) Initial program 71.6%
Taylor expanded in x around inf 71.6%
*-commutative71.6%
associate-/l*92.6%
associate-*r*92.6%
*-commutative92.6%
associate-*r/92.6%
Simplified92.6%
Final simplification76.6%
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 (<= (* x y) 5e+280) (/ 0.5 (/ a (- (* x y) (* z (* 9.0 t))))) (* x (/ (* y 0.5) 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 ((x * y) <= 5e+280) {
tmp = 0.5 / (a / ((x * y) - (z * (9.0 * t))));
} else {
tmp = x * ((y * 0.5) / a);
}
return tmp;
}
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 ((x * y) <= 5d+280) then
tmp = 0.5d0 / (a / ((x * y) - (z * (9.0d0 * t))))
else
tmp = x * ((y * 0.5d0) / a)
end if
code = tmp
end function
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 ((x * y) <= 5e+280) {
tmp = 0.5 / (a / ((x * y) - (z * (9.0 * t))));
} else {
tmp = x * ((y * 0.5) / a);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= 5e+280: tmp = 0.5 / (a / ((x * y) - (z * (9.0 * t)))) else: tmp = x * ((y * 0.5) / a) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= 5e+280) tmp = Float64(0.5 / Float64(a / Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))))); else tmp = Float64(x * Float64(Float64(y * 0.5) / a)); end return tmp end
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 ((x * y) <= 5e+280)
tmp = 0.5 / (a / ((x * y) - (z * (9.0 * t))));
else
tmp = x * ((y * 0.5) / a);
end
tmp_2 = tmp;
end
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[(x * y), $MachinePrecision], 5e+280], N[(0.5 / N[(a / N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq 5 \cdot 10^{+280}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y - z \cdot \left(9 \cdot t\right)}}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < 5.0000000000000002e280Initial program 90.3%
clear-num90.3%
inv-pow90.3%
*-commutative90.3%
associate-/l*90.3%
fma-neg90.3%
*-commutative90.3%
distribute-rgt-neg-in90.3%
distribute-rgt-neg-in90.3%
metadata-eval90.3%
Applied egg-rr90.3%
unpow-190.3%
associate-/r*90.3%
metadata-eval90.3%
associate-*r*90.3%
*-commutative90.3%
metadata-eval90.3%
distribute-lft-neg-in90.3%
distribute-lft-neg-in90.3%
metadata-eval90.3%
associate-*r*90.2%
*-commutative90.2%
*-commutative90.2%
Simplified90.2%
*-commutative90.2%
associate-*r*90.3%
metadata-eval90.3%
distribute-rgt-neg-in90.3%
distribute-lft-neg-in90.3%
fma-neg90.3%
associate-*l*90.2%
Applied egg-rr90.2%
if 5.0000000000000002e280 < (*.f64 x y) Initial program 63.5%
Taylor expanded in x around inf 68.3%
*-commutative68.3%
associate-/l*95.3%
associate-*r*95.3%
*-commutative95.3%
associate-*r/95.3%
Simplified95.3%
Final simplification90.6%
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 (<= y -1.55e-86) (not (<= y 4.5e+124))) (* x (/ (* y 0.5) a)) (* t (* (/ z a) -4.5))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((y <= -1.55e-86) || !(y <= 4.5e+124)) {
tmp = x * ((y * 0.5) / a);
} else {
tmp = t * ((z / a) * -4.5);
}
return tmp;
}
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 ((y <= (-1.55d-86)) .or. (.not. (y <= 4.5d+124))) then
tmp = x * ((y * 0.5d0) / a)
else
tmp = t * ((z / a) * (-4.5d0))
end if
code = tmp
end function
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 ((y <= -1.55e-86) || !(y <= 4.5e+124)) {
tmp = x * ((y * 0.5) / a);
} else {
tmp = t * ((z / a) * -4.5);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (y <= -1.55e-86) or not (y <= 4.5e+124): tmp = x * ((y * 0.5) / a) else: tmp = t * ((z / a) * -4.5) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if ((y <= -1.55e-86) || !(y <= 4.5e+124)) tmp = Float64(x * Float64(Float64(y * 0.5) / a)); else tmp = Float64(t * Float64(Float64(z / a) * -4.5)); end return tmp end
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 ((y <= -1.55e-86) || ~((y <= 4.5e+124)))
tmp = x * ((y * 0.5) / a);
else
tmp = t * ((z / a) * -4.5);
end
tmp_2 = tmp;
end
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[y, -1.55e-86], N[Not[LessEqual[y, 4.5e+124]], $MachinePrecision]], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.55 \cdot 10^{-86} \lor \neg \left(y \leq 4.5 \cdot 10^{+124}\right):\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\end{array}
\end{array}
if y < -1.54999999999999994e-86 or 4.5000000000000004e124 < y Initial program 86.2%
Taylor expanded in x around inf 62.4%
*-commutative62.4%
associate-/l*64.7%
associate-*r*64.7%
*-commutative64.7%
associate-*r/64.7%
Simplified64.7%
if -1.54999999999999994e-86 < y < 4.5000000000000004e124Initial program 89.6%
Taylor expanded in x around 0 60.7%
*-commutative60.7%
associate-*r*60.7%
Simplified60.7%
associate-/l*64.9%
times-frac65.0%
metadata-eval65.0%
Applied egg-rr65.0%
Final simplification64.9%
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);
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.
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;
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]) def code(x, y, z, t, a): return -4.5 * (t * (z / 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])){:}
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. 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])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 88.1%
Taylor expanded in x around 0 46.5%
associate-/l*51.4%
Simplified51.4%
Final simplification51.4%
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 (* z (/ 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 * (z * (t / a));
}
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) * (z * (t / a))
end function
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 * (z * (t / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (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(z * Float64(t / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
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[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 88.1%
Taylor expanded in x around 0 46.5%
clear-num46.5%
associate-/r*48.7%
associate-/r/49.0%
clear-num49.5%
Applied egg-rr49.5%
Final simplification49.5%
(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 2024060
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:alt
(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)))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))