
(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.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (/ (* x (/ y a)) 2.0) (* t (* (/ z a) 4.5))))
(t_2 (- (* x y) (* (* z 9.0) t))))
(if (<= t_2 -5e+302)
t_1
(if (<= t_2 1.5e+291) (/ (+ (* x y) (* z (* t -9.0))) (* a 2.0)) t_1))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = ((x * (y / a)) / 2.0) - (t * ((z / a) * 4.5));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -5e+302) {
tmp = t_1;
} else if (t_2 <= 1.5e+291) {
tmp = ((x * y) + (z * (t * -9.0))) / (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.
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 * ((z / a) * 4.5d0))
t_2 = (x * y) - ((z * 9.0d0) * t)
if (t_2 <= (-5d+302)) then
tmp = t_1
else if (t_2 <= 1.5d+291) then
tmp = ((x * y) + (z * (t * (-9.0d0)))) / (a * 2.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 = ((x * (y / a)) / 2.0) - (t * ((z / a) * 4.5));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -5e+302) {
tmp = t_1;
} else if (t_2 <= 1.5e+291) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = ((x * (y / a)) / 2.0) - (t * ((z / a) * 4.5)) t_2 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_2 <= -5e+302: tmp = t_1 elif t_2 <= 1.5e+291: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(Float64(x * Float64(y / a)) / 2.0) - Float64(t * Float64(Float64(z / a) * 4.5))) t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_2 <= -5e+302) tmp = t_1; elseif (t_2 <= 1.5e+291) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = ((x * (y / a)) / 2.0) - (t * ((z / a) * 4.5));
t_2 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_2 <= -5e+302)
tmp = t_1;
elseif (t_2 <= 1.5e+291)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - N[(t * N[(N[(z / a), $MachinePrecision] * 4.5), $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, -5e+302], t$95$1, If[LessEqual[t$95$2, 1.5e+291], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \frac{x \cdot \frac{y}{a}}{2} - t \cdot \left(\frac{z}{a} \cdot 4.5\right)\\
t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+302}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 1.5 \cdot 10^{+291}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -5e302 or 1.50000000000000008e291 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.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-*.f6467.1%
Simplified67.1%
frac-2negN/A
distribute-neg-inN/A
unsub-negN/A
sub-divN/A
frac-2negN/A
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
distribute-rgt-neg-inN/A
distribute-lft-neg-inN/A
frac-2negN/A
--lowering--.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr77.5%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6493.2%
Applied egg-rr93.2%
if -5e302 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.50000000000000008e291Initial program 99.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-*.f6499.5%
Simplified99.5%
Final simplification98.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 (- (* y (* x (/ 0.5 a))) (* t (* (/ z a) 4.5))))
(t_2 (- (* x y) (* (* z 9.0) t))))
(if (<= t_2 -5e+302)
t_1
(if (<= t_2 2e+291) (/ (+ (* x y) (* z (* t -9.0))) (* a 2.0)) t_1))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y * (x * (0.5 / a))) - (t * ((z / a) * 4.5));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -5e+302) {
tmp = t_1;
} else if (t_2 <= 2e+291) {
tmp = ((x * y) + (z * (t * -9.0))) / (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.
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 * (x * (0.5d0 / a))) - (t * ((z / a) * 4.5d0))
t_2 = (x * y) - ((z * 9.0d0) * t)
if (t_2 <= (-5d+302)) then
tmp = t_1
else if (t_2 <= 2d+291) then
tmp = ((x * y) + (z * (t * (-9.0d0)))) / (a * 2.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 * (x * (0.5 / a))) - (t * ((z / a) * 4.5));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -5e+302) {
tmp = t_1;
} else if (t_2 <= 2e+291) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (y * (x * (0.5 / a))) - (t * ((z / a) * 4.5)) t_2 = (x * y) - ((z * 9.0) * t) tmp = 0 if t_2 <= -5e+302: tmp = t_1 elif t_2 <= 2e+291: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = t_1 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y * Float64(x * Float64(0.5 / a))) - Float64(t * Float64(Float64(z / a) * 4.5))) t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_2 <= -5e+302) tmp = t_1; elseif (t_2 <= 2e+291) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = t_1; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (y * (x * (0.5 / a))) - (t * ((z / a) * 4.5));
t_2 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if (t_2 <= -5e+302)
tmp = t_1;
elseif (t_2 <= 2e+291)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t * N[(N[(z / a), $MachinePrecision] * 4.5), $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, -5e+302], t$95$1, If[LessEqual[t$95$2, 2e+291], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot \frac{0.5}{a}\right) - t \cdot \left(\frac{z}{a} \cdot 4.5\right)\\
t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+302}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+291}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -5e302 or 1.9999999999999999e291 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 66.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-*.f6466.6%
Simplified66.6%
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
--lowering--.f64N/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
Applied egg-rr77.1%
div-invN/A
metadata-evalN/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6492.9%
Applied egg-rr92.9%
if -5e302 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.9999999999999999e291Initial program 99.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-*.f6499.5%
Simplified99.5%
Final simplification98.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 (if (<= (- (* x y) (* (* z 9.0) t)) 2e+299) (/ (+ (* x y) (* z (* t -9.0))) (* a 2.0)) (* (/ y a) (+ (* -4.5 (* t (/ z y))) (* x 0.5)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) - ((z * 9.0) * t)) <= 2e+299) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (((x * y) - ((z * 9.0d0) * t)) <= 2d+299) then
tmp = ((x * y) + (z * (t * (-9.0d0)))) / (a * 2.0d0)
else
tmp = (y / a) * (((-4.5d0) * (t * (z / y))) + (x * 0.5d0))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) - ((z * 9.0) * t)) <= 2e+299) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
}
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) - ((z * 9.0) * t)) <= 2e+299: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) <= 2e+299) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(Float64(y / a) * Float64(Float64(-4.5 * Float64(t * Float64(z / y))) + Float64(x * 0.5))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (((x * y) - ((z * 9.0) * t)) <= 2e+299)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = (y / a) * ((-4.5 * (t * (z / y))) + (x * 0.5));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], 2e+299], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y / a), $MachinePrecision] * N[(N[(-4.5 * N[(t * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * 0.5), $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 - \left(z \cdot 9\right) \cdot t \leq 2 \cdot 10^{+299}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(-4.5 \cdot \left(t \cdot \frac{z}{y}\right) + x \cdot 0.5\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 2.0000000000000001e299Initial program 96.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-*.f6496.3%
Simplified96.3%
if 2.0000000000000001e299 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 52.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-*.f6452.7%
Simplified52.7%
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
Simplified84.8%
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) -1e+89) (* x (/ y (/ a 0.5))) (if (<= (* x y) 6e+116) (* z (/ (* t -4.5) a)) (* 0.5 (* y (/ x a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -1e+89) {
tmp = x * (y / (a / 0.5));
} else if ((x * y) <= 6e+116) {
tmp = z * ((t * -4.5) / a);
} else {
tmp = 0.5 * (y * (x / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= (-1d+89)) then
tmp = x * (y / (a / 0.5d0))
else if ((x * y) <= 6d+116) then
tmp = z * ((t * (-4.5d0)) / a)
else
tmp = 0.5d0 * (y * (x / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -1e+89) {
tmp = x * (y / (a / 0.5));
} else if ((x * y) <= 6e+116) {
tmp = z * ((t * -4.5) / a);
} else {
tmp = 0.5 * (y * (x / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -1e+89: tmp = x * (y / (a / 0.5)) elif (x * y) <= 6e+116: tmp = z * ((t * -4.5) / a) else: tmp = 0.5 * (y * (x / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= -1e+89) tmp = Float64(x * Float64(y / Float64(a / 0.5))); elseif (Float64(x * y) <= 6e+116) tmp = Float64(z * Float64(Float64(t * -4.5) / a)); else tmp = Float64(0.5 * Float64(y * Float64(x / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -1e+89)
tmp = x * (y / (a / 0.5));
elseif ((x * y) <= 6e+116)
tmp = z * ((t * -4.5) / a);
else
tmp = 0.5 * (y * (x / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -1e+89], N[(x * N[(y / N[(a / 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 6e+116], N[(z * N[(N[(t * -4.5), $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 -1 \cdot 10^{+89}:\\
\;\;\;\;x \cdot \frac{y}{\frac{a}{0.5}}\\
\mathbf{elif}\;x \cdot y \leq 6 \cdot 10^{+116}:\\
\;\;\;\;z \cdot \frac{t \cdot -4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999995e88Initial program 92.9%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6492.9%
Simplified92.9%
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
cancel-sign-sub-invN/A
Applied egg-rr92.9%
Taylor expanded in x around inf
*-lowering-*.f6485.6%
Simplified85.6%
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6488.0%
Applied egg-rr88.0%
if -9.99999999999999995e88 < (*.f64 x y) < 5.9999999999999997e116Initial program 93.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-*.f6493.7%
Simplified93.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.7%
Simplified72.7%
*-commutativeN/A
metadata-evalN/A
times-fracN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
metadata-evalN/A
*-lowering-*.f6471.2%
Applied egg-rr71.2%
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6471.2%
Applied egg-rr71.2%
if 5.9999999999999997e116 < (*.f64 x y) Initial program 85.4%
/-lowering-/.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
*-lowering-*.f6485.3%
Simplified85.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.3%
Simplified90.3%
Final simplification77.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 (* 0.5 (* y (/ x a)))))
(if (<= (* x y) -1e+89)
t_1
(if (<= (* x y) 6e+116) (* 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 = 0.5 * (y * (x / a));
double tmp;
if ((x * y) <= -1e+89) {
tmp = t_1;
} else if ((x * y) <= 6e+116) {
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.
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 = 0.5d0 * (y * (x / a))
if ((x * y) <= (-1d+89)) then
tmp = t_1
else if ((x * y) <= 6d+116) 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;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = 0.5 * (y * (x / a));
double tmp;
if ((x * y) <= -1e+89) {
tmp = t_1;
} else if ((x * y) <= 6e+116) {
tmp = 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 = 0.5 * (y * (x / a)) tmp = 0 if (x * y) <= -1e+89: tmp = t_1 elif (x * y) <= 6e+116: tmp = 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(0.5 * Float64(y * Float64(x / a))) tmp = 0.0 if (Float64(x * y) <= -1e+89) tmp = t_1; elseif (Float64(x * y) <= 6e+116) tmp = Float64(z * Float64(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 = 0.5 * (y * (x / a));
tmp = 0.0;
if ((x * y) <= -1e+89)
tmp = t_1;
elseif ((x * y) <= 6e+116)
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.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+89], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 6e+116], N[(z * N[(N[(t * -4.5), $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 := 0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+89}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot y \leq 6 \cdot 10^{+116}:\\
\;\;\;\;z \cdot \frac{t \cdot -4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999995e88 or 5.9999999999999997e116 < (*.f64 x y) Initial program 88.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-*.f6488.6%
Simplified88.6%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6490.3%
Simplified90.3%
if -9.99999999999999995e88 < (*.f64 x y) < 5.9999999999999997e116Initial program 93.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-*.f6493.7%
Simplified93.7%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.7%
Simplified72.7%
*-commutativeN/A
metadata-evalN/A
times-fracN/A
associate-*r*N/A
times-fracN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
associate-/l*N/A
metadata-evalN/A
*-lowering-*.f6471.2%
Applied egg-rr71.2%
*-commutativeN/A
associate-*r/N/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6471.2%
Applied egg-rr71.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) 1e+255) (/ (+ (* x y) (* z (* t -9.0))) (* a 2.0)) (* x (/ y (/ a 0.5)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+255) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = x * (y / (a / 0.5));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= 1d+255) then
tmp = ((x * y) + (z * (t * (-9.0d0)))) / (a * 2.0d0)
else
tmp = x * (y / (a / 0.5d0))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+255) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = x * (y / (a / 0.5));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= 1e+255: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = x * (y / (a / 0.5)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= 1e+255) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(x * Float64(y / Float64(a / 0.5))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= 1e+255)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = x * (y / (a / 0.5));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], 1e+255], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(y / N[(a / 0.5), $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 10^{+255}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y}{\frac{a}{0.5}}\\
\end{array}
\end{array}
if (*.f64 x y) < 9.99999999999999988e254Initial program 94.4%
/-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.4%
Simplified94.4%
if 9.99999999999999988e254 < (*.f64 x y) Initial program 65.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-*.f6465.5%
Simplified65.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
cancel-sign-sub-invN/A
Applied egg-rr65.5%
Taylor expanded in x around inf
*-lowering-*.f6465.5%
Simplified65.5%
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64100.0%
Applied egg-rr100.0%
Final simplification94.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) 1e+255) (* (/ 0.5 a) (+ (* x y) (* -9.0 (* z t)))) (* x (/ y (/ a 0.5)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+255) {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
} else {
tmp = x * (y / (a / 0.5));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if ((x * y) <= 1d+255) then
tmp = (0.5d0 / a) * ((x * y) + ((-9.0d0) * (z * t)))
else
tmp = x * (y / (a / 0.5d0))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= 1e+255) {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
} else {
tmp = x * (y / (a / 0.5));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= 1e+255: tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t))) else: tmp = x * (y / (a / 0.5)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= 1e+255) tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(-9.0 * Float64(z * t)))); else tmp = Float64(x * Float64(y / Float64(a / 0.5))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= 1e+255)
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
else
tmp = x * (y / (a / 0.5));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], 1e+255], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(y / N[(a / 0.5), $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 10^{+255}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + -9 \cdot \left(z \cdot t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \frac{y}{\frac{a}{0.5}}\\
\end{array}
\end{array}
if (*.f64 x y) < 9.99999999999999988e254Initial program 94.4%
/-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.4%
Simplified94.4%
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
cancel-sign-sub-invN/A
Applied egg-rr94.3%
if 9.99999999999999988e254 < (*.f64 x y) Initial program 65.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-*.f6465.5%
Simplified65.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
cancel-sign-sub-invN/A
Applied egg-rr65.5%
Taylor expanded in x around inf
*-lowering-*.f6465.5%
Simplified65.5%
*-commutativeN/A
associate-*l*N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
div-invN/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f64100.0%
Applied egg-rr100.0%
Final simplification94.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (let* ((t_1 (* 0.5 (* y (/ x a))))) (if (<= x -9e-42) t_1 (if (<= x 1.35e-75) (* -4.5 (* t (/ z 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 = 0.5 * (y * (x / a));
double tmp;
if (x <= -9e-42) {
tmp = t_1;
} else if (x <= 1.35e-75) {
tmp = -4.5 * (t * (z / 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 = 0.5d0 * (y * (x / a))
if (x <= (-9d-42)) then
tmp = t_1
else if (x <= 1.35d-75) then
tmp = (-4.5d0) * (t * (z / 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 = 0.5 * (y * (x / a));
double tmp;
if (x <= -9e-42) {
tmp = t_1;
} else if (x <= 1.35e-75) {
tmp = -4.5 * (t * (z / 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 = 0.5 * (y * (x / a)) tmp = 0 if x <= -9e-42: tmp = t_1 elif x <= 1.35e-75: tmp = -4.5 * (t * (z / 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(0.5 * Float64(y * Float64(x / a))) tmp = 0.0 if (x <= -9e-42) tmp = t_1; elseif (x <= 1.35e-75) tmp = Float64(-4.5 * Float64(t * Float64(z / 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 = 0.5 * (y * (x / a));
tmp = 0.0;
if (x <= -9e-42)
tmp = t_1;
elseif (x <= 1.35e-75)
tmp = -4.5 * (t * (z / 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[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -9e-42], t$95$1, If[LessEqual[x, 1.35e-75], N[(-4.5 * N[(t * N[(z / 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 := 0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{if}\;x \leq -9 \cdot 10^{-42}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 1.35 \cdot 10^{-75}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -9e-42 or 1.3499999999999999e-75 < x Initial program 91.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-*.f6491.7%
Simplified91.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f6465.6%
Simplified65.6%
if -9e-42 < x < 1.3499999999999999e-75Initial program 92.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-*.f6492.1%
Simplified92.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6470.4%
Simplified70.4%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6472.3%
Applied egg-rr72.3%
Final simplification68.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= x -3.9e-96) (* -4.5 (/ (* z t) a)) (* -4.5 (* t (/ z a)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -3.9e-96) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (x <= (-3.9d-96)) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = (-4.5d0) * (t * (z / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -3.9e-96) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if x <= -3.9e-96: tmp = -4.5 * ((z * t) / a) else: tmp = -4.5 * (t * (z / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (x <= -3.9e-96) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(-4.5 * Float64(t * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (x <= -3.9e-96)
tmp = -4.5 * ((z * t) / a);
else
tmp = -4.5 * (t * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[x, -3.9e-96], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -3.9 \cdot 10^{-96}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if x < -3.8999999999999998e-96Initial program 91.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-*.f6491.4%
Simplified91.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6440.6%
Simplified40.6%
if -3.8999999999999998e-96 < x Initial program 92.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-*.f6492.1%
Simplified92.1%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6459.7%
Simplified59.7%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6461.9%
Applied egg-rr61.9%
Final simplification54.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* t (/ z a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = (-4.5d0) * (t * (z / a))
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 91.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-*.f6491.9%
Simplified91.9%
Taylor expanded in x around 0
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6452.9%
Simplified52.9%
associate-/l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f6454.8%
Applied egg-rr54.8%
Final simplification54.8%
(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 2024152
(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)))