
(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) (* (* z 9.0) t))))
(if (<= t_1 -5e+302)
(* z (/ (+ (* t -4.5) (* 0.5 (/ (* x y) z))) a))
(if (<= t_1 2e+291)
(/ (fma x y (* z (* t -9.0))) (* a 2.0))
(* t (fma -4.5 (/ z a) (* 0.5 (* x (/ y (* t a))))))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -5e+302) {
tmp = z * (((t * -4.5) + (0.5 * ((x * y) / z))) / a);
} else if (t_1 <= 2e+291) {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = t * fma(-4.5, (z / a), (0.5 * (x * (y / (t * a)))));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= -5e+302) tmp = Float64(z * Float64(Float64(Float64(t * -4.5) + Float64(0.5 * Float64(Float64(x * y) / z))) / a)); elseif (t_1 <= 2e+291) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(t * fma(-4.5, Float64(z / a), Float64(0.5 * Float64(x * Float64(y / Float64(t * a)))))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+302], N[(z * N[(N[(N[(t * -4.5), $MachinePrecision] + N[(0.5 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+291], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.5 * N[(z / a), $MachinePrecision] + N[(0.5 * N[(x * N[(y / N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+302}:\\
\;\;\;\;z \cdot \frac{t \cdot -4.5 + 0.5 \cdot \frac{x \cdot y}{z}}{a}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+291}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \mathsf{fma}\left(-4.5, \frac{z}{a}, 0.5 \cdot \left(x \cdot \frac{y}{t \cdot a}\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -5e302Initial program 75.3%
div-sub72.0%
*-commutative72.0%
div-sub75.3%
cancel-sign-sub-inv75.3%
*-commutative75.3%
fma-define75.3%
distribute-rgt-neg-in75.3%
associate-*r*75.3%
distribute-lft-neg-in75.3%
*-commutative75.3%
distribute-rgt-neg-in75.3%
metadata-eval75.3%
Simplified75.3%
Taylor expanded in z around inf 90.4%
Taylor expanded in a around 0 90.6%
if -5e302 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 1.9999999999999999e291Initial program 99.5%
div-sub97.4%
*-commutative97.4%
div-sub99.5%
cancel-sign-sub-inv99.5%
*-commutative99.5%
fma-define99.5%
distribute-rgt-neg-in99.5%
associate-*r*99.5%
distribute-lft-neg-in99.5%
*-commutative99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
Simplified99.5%
if 1.9999999999999999e291 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 57.5%
div-sub50.6%
*-commutative50.6%
div-sub57.5%
cancel-sign-sub-inv57.5%
*-commutative57.5%
fma-define57.5%
distribute-rgt-neg-in57.5%
associate-*r*57.5%
distribute-lft-neg-in57.5%
*-commutative57.5%
distribute-rgt-neg-in57.5%
metadata-eval57.5%
Simplified57.5%
Taylor expanded in t around inf 73.3%
fma-define73.3%
associate-/l*86.3%
*-commutative86.3%
Simplified86.3%
Final simplification96.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) 1e+255) (/ (fma x y (* z (* t -9.0))) (* a 2.0)) (* 0.5 (* x (/ y 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+255) {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / 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+255) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], 1e+255], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / 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 10^{+255}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < 9.99999999999999988e254Initial program 94.4%
div-sub91.8%
*-commutative91.8%
div-sub94.4%
cancel-sign-sub-inv94.4%
*-commutative94.4%
fma-define94.4%
distribute-rgt-neg-in94.4%
associate-*r*94.4%
distribute-lft-neg-in94.4%
*-commutative94.4%
distribute-rgt-neg-in94.4%
metadata-eval94.4%
Simplified94.4%
if 9.99999999999999988e254 < (*.f64 x y) Initial program 65.5%
div-sub61.0%
*-commutative61.0%
div-sub65.5%
cancel-sign-sub-inv65.5%
*-commutative65.5%
fma-define65.5%
distribute-rgt-neg-in65.5%
associate-*r*65.5%
distribute-lft-neg-in65.5%
*-commutative65.5%
distribute-rgt-neg-in65.5%
metadata-eval65.5%
Simplified65.5%
Taylor expanded in x around inf 65.5%
associate-/l*100.0%
Simplified100.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) -1e+89)
(* 0.5 (* x (/ y a)))
(if (<= (* x y) 6e+116)
(* z (* t (/ -4.5 a)))
(/ 1.0 (* 2.0 (/ 1.0 (* 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 = 0.5 * (x * (y / a));
} else if ((x * y) <= 6e+116) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = 1.0 / (2.0 * (1.0 / (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 = 0.5d0 * (x * (y / a))
else if ((x * y) <= 6d+116) then
tmp = z * (t * ((-4.5d0) / a))
else
tmp = 1.0d0 / (2.0d0 * (1.0d0 / (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 = 0.5 * (x * (y / a));
} else if ((x * y) <= 6e+116) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = 1.0 / (2.0 * (1.0 / (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 = 0.5 * (x * (y / a)) elif (x * y) <= 6e+116: tmp = z * (t * (-4.5 / a)) else: tmp = 1.0 / (2.0 * (1.0 / (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(0.5 * Float64(x * Float64(y / a))); elseif (Float64(x * y) <= 6e+116) tmp = Float64(z * Float64(t * Float64(-4.5 / a))); else tmp = Float64(1.0 / Float64(2.0 * Float64(1.0 / 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 = 0.5 * (x * (y / a));
elseif ((x * y) <= 6e+116)
tmp = z * (t * (-4.5 / a));
else
tmp = 1.0 / (2.0 * (1.0 / (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[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 6e+116], N[(z * N[(t * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(2.0 * N[(1.0 / N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $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}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 6 \cdot 10^{+116}:\\
\;\;\;\;z \cdot \left(t \cdot \frac{-4.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{2 \cdot \frac{1}{y \cdot \frac{x}{a}}}\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999995e88Initial program 92.9%
div-sub90.4%
*-commutative90.4%
div-sub92.9%
cancel-sign-sub-inv92.9%
*-commutative92.9%
fma-define92.9%
distribute-rgt-neg-in92.9%
associate-*r*92.9%
distribute-lft-neg-in92.9%
*-commutative92.9%
distribute-rgt-neg-in92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in x around inf 85.6%
associate-/l*88.0%
Simplified88.0%
if -9.99999999999999995e88 < (*.f64 x y) < 5.9999999999999997e116Initial program 93.7%
div-sub91.2%
*-commutative91.2%
div-sub93.7%
cancel-sign-sub-inv93.7%
*-commutative93.7%
fma-define93.7%
distribute-rgt-neg-in93.7%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in z around inf 83.6%
Taylor expanded in t around inf 71.2%
associate-*r/71.2%
*-commutative71.2%
associate-/l*71.2%
Simplified71.2%
if 5.9999999999999997e116 < (*.f64 x y) Initial program 85.4%
div-sub81.5%
*-commutative81.5%
div-sub85.4%
cancel-sign-sub-inv85.4%
*-commutative85.4%
fma-define85.4%
distribute-rgt-neg-in85.4%
associate-*r*85.3%
distribute-lft-neg-in85.3%
*-commutative85.3%
distribute-rgt-neg-in85.3%
metadata-eval85.3%
Simplified85.3%
clear-num85.3%
inv-pow85.3%
Applied egg-rr85.3%
unpow-185.3%
associate-/l*85.2%
Simplified85.2%
Taylor expanded in x around inf 77.7%
*-commutative77.7%
Simplified77.7%
*-un-lft-identity77.7%
times-frac90.1%
Applied egg-rr90.1%
*-commutative90.1%
clear-num90.1%
frac-times90.2%
metadata-eval90.2%
Applied egg-rr90.2%
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
(if (<= (* x y) -1e+89)
(* 0.5 (* x (/ y a)))
(if (<= (* x y) 6e+116)
(* z (* t (/ -4.5 a)))
(/ 1.0 (* 2.0 (/ (/ a x) y))))))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 = 0.5 * (x * (y / a));
} else if ((x * y) <= 6e+116) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = 1.0 / (2.0 * ((a / x) / y));
}
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 = 0.5d0 * (x * (y / a))
else if ((x * y) <= 6d+116) then
tmp = z * (t * ((-4.5d0) / a))
else
tmp = 1.0d0 / (2.0d0 * ((a / x) / y))
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 = 0.5 * (x * (y / a));
} else if ((x * y) <= 6e+116) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = 1.0 / (2.0 * ((a / x) / y));
}
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 = 0.5 * (x * (y / a)) elif (x * y) <= 6e+116: tmp = z * (t * (-4.5 / a)) else: tmp = 1.0 / (2.0 * ((a / x) / y)) 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(0.5 * Float64(x * Float64(y / a))); elseif (Float64(x * y) <= 6e+116) tmp = Float64(z * Float64(t * Float64(-4.5 / a))); else tmp = Float64(1.0 / Float64(2.0 * Float64(Float64(a / x) / y))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -1e+89)
tmp = 0.5 * (x * (y / a));
elseif ((x * y) <= 6e+116)
tmp = z * (t * (-4.5 / a));
else
tmp = 1.0 / (2.0 * ((a / x) / y));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], -1e+89], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 6e+116], N[(z * N[(t * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(2.0 * N[(N[(a / x), $MachinePrecision] / y), $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}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 6 \cdot 10^{+116}:\\
\;\;\;\;z \cdot \left(t \cdot \frac{-4.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{2 \cdot \frac{\frac{a}{x}}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999995e88Initial program 92.9%
div-sub90.4%
*-commutative90.4%
div-sub92.9%
cancel-sign-sub-inv92.9%
*-commutative92.9%
fma-define92.9%
distribute-rgt-neg-in92.9%
associate-*r*92.9%
distribute-lft-neg-in92.9%
*-commutative92.9%
distribute-rgt-neg-in92.9%
metadata-eval92.9%
Simplified92.9%
Taylor expanded in x around inf 85.6%
associate-/l*88.0%
Simplified88.0%
if -9.99999999999999995e88 < (*.f64 x y) < 5.9999999999999997e116Initial program 93.7%
div-sub91.2%
*-commutative91.2%
div-sub93.7%
cancel-sign-sub-inv93.7%
*-commutative93.7%
fma-define93.7%
distribute-rgt-neg-in93.7%
associate-*r*93.7%
distribute-lft-neg-in93.7%
*-commutative93.7%
distribute-rgt-neg-in93.7%
metadata-eval93.7%
Simplified93.7%
Taylor expanded in z around inf 83.6%
Taylor expanded in t around inf 71.2%
associate-*r/71.2%
*-commutative71.2%
associate-/l*71.2%
Simplified71.2%
if 5.9999999999999997e116 < (*.f64 x y) Initial program 85.4%
div-sub81.5%
*-commutative81.5%
div-sub85.4%
cancel-sign-sub-inv85.4%
*-commutative85.4%
fma-define85.4%
distribute-rgt-neg-in85.4%
associate-*r*85.3%
distribute-lft-neg-in85.3%
*-commutative85.3%
distribute-rgt-neg-in85.3%
metadata-eval85.3%
Simplified85.3%
clear-num85.3%
inv-pow85.3%
Applied egg-rr85.3%
unpow-185.3%
associate-/l*85.2%
Simplified85.2%
Taylor expanded in x around inf 77.7%
*-commutative77.7%
Simplified77.7%
*-un-lft-identity77.7%
times-frac90.1%
Applied egg-rr90.1%
associate-*l/90.3%
*-un-lft-identity90.3%
Applied egg-rr90.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 (or (<= (* x y) -1e+89) (not (<= (* x y) 5e+82))) (* 0.5 (* x (/ y 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 (((x * y) <= -1e+89) || !((x * y) <= 5e+82)) {
tmp = 0.5 * (x * (y / 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 (((x * y) <= (-1d+89)) .or. (.not. ((x * y) <= 5d+82))) then
tmp = 0.5d0 * (x * (y / 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 (((x * y) <= -1e+89) || !((x * y) <= 5e+82)) {
tmp = 0.5 * (x * (y / 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 ((x * y) <= -1e+89) or not ((x * y) <= 5e+82): tmp = 0.5 * (x * (y / 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 ((Float64(x * y) <= -1e+89) || !(Float64(x * y) <= 5e+82)) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(Float64(-4.5 * Float64(z * t)) / a); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (((x * y) <= -1e+89) || ~(((x * y) <= 5e+82)))
tmp = 0.5 * (x * (y / 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[Or[LessEqual[N[(x * y), $MachinePrecision], -1e+89], N[Not[LessEqual[N[(x * y), $MachinePrecision], 5e+82]], $MachinePrecision]], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.5 * N[(z * t), $MachinePrecision]), $MachinePrecision] / a), $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} \lor \neg \left(x \cdot y \leq 5 \cdot 10^{+82}\right):\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-4.5 \cdot \left(z \cdot t\right)}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999995e88 or 5.00000000000000015e82 < (*.f64 x y) Initial program 88.6%
div-sub84.6%
*-commutative84.6%
div-sub88.6%
cancel-sign-sub-inv88.6%
*-commutative88.6%
fma-define88.6%
distribute-rgt-neg-in88.6%
associate-*r*88.6%
distribute-lft-neg-in88.6%
*-commutative88.6%
distribute-rgt-neg-in88.6%
metadata-eval88.6%
Simplified88.6%
Taylor expanded in x around inf 79.0%
associate-/l*85.9%
Simplified85.9%
if -9.99999999999999995e88 < (*.f64 x y) < 5.00000000000000015e82Initial program 94.0%
div-sub92.1%
*-commutative92.1%
div-sub94.0%
cancel-sign-sub-inv94.0%
*-commutative94.0%
fma-define94.0%
distribute-rgt-neg-in94.0%
associate-*r*94.0%
distribute-lft-neg-in94.0%
*-commutative94.0%
distribute-rgt-neg-in94.0%
metadata-eval94.0%
Simplified94.0%
Taylor expanded in x around 0 74.5%
associate-*r/74.6%
Applied egg-rr74.6%
Final simplification79.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) 1e+255) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)) (* 0.5 (* x (/ y 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+255) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / 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+255) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = 0.5d0 * (x * (y / 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+255) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / 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+255: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = 0.5 * (x * (y / 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+255) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(x * Float64(y / 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+255)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = 0.5 * (x * (y / 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+255], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / 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 10^{+255}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < 9.99999999999999988e254Initial program 94.4%
div-sub91.8%
*-commutative91.8%
div-sub94.4%
cancel-sign-sub-inv94.4%
*-commutative94.4%
fma-define94.4%
distribute-rgt-neg-in94.4%
associate-*r*94.4%
distribute-lft-neg-in94.4%
*-commutative94.4%
distribute-rgt-neg-in94.4%
metadata-eval94.4%
Simplified94.4%
*-commutative94.4%
associate-*r*94.4%
metadata-eval94.4%
distribute-rgt-neg-in94.4%
distribute-lft-neg-in94.4%
fmm-def94.4%
associate-*l*94.4%
Applied egg-rr94.4%
if 9.99999999999999988e254 < (*.f64 x y) Initial program 65.5%
div-sub61.0%
*-commutative61.0%
div-sub65.5%
cancel-sign-sub-inv65.5%
*-commutative65.5%
fma-define65.5%
distribute-rgt-neg-in65.5%
associate-*r*65.5%
distribute-lft-neg-in65.5%
*-commutative65.5%
distribute-rgt-neg-in65.5%
metadata-eval65.5%
Simplified65.5%
Taylor expanded in x around inf 65.5%
associate-/l*100.0%
Simplified100.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 (or (<= y -2.8e-87) (not (<= y 7e+79))) (* 0.5 (* x (/ y 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 ((y <= -2.8e-87) || !(y <= 7e+79)) {
tmp = 0.5 * (x * (y / 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 ((y <= (-2.8d-87)) .or. (.not. (y <= 7d+79))) then
tmp = 0.5d0 * (x * (y / 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 ((y <= -2.8e-87) || !(y <= 7e+79)) {
tmp = 0.5 * (x * (y / 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 (y <= -2.8e-87) or not (y <= 7e+79): tmp = 0.5 * (x * (y / 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 ((y <= -2.8e-87) || !(y <= 7e+79)) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((y <= -2.8e-87) || ~((y <= 7e+79)))
tmp = 0.5 * (x * (y / 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[Or[LessEqual[y, -2.8e-87], N[Not[LessEqual[y, 7e+79]], $MachinePrecision]], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2.8 \cdot 10^{-87} \lor \neg \left(y \leq 7 \cdot 10^{+79}\right):\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if y < -2.8000000000000001e-87 or 6.99999999999999961e79 < y Initial program 89.9%
div-sub87.5%
*-commutative87.5%
div-sub89.9%
cancel-sign-sub-inv89.9%
*-commutative89.9%
fma-define89.9%
distribute-rgt-neg-in89.9%
associate-*r*89.9%
distribute-lft-neg-in89.9%
*-commutative89.9%
distribute-rgt-neg-in89.9%
metadata-eval89.9%
Simplified89.9%
Taylor expanded in x around inf 66.7%
associate-/l*69.8%
Simplified69.8%
if -2.8000000000000001e-87 < y < 6.99999999999999961e79Initial program 93.8%
div-sub90.7%
*-commutative90.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.8%
distribute-lft-neg-in93.8%
*-commutative93.8%
distribute-rgt-neg-in93.8%
metadata-eval93.8%
Simplified93.8%
Taylor expanded in x around 0 73.0%
Final simplification71.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 (<= y -6e-86) (* 0.5 (* x (/ y a))) (if (<= y 7.5e+79) (* -4.5 (/ (* z t) a)) (/ 0.5 (/ (/ a y) x)))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (y <= -6e-86) {
tmp = 0.5 * (x * (y / a));
} else if (y <= 7.5e+79) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 / ((a / y) / x);
}
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 (y <= (-6d-86)) then
tmp = 0.5d0 * (x * (y / a))
else if (y <= 7.5d+79) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 / ((a / y) / x)
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 (y <= -6e-86) {
tmp = 0.5 * (x * (y / a));
} else if (y <= 7.5e+79) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 / ((a / y) / x);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if y <= -6e-86: tmp = 0.5 * (x * (y / a)) elif y <= 7.5e+79: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 / ((a / y) / x) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (y <= -6e-86) tmp = Float64(0.5 * Float64(x * Float64(y / a))); elseif (y <= 7.5e+79) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 / Float64(Float64(a / y) / x)); 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 (y <= -6e-86)
tmp = 0.5 * (x * (y / a));
elseif (y <= 7.5e+79)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 / ((a / y) / x);
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[y, -6e-86], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 7.5e+79], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 / N[(N[(a / y), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -6 \cdot 10^{-86}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;y \leq 7.5 \cdot 10^{+79}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{\frac{\frac{a}{y}}{x}}\\
\end{array}
\end{array}
if y < -6.0000000000000002e-86Initial program 90.2%
div-sub88.9%
*-commutative88.9%
div-sub90.2%
cancel-sign-sub-inv90.2%
*-commutative90.2%
fma-define90.2%
distribute-rgt-neg-in90.2%
associate-*r*90.2%
distribute-lft-neg-in90.2%
*-commutative90.2%
distribute-rgt-neg-in90.2%
metadata-eval90.2%
Simplified90.2%
Taylor expanded in x around inf 63.3%
associate-/l*66.9%
Simplified66.9%
if -6.0000000000000002e-86 < y < 7.49999999999999967e79Initial program 93.8%
div-sub90.7%
*-commutative90.7%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.8%
distribute-lft-neg-in93.8%
*-commutative93.8%
distribute-rgt-neg-in93.8%
metadata-eval93.8%
Simplified93.8%
Taylor expanded in x around 0 73.0%
if 7.49999999999999967e79 < y Initial program 89.4%
div-sub85.1%
*-commutative85.1%
div-sub89.4%
cancel-sign-sub-inv89.4%
*-commutative89.4%
fma-define89.4%
distribute-rgt-neg-in89.4%
associate-*r*89.5%
distribute-lft-neg-in89.5%
*-commutative89.5%
distribute-rgt-neg-in89.5%
metadata-eval89.5%
Simplified89.5%
clear-num89.5%
inv-pow89.5%
Applied egg-rr89.5%
unpow-189.5%
associate-/l*89.4%
Simplified89.4%
Taylor expanded in x around inf 72.6%
*-commutative72.6%
Simplified72.6%
*-un-lft-identity72.6%
associate-/r*72.6%
metadata-eval72.6%
associate-/r*75.4%
Applied egg-rr75.4%
*-un-lft-identity75.4%
Applied egg-rr75.4%
Final simplification71.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= x -6.7e-105) (* -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 <= -6.7e-105) {
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 <= (-6.7d-105)) 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 <= -6.7e-105) {
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 <= -6.7e-105: 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 <= -6.7e-105) tmp = Float64(-4.5 * Float64(z * Float64(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 <= -6.7e-105)
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, -6.7e-105], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $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 -6.7 \cdot 10^{-105}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if x < -6.7000000000000002e-105Initial program 91.6%
div-sub86.1%
*-commutative86.1%
div-sub91.6%
cancel-sign-sub-inv91.6%
*-commutative91.6%
fma-define91.6%
distribute-rgt-neg-in91.6%
associate-*r*91.5%
distribute-lft-neg-in91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
metadata-eval91.5%
Simplified91.5%
Taylor expanded in x around 0 41.2%
associate-*r/41.2%
associate-*r*41.2%
associate-*l/39.8%
associate-*r/39.7%
associate-*l*39.7%
Simplified39.7%
if -6.7000000000000002e-105 < x Initial program 92.1%
div-sub90.8%
*-commutative90.8%
div-sub92.1%
cancel-sign-sub-inv92.1%
*-commutative92.1%
fma-define92.1%
distribute-rgt-neg-in92.1%
associate-*r*92.1%
distribute-lft-neg-in92.1%
*-commutative92.1%
distribute-rgt-neg-in92.1%
metadata-eval92.1%
Simplified92.1%
Taylor expanded in x around 0 59.4%
*-commutative59.4%
associate-/l*61.7%
associate-*r*61.8%
*-commutative61.8%
Simplified61.8%
pow161.8%
Applied egg-rr61.8%
unpow161.8%
associate-*r*61.8%
Simplified61.8%
Taylor expanded in t around 0 59.4%
associate-*r/61.7%
Simplified61.7%
Final simplification53.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 (* -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%
div-sub89.1%
*-commutative89.1%
div-sub91.9%
cancel-sign-sub-inv91.9%
*-commutative91.9%
fma-define91.9%
distribute-rgt-neg-in91.9%
associate-*r*91.9%
distribute-lft-neg-in91.9%
*-commutative91.9%
distribute-rgt-neg-in91.9%
metadata-eval91.9%
Simplified91.9%
Taylor expanded in x around 0 52.9%
*-commutative52.9%
associate-/l*54.8%
associate-*r*54.9%
*-commutative54.9%
Simplified54.9%
pow154.9%
Applied egg-rr54.9%
unpow154.9%
associate-*r*54.9%
Simplified54.9%
Taylor expanded in t around 0 52.9%
associate-*r/54.8%
Simplified54.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)))