
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 -1e+251)
(- (/ (* x (/ y a)) 2.0) (/ (* t 4.5) (/ a z)))
(if (<= t_1 1e+216)
(/ t_1 (* a 2.0))
(fma (/ y (* a 2.0)) x (* (/ (* t 4.5) a) (- 0.0 z)))))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -1e+251) {
tmp = ((x * (y / a)) / 2.0) - ((t * 4.5) / (a / z));
} else if (t_1 <= 1e+216) {
tmp = t_1 / (a * 2.0);
} else {
tmp = fma((y / (a * 2.0)), x, (((t * 4.5) / a) * (0.0 - z)));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= -1e+251) tmp = Float64(Float64(Float64(x * Float64(y / a)) / 2.0) - Float64(Float64(t * 4.5) / Float64(a / z))); elseif (t_1 <= 1e+216) tmp = Float64(t_1 / Float64(a * 2.0)); else tmp = fma(Float64(y / Float64(a * 2.0)), x, Float64(Float64(Float64(t * 4.5) / a) * Float64(0.0 - z))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+251], N[(N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - N[(N[(t * 4.5), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+216], N[(t$95$1 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * x + N[(N[(N[(t * 4.5), $MachinePrecision] / a), $MachinePrecision] * N[(0.0 - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+251}:\\
\;\;\;\;\frac{x \cdot \frac{y}{a}}{2} - \frac{t \cdot 4.5}{\frac{a}{z}}\\
\mathbf{elif}\;t\_1 \leq 10^{+216}:\\
\;\;\;\;\frac{t\_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a \cdot 2}, x, \frac{t \cdot 4.5}{a} \cdot \left(0 - z\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e251Initial program 74.4%
div-subN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
metadata-eval78.4%
Applied egg-rr78.4%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.0%
Applied egg-rr95.0%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6494.9%
Applied egg-rr94.9%
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r/N/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6497.3%
Applied egg-rr97.3%
if -1e251 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1e216Initial program 98.6%
if 1e216 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 73.5%
div-subN/A
sub-negN/A
associate-/l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
--lowering--.f64N/A
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
metadata-eval93.4%
Applied egg-rr93.4%
Final simplification97.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (/ (* x (/ y a)) 2.0) (/ (* t 4.5) (/ a z))))
(t_2 (- (* x y) (* (* z 9.0) t))))
(if (<= t_2 -1e+251) t_1 (if (<= t_2 1e+275) (/ t_2 (* a 2.0)) t_1))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = ((x * (y / a)) / 2.0) - ((t * 4.5) / (a / z));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -1e+251) {
tmp = t_1;
} else if (t_2 <= 1e+275) {
tmp = t_2 / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = ((x * (y / a)) / 2.0d0) - ((t * 4.5d0) / (a / z))
t_2 = (x * y) - ((z * 9.0d0) * t)
if (t_2 <= (-1d+251)) then
tmp = t_1
else if (t_2 <= 1d+275) then
tmp = t_2 / (a * 2.0d0)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = ((x * (y / a)) / 2.0) - ((t * 4.5) / (a / z));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -1e+251) {
tmp = t_1;
} else if (t_2 <= 1e+275) {
tmp = t_2 / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = ((x * (y / a)) / 2.0) - ((t * 4.5) / (a / z)) t_2 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_2 <= -1e+251: tmp = t_1 elif t_2 <= 1e+275: tmp = t_2 / (a * 2.0) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(Float64(x * Float64(y / a)) / 2.0) - Float64(Float64(t * 4.5) / Float64(a / z))) t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_2 <= -1e+251) tmp = t_1; elseif (t_2 <= 1e+275) tmp = Float64(t_2 / Float64(a * 2.0)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = ((x * (y / a)) / 2.0) - ((t * 4.5) / (a / z));
t_2 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_2 <= -1e+251)
tmp = t_1;
elseif (t_2 <= 1e+275)
tmp = t_2 / (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.
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[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - N[(N[(t * 4.5), $MachinePrecision] / N[(a / z), $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, -1e+251], t$95$1, If[LessEqual[t$95$2, 1e+275], N[(t$95$2 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \frac{x \cdot \frac{y}{a}}{2} - \frac{t \cdot 4.5}{\frac{a}{z}}\\
t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+251}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{+275}:\\
\;\;\;\;\frac{t\_2}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e251 or 9.9999999999999996e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 70.2%
div-subN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
metadata-eval78.5%
Applied egg-rr78.5%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6492.0%
Applied egg-rr92.0%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6493.3%
Applied egg-rr93.3%
*-commutativeN/A
div-invN/A
associate-*l*N/A
associate-/r/N/A
div-invN/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6494.6%
Applied egg-rr94.6%
if -1e251 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999996e274Initial program 98.7%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 -1e+251)
(- (/ x (/ 2.0 (/ y a))) (/ z (/ a (* t 4.5))))
(if (<= t_1 1e+275)
(/ t_1 (* a 2.0))
(- (* x (/ y (/ a 0.5))) (* z (/ (* t 4.5) a)))))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -1e+251) {
tmp = (x / (2.0 / (y / a))) - (z / (a / (t * 4.5)));
} else if (t_1 <= 1e+275) {
tmp = t_1 / (a * 2.0);
} else {
tmp = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = (x * y) - ((z * 9.0d0) * t)
if (t_1 <= (-1d+251)) then
tmp = (x / (2.0d0 / (y / a))) - (z / (a / (t * 4.5d0)))
else if (t_1 <= 1d+275) then
tmp = t_1 / (a * 2.0d0)
else
tmp = (x * (y / (a / 0.5d0))) - (z * ((t * 4.5d0) / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -1e+251) {
tmp = (x / (2.0 / (y / a))) - (z / (a / (t * 4.5)));
} else if (t_1 <= 1e+275) {
tmp = t_1 / (a * 2.0);
} else {
tmp = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_1 <= -1e+251: tmp = (x / (2.0 / (y / a))) - (z / (a / (t * 4.5))) elif t_1 <= 1e+275: tmp = t_1 / (a * 2.0) else: tmp = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= -1e+251) tmp = Float64(Float64(x / Float64(2.0 / Float64(y / a))) - Float64(z / Float64(a / Float64(t * 4.5)))); elseif (t_1 <= 1e+275) tmp = Float64(t_1 / Float64(a * 2.0)); else tmp = Float64(Float64(x * Float64(y / Float64(a / 0.5))) - Float64(z * Float64(Float64(t * 4.5) / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_1 <= -1e+251)
tmp = (x / (2.0 / (y / a))) - (z / (a / (t * 4.5)));
elseif (t_1 <= 1e+275)
tmp = t_1 / (a * 2.0);
else
tmp = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+251], N[(N[(x / N[(2.0 / N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(z / N[(a / N[(t * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+275], N[(t$95$1 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(y / N[(a / 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(z * N[(N[(t * 4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+251}:\\
\;\;\;\;\frac{x}{\frac{2}{\frac{y}{a}}} - \frac{z}{\frac{a}{t \cdot 4.5}}\\
\mathbf{elif}\;t\_1 \leq 10^{+275}:\\
\;\;\;\;\frac{t\_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y}{\frac{a}{0.5}} - z \cdot \frac{t \cdot 4.5}{a}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e251Initial program 74.4%
div-subN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
metadata-eval78.4%
Applied egg-rr78.4%
times-fracN/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6495.0%
Applied egg-rr95.0%
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6494.9%
Applied egg-rr94.9%
--lowering--.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6497.3%
Applied egg-rr97.3%
if -1e251 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999996e274Initial program 98.7%
if 9.9999999999999996e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 65.6%
div-subN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
metadata-eval78.5%
Applied egg-rr78.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6491.5%
Applied egg-rr91.5%
Final simplification97.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x (/ y (/ a 0.5))) (* z (/ (* t 4.5) a))))
(t_2 (- (* x y) (* (* z 9.0) t))))
(if (<= t_2 -1e+251) t_1 (if (<= t_2 1e+275) (/ t_2 (* a 2.0)) t_1))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -1e+251) {
tmp = t_1;
} else if (t_2 <= 1e+275) {
tmp = t_2 / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (x * (y / (a / 0.5d0))) - (z * ((t * 4.5d0) / a))
t_2 = (x * y) - ((z * 9.0d0) * t)
if (t_2 <= (-1d+251)) then
tmp = t_1
else if (t_2 <= 1d+275) then
tmp = t_2 / (a * 2.0d0)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -1e+251) {
tmp = t_1;
} else if (t_2 <= 1e+275) {
tmp = t_2 / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a)) t_2 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_2 <= -1e+251: tmp = t_1 elif t_2 <= 1e+275: tmp = t_2 / (a * 2.0) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * Float64(y / Float64(a / 0.5))) - Float64(z * Float64(Float64(t * 4.5) / a))) t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_2 <= -1e+251) tmp = t_1; elseif (t_2 <= 1e+275) tmp = Float64(t_2 / Float64(a * 2.0)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * (y / (a / 0.5))) - (z * ((t * 4.5) / a));
t_2 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_2 <= -1e+251)
tmp = t_1;
elseif (t_2 <= 1e+275)
tmp = t_2 / (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.
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 * N[(y / N[(a / 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(z * N[(N[(t * 4.5), $MachinePrecision] / a), $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, -1e+251], t$95$1, If[LessEqual[t$95$2, 1e+275], N[(t$95$2 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot \frac{y}{\frac{a}{0.5}} - z \cdot \frac{t \cdot 4.5}{a}\\
t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+251}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{+275}:\\
\;\;\;\;\frac{t\_2}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -1e251 or 9.9999999999999996e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 70.2%
div-subN/A
--lowering--.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
metadata-eval78.5%
Applied egg-rr78.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6493.3%
Applied egg-rr93.3%
if -1e251 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 9.9999999999999996e274Initial program 98.7%
Final simplification97.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (/ (/ y (/ a x)) 2.0)))
(if (<= (* x y) -5e-95)
t_1
(if (<= (* x y) 5e+64) (* (* z t) (/ -4.5 a)) t_1))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y / (a / x)) / 2.0;
double tmp;
if ((x * y) <= -5e-95) {
tmp = t_1;
} else if ((x * y) <= 5e+64) {
tmp = (z * t) * (-4.5 / a);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = (y / (a / x)) / 2.0d0
if ((x * y) <= (-5d-95)) then
tmp = t_1
else if ((x * y) <= 5d+64) then
tmp = (z * t) * ((-4.5d0) / a)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (y / (a / x)) / 2.0;
double tmp;
if ((x * y) <= -5e-95) {
tmp = t_1;
} else if ((x * y) <= 5e+64) {
tmp = (z * t) * (-4.5 / a);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (y / (a / x)) / 2.0 tmp = 0 if (x * y) <= -5e-95: tmp = t_1 elif (x * y) <= 5e+64: tmp = (z * t) * (-4.5 / a) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y / Float64(a / x)) / 2.0) tmp = 0.0 if (Float64(x * y) <= -5e-95) tmp = t_1; elseif (Float64(x * y) <= 5e+64) tmp = Float64(Float64(z * t) * Float64(-4.5 / a)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (y / (a / x)) / 2.0;
tmp = 0.0;
if ((x * y) <= -5e-95)
tmp = t_1;
elseif ((x * y) <= 5e+64)
tmp = (z * t) * (-4.5 / 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.
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 / N[(a / x), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e-95], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 5e+64], N[(N[(z * t), $MachinePrecision] * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{y}{\frac{a}{x}}}{2}\\
\mathbf{if}\;x \cdot y \leq -5 \cdot 10^{-95}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+64}:\\
\;\;\;\;\left(z \cdot t\right) \cdot \frac{-4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 x y) < -4.9999999999999998e-95 or 5e64 < (*.f64 x y) Initial program 85.4%
Taylor expanded in x around inf
*-lowering-*.f6470.6%
Simplified70.6%
associate-/r*N/A
associate-*l/N/A
/-lowering-/.f64N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
/-lowering-/.f64N/A
/-lowering-/.f6474.8%
Applied egg-rr74.8%
if -4.9999999999999998e-95 < (*.f64 x y) < 5e64Initial program 94.9%
Taylor expanded in x around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.6%
Simplified75.6%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6475.6%
Applied egg-rr75.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* y (* x (/ 0.5 a)))))
(if (<= (* x y) -4e-32)
t_1
(if (<= (* x y) 5e+64) (* (* z t) (/ -4.5 a)) t_1))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = y * (x * (0.5 / a));
double tmp;
if ((x * y) <= -4e-32) {
tmp = t_1;
} else if ((x * y) <= 5e+64) {
tmp = (z * t) * (-4.5 / a);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = y * (x * (0.5d0 / a))
if ((x * y) <= (-4d-32)) then
tmp = t_1
else if ((x * y) <= 5d+64) then
tmp = (z * t) * ((-4.5d0) / a)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = y * (x * (0.5 / a));
double tmp;
if ((x * y) <= -4e-32) {
tmp = t_1;
} else if ((x * y) <= 5e+64) {
tmp = (z * t) * (-4.5 / a);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = y * (x * (0.5 / a)) tmp = 0 if (x * y) <= -4e-32: tmp = t_1 elif (x * y) <= 5e+64: tmp = (z * t) * (-4.5 / a) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(y * Float64(x * Float64(0.5 / a))) tmp = 0.0 if (Float64(x * y) <= -4e-32) tmp = t_1; elseif (Float64(x * y) <= 5e+64) tmp = Float64(Float64(z * t) * Float64(-4.5 / a)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = y * (x * (0.5 / a));
tmp = 0.0;
if ((x * y) <= -4e-32)
tmp = t_1;
elseif ((x * y) <= 5e+64)
tmp = (z * t) * (-4.5 / 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.
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[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -4e-32], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 5e+64], N[(N[(z * t), $MachinePrecision] * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{if}\;x \cdot y \leq -4 \cdot 10^{-32}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+64}:\\
\;\;\;\;\left(z \cdot t\right) \cdot \frac{-4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 x y) < -4.00000000000000022e-32 or 5e64 < (*.f64 x y) Initial program 84.8%
Taylor expanded in x around inf
*-lowering-*.f6472.9%
Simplified72.9%
div-invN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
/-lowering-/.f6477.8%
Applied egg-rr77.8%
if -4.00000000000000022e-32 < (*.f64 x y) < 5e64Initial program 94.6%
Taylor expanded in x around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6473.5%
Simplified73.5%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6473.5%
Applied egg-rr73.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) -2e+256) (* x (/ y (* a 2.0))) (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+256) {
tmp = x * (y / (a * 2.0));
} else {
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= (-2d+256)) then
tmp = x * (y / (a * 2.0d0))
else
tmp = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+256) {
tmp = x * (y / (a * 2.0));
} else {
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -2e+256: tmp = x * (y / (a * 2.0)) else: tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -2e+256) tmp = Float64(x * Float64(y / Float64(a * 2.0))); else tmp = Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -2e+256)
tmp = x * (y / (a * 2.0));
else
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+256], N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{+256}:\\
\;\;\;\;x \cdot \frac{y}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -2.0000000000000001e256Initial program 65.6%
Taylor expanded in x around inf
*-lowering-*.f6473.6%
Simplified73.6%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.9%
Applied egg-rr99.9%
if -2.0000000000000001e256 < (*.f64 x y) Initial program 92.9%
Final simplification93.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) -2e+256) (* x (/ y (* a 2.0))) (* (/ 0.5 a) (+ (* x y) (* z (* t -9.0))))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+256) {
tmp = x * (y / (a * 2.0));
} else {
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= (-2d+256)) then
tmp = x * (y / (a * 2.0d0))
else
tmp = (0.5d0 / a) * ((x * y) + (z * (t * (-9.0d0))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e+256) {
tmp = x * (y / (a * 2.0));
} else {
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -2e+256: tmp = x * (y / (a * 2.0)) else: tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0))) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -2e+256) tmp = Float64(x * Float64(y / Float64(a * 2.0))); else tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(z * Float64(t * -9.0)))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -2e+256)
tmp = x * (y / (a * 2.0));
else
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e+256], N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{+256}:\\
\;\;\;\;x \cdot \frac{y}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + z \cdot \left(t \cdot -9\right)\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -2.0000000000000001e256Initial program 65.6%
Taylor expanded in x around inf
*-lowering-*.f6473.6%
Simplified73.6%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.9%
Applied egg-rr99.9%
if -2.0000000000000001e256 < (*.f64 x y) Initial program 92.9%
clear-numN/A
associate-/r/N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/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-eval92.9%
Applied egg-rr92.9%
Final simplification93.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (let* ((t_1 (* (* t -4.5) (/ z a)))) (if (<= z -1.6e+23) t_1 (if (<= z 2.3e-27) (* y (* x (/ 0.5 a))) t_1))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (t * -4.5) * (z / a);
double tmp;
if (z <= -1.6e+23) {
tmp = t_1;
} else if (z <= 2.3e-27) {
tmp = y * (x * (0.5 / a));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = (t * (-4.5d0)) * (z / a)
if (z <= (-1.6d+23)) then
tmp = t_1
else if (z <= 2.3d-27) then
tmp = y * (x * (0.5d0 / a))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (t * -4.5) * (z / a);
double tmp;
if (z <= -1.6e+23) {
tmp = t_1;
} else if (z <= 2.3e-27) {
tmp = y * (x * (0.5 / a));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (t * -4.5) * (z / a) tmp = 0 if z <= -1.6e+23: tmp = t_1 elif z <= 2.3e-27: tmp = y * (x * (0.5 / a)) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(t * -4.5) * Float64(z / a)) tmp = 0.0 if (z <= -1.6e+23) tmp = t_1; elseif (z <= 2.3e-27) tmp = Float64(y * Float64(x * Float64(0.5 / a))); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (t * -4.5) * (z / a);
tmp = 0.0;
if (z <= -1.6e+23)
tmp = t_1;
elseif (z <= 2.3e-27)
tmp = y * (x * (0.5 / 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.
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[(t * -4.5), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.6e+23], t$95$1, If[LessEqual[z, 2.3e-27], N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \left(t \cdot -4.5\right) \cdot \frac{z}{a}\\
\mathbf{if}\;z \leq -1.6 \cdot 10^{+23}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.3 \cdot 10^{-27}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{0.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -1.6e23 or 2.2999999999999999e-27 < z Initial program 89.2%
Taylor expanded in x around 0
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6462.9%
Simplified62.9%
associate-*r*N/A
metadata-evalN/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
/-lowering-/.f6466.8%
Applied egg-rr66.8%
if -1.6e23 < z < 2.2999999999999999e-27Initial program 91.6%
Taylor expanded in x around inf
*-lowering-*.f6466.5%
Simplified66.5%
div-invN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
/-lowering-/.f6468.5%
Applied egg-rr68.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* y (* x (/ 0.5 a))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return y * (x * (0.5 / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = y * (x * (0.5d0 / a))
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return y * (x * (0.5 / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return y * (x * (0.5 / a))
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(y * Float64(x * Float64(0.5 / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = y * (x * (0.5 / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
y \cdot \left(x \cdot \frac{0.5}{a}\right)
\end{array}
Initial program 90.2%
Taylor expanded in x around inf
*-lowering-*.f6449.6%
Simplified49.6%
div-invN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
/-lowering-/.f6450.2%
Applied egg-rr50.2%
(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 2024191
(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)))