
(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 13 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 -2e+217)
(* (fma 0.5 y (* z (/ (* t -4.5) x))) (/ x a))
(if (<= t_1 1e+308)
(/ t_1 (* a 2.0))
(* x (* y (- (/ 0.5 a) (* 4.5 (* t (/ z (* 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 t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -2e+217) {
tmp = fma(0.5, y, (z * ((t * -4.5) / x))) * (x / a);
} else if (t_1 <= 1e+308) {
tmp = t_1 / (a * 2.0);
} else {
tmp = x * (y * ((0.5 / a) - (4.5 * (t * (z / (y * (x * a)))))));
}
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 <= -2e+217) tmp = Float64(fma(0.5, y, Float64(z * Float64(Float64(t * -4.5) / x))) * Float64(x / a)); elseif (t_1 <= 1e+308) tmp = Float64(t_1 / Float64(a * 2.0)); else tmp = Float64(x * Float64(y * Float64(Float64(0.5 / a) - Float64(4.5 * Float64(t * Float64(z / Float64(y * Float64(x * a)))))))); 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[LessEqual[t$95$1, -2e+217], N[(N[(0.5 * y + N[(z * N[(N[(t * -4.5), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+308], N[(t$95$1 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(N[(0.5 / a), $MachinePrecision] - N[(4.5 * N[(t * N[(z / N[(y * N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $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 -2 \cdot 10^{+217}:\\
\;\;\;\;\mathsf{fma}\left(0.5, y, z \cdot \frac{t \cdot -4.5}{x}\right) \cdot \frac{x}{a}\\
\mathbf{elif}\;t\_1 \leq 10^{+308}:\\
\;\;\;\;\frac{t\_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(y \cdot \left(\frac{0.5}{a} - 4.5 \cdot \left(t \cdot \frac{z}{y \cdot \left(x \cdot a\right)}\right)\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1.99999999999999992e217Initial program 76.6%
Taylor expanded in x around inf 89.2%
Taylor expanded in a around 0 76.6%
*-commutative76.6%
associate-/l*91.8%
+-commutative91.8%
fma-define91.8%
associate-*r/91.8%
associate-*r*91.8%
*-commutative91.8%
*-commutative91.8%
associate-/l*91.8%
*-commutative91.8%
Simplified91.8%
if -1.99999999999999992e217 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1e308Initial program 98.2%
if 1e308 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 60.3%
Taylor expanded in x around inf 65.2%
Taylor expanded in y around -inf 65.4%
associate-*r*65.4%
mul-1-neg65.4%
associate-/l*87.5%
associate-*r*84.4%
associate-*r/84.4%
metadata-eval84.4%
Simplified84.4%
Final simplification95.7%
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+308)))
(* x (* y (- (/ 0.5 a) (* 4.5 (* t (/ z (* y (* x a))))))))
(/ t_1 (* 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+308)) {
tmp = x * (y * ((0.5 / a) - (4.5 * (t * (z / (y * (x * a)))))));
} else {
tmp = t_1 / (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+308)) {
tmp = x * (y * ((0.5 / a) - (4.5 * (t * (z / (y * (x * a)))))));
} else {
tmp = t_1 / (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+308): tmp = x * (y * ((0.5 / a) - (4.5 * (t * (z / (y * (x * a))))))) else: tmp = t_1 / (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+308)) tmp = Float64(x * Float64(y * Float64(Float64(0.5 / a) - Float64(4.5 * Float64(t * Float64(z / Float64(y * Float64(x * a)))))))); else tmp = Float64(t_1 / 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+308)))
tmp = x * (y * ((0.5 / a) - (4.5 * (t * (z / (y * (x * a)))))));
else
tmp = t_1 / (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+308]], $MachinePrecision]], N[(x * N[(y * N[(N[(0.5 / a), $MachinePrecision] - N[(4.5 * N[(t * N[(z / N[(y * N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / 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^{+308}\right):\\
\;\;\;\;x \cdot \left(y \cdot \left(\frac{0.5}{a} - 4.5 \cdot \left(t \cdot \frac{z}{y \cdot \left(x \cdot a\right)}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_1}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 1e308 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 65.5%
Taylor expanded in x around inf 75.6%
Taylor expanded in y around -inf 77.4%
associate-*r*77.4%
mul-1-neg77.4%
associate-/l*93.5%
associate-*r*91.9%
associate-*r/91.9%
metadata-eval91.9%
Simplified91.9%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1e308Initial program 98.3%
Final simplification96.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 -2e+217)
(* y (+ (* -4.5 (/ (* z t) (* y a))) (* 0.5 (/ x a))))
(if (<= t_1 1e+305)
(/ t_1 (* a 2.0))
(* t (+ (* -4.5 (/ z a)) (* 0.5 (/ (* x y) (* t a)))))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -2e+217) {
tmp = y * ((-4.5 * ((z * t) / (y * a))) + (0.5 * (x / a)));
} else if (t_1 <= 1e+305) {
tmp = t_1 / (a * 2.0);
} else {
tmp = t * ((-4.5 * (z / a)) + (0.5 * ((x * y) / (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) :: t_1
real(8) :: tmp
t_1 = (x * y) - ((z * 9.0d0) * t)
if (t_1 <= (-2d+217)) then
tmp = y * (((-4.5d0) * ((z * t) / (y * a))) + (0.5d0 * (x / a)))
else if (t_1 <= 1d+305) then
tmp = t_1 / (a * 2.0d0)
else
tmp = t * (((-4.5d0) * (z / a)) + (0.5d0 * ((x * y) / (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 t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -2e+217) {
tmp = y * ((-4.5 * ((z * t) / (y * a))) + (0.5 * (x / a)));
} else if (t_1 <= 1e+305) {
tmp = t_1 / (a * 2.0);
} else {
tmp = t * ((-4.5 * (z / a)) + (0.5 * ((x * y) / (t * a))));
}
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 <= -2e+217: tmp = y * ((-4.5 * ((z * t) / (y * a))) + (0.5 * (x / a))) elif t_1 <= 1e+305: tmp = t_1 / (a * 2.0) else: tmp = t * ((-4.5 * (z / a)) + (0.5 * ((x * y) / (t * a)))) 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 <= -2e+217) tmp = Float64(y * Float64(Float64(-4.5 * Float64(Float64(z * t) / Float64(y * a))) + Float64(0.5 * Float64(x / a)))); elseif (t_1 <= 1e+305) tmp = Float64(t_1 / Float64(a * 2.0)); else tmp = Float64(t * Float64(Float64(-4.5 * Float64(z / a)) + Float64(0.5 * Float64(Float64(x * y) / Float64(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)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_1 <= -2e+217)
tmp = y * ((-4.5 * ((z * t) / (y * a))) + (0.5 * (x / a)));
elseif (t_1 <= 1e+305)
tmp = t_1 / (a * 2.0);
else
tmp = t * ((-4.5 * (z / a)) + (0.5 * ((x * y) / (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_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+217], N[(y * N[(N[(-4.5 * N[(N[(z * t), $MachinePrecision] / N[(y * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+305], N[(t$95$1 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(N[(x * y), $MachinePrecision] / N[(t * a), $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 -2 \cdot 10^{+217}:\\
\;\;\;\;y \cdot \left(-4.5 \cdot \frac{z \cdot t}{y \cdot a} + 0.5 \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+305}:\\
\;\;\;\;\frac{t\_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a} + 0.5 \cdot \frac{x \cdot y}{t \cdot a}\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1.99999999999999992e217Initial program 76.6%
Taylor expanded in y around inf 86.2%
if -1.99999999999999992e217 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999994e304Initial program 98.2%
if 9.9999999999999994e304 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 62.7%
Taylor expanded in t around inf 81.9%
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 (* y (/ x (* a 2.0)))))
(if (<= (* x y) -2e+217)
t_1
(if (<= (* x y) -1e-53)
(* (* x y) (/ 0.5 a))
(if (<= (* x y) 5e+67) (* -4.5 (/ t (/ a z))) 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 * (x / (a * 2.0));
double tmp;
if ((x * y) <= -2e+217) {
tmp = t_1;
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = -4.5 * (t / (a / z));
} 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 = y * (x / (a * 2.0d0))
if ((x * y) <= (-2d+217)) then
tmp = t_1
else if ((x * y) <= (-1d-53)) then
tmp = (x * y) * (0.5d0 / a)
else if ((x * y) <= 5d+67) then
tmp = (-4.5d0) * (t / (a / z))
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 = y * (x / (a * 2.0));
double tmp;
if ((x * y) <= -2e+217) {
tmp = t_1;
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = -4.5 * (t / (a / z));
} 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 * (x / (a * 2.0)) tmp = 0 if (x * y) <= -2e+217: tmp = t_1 elif (x * y) <= -1e-53: tmp = (x * y) * (0.5 / a) elif (x * y) <= 5e+67: tmp = -4.5 * (t / (a / z)) 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(y * Float64(x / Float64(a * 2.0))) tmp = 0.0 if (Float64(x * y) <= -2e+217) tmp = t_1; elseif (Float64(x * y) <= -1e-53) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); elseif (Float64(x * y) <= 5e+67) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); 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 * (x / (a * 2.0));
tmp = 0.0;
if ((x * y) <= -2e+217)
tmp = t_1;
elseif ((x * y) <= -1e-53)
tmp = (x * y) * (0.5 / a);
elseif ((x * y) <= 5e+67)
tmp = -4.5 * (t / (a / z));
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[(y * N[(x / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -2e+217], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -1e-53], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+67], N[(-4.5 * N[(t / N[(a / z), $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 := y \cdot \frac{x}{a \cdot 2}\\
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{+217}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-53}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+67}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999992e217 or 4.99999999999999976e67 < (*.f64 x y) Initial program 83.3%
div-inv83.2%
fmm-def83.2%
*-commutative83.2%
distribute-rgt-neg-in83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
*-commutative83.2%
associate-/r*83.2%
metadata-eval83.2%
Applied egg-rr83.2%
Taylor expanded in x around inf 79.5%
clear-num79.5%
un-div-inv79.6%
*-commutative79.6%
div-inv79.6%
metadata-eval79.6%
Applied egg-rr79.6%
associate-/l*86.6%
Simplified86.6%
if -1.99999999999999992e217 < (*.f64 x y) < -1.00000000000000003e-53Initial program 97.8%
div-inv97.7%
fmm-def97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
*-commutative97.7%
associate-/r*97.7%
metadata-eval97.7%
Applied egg-rr97.7%
Taylor expanded in x around inf 74.9%
if -1.00000000000000003e-53 < (*.f64 x y) < 4.99999999999999976e67Initial program 92.3%
Taylor expanded in x around 0 75.2%
associate-/l*74.4%
Simplified74.4%
clear-num74.4%
un-div-inv75.0%
Applied egg-rr75.0%
Final simplification78.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) -2e+217)
(* y (* x (/ 0.5 a)))
(if (<= (* x y) -1e-53)
(* (* x y) (/ 0.5 a))
(if (<= (* x y) 5e+67) (* -4.5 (/ t (/ a z))) (* y (/ x (* 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 tmp;
if ((x * y) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = y * (x / (a * 2.0));
}
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) <= (-2d+217)) then
tmp = y * (x * (0.5d0 / a))
else if ((x * y) <= (-1d-53)) then
tmp = (x * y) * (0.5d0 / a)
else if ((x * y) <= 5d+67) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = y * (x / (a * 2.0d0))
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) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = y * (x / (a * 2.0));
}
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) <= -2e+217: tmp = y * (x * (0.5 / a)) elif (x * y) <= -1e-53: tmp = (x * y) * (0.5 / a) elif (x * y) <= 5e+67: tmp = -4.5 * (t / (a / z)) else: tmp = y * (x / (a * 2.0)) 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) <= -2e+217) tmp = Float64(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= -1e-53) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); elseif (Float64(x * y) <= 5e+67) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(y * Float64(x / 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)
tmp = 0.0;
if ((x * y) <= -2e+217)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= -1e-53)
tmp = (x * y) * (0.5 / a);
elseif ((x * y) <= 5e+67)
tmp = -4.5 * (t / (a / z));
else
tmp = y * (x / (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_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+217], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -1e-53], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+67], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(x / N[(a * 2.0), $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 -2 \cdot 10^{+217}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-53}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+67}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \frac{x}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999992e217Initial program 74.7%
div-inv74.7%
fmm-def74.7%
*-commutative74.7%
distribute-rgt-neg-in74.7%
distribute-rgt-neg-in74.7%
metadata-eval74.7%
*-commutative74.7%
associate-/r*74.7%
metadata-eval74.7%
Applied egg-rr74.7%
Taylor expanded in x around inf 70.2%
associate-*r/70.2%
*-commutative70.2%
associate-*l*70.2%
Applied egg-rr70.2%
associate-/l*95.2%
*-commutative95.2%
*-un-lft-identity95.2%
times-frac95.2%
metadata-eval95.2%
metadata-eval95.2%
times-frac95.2%
*-un-lft-identity95.2%
*-commutative95.2%
*-commutative95.2%
div-inv95.3%
metadata-eval95.3%
div-inv95.3%
clear-num95.3%
Applied egg-rr95.3%
if -1.99999999999999992e217 < (*.f64 x y) < -1.00000000000000003e-53Initial program 97.8%
div-inv97.7%
fmm-def97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
*-commutative97.7%
associate-/r*97.7%
metadata-eval97.7%
Applied egg-rr97.7%
Taylor expanded in x around inf 74.9%
if -1.00000000000000003e-53 < (*.f64 x y) < 4.99999999999999976e67Initial program 92.3%
Taylor expanded in x around 0 75.2%
associate-/l*74.4%
Simplified74.4%
clear-num74.4%
un-div-inv75.0%
Applied egg-rr75.0%
if 4.99999999999999976e67 < (*.f64 x y) Initial program 86.7%
div-inv86.5%
fmm-def86.5%
*-commutative86.5%
distribute-rgt-neg-in86.5%
distribute-rgt-neg-in86.5%
metadata-eval86.5%
*-commutative86.5%
associate-/r*86.5%
metadata-eval86.5%
Applied egg-rr86.5%
Taylor expanded in x around inf 83.2%
clear-num83.2%
un-div-inv83.3%
*-commutative83.3%
div-inv83.3%
metadata-eval83.3%
Applied egg-rr83.3%
associate-/l*83.2%
Simplified83.2%
Final simplification78.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) -2e+217)
(* y (* x (/ 0.5 a)))
(if (<= (* x y) -1e-53)
(* (* x y) (/ 0.5 a))
(if (<= (* x y) 5e+67) (* t (* -4.5 (/ z a))) (* y (/ x (* 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 tmp;
if ((x * y) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = t * (-4.5 * (z / a));
} else {
tmp = y * (x / (a * 2.0));
}
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) <= (-2d+217)) then
tmp = y * (x * (0.5d0 / a))
else if ((x * y) <= (-1d-53)) then
tmp = (x * y) * (0.5d0 / a)
else if ((x * y) <= 5d+67) then
tmp = t * ((-4.5d0) * (z / a))
else
tmp = y * (x / (a * 2.0d0))
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) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = t * (-4.5 * (z / a));
} else {
tmp = y * (x / (a * 2.0));
}
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) <= -2e+217: tmp = y * (x * (0.5 / a)) elif (x * y) <= -1e-53: tmp = (x * y) * (0.5 / a) elif (x * y) <= 5e+67: tmp = t * (-4.5 * (z / a)) else: tmp = y * (x / (a * 2.0)) 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) <= -2e+217) tmp = Float64(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= -1e-53) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); elseif (Float64(x * y) <= 5e+67) tmp = Float64(t * Float64(-4.5 * Float64(z / a))); else tmp = Float64(y * Float64(x / 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)
tmp = 0.0;
if ((x * y) <= -2e+217)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= -1e-53)
tmp = (x * y) * (0.5 / a);
elseif ((x * y) <= 5e+67)
tmp = t * (-4.5 * (z / a));
else
tmp = y * (x / (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_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+217], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -1e-53], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+67], N[(t * N[(-4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(x / N[(a * 2.0), $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 -2 \cdot 10^{+217}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-53}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+67}:\\
\;\;\;\;t \cdot \left(-4.5 \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \frac{x}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999992e217Initial program 74.7%
div-inv74.7%
fmm-def74.7%
*-commutative74.7%
distribute-rgt-neg-in74.7%
distribute-rgt-neg-in74.7%
metadata-eval74.7%
*-commutative74.7%
associate-/r*74.7%
metadata-eval74.7%
Applied egg-rr74.7%
Taylor expanded in x around inf 70.2%
associate-*r/70.2%
*-commutative70.2%
associate-*l*70.2%
Applied egg-rr70.2%
associate-/l*95.2%
*-commutative95.2%
*-un-lft-identity95.2%
times-frac95.2%
metadata-eval95.2%
metadata-eval95.2%
times-frac95.2%
*-un-lft-identity95.2%
*-commutative95.2%
*-commutative95.2%
div-inv95.3%
metadata-eval95.3%
div-inv95.3%
clear-num95.3%
Applied egg-rr95.3%
if -1.99999999999999992e217 < (*.f64 x y) < -1.00000000000000003e-53Initial program 97.8%
div-inv97.7%
fmm-def97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
*-commutative97.7%
associate-/r*97.7%
metadata-eval97.7%
Applied egg-rr97.7%
Taylor expanded in x around inf 74.9%
if -1.00000000000000003e-53 < (*.f64 x y) < 4.99999999999999976e67Initial program 92.3%
Taylor expanded in x around 0 75.2%
*-commutative75.2%
associate-*r*75.2%
Simplified75.2%
associate-*r*75.2%
times-frac75.2%
associate-*r/74.4%
metadata-eval74.4%
*-commutative74.4%
*-commutative74.4%
associate-*r*74.4%
metadata-eval74.4%
times-frac74.4%
*-commutative74.4%
*-commutative74.4%
times-frac74.4%
metadata-eval74.4%
Applied egg-rr74.4%
if 4.99999999999999976e67 < (*.f64 x y) Initial program 86.7%
div-inv86.5%
fmm-def86.5%
*-commutative86.5%
distribute-rgt-neg-in86.5%
distribute-rgt-neg-in86.5%
metadata-eval86.5%
*-commutative86.5%
associate-/r*86.5%
metadata-eval86.5%
Applied egg-rr86.5%
Taylor expanded in x around inf 83.2%
clear-num83.2%
un-div-inv83.3%
*-commutative83.3%
div-inv83.3%
metadata-eval83.3%
Applied egg-rr83.3%
associate-/l*83.2%
Simplified83.2%
Final simplification78.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
(if (<= (* x y) -2e+217)
(* y (* x (/ 0.5 a)))
(if (<= (* x y) -1e-53)
(* (* x y) (/ 0.5 a))
(if (<= (* x y) 5e+67) (/ (* t -4.5) (/ a z)) (* y (/ x (* 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 tmp;
if ((x * y) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = (t * -4.5) / (a / z);
} else {
tmp = y * (x / (a * 2.0));
}
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) <= (-2d+217)) then
tmp = y * (x * (0.5d0 / a))
else if ((x * y) <= (-1d-53)) then
tmp = (x * y) * (0.5d0 / a)
else if ((x * y) <= 5d+67) then
tmp = (t * (-4.5d0)) / (a / z)
else
tmp = y * (x / (a * 2.0d0))
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) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) * (0.5 / a);
} else if ((x * y) <= 5e+67) {
tmp = (t * -4.5) / (a / z);
} else {
tmp = y * (x / (a * 2.0));
}
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) <= -2e+217: tmp = y * (x * (0.5 / a)) elif (x * y) <= -1e-53: tmp = (x * y) * (0.5 / a) elif (x * y) <= 5e+67: tmp = (t * -4.5) / (a / z) else: tmp = y * (x / (a * 2.0)) 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) <= -2e+217) tmp = Float64(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= -1e-53) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); elseif (Float64(x * y) <= 5e+67) tmp = Float64(Float64(t * -4.5) / Float64(a / z)); else tmp = Float64(y * Float64(x / 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)
tmp = 0.0;
if ((x * y) <= -2e+217)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= -1e-53)
tmp = (x * y) * (0.5 / a);
elseif ((x * y) <= 5e+67)
tmp = (t * -4.5) / (a / z);
else
tmp = y * (x / (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_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+217], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -1e-53], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+67], N[(N[(t * -4.5), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision], N[(y * N[(x / N[(a * 2.0), $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 -2 \cdot 10^{+217}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-53}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+67}:\\
\;\;\;\;\frac{t \cdot -4.5}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \frac{x}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999992e217Initial program 74.7%
div-inv74.7%
fmm-def74.7%
*-commutative74.7%
distribute-rgt-neg-in74.7%
distribute-rgt-neg-in74.7%
metadata-eval74.7%
*-commutative74.7%
associate-/r*74.7%
metadata-eval74.7%
Applied egg-rr74.7%
Taylor expanded in x around inf 70.2%
associate-*r/70.2%
*-commutative70.2%
associate-*l*70.2%
Applied egg-rr70.2%
associate-/l*95.2%
*-commutative95.2%
*-un-lft-identity95.2%
times-frac95.2%
metadata-eval95.2%
metadata-eval95.2%
times-frac95.2%
*-un-lft-identity95.2%
*-commutative95.2%
*-commutative95.2%
div-inv95.3%
metadata-eval95.3%
div-inv95.3%
clear-num95.3%
Applied egg-rr95.3%
if -1.99999999999999992e217 < (*.f64 x y) < -1.00000000000000003e-53Initial program 97.8%
div-inv97.7%
fmm-def97.7%
*-commutative97.7%
distribute-rgt-neg-in97.7%
distribute-rgt-neg-in97.7%
metadata-eval97.7%
*-commutative97.7%
associate-/r*97.7%
metadata-eval97.7%
Applied egg-rr97.7%
Taylor expanded in x around inf 74.9%
if -1.00000000000000003e-53 < (*.f64 x y) < 4.99999999999999976e67Initial program 92.3%
Taylor expanded in x around 0 75.2%
associate-/l*74.4%
Simplified74.4%
associate-*r*74.3%
clear-num74.3%
un-div-inv75.0%
*-commutative75.0%
Applied egg-rr75.0%
if 4.99999999999999976e67 < (*.f64 x y) Initial program 86.7%
div-inv86.5%
fmm-def86.5%
*-commutative86.5%
distribute-rgt-neg-in86.5%
distribute-rgt-neg-in86.5%
metadata-eval86.5%
*-commutative86.5%
associate-/r*86.5%
metadata-eval86.5%
Applied egg-rr86.5%
Taylor expanded in x around inf 83.2%
clear-num83.2%
un-div-inv83.3%
*-commutative83.3%
div-inv83.3%
metadata-eval83.3%
Applied egg-rr83.3%
associate-/l*83.2%
Simplified83.2%
Final simplification78.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) -2e+217)
(* y (* x (/ 0.5 a)))
(if (<= (* x y) -1e-53)
(/ (* x y) (* a 2.0))
(if (<= (* x y) 5e+67) (/ (* t -4.5) (/ a z)) (* y (/ x (* 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 tmp;
if ((x * y) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) / (a * 2.0);
} else if ((x * y) <= 5e+67) {
tmp = (t * -4.5) / (a / z);
} else {
tmp = y * (x / (a * 2.0));
}
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) <= (-2d+217)) then
tmp = y * (x * (0.5d0 / a))
else if ((x * y) <= (-1d-53)) then
tmp = (x * y) / (a * 2.0d0)
else if ((x * y) <= 5d+67) then
tmp = (t * (-4.5d0)) / (a / z)
else
tmp = y * (x / (a * 2.0d0))
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) <= -2e+217) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= -1e-53) {
tmp = (x * y) / (a * 2.0);
} else if ((x * y) <= 5e+67) {
tmp = (t * -4.5) / (a / z);
} else {
tmp = y * (x / (a * 2.0));
}
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) <= -2e+217: tmp = y * (x * (0.5 / a)) elif (x * y) <= -1e-53: tmp = (x * y) / (a * 2.0) elif (x * y) <= 5e+67: tmp = (t * -4.5) / (a / z) else: tmp = y * (x / (a * 2.0)) 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) <= -2e+217) tmp = Float64(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= -1e-53) tmp = Float64(Float64(x * y) / Float64(a * 2.0)); elseif (Float64(x * y) <= 5e+67) tmp = Float64(Float64(t * -4.5) / Float64(a / z)); else tmp = Float64(y * Float64(x / 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)
tmp = 0.0;
if ((x * y) <= -2e+217)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= -1e-53)
tmp = (x * y) / (a * 2.0);
elseif ((x * y) <= 5e+67)
tmp = (t * -4.5) / (a / z);
else
tmp = y * (x / (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_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+217], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -1e-53], N[(N[(x * y), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+67], N[(N[(t * -4.5), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision], N[(y * N[(x / N[(a * 2.0), $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 -2 \cdot 10^{+217}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{-53}:\\
\;\;\;\;\frac{x \cdot y}{a \cdot 2}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+67}:\\
\;\;\;\;\frac{t \cdot -4.5}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \frac{x}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999992e217Initial program 74.7%
div-inv74.7%
fmm-def74.7%
*-commutative74.7%
distribute-rgt-neg-in74.7%
distribute-rgt-neg-in74.7%
metadata-eval74.7%
*-commutative74.7%
associate-/r*74.7%
metadata-eval74.7%
Applied egg-rr74.7%
Taylor expanded in x around inf 70.2%
associate-*r/70.2%
*-commutative70.2%
associate-*l*70.2%
Applied egg-rr70.2%
associate-/l*95.2%
*-commutative95.2%
*-un-lft-identity95.2%
times-frac95.2%
metadata-eval95.2%
metadata-eval95.2%
times-frac95.2%
*-un-lft-identity95.2%
*-commutative95.2%
*-commutative95.2%
div-inv95.3%
metadata-eval95.3%
div-inv95.3%
clear-num95.3%
Applied egg-rr95.3%
if -1.99999999999999992e217 < (*.f64 x y) < -1.00000000000000003e-53Initial program 97.8%
Taylor expanded in x around inf 75.0%
if -1.00000000000000003e-53 < (*.f64 x y) < 4.99999999999999976e67Initial program 92.3%
Taylor expanded in x around 0 75.2%
associate-/l*74.4%
Simplified74.4%
associate-*r*74.3%
clear-num74.3%
un-div-inv75.0%
*-commutative75.0%
Applied egg-rr75.0%
if 4.99999999999999976e67 < (*.f64 x y) Initial program 86.7%
div-inv86.5%
fmm-def86.5%
*-commutative86.5%
distribute-rgt-neg-in86.5%
distribute-rgt-neg-in86.5%
metadata-eval86.5%
*-commutative86.5%
associate-/r*86.5%
metadata-eval86.5%
Applied egg-rr86.5%
Taylor expanded in x around inf 83.2%
clear-num83.2%
un-div-inv83.3%
*-commutative83.3%
div-inv83.3%
metadata-eval83.3%
Applied egg-rr83.3%
associate-/l*83.2%
Simplified83.2%
Final simplification78.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
(let* ((t_1 (* x (/ (* y 0.5) a))) (t_2 (* t (* z (/ -4.5 a)))))
(if (<= z -1.35e+173)
t_2
(if (<= z -9.8e+145)
t_1
(if (<= z -185000000000.0)
t_2
(if (<= z 2.8e+64) t_1 (* -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) {
double t_1 = x * ((y * 0.5) / a);
double t_2 = t * (z * (-4.5 / a));
double tmp;
if (z <= -1.35e+173) {
tmp = t_2;
} else if (z <= -9.8e+145) {
tmp = t_1;
} else if (z <= -185000000000.0) {
tmp = t_2;
} else if (z <= 2.8e+64) {
tmp = t_1;
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: t_2
real(8) :: tmp
t_1 = x * ((y * 0.5d0) / a)
t_2 = t * (z * ((-4.5d0) / a))
if (z <= (-1.35d+173)) then
tmp = t_2
else if (z <= (-9.8d+145)) then
tmp = t_1
else if (z <= (-185000000000.0d0)) then
tmp = t_2
else if (z <= 2.8d+64) then
tmp = t_1
else
tmp = (-4.5d0) * (t * (z / 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 t_1 = x * ((y * 0.5) / a);
double t_2 = t * (z * (-4.5 / a));
double tmp;
if (z <= -1.35e+173) {
tmp = t_2;
} else if (z <= -9.8e+145) {
tmp = t_1;
} else if (z <= -185000000000.0) {
tmp = t_2;
} else if (z <= 2.8e+64) {
tmp = t_1;
} else {
tmp = -4.5 * (t * (z / a));
}
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) t_2 = t * (z * (-4.5 / a)) tmp = 0 if z <= -1.35e+173: tmp = t_2 elif z <= -9.8e+145: tmp = t_1 elif z <= -185000000000.0: tmp = t_2 elif z <= 2.8e+64: tmp = t_1 else: tmp = -4.5 * (t * (z / a)) 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)) t_2 = Float64(t * Float64(z * Float64(-4.5 / a))) tmp = 0.0 if (z <= -1.35e+173) tmp = t_2; elseif (z <= -9.8e+145) tmp = t_1; elseif (z <= -185000000000.0) tmp = t_2; elseif (z <= 2.8e+64) tmp = t_1; else tmp = Float64(-4.5 * Float64(t * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = x * ((y * 0.5) / a);
t_2 = t * (z * (-4.5 / a));
tmp = 0.0;
if (z <= -1.35e+173)
tmp = t_2;
elseif (z <= -9.8e+145)
tmp = t_1;
elseif (z <= -185000000000.0)
tmp = t_2;
elseif (z <= 2.8e+64)
tmp = t_1;
else
tmp = -4.5 * (t * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.35e+173], t$95$2, If[LessEqual[z, -9.8e+145], t$95$1, If[LessEqual[z, -185000000000.0], t$95$2, If[LessEqual[z, 2.8e+64], t$95$1, 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])\\
\\
\begin{array}{l}
t_1 := x \cdot \frac{y \cdot 0.5}{a}\\
t_2 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\mathbf{if}\;z \leq -1.35 \cdot 10^{+173}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq -9.8 \cdot 10^{+145}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq -185000000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+64}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if z < -1.3500000000000001e173 or -9.80000000000000006e145 < z < -1.85e11Initial program 90.6%
div-inv90.6%
fmm-def90.6%
*-commutative90.6%
distribute-rgt-neg-in90.6%
distribute-rgt-neg-in90.6%
metadata-eval90.6%
*-commutative90.6%
associate-/r*90.6%
metadata-eval90.6%
Applied egg-rr90.6%
Taylor expanded in x around 0 69.9%
*-commutative69.9%
metadata-eval69.9%
times-frac69.9%
associate-*r*69.9%
associate-/l*74.6%
times-frac74.6%
metadata-eval74.6%
associate-*l/74.6%
associate-/l*74.6%
Simplified74.6%
if -1.3500000000000001e173 < z < -9.80000000000000006e145 or -1.85e11 < z < 2.80000000000000024e64Initial program 92.1%
Taylor expanded in x around inf 65.5%
*-commutative65.5%
associate-/l*64.2%
associate-*r*64.2%
*-commutative64.2%
associate-*r/64.2%
Simplified64.2%
if 2.80000000000000024e64 < z Initial program 84.6%
Taylor expanded in x around 0 54.0%
associate-/l*64.0%
Simplified64.0%
Final simplification66.7%
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 (* t (* z (/ -4.5 a)))))
(if (<= z -1.35e+173)
t_1
(if (<= z -9.8e+145)
(* y (/ x (* a 2.0)))
(if (<= z -480000000000.0)
t_1
(if (<= z 2.8e+64) (* x (/ (* y 0.5) a)) (* -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) {
double t_1 = t * (z * (-4.5 / a));
double tmp;
if (z <= -1.35e+173) {
tmp = t_1;
} else if (z <= -9.8e+145) {
tmp = y * (x / (a * 2.0));
} else if (z <= -480000000000.0) {
tmp = t_1;
} else if (z <= 2.8e+64) {
tmp = x * ((y * 0.5) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 = t * (z * ((-4.5d0) / a))
if (z <= (-1.35d+173)) then
tmp = t_1
else if (z <= (-9.8d+145)) then
tmp = y * (x / (a * 2.0d0))
else if (z <= (-480000000000.0d0)) then
tmp = t_1
else if (z <= 2.8d+64) then
tmp = x * ((y * 0.5d0) / a)
else
tmp = (-4.5d0) * (t * (z / 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 t_1 = t * (z * (-4.5 / a));
double tmp;
if (z <= -1.35e+173) {
tmp = t_1;
} else if (z <= -9.8e+145) {
tmp = y * (x / (a * 2.0));
} else if (z <= -480000000000.0) {
tmp = t_1;
} else if (z <= 2.8e+64) {
tmp = x * ((y * 0.5) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * (z * (-4.5 / a)) tmp = 0 if z <= -1.35e+173: tmp = t_1 elif z <= -9.8e+145: tmp = y * (x / (a * 2.0)) elif z <= -480000000000.0: tmp = t_1 elif z <= 2.8e+64: tmp = x * ((y * 0.5) / a) else: tmp = -4.5 * (t * (z / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(z * Float64(-4.5 / a))) tmp = 0.0 if (z <= -1.35e+173) tmp = t_1; elseif (z <= -9.8e+145) tmp = Float64(y * Float64(x / Float64(a * 2.0))); elseif (z <= -480000000000.0) tmp = t_1; elseif (z <= 2.8e+64) tmp = Float64(x * Float64(Float64(y * 0.5) / a)); else tmp = Float64(-4.5 * Float64(t * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * (z * (-4.5 / a));
tmp = 0.0;
if (z <= -1.35e+173)
tmp = t_1;
elseif (z <= -9.8e+145)
tmp = y * (x / (a * 2.0));
elseif (z <= -480000000000.0)
tmp = t_1;
elseif (z <= 2.8e+64)
tmp = x * ((y * 0.5) / a);
else
tmp = -4.5 * (t * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.35e+173], t$95$1, If[LessEqual[z, -9.8e+145], N[(y * N[(x / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -480000000000.0], t$95$1, If[LessEqual[z, 2.8e+64], N[(x * N[(N[(y * 0.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\mathbf{if}\;z \leq -1.35 \cdot 10^{+173}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq -9.8 \cdot 10^{+145}:\\
\;\;\;\;y \cdot \frac{x}{a \cdot 2}\\
\mathbf{elif}\;z \leq -480000000000:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+64}:\\
\;\;\;\;x \cdot \frac{y \cdot 0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if z < -1.3500000000000001e173 or -9.80000000000000006e145 < z < -4.8e11Initial program 90.6%
div-inv90.6%
fmm-def90.6%
*-commutative90.6%
distribute-rgt-neg-in90.6%
distribute-rgt-neg-in90.6%
metadata-eval90.6%
*-commutative90.6%
associate-/r*90.6%
metadata-eval90.6%
Applied egg-rr90.6%
Taylor expanded in x around 0 69.9%
*-commutative69.9%
metadata-eval69.9%
times-frac69.9%
associate-*r*69.9%
associate-/l*74.6%
times-frac74.6%
metadata-eval74.6%
associate-*l/74.6%
associate-/l*74.6%
Simplified74.6%
if -1.3500000000000001e173 < z < -9.80000000000000006e145Initial program 86.5%
div-inv87.0%
fmm-def87.0%
*-commutative87.0%
distribute-rgt-neg-in87.0%
distribute-rgt-neg-in87.0%
metadata-eval87.0%
*-commutative87.0%
associate-/r*87.0%
metadata-eval87.0%
Applied egg-rr87.0%
Taylor expanded in x around inf 58.7%
clear-num58.7%
un-div-inv58.7%
*-commutative58.7%
div-inv58.7%
metadata-eval58.7%
Applied egg-rr58.7%
associate-/l*58.7%
Simplified58.7%
if -4.8e11 < z < 2.80000000000000024e64Initial program 92.3%
Taylor expanded in x around inf 65.8%
*-commutative65.8%
associate-/l*64.4%
associate-*r*64.4%
*-commutative64.4%
associate-*r/64.4%
Simplified64.4%
if 2.80000000000000024e64 < z Initial program 84.6%
Taylor expanded in x around 0 54.0%
associate-/l*64.0%
Simplified64.0%
Final simplification66.7%
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))
(* y (* x (/ 0.5 a)))
(if (<= (* x y) 5e+274)
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0))
(* y (/ x (* 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 tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= 5e+274) {
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
} else {
tmp = y * (x / (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 tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = y * (x * (0.5 / a));
} else if ((x * y) <= 5e+274) {
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
} else {
tmp = y * (x / (a * 2.0));
}
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 = y * (x * (0.5 / a)) elif (x * y) <= 5e+274: tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0) else: tmp = y * (x / (a * 2.0)) 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(y * Float64(x * Float64(0.5 / a))); elseif (Float64(x * y) <= 5e+274) tmp = Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)); else tmp = Float64(y * Float64(x / 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)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = y * (x * (0.5 / a));
elseif ((x * y) <= 5e+274)
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
else
tmp = y * (x / (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_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+274], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(y * N[(x / N[(a * 2.0), $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 -\infty:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \frac{x}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 65.3%
div-inv65.3%
fmm-def65.3%
*-commutative65.3%
distribute-rgt-neg-in65.3%
distribute-rgt-neg-in65.3%
metadata-eval65.3%
*-commutative65.3%
associate-/r*65.3%
metadata-eval65.3%
Applied egg-rr65.3%
Taylor expanded in x around inf 65.3%
associate-*r/65.3%
*-commutative65.3%
associate-*l*65.3%
Applied egg-rr65.3%
associate-/l*99.8%
*-commutative99.8%
*-un-lft-identity99.8%
times-frac99.8%
metadata-eval99.8%
metadata-eval99.8%
times-frac99.8%
*-un-lft-identity99.8%
*-commutative99.8%
*-commutative99.8%
div-inv99.9%
metadata-eval99.9%
div-inv99.9%
clear-num99.9%
Applied egg-rr99.9%
if -inf.0 < (*.f64 x y) < 4.9999999999999998e274Initial program 94.1%
if 4.9999999999999998e274 < (*.f64 x y) Initial program 74.2%
div-inv74.2%
fmm-def74.2%
*-commutative74.2%
distribute-rgt-neg-in74.2%
distribute-rgt-neg-in74.2%
metadata-eval74.2%
*-commutative74.2%
associate-/r*74.2%
metadata-eval74.2%
Applied egg-rr74.2%
Taylor expanded in x around inf 83.3%
clear-num83.3%
un-div-inv83.3%
*-commutative83.3%
div-inv83.3%
metadata-eval83.3%
Applied egg-rr83.3%
associate-/l*95.6%
Simplified95.6%
Final simplification94.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 (* -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 90.6%
Taylor expanded in x around 0 46.6%
associate-/l*46.9%
Simplified46.9%
Final simplification46.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 (* t (* z (/ -4.5 a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return t * (z * (-4.5 / 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 = t * (z * ((-4.5d0) / 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 t * (z * (-4.5 / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return t * (z * (-4.5 / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(t * Float64(z * Float64(-4.5 / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = t * (z * (-4.5 / 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[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
t \cdot \left(z \cdot \frac{-4.5}{a}\right)
\end{array}
Initial program 90.6%
div-inv90.5%
fmm-def90.5%
*-commutative90.5%
distribute-rgt-neg-in90.5%
distribute-rgt-neg-in90.5%
metadata-eval90.5%
*-commutative90.5%
associate-/r*90.5%
metadata-eval90.5%
Applied egg-rr90.5%
Taylor expanded in x around 0 46.6%
*-commutative46.6%
metadata-eval46.6%
times-frac46.6%
associate-*r*46.6%
associate-/l*47.3%
times-frac47.3%
metadata-eval47.3%
associate-*l/47.3%
associate-/l*47.3%
Simplified47.3%
Final simplification47.3%
(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 2024076
(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)))