
(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 14 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 (* (/ y a) (+ (* -4.5 (* t (/ z y))) (* x 0.5))))
(t_2 (/ (- (* x y) (* t (* z 9.0))) (* a 2.0))))
(if (<= t_2 (- INFINITY))
t_1
(if (<= t_2 5e+303)
(- (/ (/ (* x y) a) 2.0) (/ (* z (* t 4.5)) a))
t_1))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
double t_2 = ((x * y) - (t * (z * 9.0))) / (a * 2.0);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = t_1;
} else if (t_2 <= 5e+303) {
tmp = (((x * y) / a) / 2.0) - ((z * (t * 4.5)) / a);
} else {
tmp = t_1;
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
double t_2 = ((x * y) - (t * (z * 9.0))) / (a * 2.0);
double tmp;
if (t_2 <= -Double.POSITIVE_INFINITY) {
tmp = t_1;
} else if (t_2 <= 5e+303) {
tmp = (((x * y) / a) / 2.0) - ((z * (t * 4.5)) / a);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5)) t_2 = ((x * y) - (t * (z * 9.0))) / (a * 2.0) tmp = 0 if t_2 <= -math.inf: tmp = t_1 elif t_2 <= 5e+303: tmp = (((x * y) / a) / 2.0) - ((z * (t * 4.5)) / a) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y / a) * Float64(Float64(-4.5 * Float64(t * Float64(z / y))) + Float64(x * 0.5))) t_2 = Float64(Float64(Float64(x * y) - Float64(t * Float64(z * 9.0))) / Float64(a * 2.0)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = t_1; elseif (t_2 <= 5e+303) tmp = Float64(Float64(Float64(Float64(x * y) / a) / 2.0) - Float64(Float64(z * Float64(t * 4.5)) / a)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
t_2 = ((x * y) - (t * (z * 9.0))) / (a * 2.0);
tmp = 0.0;
if (t_2 <= -Inf)
tmp = t_1;
elseif (t_2 <= 5e+303)
tmp = (((x * y) / a) / 2.0) - ((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.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y / a), $MachinePrecision] * N[(N[(-4.5 * N[(t * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * y), $MachinePrecision] - N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 5e+303], N[(N[(N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision] / 2.0), $MachinePrecision] - N[(N[(z * N[(t * 4.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \frac{y}{a} \cdot \left(-4.5 \cdot \left(t \cdot \frac{z}{y}\right) + x \cdot 0.5\right)\\
t_2 := \frac{x \cdot y - t \cdot \left(z \cdot 9\right)}{a \cdot 2}\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+303}:\\
\;\;\;\;\frac{\frac{x \cdot y}{a}}{2} - \frac{z \cdot \left(t \cdot 4.5\right)}{a}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64))) < -inf.0 or 4.9999999999999997e303 < (/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64))) Initial program 77.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6477.9%
Simplified77.9%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
fma-defineN/A
associate-*l/N/A
times-fracN/A
*-inversesN/A
*-inversesN/A
times-fracN/A
associate-*l/N/A
fma-defineN/A
associate-*l*N/A
Simplified90.6%
if -inf.0 < (/.f64 (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) (*.f64 a #s(literal 2 binary64))) < 4.9999999999999997e303Initial program 98.8%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6498.2%
Simplified98.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr98.7%
distribute-rgt-inN/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
div-invN/A
associate-*l/N/A
clear-numN/A
div-invN/A
metadata-evalN/A
un-div-invN/A
associate-*r*N/A
*-commutativeN/A
times-fracN/A
*-commutativeN/A
associate-/l*N/A
metadata-evalN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
Applied egg-rr98.8%
Final simplification95.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* 4.5 (- 0.0 (/ z a)))))
(if (<= (* a 2.0) 1e+21)
(/ (- (* x y) (* (* z t) 9.0)) (* a 2.0))
(+ (fma (/ y a) (/ x 2.0) (* t t_1)) (fma t_1 t (* t (* (/ z a) 4.5)))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = 4.5 * (0.0 - (z / a));
double tmp;
if ((a * 2.0) <= 1e+21) {
tmp = ((x * y) - ((z * t) * 9.0)) / (a * 2.0);
} else {
tmp = fma((y / a), (x / 2.0), (t * t_1)) + fma(t_1, t, (t * ((z / a) * 4.5)));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(4.5 * Float64(0.0 - Float64(z / a))) tmp = 0.0 if (Float64(a * 2.0) <= 1e+21) tmp = Float64(Float64(Float64(x * y) - Float64(Float64(z * t) * 9.0)) / Float64(a * 2.0)); else tmp = Float64(fma(Float64(y / a), Float64(x / 2.0), Float64(t * t_1)) + fma(t_1, t, Float64(t * Float64(Float64(z / a) * 4.5)))); 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[(4.5 * N[(0.0 - N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * 2.0), $MachinePrecision], 1e+21], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * t), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x / 2.0), $MachinePrecision] + N[(t * t$95$1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * t + N[(t * N[(N[(z / a), $MachinePrecision] * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := 4.5 \cdot \left(0 - \frac{z}{a}\right)\\
\mathbf{if}\;a \cdot 2 \leq 10^{+21}:\\
\;\;\;\;\frac{x \cdot y - \left(z \cdot t\right) \cdot 9}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, \frac{x}{2}, t \cdot t\_1\right) + \mathsf{fma}\left(t\_1, t, t \cdot \left(\frac{z}{a} \cdot 4.5\right)\right)\\
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 1e21Initial program 92.5%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6492.5%
Applied egg-rr92.5%
if 1e21 < (*.f64 a #s(literal 2 binary64)) Initial program 82.0%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6482.0%
Simplified82.0%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
times-fracN/A
prod-diffN/A
Applied egg-rr95.4%
Final simplification93.0%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* 4.5 (/ t a))) (t_2 (- 0.0 t_1)))
(if (<= (* a 2.0) 2e+35)
(/ (- (* x y) (* (* z t) 9.0)) (* a 2.0))
(+ (fma (/ y a) (/ x 2.0) (* z t_2)) (fma t_2 z (* 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 = 4.5 * (t / a);
double t_2 = 0.0 - t_1;
double tmp;
if ((a * 2.0) <= 2e+35) {
tmp = ((x * y) - ((z * t) * 9.0)) / (a * 2.0);
} else {
tmp = fma((y / a), (x / 2.0), (z * t_2)) + fma(t_2, z, (z * t_1));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(4.5 * Float64(t / a)) t_2 = Float64(0.0 - t_1) tmp = 0.0 if (Float64(a * 2.0) <= 2e+35) tmp = Float64(Float64(Float64(x * y) - Float64(Float64(z * t) * 9.0)) / Float64(a * 2.0)); else tmp = Float64(fma(Float64(y / a), Float64(x / 2.0), Float64(z * t_2)) + fma(t_2, z, Float64(z * t_1))); 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[(4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(0.0 - t$95$1), $MachinePrecision]}, If[LessEqual[N[(a * 2.0), $MachinePrecision], 2e+35], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * t), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x / 2.0), $MachinePrecision] + N[(z * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 * z + N[(z * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := 4.5 \cdot \frac{t}{a}\\
t_2 := 0 - t\_1\\
\mathbf{if}\;a \cdot 2 \leq 2 \cdot 10^{+35}:\\
\;\;\;\;\frac{x \cdot y - \left(z \cdot t\right) \cdot 9}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, \frac{x}{2}, z \cdot t\_2\right) + \mathsf{fma}\left(t\_2, z, z \cdot t\_1\right)\\
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 1.9999999999999999e35Initial program 92.6%
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6492.6%
Applied egg-rr92.6%
if 1.9999999999999999e35 < (*.f64 a #s(literal 2 binary64)) Initial program 80.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6480.5%
Simplified80.5%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
associate-*l*N/A
associate-/l*N/A
*-commutativeN/A
times-fracN/A
prod-diffN/A
Applied egg-rr93.4%
Final simplification92.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 (* (/ y a) (+ (* -4.5 (* t (/ z y))) (* x 0.5))))
(t_2 (- (* x y) (* t (* z 9.0)))))
(if (<= t_2 -5e+272)
t_1
(if (<= t_2 1e+281) (* (/ 0.5 a) (+ (* x y) (* z (* t -9.0)))) t_1))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
double t_2 = (x * y) - (t * (z * 9.0));
double tmp;
if (t_2 <= -5e+272) {
tmp = t_1;
} else if (t_2 <= 1e+281) {
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
} 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) :: t_2
real(8) :: tmp
t_1 = (y / a) * (((-4.5d0) * (t * (z / y))) + (x * 0.5d0))
t_2 = (x * y) - (t * (z * 9.0d0))
if (t_2 <= (-5d+272)) then
tmp = t_1
else if (t_2 <= 1d+281) then
tmp = (0.5d0 / a) * ((x * y) + (z * (t * (-9.0d0))))
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 / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
double t_2 = (x * y) - (t * (z * 9.0));
double tmp;
if (t_2 <= -5e+272) {
tmp = t_1;
} else if (t_2 <= 1e+281) {
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5)) t_2 = (x * y) - (t * (z * 9.0)) tmp = 0 if t_2 <= -5e+272: tmp = t_1 elif t_2 <= 1e+281: tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0))) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y / a) * Float64(Float64(-4.5 * Float64(t * Float64(z / y))) + Float64(x * 0.5))) t_2 = Float64(Float64(x * y) - Float64(t * Float64(z * 9.0))) tmp = 0.0 if (t_2 <= -5e+272) tmp = t_1; elseif (t_2 <= 1e+281) tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(z * Float64(t * -9.0)))); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
t_2 = (x * y) - (t * (z * 9.0));
tmp = 0.0;
if (t_2 <= -5e+272)
tmp = t_1;
elseif (t_2 <= 1e+281)
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y / a), $MachinePrecision] * N[(N[(-4.5 * N[(t * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] - N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+272], t$95$1, If[LessEqual[t$95$2, 1e+281], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $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 := \frac{y}{a} \cdot \left(-4.5 \cdot \left(t \cdot \frac{z}{y}\right) + x \cdot 0.5\right)\\
t_2 := x \cdot y - t \cdot \left(z \cdot 9\right)\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+272}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{+281}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + z \cdot \left(t \cdot -9\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -4.99999999999999973e272 or 1e281 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 68.3%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6468.3%
Simplified68.3%
Taylor expanded in x around inf
distribute-lft-inN/A
*-commutativeN/A
associate-*r*N/A
associate-/l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
fma-defineN/A
associate-*l/N/A
times-fracN/A
*-inversesN/A
*-inversesN/A
times-fracN/A
associate-*l/N/A
fma-defineN/A
associate-*l*N/A
Simplified87.9%
if -4.99999999999999973e272 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1e281Initial program 99.0%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6498.5%
Simplified98.5%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr99.0%
Final simplification95.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* t (* z 9.0))))
(if (<= t_1 (- INFINITY))
(* -4.5 (* z (/ t a)))
(if (<= t_1 4e+185)
(* (/ 0.5 a) (+ (* x y) (* z (* t -9.0))))
(* t (* (/ z a) -4.5))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = -4.5 * (z * (t / a));
} else if (t_1 <= 4e+185) {
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
} else {
tmp = t * ((z / a) * -4.5);
}
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 = t * (z * 9.0);
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = -4.5 * (z * (t / a));
} else if (t_1 <= 4e+185) {
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
} else {
tmp = t * ((z / a) * -4.5);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * (z * 9.0) tmp = 0 if t_1 <= -math.inf: tmp = -4.5 * (z * (t / a)) elif t_1 <= 4e+185: tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0))) else: tmp = t * ((z / a) * -4.5) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(z * 9.0)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t_1 <= 4e+185) tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(z * Float64(t * -9.0)))); else tmp = Float64(t * Float64(Float64(z / a) * -4.5)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * (z * 9.0);
tmp = 0.0;
if (t_1 <= -Inf)
tmp = -4.5 * (z * (t / a));
elseif (t_1 <= 4e+185)
tmp = (0.5 / a) * ((x * y) + (z * (t * -9.0)));
else
tmp = t * ((z / a) * -4.5);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+185], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(z \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+185}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + z \cdot \left(t \cdot -9\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0Initial program 62.0%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6462.0%
Simplified62.0%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.6%
Simplified68.6%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6499.9%
Applied egg-rr99.9%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 3.9999999999999999e185Initial program 94.8%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.3%
Simplified94.3%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr94.7%
if 3.9999999999999999e185 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 72.1%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6472.1%
Simplified72.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.1%
Simplified72.1%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6496.3%
Applied egg-rr96.3%
Final simplification95.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) -2e-14)
(* x (/ (/ y 2.0) a))
(if (<= (* x y) 1e-38)
(/ (* t (* z -9.0)) (* a 2.0))
(/ y (/ a (/ x 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-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = (t * (z * -9.0)) / (a * 2.0);
} else {
tmp = y / (a / (x / 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-14)) then
tmp = x * ((y / 2.0d0) / a)
else if ((x * y) <= 1d-38) then
tmp = (t * (z * (-9.0d0))) / (a * 2.0d0)
else
tmp = y / (a / (x / 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-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = (t * (z * -9.0)) / (a * 2.0);
} else {
tmp = y / (a / (x / 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-14: tmp = x * ((y / 2.0) / a) elif (x * y) <= 1e-38: tmp = (t * (z * -9.0)) / (a * 2.0) else: tmp = y / (a / (x / 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-14) tmp = Float64(x * Float64(Float64(y / 2.0) / a)); elseif (Float64(x * y) <= 1e-38) tmp = Float64(Float64(t * Float64(z * -9.0)) / Float64(a * 2.0)); else tmp = Float64(y / Float64(a / Float64(x / 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-14)
tmp = x * ((y / 2.0) / a);
elseif ((x * y) <= 1e-38)
tmp = (t * (z * -9.0)) / (a * 2.0);
else
tmp = y / (a / (x / 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-14], N[(x * N[(N[(y / 2.0), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-38], N[(N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(y / N[(a / N[(x / 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^{-14}:\\
\;\;\;\;x \cdot \frac{\frac{y}{2}}{a}\\
\mathbf{elif}\;x \cdot y \leq 10^{-38}:\\
\;\;\;\;\frac{t \cdot \left(z \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{\frac{a}{\frac{x}{2}}}\\
\end{array}
\end{array}
if (*.f64 x y) < -2e-14Initial program 87.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr87.5%
Taylor expanded in x around inf
*-lowering-*.f6471.8%
Simplified71.8%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/r/N/A
*-rgt-identityN/A
times-fracN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6471.7%
Applied egg-rr71.7%
if -2e-14 < (*.f64 x y) < 9.9999999999999996e-39Initial program 94.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.7%
Simplified94.7%
Taylor expanded in x around 0
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6475.0%
Simplified75.0%
if 9.9999999999999996e-39 < (*.f64 x y) Initial program 86.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr86.1%
Taylor expanded in x around inf
*-lowering-*.f6472.0%
Simplified72.0%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/l/N/A
/-lowering-/.f64N/A
remove-double-divN/A
un-div-invN/A
/-lowering-/.f64N/A
clear-numN/A
/-lowering-/.f6472.9%
Applied egg-rr72.9%
Final simplification73.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-14) (* x (/ (/ y 2.0) a)) (if (<= (* x y) 1e-38) (/ (* (* z t) -4.5) a) (/ y (/ a (/ x 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-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = ((z * t) * -4.5) / a;
} else {
tmp = y / (a / (x / 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-14)) then
tmp = x * ((y / 2.0d0) / a)
else if ((x * y) <= 1d-38) then
tmp = ((z * t) * (-4.5d0)) / a
else
tmp = y / (a / (x / 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-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = ((z * t) * -4.5) / a;
} else {
tmp = y / (a / (x / 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-14: tmp = x * ((y / 2.0) / a) elif (x * y) <= 1e-38: tmp = ((z * t) * -4.5) / a else: tmp = y / (a / (x / 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-14) tmp = Float64(x * Float64(Float64(y / 2.0) / a)); elseif (Float64(x * y) <= 1e-38) tmp = Float64(Float64(Float64(z * t) * -4.5) / a); else tmp = Float64(y / Float64(a / Float64(x / 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-14)
tmp = x * ((y / 2.0) / a);
elseif ((x * y) <= 1e-38)
tmp = ((z * t) * -4.5) / a;
else
tmp = y / (a / (x / 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-14], N[(x * N[(N[(y / 2.0), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-38], N[(N[(N[(z * t), $MachinePrecision] * -4.5), $MachinePrecision] / a), $MachinePrecision], N[(y / N[(a / N[(x / 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^{-14}:\\
\;\;\;\;x \cdot \frac{\frac{y}{2}}{a}\\
\mathbf{elif}\;x \cdot y \leq 10^{-38}:\\
\;\;\;\;\frac{\left(z \cdot t\right) \cdot -4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{\frac{a}{\frac{x}{2}}}\\
\end{array}
\end{array}
if (*.f64 x y) < -2e-14Initial program 87.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr87.5%
Taylor expanded in x around inf
*-lowering-*.f6471.8%
Simplified71.8%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/r/N/A
*-rgt-identityN/A
times-fracN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6471.7%
Applied egg-rr71.7%
if -2e-14 < (*.f64 x y) < 9.9999999999999996e-39Initial program 94.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.7%
Simplified94.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.0%
Simplified75.0%
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6475.0%
Applied egg-rr75.0%
if 9.9999999999999996e-39 < (*.f64 x y) Initial program 86.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr86.1%
Taylor expanded in x around inf
*-lowering-*.f6472.0%
Simplified72.0%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/l/N/A
/-lowering-/.f64N/A
remove-double-divN/A
un-div-invN/A
/-lowering-/.f64N/A
clear-numN/A
/-lowering-/.f6472.9%
Applied egg-rr72.9%
Final simplification73.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-14) (* x (/ (/ y 2.0) a)) (if (<= (* x y) 1e-38) (* -4.5 (/ (* z t) a)) (/ y (/ a (/ x 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-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = y / (a / (x / 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-14)) then
tmp = x * ((y / 2.0d0) / a)
else if ((x * y) <= 1d-38) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = y / (a / (x / 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-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = y / (a / (x / 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-14: tmp = x * ((y / 2.0) / a) elif (x * y) <= 1e-38: tmp = -4.5 * ((z * t) / a) else: tmp = y / (a / (x / 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-14) tmp = Float64(x * Float64(Float64(y / 2.0) / a)); elseif (Float64(x * y) <= 1e-38) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(y / Float64(a / Float64(x / 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-14)
tmp = x * ((y / 2.0) / a);
elseif ((x * y) <= 1e-38)
tmp = -4.5 * ((z * t) / a);
else
tmp = y / (a / (x / 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-14], N[(x * N[(N[(y / 2.0), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-38], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(y / N[(a / N[(x / 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^{-14}:\\
\;\;\;\;x \cdot \frac{\frac{y}{2}}{a}\\
\mathbf{elif}\;x \cdot y \leq 10^{-38}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{\frac{a}{\frac{x}{2}}}\\
\end{array}
\end{array}
if (*.f64 x y) < -2e-14Initial program 87.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr87.5%
Taylor expanded in x around inf
*-lowering-*.f6471.8%
Simplified71.8%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/r/N/A
*-rgt-identityN/A
times-fracN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6471.7%
Applied egg-rr71.7%
if -2e-14 < (*.f64 x y) < 9.9999999999999996e-39Initial program 94.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.7%
Simplified94.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.0%
Simplified75.0%
if 9.9999999999999996e-39 < (*.f64 x y) Initial program 86.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr86.1%
Taylor expanded in x around inf
*-lowering-*.f6472.0%
Simplified72.0%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/l/N/A
/-lowering-/.f64N/A
remove-double-divN/A
un-div-invN/A
/-lowering-/.f64N/A
clear-numN/A
/-lowering-/.f6472.9%
Applied egg-rr72.9%
Final simplification73.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-14) (* x (/ (/ y 2.0) a)) (if (<= (* x y) 1e-38) (* -4.5 (/ (* z t) a)) (* 0.5 (* y (/ x a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (y * (x / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= (-2d-14)) then
tmp = x * ((y / 2.0d0) / a)
else if ((x * y) <= 1d-38) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 * (y * (x / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e-14) {
tmp = x * ((y / 2.0) / a);
} else if ((x * y) <= 1e-38) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (y * (x / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -2e-14: tmp = x * ((y / 2.0) / a) elif (x * y) <= 1e-38: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 * (y * (x / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -2e-14) tmp = Float64(x * Float64(Float64(y / 2.0) / a)); elseif (Float64(x * y) <= 1e-38) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 * Float64(y * Float64(x / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -2e-14)
tmp = x * ((y / 2.0) / a);
elseif ((x * y) <= 1e-38)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 * (y * (x / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e-14], N[(x * N[(N[(y / 2.0), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-38], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{-14}:\\
\;\;\;\;x \cdot \frac{\frac{y}{2}}{a}\\
\mathbf{elif}\;x \cdot y \leq 10^{-38}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -2e-14Initial program 87.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr87.5%
Taylor expanded in x around inf
*-lowering-*.f6471.8%
Simplified71.8%
associate-*r*N/A
*-commutativeN/A
associate-*l/N/A
metadata-evalN/A
associate-/r/N/A
associate-/l*N/A
div-invN/A
associate-/r/N/A
*-rgt-identityN/A
times-fracN/A
/-rgt-identityN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f6471.7%
Applied egg-rr71.7%
if -2e-14 < (*.f64 x y) < 9.9999999999999996e-39Initial program 94.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.7%
Simplified94.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.0%
Simplified75.0%
if 9.9999999999999996e-39 < (*.f64 x y) Initial program 86.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6472.8%
Simplified72.8%
Final simplification73.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-14) (* x (* y (/ 0.5 a))) (if (<= (* x y) 1e-38) (* -4.5 (/ (* z t) a)) (* 0.5 (* y (/ x a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e-14) {
tmp = x * (y * (0.5 / a));
} else if ((x * y) <= 1e-38) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (y * (x / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= (-2d-14)) then
tmp = x * (y * (0.5d0 / a))
else if ((x * y) <= 1d-38) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 * (y * (x / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -2e-14) {
tmp = x * (y * (0.5 / a));
} else if ((x * y) <= 1e-38) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (y * (x / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -2e-14: tmp = x * (y * (0.5 / a)) elif (x * y) <= 1e-38: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 * (y * (x / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -2e-14) tmp = Float64(x * Float64(y * Float64(0.5 / a))); elseif (Float64(x * y) <= 1e-38) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 * Float64(y * Float64(x / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -2e-14)
tmp = x * (y * (0.5 / a));
elseif ((x * y) <= 1e-38)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 * (y * (x / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -2e-14], N[(x * N[(y * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-38], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -2 \cdot 10^{-14}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{0.5}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 10^{-38}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -2e-14Initial program 87.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
div-subN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
metadata-evalN/A
Applied egg-rr87.5%
Taylor expanded in x around inf
*-lowering-*.f6471.8%
Simplified71.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6471.7%
Applied egg-rr71.7%
if -2e-14 < (*.f64 x y) < 9.9999999999999996e-39Initial program 94.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6494.7%
Simplified94.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6475.0%
Simplified75.0%
if 9.9999999999999996e-39 < (*.f64 x y) Initial program 86.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6486.2%
Simplified86.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6472.8%
Simplified72.8%
Final simplification73.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (let* ((t_1 (* t (* (/ z a) -4.5)))) (if (<= t -0.0002) t_1 (if (<= t 3e-12) (* 0.5 (* y (/ x a))) t_1))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = t * ((z / a) * -4.5);
double tmp;
if (t <= -0.0002) {
tmp = t_1;
} else if (t <= 3e-12) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = t * ((z / a) * (-4.5d0))
if (t <= (-0.0002d0)) then
tmp = t_1
else if (t <= 3d-12) then
tmp = 0.5d0 * (y * (x / a))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = t * ((z / a) * -4.5);
double tmp;
if (t <= -0.0002) {
tmp = t_1;
} else if (t <= 3e-12) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * ((z / a) * -4.5) tmp = 0 if t <= -0.0002: tmp = t_1 elif t <= 3e-12: tmp = 0.5 * (y * (x / a)) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(Float64(z / a) * -4.5)) tmp = 0.0 if (t <= -0.0002) tmp = t_1; elseif (t <= 3e-12) tmp = Float64(0.5 * Float64(y * Float64(x / a))); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * ((z / a) * -4.5);
tmp = 0.0;
if (t <= -0.0002)
tmp = t_1;
elseif (t <= 3e-12)
tmp = 0.5 * (y * (x / a));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -0.0002], t$95$1, If[LessEqual[t, 3e-12], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{if}\;t \leq -0.0002:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 3 \cdot 10^{-12}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -2.0000000000000001e-4 or 3.0000000000000001e-12 < t Initial program 83.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6482.8%
Simplified82.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.4%
Simplified56.4%
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6463.4%
Applied egg-rr63.4%
if -2.0000000000000001e-4 < t < 3.0000000000000001e-12Initial program 96.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6496.2%
Simplified96.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6464.2%
Simplified64.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (let* ((t_1 (* -4.5 (* z (/ t a))))) (if (<= t -2.8e-5) t_1 (if (<= t 1e-11) (* 0.5 (* y (/ x a))) t_1))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = -4.5 * (z * (t / a));
double tmp;
if (t <= -2.8e-5) {
tmp = t_1;
} else if (t <= 1e-11) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.5d0) * (z * (t / a))
if (t <= (-2.8d-5)) then
tmp = t_1
else if (t <= 1d-11) then
tmp = 0.5d0 * (y * (x / a))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = -4.5 * (z * (t / a));
double tmp;
if (t <= -2.8e-5) {
tmp = t_1;
} else if (t <= 1e-11) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = -4.5 * (z * (t / a)) tmp = 0 if t <= -2.8e-5: tmp = t_1 elif t <= 1e-11: tmp = 0.5 * (y * (x / a)) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(-4.5 * Float64(z * Float64(t / a))) tmp = 0.0 if (t <= -2.8e-5) tmp = t_1; elseif (t <= 1e-11) tmp = Float64(0.5 * Float64(y * Float64(x / a))); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = -4.5 * (z * (t / a));
tmp = 0.0;
if (t <= -2.8e-5)
tmp = t_1;
elseif (t <= 1e-11)
tmp = 0.5 * (y * (x / a));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.8e-5], t$95$1, If[LessEqual[t, 1e-11], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := -4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{if}\;t \leq -2.8 \cdot 10^{-5}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 10^{-11}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -2.79999999999999996e-5 or 9.99999999999999939e-12 < t Initial program 83.7%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6482.8%
Simplified82.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6456.4%
Simplified56.4%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6465.1%
Applied egg-rr65.1%
if -2.79999999999999996e-5 < t < 9.99999999999999939e-12Initial program 96.2%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6496.2%
Simplified96.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6464.2%
Simplified64.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= a 1.1e+35) (* -4.5 (/ (* z t) a)) (* -4.5 (* z (/ t a)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a <= 1.1e+35) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (a <= 1.1d+35) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a <= 1.1e+35) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if a <= 1.1e+35: tmp = -4.5 * ((z * t) / a) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (a <= 1.1e+35) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(-4.5 * Float64(z * 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)
tmp = 0.0;
if (a <= 1.1e+35)
tmp = -4.5 * ((z * t) / a);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[a, 1.1e+35], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq 1.1 \cdot 10^{+35}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if a < 1.0999999999999999e35Initial program 92.6%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.1%
Simplified92.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6447.1%
Simplified47.1%
if 1.0999999999999999e35 < a Initial program 80.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6480.5%
Simplified80.5%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6442.9%
Simplified42.9%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6447.0%
Applied egg-rr47.0%
Final simplification47.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = (-4.5d0) * (z * (t / a))
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 90.5%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6490.1%
Simplified90.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6446.3%
Simplified46.3%
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6449.6%
Applied egg-rr49.6%
(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 2024150
(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)))