
(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 12 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 (<= t_1 (- INFINITY))
(* y (/ (+ (* t (* (/ z y) -4.5)) (* x 0.5)) a))
(if (<= t_1 5e+262)
(/ (- (* x y) (* 9.0 (* z t))) (* a 2.0))
(* (/ y a) (+ (* x 0.5) (* -4.5 (* t (/ z y)))))))))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 = y * (((t * ((z / y) * -4.5)) + (x * 0.5)) / a);
} else if (t_1 <= 5e+262) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y))));
}
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) {
tmp = y * (((t * ((z / y) * -4.5)) + (x * 0.5)) / a);
} else if (t_1 <= 5e+262) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y))));
}
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: tmp = y * (((t * ((z / y) * -4.5)) + (x * 0.5)) / a) elif t_1 <= 5e+262: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y)))) 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)) tmp = Float64(y * Float64(Float64(Float64(t * Float64(Float64(z / y) * -4.5)) + Float64(x * 0.5)) / a)); elseif (t_1 <= 5e+262) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(y / a) * Float64(Float64(x * 0.5) + Float64(-4.5 * Float64(t * Float64(z / y))))); 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)
tmp = y * (((t * ((z / y) * -4.5)) + (x * 0.5)) / a);
elseif (t_1 <= 5e+262)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y))));
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[LessEqual[t$95$1, (-Infinity)], N[(y * N[(N[(N[(t * N[(N[(z / y), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision] + N[(x * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+262], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y / a), $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] + N[(-4.5 * N[(t * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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:\\
\;\;\;\;y \cdot \frac{t \cdot \left(\frac{z}{y} \cdot -4.5\right) + x \cdot 0.5}{a}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+262}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5 + -4.5 \cdot \left(t \cdot \frac{z}{y}\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0Initial program 55.3%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6455.2%
Simplified55.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-/r*N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
*-commutativeN/A
associate-/r*N/A
frac-subN/A
Applied egg-rr51.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
associate-*l/N/A
*-commutativeN/A
+-lowering-+.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.5%
Simplified51.5%
associate-/l*N/A
*-commutativeN/A
times-fracN/A
*-inversesN/A
*-lft-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6476.6%
Applied egg-rr76.6%
associate-/l*N/A
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.4%
Applied egg-rr89.4%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 5.00000000000000008e262Initial program 99.7%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6499.7%
Applied egg-rr99.7%
if 5.00000000000000008e262 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 72.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6472.6%
Simplified72.6%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
fma-defineN/A
associate-*l/N/A
times-fracN/A
*-inversesN/A
*-inversesN/A
times-fracN/A
associate-*l/N/A
fma-defineN/A
associate-*l*N/A
Simplified90.2%
Final simplification96.5%
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 (* (/ y a) (+ (* x 0.5) (* -4.5 (* t (/ z y))))))
(t_2 (- (* x y) (* (* z 9.0) t))))
(if (<= t_2 (- INFINITY))
t_1
(if (<= t_2 5e+262) (/ (- (* x y) (* 9.0 (* z t))) (* a 2.0)) 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 = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y))));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = t_1;
} else if (t_2 <= 5e+262) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = t_1;
}
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 = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y))));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -Double.POSITIVE_INFINITY) {
tmp = t_1;
} else if (t_2 <= 5e+262) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} 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 = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y)))) t_2 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_2 <= -math.inf: tmp = t_1 elif t_2 <= 5e+262: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) 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(Float64(y / a) * Float64(Float64(x * 0.5) + Float64(-4.5 * Float64(t * Float64(z / y))))) t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = t_1; elseif (t_2 <= 5e+262) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); 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 = (y / a) * ((x * 0.5) + (-4.5 * (t * (z / y))));
t_2 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_2 <= -Inf)
tmp = t_1;
elseif (t_2 <= 5e+262)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
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[(N[(y / a), $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] + N[(-4.5 * N[(t * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 5e+262], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $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 := \frac{y}{a} \cdot \left(x \cdot 0.5 + -4.5 \cdot \left(t \cdot \frac{z}{y}\right)\right)\\
t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+262}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 5.00000000000000008e262 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 63.3%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6463.2%
Simplified63.2%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
fma-defineN/A
associate-*l/N/A
times-fracN/A
*-inversesN/A
*-inversesN/A
times-fracN/A
associate-*l/N/A
fma-defineN/A
associate-*l*N/A
Simplified89.6%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 5.00000000000000008e262Initial program 99.7%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6499.7%
Applied egg-rr99.7%
Final simplification96.5%
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)) (t_2 (* t (* z (/ -4.5 a)))))
(if (<= t_1 (- INFINITY))
t_2
(if (<= t_1 1e+228) (/ (- (* x y) (* 9.0 (* z t))) (* a 2.0)) t_2))))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 t_2 = t * (z * (-4.5 / a));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 <= 1e+228) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = t_2;
}
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 = (z * 9.0) * t;
double t_2 = t * (z * (-4.5 / a));
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 <= 1e+228) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = t_2;
}
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 t_2 = t * (z * (-4.5 / a)) tmp = 0 if t_1 <= -math.inf: tmp = t_2 elif t_1 <= 1e+228: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = t_2 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) t_2 = Float64(t * Float64(z * Float64(-4.5 / a))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = t_2; elseif (t_1 <= 1e+228) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = t_2; 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;
t_2 = t * (z * (-4.5 / a));
tmp = 0.0;
if (t_1 <= -Inf)
tmp = t_2;
elseif (t_1 <= 1e+228)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = t_2;
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]}, Block[{t$95$2 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$2, If[LessEqual[t$95$1, 1e+228], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\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\\
t_2 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{+228}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0 or 9.9999999999999992e227 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 66.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6466.7%
Simplified66.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6497.8%
Applied egg-rr97.8%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6498.2%
Applied egg-rr98.2%
associate-*r/N/A
associate-*l/N/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6498.3%
Applied egg-rr98.3%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 9.9999999999999992e227Initial program 92.9%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6493.0%
Applied egg-rr93.0%
Final simplification94.0%
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)) (t_2 (* t (* z (/ -4.5 a)))))
(if (<= t_1 (- INFINITY))
t_2
(if (<= t_1 1e+228) (/ (+ (* x y) (* z (* t -9.0))) (* a 2.0)) t_2))))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 t_2 = t * (z * (-4.5 / a));
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = t_2;
} else if (t_1 <= 1e+228) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = t_2;
}
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 = (z * 9.0) * t;
double t_2 = t * (z * (-4.5 / a));
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = t_2;
} else if (t_1 <= 1e+228) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = t_2;
}
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 t_2 = t * (z * (-4.5 / a)) tmp = 0 if t_1 <= -math.inf: tmp = t_2 elif t_1 <= 1e+228: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = t_2 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) t_2 = Float64(t * Float64(z * Float64(-4.5 / a))) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = t_2; elseif (t_1 <= 1e+228) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = t_2; 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;
t_2 = t * (z * (-4.5 / a));
tmp = 0.0;
if (t_1 <= -Inf)
tmp = t_2;
elseif (t_1 <= 1e+228)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = t_2;
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]}, Block[{t$95$2 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$2, If[LessEqual[t$95$1, 1e+228], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\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\\
t_2 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{+228}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0 or 9.9999999999999992e227 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 66.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6466.7%
Simplified66.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.7%
Simplified68.7%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6497.8%
Applied egg-rr97.8%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6498.2%
Applied egg-rr98.2%
associate-*r/N/A
associate-*l/N/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6498.3%
Applied egg-rr98.3%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 9.9999999999999992e227Initial program 92.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.9%
Simplified92.9%
Final simplification93.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
(if (<= (* x y) (- INFINITY))
(* (* x 0.5) (/ y a))
(if (<= (* x y) 4e+234)
(/ 0.5 (/ a (+ (* x y) (* z (* t -9.0)))))
(* 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) <= -((double) INFINITY)) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 4e+234) {
tmp = 0.5 / (a / ((x * y) + (z * (t * -9.0))));
} else {
tmp = x * ((y * 0.5) / a);
}
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 tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 4e+234) {
tmp = 0.5 / (a / ((x * y) + (z * (t * -9.0))));
} 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) <= -math.inf: tmp = (x * 0.5) * (y / a) elif (x * y) <= 4e+234: tmp = 0.5 / (a / ((x * y) + (z * (t * -9.0)))) 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) <= Float64(-Inf)) tmp = Float64(Float64(x * 0.5) * Float64(y / a)); elseif (Float64(x * y) <= 4e+234) tmp = Float64(0.5 / Float64(a / Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))))); 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) <= -Inf)
tmp = (x * 0.5) * (y / a);
elseif ((x * y) <= 4e+234)
tmp = 0.5 / (a / ((x * y) + (z * (t * -9.0))));
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], (-Infinity)], N[(N[(x * 0.5), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 4e+234], N[(0.5 / N[(a / N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $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 -\infty:\\
\;\;\;\;\left(x \cdot 0.5\right) \cdot \frac{y}{a}\\
\mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+234}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y + z \cdot \left(t \cdot -9\right)}}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 56.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6456.5%
Simplified56.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.8%
Simplified95.8%
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.7%
Applied egg-rr95.7%
if -inf.0 < (*.f64 x y) < 4.00000000000000007e234Initial program 93.1%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6493.1%
Simplified93.1%
clear-numN/A
associate-/r/N/A
*-commutativeN/A
associate-/r*N/A
flip3-+N/A
clear-numN/A
frac-timesN/A
metadata-evalN/A
metadata-evalN/A
metadata-evalN/A
clear-numN/A
Applied egg-rr93.0%
if 4.00000000000000007e234 < (*.f64 x y) Initial program 72.8%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6472.8%
Simplified72.8%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.9%
Simplified95.9%
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.9%
Applied egg-rr95.9%
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6495.9%
Applied egg-rr95.9%
Final simplification93.5%
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) (- INFINITY))
(* (* x 0.5) (/ y a))
(if (<= (* x y) 4e+234)
(* (+ (* x y) (* z (* t -9.0))) (/ 0.5 a))
(* 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) <= -((double) INFINITY)) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 4e+234) {
tmp = ((x * y) + (z * (t * -9.0))) * (0.5 / a);
} else {
tmp = x * ((y * 0.5) / a);
}
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 tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 4e+234) {
tmp = ((x * y) + (z * (t * -9.0))) * (0.5 / a);
} 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) <= -math.inf: tmp = (x * 0.5) * (y / a) elif (x * y) <= 4e+234: tmp = ((x * y) + (z * (t * -9.0))) * (0.5 / a) 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) <= Float64(-Inf)) tmp = Float64(Float64(x * 0.5) * Float64(y / a)); elseif (Float64(x * y) <= 4e+234) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) * Float64(0.5 / a)); 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) <= -Inf)
tmp = (x * 0.5) * (y / a);
elseif ((x * y) <= 4e+234)
tmp = ((x * y) + (z * (t * -9.0))) * (0.5 / a);
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], (-Infinity)], N[(N[(x * 0.5), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 4e+234], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $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 -\infty:\\
\;\;\;\;\left(x \cdot 0.5\right) \cdot \frac{y}{a}\\
\mathbf{elif}\;x \cdot y \leq 4 \cdot 10^{+234}:\\
\;\;\;\;\left(x \cdot y + z \cdot \left(t \cdot -9\right)\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 56.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6456.5%
Simplified56.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.8%
Simplified95.8%
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.7%
Applied egg-rr95.7%
if -inf.0 < (*.f64 x y) < 4.00000000000000007e234Initial program 93.1%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6493.1%
Simplified93.1%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr92.9%
if 4.00000000000000007e234 < (*.f64 x y) Initial program 72.8%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6472.8%
Simplified72.8%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.9%
Simplified95.9%
associate-*r*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.9%
Applied egg-rr95.9%
associate-/r/N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6495.9%
Applied egg-rr95.9%
Final simplification93.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 (if (<= (* x y) -1e+90) (/ (* x 0.5) (/ a y)) (if (<= (* x y) 1e+38) (* (/ t a) (* z -4.5)) (* 0.5 (* y (/ x 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+90) {
tmp = (x * 0.5) / (a / y);
} else if ((x * y) <= 1e+38) {
tmp = (t / a) * (z * -4.5);
} else {
tmp = 0.5 * (y * (x / 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+90)) then
tmp = (x * 0.5d0) / (a / y)
else if ((x * y) <= 1d+38) then
tmp = (t / a) * (z * (-4.5d0))
else
tmp = 0.5d0 * (y * (x / 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+90) {
tmp = (x * 0.5) / (a / y);
} else if ((x * y) <= 1e+38) {
tmp = (t / a) * (z * -4.5);
} else {
tmp = 0.5 * (y * (x / 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+90: tmp = (x * 0.5) / (a / y) elif (x * y) <= 1e+38: tmp = (t / a) * (z * -4.5) else: tmp = 0.5 * (y * (x / 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+90) tmp = Float64(Float64(x * 0.5) / Float64(a / y)); elseif (Float64(x * y) <= 1e+38) tmp = Float64(Float64(t / a) * Float64(z * -4.5)); else tmp = Float64(0.5 * Float64(y * Float64(x / 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+90)
tmp = (x * 0.5) / (a / y);
elseif ((x * y) <= 1e+38)
tmp = (t / a) * (z * -4.5);
else
tmp = 0.5 * (y * (x / 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+90], N[(N[(x * 0.5), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+38], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $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^{+90}:\\
\;\;\;\;\frac{x \cdot 0.5}{\frac{a}{y}}\\
\mathbf{elif}\;x \cdot y \leq 10^{+38}:\\
\;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999966e89Initial program 79.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.5%
Simplified79.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6477.4%
Simplified77.4%
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6474.6%
Applied egg-rr74.6%
if -9.99999999999999966e89 < (*.f64 x y) < 9.99999999999999977e37Initial program 92.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.6%
Simplified92.6%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.1%
Simplified75.1%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6479.1%
Applied egg-rr79.1%
if 9.99999999999999977e37 < (*.f64 x y) Initial program 85.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6485.7%
Simplified85.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.1%
Simplified79.1%
Final simplification77.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 (if (<= (* x y) -1e+90) (* (* x 0.5) (/ y a)) (if (<= (* x y) 1e+38) (* (/ t a) (* z -4.5)) (* 0.5 (* y (/ x 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+90) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 1e+38) {
tmp = (t / a) * (z * -4.5);
} else {
tmp = 0.5 * (y * (x / 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+90)) then
tmp = (x * 0.5d0) * (y / a)
else if ((x * y) <= 1d+38) then
tmp = (t / a) * (z * (-4.5d0))
else
tmp = 0.5d0 * (y * (x / 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+90) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 1e+38) {
tmp = (t / a) * (z * -4.5);
} else {
tmp = 0.5 * (y * (x / 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+90: tmp = (x * 0.5) * (y / a) elif (x * y) <= 1e+38: tmp = (t / a) * (z * -4.5) else: tmp = 0.5 * (y * (x / 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+90) tmp = Float64(Float64(x * 0.5) * Float64(y / a)); elseif (Float64(x * y) <= 1e+38) tmp = Float64(Float64(t / a) * Float64(z * -4.5)); else tmp = Float64(0.5 * Float64(y * Float64(x / 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+90)
tmp = (x * 0.5) * (y / a);
elseif ((x * y) <= 1e+38)
tmp = (t / a) * (z * -4.5);
else
tmp = 0.5 * (y * (x / 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+90], N[(N[(x * 0.5), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e+38], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $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^{+90}:\\
\;\;\;\;\left(x \cdot 0.5\right) \cdot \frac{y}{a}\\
\mathbf{elif}\;x \cdot y \leq 10^{+38}:\\
\;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999966e89Initial program 79.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.5%
Simplified79.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6477.4%
Simplified77.4%
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6474.5%
Applied egg-rr74.5%
if -9.99999999999999966e89 < (*.f64 x y) < 9.99999999999999977e37Initial program 92.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.6%
Simplified92.6%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.1%
Simplified75.1%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6479.1%
Applied egg-rr79.1%
if 9.99999999999999977e37 < (*.f64 x y) Initial program 85.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6485.7%
Simplified85.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6479.1%
Simplified79.1%
Final simplification77.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 (if (<= (* x y) -1e+90) (* (* x 0.5) (/ y a)) (if (<= (* x y) 2e+117) (* t (* z (/ -4.5 a))) (* 0.5 (* y (/ x 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+90) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 2e+117) {
tmp = t * (z * (-4.5 / a));
} else {
tmp = 0.5 * (y * (x / 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+90)) then
tmp = (x * 0.5d0) * (y / a)
else if ((x * y) <= 2d+117) then
tmp = t * (z * ((-4.5d0) / a))
else
tmp = 0.5d0 * (y * (x / 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+90) {
tmp = (x * 0.5) * (y / a);
} else if ((x * y) <= 2e+117) {
tmp = t * (z * (-4.5 / a));
} else {
tmp = 0.5 * (y * (x / 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+90: tmp = (x * 0.5) * (y / a) elif (x * y) <= 2e+117: tmp = t * (z * (-4.5 / a)) else: tmp = 0.5 * (y * (x / 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+90) tmp = Float64(Float64(x * 0.5) * Float64(y / a)); elseif (Float64(x * y) <= 2e+117) tmp = Float64(t * Float64(z * Float64(-4.5 / a))); else tmp = Float64(0.5 * Float64(y * Float64(x / 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+90)
tmp = (x * 0.5) * (y / a);
elseif ((x * y) <= 2e+117)
tmp = t * (z * (-4.5 / a));
else
tmp = 0.5 * (y * (x / 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+90], N[(N[(x * 0.5), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+117], N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $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^{+90}:\\
\;\;\;\;\left(x \cdot 0.5\right) \cdot \frac{y}{a}\\
\mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+117}:\\
\;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999966e89Initial program 79.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6479.5%
Simplified79.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6477.4%
Simplified77.4%
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6474.5%
Applied egg-rr74.5%
if -9.99999999999999966e89 < (*.f64 x y) < 2.0000000000000001e117Initial program 92.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.5%
Simplified92.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.1%
Simplified72.1%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.4%
Applied egg-rr76.4%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6475.2%
Applied egg-rr75.2%
associate-*r/N/A
associate-*l/N/A
associate-/r/N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6474.0%
Applied egg-rr74.0%
if 2.0000000000000001e117 < (*.f64 x y) Initial program 83.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6483.5%
Simplified83.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6489.5%
Simplified89.5%
Final simplification76.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 (let* ((t_1 (* -4.5 (/ z (/ a t))))) (if (<= t -1.4e-81) t_1 (if (<= t 5.5e-5) (* 0.5 (* y (/ x a))) 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 = -4.5 * (z / (a / t));
double tmp;
if (t <= -1.4e-81) {
tmp = t_1;
} else if (t <= 5.5e-5) {
tmp = 0.5 * (y * (x / a));
} 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 = (-4.5d0) * (z / (a / t))
if (t <= (-1.4d-81)) then
tmp = t_1
else if (t <= 5.5d-5) then
tmp = 0.5d0 * (y * (x / a))
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 = -4.5 * (z / (a / t));
double tmp;
if (t <= -1.4e-81) {
tmp = t_1;
} else if (t <= 5.5e-5) {
tmp = 0.5 * (y * (x / a));
} 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 = -4.5 * (z / (a / t)) tmp = 0 if t <= -1.4e-81: tmp = t_1 elif t <= 5.5e-5: tmp = 0.5 * (y * (x / a)) 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(-4.5 * Float64(z / Float64(a / t))) tmp = 0.0 if (t <= -1.4e-81) tmp = t_1; elseif (t <= 5.5e-5) tmp = Float64(0.5 * Float64(y * Float64(x / a))); 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 = -4.5 * (z / (a / t));
tmp = 0.0;
if (t <= -1.4e-81)
tmp = t_1;
elseif (t <= 5.5e-5)
tmp = 0.5 * (y * (x / a));
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[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.4e-81], t$95$1, If[LessEqual[t, 5.5e-5], N[(0.5 * N[(y * N[(x / a), $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 := -4.5 \cdot \frac{z}{\frac{a}{t}}\\
\mathbf{if}\;t \leq -1.4 \cdot 10^{-81}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 5.5 \cdot 10^{-5}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -1.3999999999999999e-81 or 5.5000000000000002e-5 < t Initial program 84.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6484.8%
Simplified84.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6457.5%
Simplified57.5%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.9%
Applied egg-rr68.9%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6468.2%
Applied egg-rr68.2%
if -1.3999999999999999e-81 < t < 5.5000000000000002e-5Initial program 92.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.5%
Simplified92.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6468.4%
Simplified68.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 (if (<= x 2.1e-255) (* -4.5 (/ z (/ a t))) (* -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) {
double tmp;
if (x <= 2.1e-255) {
tmp = -4.5 * (z / (a / t));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 <= 2.1d-255) then
tmp = (-4.5d0) * (z / (a / t))
else
tmp = (-4.5d0) * ((z * t) / 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 <= 2.1e-255) {
tmp = -4.5 * (z / (a / t));
} else {
tmp = -4.5 * ((z * t) / 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 <= 2.1e-255: tmp = -4.5 * (z / (a / t)) else: tmp = -4.5 * ((z * t) / 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 (x <= 2.1e-255) tmp = Float64(-4.5 * Float64(z / Float64(a / t))); else tmp = Float64(-4.5 * Float64(Float64(z * t) / 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 <= 2.1e-255)
tmp = -4.5 * (z / (a / t));
else
tmp = -4.5 * ((z * t) / a);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[x, 2.1e-255], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $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 \leq 2.1 \cdot 10^{-255}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if x < 2.1e-255Initial program 86.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.7%
Simplified86.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6451.3%
Simplified51.3%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6458.2%
Applied egg-rr58.2%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6457.1%
Applied egg-rr57.1%
if 2.1e-255 < x Initial program 89.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6489.5%
Simplified89.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6448.8%
Simplified48.8%
Final simplification53.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 (* -4.5 (/ z (/ a t))))
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 / (a / t));
}
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 / (a / t))
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 / (a / t));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (z / (a / t))
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(a / t))) 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 / (a / t));
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[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \frac{z}{\frac{a}{t}}
\end{array}
Initial program 88.0%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6488.0%
Simplified88.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6450.2%
Simplified50.2%
*-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
metadata-evalN/A
associate-*l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6455.7%
Applied egg-rr55.7%
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6454.7%
Applied egg-rr54.7%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2024138
(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)))