
(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 11 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 (if (<= (- (* x y) (* (* z 9.0) t)) (- INFINITY)) (- (* x (/ y (* a 2.0))) (* z (/ (* t 4.5) a))) (/ (fma x y (* z (* t -9.0))) (* a 2.0))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) - ((z * 9.0) * t)) <= -((double) INFINITY)) {
tmp = (x * (y / (a * 2.0))) - (z * ((t * 4.5) / a));
} else {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) <= Float64(-Inf)) tmp = Float64(Float64(x * Float64(y / Float64(a * 2.0))) - Float64(z * Float64(Float64(t * 4.5) / a))); else tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); 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[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(z * N[(N[(t * 4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $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 -\infty:\\
\;\;\;\;x \cdot \frac{y}{a \cdot 2} - z \cdot \frac{t \cdot 4.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0Initial program 60.4%
div-sub51.3%
*-commutative51.3%
div-sub60.4%
cancel-sign-sub-inv60.4%
*-commutative60.4%
fma-define60.4%
distribute-rgt-neg-in60.4%
associate-*r*60.4%
distribute-lft-neg-in60.4%
*-commutative60.4%
distribute-rgt-neg-in60.4%
metadata-eval60.4%
Simplified60.4%
*-un-lft-identity60.4%
*-un-lft-identity60.4%
*-commutative60.4%
associate-*r*60.4%
metadata-eval60.4%
distribute-rgt-neg-in60.4%
distribute-lft-neg-in60.4%
fmm-def60.4%
div-sub51.3%
associate-/l*79.3%
associate-*l*79.3%
associate-/l*90.8%
Applied egg-rr90.8%
Taylor expanded in z around 0 79.3%
associate-*r/79.3%
associate-*r*79.3%
associate-*l/90.8%
associate-*r/90.8%
*-commutative90.8%
*-commutative90.8%
associate-*l/90.8%
Simplified90.8%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 93.8%
div-sub91.1%
*-commutative91.1%
div-sub93.8%
cancel-sign-sub-inv93.8%
*-commutative93.8%
fma-define95.2%
distribute-rgt-neg-in95.2%
associate-*r*95.2%
distribute-lft-neg-in95.2%
*-commutative95.2%
distribute-rgt-neg-in95.2%
metadata-eval95.2%
Simplified95.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 (or (<= (* x y) -5e-40) (not (<= (* x y) 2e-20))) (* (* y 0.5) (/ x a)) (/ (* z (* t -4.5)) 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) <= -5e-40) || !((x * y) <= 2e-20)) {
tmp = (y * 0.5) * (x / a);
} else {
tmp = (z * (t * -4.5)) / 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) <= (-5d-40)) .or. (.not. ((x * y) <= 2d-20))) then
tmp = (y * 0.5d0) * (x / a)
else
tmp = (z * (t * (-4.5d0))) / 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) <= -5e-40) || !((x * y) <= 2e-20)) {
tmp = (y * 0.5) * (x / a);
} else {
tmp = (z * (t * -4.5)) / 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) <= -5e-40) or not ((x * y) <= 2e-20): tmp = (y * 0.5) * (x / a) else: tmp = (z * (t * -4.5)) / 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) <= -5e-40) || !(Float64(x * y) <= 2e-20)) tmp = Float64(Float64(y * 0.5) * Float64(x / a)); else tmp = Float64(Float64(z * Float64(t * -4.5)) / 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) <= -5e-40) || ~(((x * y) <= 2e-20)))
tmp = (y * 0.5) * (x / a);
else
tmp = (z * (t * -4.5)) / a;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -5e-40], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e-20]], $MachinePrecision]], N[(N[(y * 0.5), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], N[(N[(z * N[(t * -4.5), $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 -5 \cdot 10^{-40} \lor \neg \left(x \cdot y \leq 2 \cdot 10^{-20}\right):\\
\;\;\;\;\left(y \cdot 0.5\right) \cdot \frac{x}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{z \cdot \left(t \cdot -4.5\right)}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999965e-40 or 1.99999999999999989e-20 < (*.f64 x y) Initial program 85.1%
div-sub78.7%
*-commutative78.7%
div-sub85.1%
cancel-sign-sub-inv85.1%
*-commutative85.1%
fma-define87.2%
distribute-rgt-neg-in87.2%
associate-*r*87.2%
distribute-lft-neg-in87.2%
*-commutative87.2%
distribute-rgt-neg-in87.2%
metadata-eval87.2%
Simplified87.2%
Taylor expanded in x around inf 64.0%
associate-/l*70.6%
Simplified70.6%
associate-*r*70.6%
clear-num70.1%
un-div-inv70.1%
Applied egg-rr70.1%
associate-/r/65.0%
associate-*r/65.0%
*-commutative65.0%
associate-*r*65.1%
Simplified65.1%
if -4.99999999999999965e-40 < (*.f64 x y) < 1.99999999999999989e-20Initial program 95.0%
div-sub95.0%
*-commutative95.0%
div-sub95.0%
cancel-sign-sub-inv95.0%
*-commutative95.0%
fma-define95.0%
distribute-rgt-neg-in95.0%
associate-*r*95.0%
distribute-lft-neg-in95.0%
*-commutative95.0%
distribute-rgt-neg-in95.0%
metadata-eval95.0%
Simplified95.0%
Taylor expanded in x around 0 80.5%
*-commutative80.5%
associate-/l*76.7%
associate-*r*76.8%
*-commutative76.8%
Simplified76.8%
associate-*r*76.8%
associate-*r/80.6%
Applied egg-rr80.6%
Final simplification72.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 (<= (* x y) -5e-40) (not (<= (* x y) 2e-20))) (* (* y 0.5) (/ x a)) (/ (* t (* z -4.5)) a)))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) <= -5e-40) || !((x * y) <= 2e-20)) {
tmp = (y * 0.5) * (x / a);
} else {
tmp = (t * (z * -4.5)) / 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) <= (-5d-40)) .or. (.not. ((x * y) <= 2d-20))) then
tmp = (y * 0.5d0) * (x / a)
else
tmp = (t * (z * (-4.5d0))) / 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) <= -5e-40) || !((x * y) <= 2e-20)) {
tmp = (y * 0.5) * (x / a);
} else {
tmp = (t * (z * -4.5)) / 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) <= -5e-40) or not ((x * y) <= 2e-20): tmp = (y * 0.5) * (x / a) else: tmp = (t * (z * -4.5)) / 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) <= -5e-40) || !(Float64(x * y) <= 2e-20)) tmp = Float64(Float64(y * 0.5) * Float64(x / a)); else tmp = Float64(Float64(t * Float64(z * -4.5)) / 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) <= -5e-40) || ~(((x * y) <= 2e-20)))
tmp = (y * 0.5) * (x / a);
else
tmp = (t * (z * -4.5)) / a;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -5e-40], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e-20]], $MachinePrecision]], N[(N[(y * 0.5), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], N[(N[(t * N[(z * -4.5), $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 -5 \cdot 10^{-40} \lor \neg \left(x \cdot y \leq 2 \cdot 10^{-20}\right):\\
\;\;\;\;\left(y \cdot 0.5\right) \cdot \frac{x}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot \left(z \cdot -4.5\right)}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999965e-40 or 1.99999999999999989e-20 < (*.f64 x y) Initial program 85.1%
div-sub78.7%
*-commutative78.7%
div-sub85.1%
cancel-sign-sub-inv85.1%
*-commutative85.1%
fma-define87.2%
distribute-rgt-neg-in87.2%
associate-*r*87.2%
distribute-lft-neg-in87.2%
*-commutative87.2%
distribute-rgt-neg-in87.2%
metadata-eval87.2%
Simplified87.2%
Taylor expanded in x around inf 64.0%
associate-/l*70.6%
Simplified70.6%
associate-*r*70.6%
clear-num70.1%
un-div-inv70.1%
Applied egg-rr70.1%
associate-/r/65.0%
associate-*r/65.0%
*-commutative65.0%
associate-*r*65.1%
Simplified65.1%
if -4.99999999999999965e-40 < (*.f64 x y) < 1.99999999999999989e-20Initial program 95.0%
div-sub95.0%
*-commutative95.0%
div-sub95.0%
cancel-sign-sub-inv95.0%
*-commutative95.0%
fma-define95.0%
distribute-rgt-neg-in95.0%
associate-*r*95.0%
distribute-lft-neg-in95.0%
*-commutative95.0%
distribute-rgt-neg-in95.0%
metadata-eval95.0%
Simplified95.0%
Taylor expanded in x around 0 80.5%
*-commutative80.5%
associate-/l*76.7%
associate-*r*76.8%
*-commutative76.8%
Simplified76.8%
*-commutative76.8%
associate-*r/76.8%
associate-*l/80.6%
Applied egg-rr80.6%
Final simplification72.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 (<= (* x y) -5e-40) (not (<= (* x y) 2e-20))) (* (* y 0.5) (/ x 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) <= -5e-40) || !((x * y) <= 2e-20)) {
tmp = (y * 0.5) * (x / 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) <= (-5d-40)) .or. (.not. ((x * y) <= 2d-20))) then
tmp = (y * 0.5d0) * (x / 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) <= -5e-40) || !((x * y) <= 2e-20)) {
tmp = (y * 0.5) * (x / 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) <= -5e-40) or not ((x * y) <= 2e-20): tmp = (y * 0.5) * (x / 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) <= -5e-40) || !(Float64(x * y) <= 2e-20)) tmp = Float64(Float64(y * 0.5) * Float64(x / 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 (((x * y) <= -5e-40) || ~(((x * y) <= 2e-20)))
tmp = (y * 0.5) * (x / 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], -5e-40], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e-20]], $MachinePrecision]], N[(N[(y * 0.5), $MachinePrecision] * N[(x / a), $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}\;x \cdot y \leq -5 \cdot 10^{-40} \lor \neg \left(x \cdot y \leq 2 \cdot 10^{-20}\right):\\
\;\;\;\;\left(y \cdot 0.5\right) \cdot \frac{x}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -4.99999999999999965e-40 or 1.99999999999999989e-20 < (*.f64 x y) Initial program 85.1%
div-sub78.7%
*-commutative78.7%
div-sub85.1%
cancel-sign-sub-inv85.1%
*-commutative85.1%
fma-define87.2%
distribute-rgt-neg-in87.2%
associate-*r*87.2%
distribute-lft-neg-in87.2%
*-commutative87.2%
distribute-rgt-neg-in87.2%
metadata-eval87.2%
Simplified87.2%
Taylor expanded in x around inf 64.0%
associate-/l*70.6%
Simplified70.6%
associate-*r*70.6%
clear-num70.1%
un-div-inv70.1%
Applied egg-rr70.1%
associate-/r/65.0%
associate-*r/65.0%
*-commutative65.0%
associate-*r*65.1%
Simplified65.1%
if -4.99999999999999965e-40 < (*.f64 x y) < 1.99999999999999989e-20Initial program 95.0%
div-sub95.0%
*-commutative95.0%
div-sub95.0%
cancel-sign-sub-inv95.0%
*-commutative95.0%
fma-define95.0%
distribute-rgt-neg-in95.0%
associate-*r*95.0%
distribute-lft-neg-in95.0%
*-commutative95.0%
distribute-rgt-neg-in95.0%
metadata-eval95.0%
Simplified95.0%
Taylor expanded in x around 0 80.5%
Final simplification72.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) (- INFINITY)) (* (* y 0.5) (/ x a)) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (y * 0.5) * (x / a);
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = (y * 0.5) * (x / a);
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = (y * 0.5) * (x / a) else: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(y * 0.5) * Float64(x / a)); else tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = (y * 0.5) * (x / a);
else
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(N[(y * 0.5), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\left(y \cdot 0.5\right) \cdot \frac{x}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 35.2%
div-sub30.7%
*-commutative30.7%
div-sub35.2%
cancel-sign-sub-inv35.2%
*-commutative35.2%
fma-define44.5%
distribute-rgt-neg-in44.5%
associate-*r*44.5%
distribute-lft-neg-in44.5%
*-commutative44.5%
distribute-rgt-neg-in44.5%
metadata-eval44.5%
Simplified44.5%
Taylor expanded in x around inf 39.8%
associate-/l*84.5%
Simplified84.5%
associate-*r*84.5%
clear-num84.4%
un-div-inv84.4%
Applied egg-rr84.4%
associate-/r/84.5%
associate-*r/84.5%
*-commutative84.5%
associate-*r*84.5%
Simplified84.5%
if -inf.0 < (*.f64 x y) Initial program 94.6%
div-sub91.2%
*-commutative91.2%
div-sub94.6%
cancel-sign-sub-inv94.6%
*-commutative94.6%
fma-define95.0%
distribute-rgt-neg-in95.0%
associate-*r*95.0%
distribute-lft-neg-in95.0%
*-commutative95.0%
distribute-rgt-neg-in95.0%
metadata-eval95.0%
Simplified95.0%
*-commutative95.0%
associate-*r*95.0%
metadata-eval95.0%
distribute-rgt-neg-in95.0%
distribute-lft-neg-in95.0%
fmm-def94.6%
associate-*l*94.6%
Applied egg-rr94.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 (<= z -1.25e+49) (* -4.5 (/ (* z t) a)) (if (<= z 1.9e-142) (* y (/ 0.5 (/ a x))) (* (* t -4.5) (/ 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 (z <= -1.25e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 1.9e-142) {
tmp = y * (0.5 / (a / x));
} else {
tmp = (t * -4.5) * (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 (z <= (-1.25d+49)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (z <= 1.9d-142) then
tmp = y * (0.5d0 / (a / x))
else
tmp = (t * (-4.5d0)) * (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 (z <= -1.25e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 1.9e-142) {
tmp = y * (0.5 / (a / x));
} else {
tmp = (t * -4.5) * (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 z <= -1.25e+49: tmp = -4.5 * ((z * t) / a) elif z <= 1.9e-142: tmp = y * (0.5 / (a / x)) else: tmp = (t * -4.5) * (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 (z <= -1.25e+49) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (z <= 1.9e-142) tmp = Float64(y * Float64(0.5 / Float64(a / x))); else tmp = Float64(Float64(t * -4.5) * 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 (z <= -1.25e+49)
tmp = -4.5 * ((z * t) / a);
elseif (z <= 1.9e-142)
tmp = y * (0.5 / (a / x));
else
tmp = (t * -4.5) * (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[z, -1.25e+49], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.9e-142], N[(y * N[(0.5 / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t * -4.5), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.25 \cdot 10^{+49}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{-142}:\\
\;\;\;\;y \cdot \frac{0.5}{\frac{a}{x}}\\
\mathbf{else}:\\
\;\;\;\;\left(t \cdot -4.5\right) \cdot \frac{z}{a}\\
\end{array}
\end{array}
if z < -1.2500000000000001e49Initial program 85.7%
div-sub80.2%
*-commutative80.2%
div-sub85.7%
cancel-sign-sub-inv85.7%
*-commutative85.7%
fma-define87.7%
distribute-rgt-neg-in87.7%
associate-*r*87.7%
distribute-lft-neg-in87.7%
*-commutative87.7%
distribute-rgt-neg-in87.7%
metadata-eval87.7%
Simplified87.7%
Taylor expanded in x around 0 71.5%
if -1.2500000000000001e49 < z < 1.89999999999999986e-142Initial program 92.2%
div-sub89.5%
*-commutative89.5%
div-sub92.2%
cancel-sign-sub-inv92.2%
*-commutative92.2%
fma-define92.2%
distribute-rgt-neg-in92.2%
associate-*r*92.2%
distribute-lft-neg-in92.2%
*-commutative92.2%
distribute-rgt-neg-in92.2%
metadata-eval92.2%
Simplified92.2%
Taylor expanded in x around inf 69.9%
associate-/l*69.8%
Simplified69.8%
associate-*r*69.8%
clear-num68.9%
un-div-inv68.9%
Applied egg-rr68.9%
associate-/r/65.2%
associate-*r/65.2%
*-commutative65.2%
associate-*r*65.2%
Simplified65.2%
clear-num64.8%
un-div-inv64.8%
Applied egg-rr64.8%
associate-/l*64.8%
Simplified64.8%
if 1.89999999999999986e-142 < z Initial program 88.4%
div-sub85.2%
*-commutative85.2%
div-sub88.4%
cancel-sign-sub-inv88.4%
*-commutative88.4%
fma-define90.6%
distribute-rgt-neg-in90.6%
associate-*r*90.6%
distribute-lft-neg-in90.6%
*-commutative90.6%
distribute-rgt-neg-in90.6%
metadata-eval90.6%
Simplified90.6%
Taylor expanded in x around 0 66.6%
*-commutative66.6%
times-frac66.5%
metadata-eval66.5%
associate-*r/66.6%
associate-*r*66.6%
Applied egg-rr66.6%
Final simplification66.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 (<= z -1.25e+49) (* -4.5 (/ (* z t) a)) (if (<= z 1.9e-142) (* y (/ 0.5 (/ a x))) (* t (* z (/ -4.5 a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.25e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 1.9e-142) {
tmp = y * (0.5 / (a / x));
} else {
tmp = t * (z * (-4.5 / 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 (z <= (-1.25d+49)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (z <= 1.9d-142) then
tmp = y * (0.5d0 / (a / x))
else
tmp = t * (z * ((-4.5d0) / 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 (z <= -1.25e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 1.9e-142) {
tmp = y * (0.5 / (a / x));
} else {
tmp = t * (z * (-4.5 / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if z <= -1.25e+49: tmp = -4.5 * ((z * t) / a) elif z <= 1.9e-142: tmp = y * (0.5 / (a / x)) else: tmp = t * (z * (-4.5 / 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 (z <= -1.25e+49) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (z <= 1.9e-142) tmp = Float64(y * Float64(0.5 / Float64(a / x))); else tmp = Float64(t * Float64(z * Float64(-4.5 / 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 (z <= -1.25e+49)
tmp = -4.5 * ((z * t) / a);
elseif (z <= 1.9e-142)
tmp = y * (0.5 / (a / x));
else
tmp = t * (z * (-4.5 / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.25e+49], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.9e-142], N[(y * N[(0.5 / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.25 \cdot 10^{+49}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{-142}:\\
\;\;\;\;y \cdot \frac{0.5}{\frac{a}{x}}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\end{array}
\end{array}
if z < -1.2500000000000001e49Initial program 85.7%
div-sub80.2%
*-commutative80.2%
div-sub85.7%
cancel-sign-sub-inv85.7%
*-commutative85.7%
fma-define87.7%
distribute-rgt-neg-in87.7%
associate-*r*87.7%
distribute-lft-neg-in87.7%
*-commutative87.7%
distribute-rgt-neg-in87.7%
metadata-eval87.7%
Simplified87.7%
Taylor expanded in x around 0 71.5%
if -1.2500000000000001e49 < z < 1.89999999999999986e-142Initial program 92.2%
div-sub89.5%
*-commutative89.5%
div-sub92.2%
cancel-sign-sub-inv92.2%
*-commutative92.2%
fma-define92.2%
distribute-rgt-neg-in92.2%
associate-*r*92.2%
distribute-lft-neg-in92.2%
*-commutative92.2%
distribute-rgt-neg-in92.2%
metadata-eval92.2%
Simplified92.2%
Taylor expanded in x around inf 69.9%
associate-/l*69.8%
Simplified69.8%
associate-*r*69.8%
clear-num68.9%
un-div-inv68.9%
Applied egg-rr68.9%
associate-/r/65.2%
associate-*r/65.2%
*-commutative65.2%
associate-*r*65.2%
Simplified65.2%
clear-num64.8%
un-div-inv64.8%
Applied egg-rr64.8%
associate-/l*64.8%
Simplified64.8%
if 1.89999999999999986e-142 < z Initial program 88.4%
div-sub85.2%
*-commutative85.2%
div-sub88.4%
cancel-sign-sub-inv88.4%
*-commutative88.4%
fma-define90.6%
distribute-rgt-neg-in90.6%
associate-*r*90.6%
distribute-lft-neg-in90.6%
*-commutative90.6%
distribute-rgt-neg-in90.6%
metadata-eval90.6%
Simplified90.6%
clear-num90.5%
inv-pow90.5%
Applied egg-rr90.5%
unpow-190.5%
associate-/l*90.4%
Simplified90.4%
*-commutative90.6%
associate-*r*90.6%
metadata-eval90.6%
distribute-rgt-neg-in90.6%
distribute-lft-neg-in90.6%
fmm-def88.4%
associate-*l*88.4%
Applied egg-rr88.2%
Taylor expanded in x around 0 66.5%
*-commutative66.5%
*-commutative66.5%
associate-*r/66.6%
associate-*r*66.7%
*-commutative66.7%
*-commutative66.7%
*-commutative66.7%
associate-*l/66.6%
associate-/r/67.1%
associate-/l*66.6%
associate-/r/66.6%
Simplified66.6%
Final simplification66.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 (<= z -1.9e+49) (* -4.5 (/ (* z t) a)) (if (<= z 8.1e-128) (* 0.5 (* x (/ y a))) (* t (* z (/ -4.5 a))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (z <= -1.9e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 8.1e-128) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (z * (-4.5 / 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 (z <= (-1.9d+49)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (z <= 8.1d-128) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = t * (z * ((-4.5d0) / 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 (z <= -1.9e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 8.1e-128) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = t * (z * (-4.5 / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if z <= -1.9e+49: tmp = -4.5 * ((z * t) / a) elif z <= 8.1e-128: tmp = 0.5 * (x * (y / a)) else: tmp = t * (z * (-4.5 / 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 (z <= -1.9e+49) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (z <= 8.1e-128) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(t * Float64(z * Float64(-4.5 / 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 (z <= -1.9e+49)
tmp = -4.5 * ((z * t) / a);
elseif (z <= 8.1e-128)
tmp = 0.5 * (x * (y / a));
else
tmp = t * (z * (-4.5 / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.9e+49], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.1e-128], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(z * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.9 \cdot 10^{+49}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;z \leq 8.1 \cdot 10^{-128}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(z \cdot \frac{-4.5}{a}\right)\\
\end{array}
\end{array}
if z < -1.8999999999999999e49Initial program 85.7%
div-sub80.2%
*-commutative80.2%
div-sub85.7%
cancel-sign-sub-inv85.7%
*-commutative85.7%
fma-define87.7%
distribute-rgt-neg-in87.7%
associate-*r*87.7%
distribute-lft-neg-in87.7%
*-commutative87.7%
distribute-rgt-neg-in87.7%
metadata-eval87.7%
Simplified87.7%
Taylor expanded in x around 0 71.5%
if -1.8999999999999999e49 < z < 8.09999999999999966e-128Initial program 92.5%
div-sub89.9%
*-commutative89.9%
div-sub92.5%
cancel-sign-sub-inv92.5%
*-commutative92.5%
fma-define92.5%
distribute-rgt-neg-in92.5%
associate-*r*92.5%
distribute-lft-neg-in92.5%
*-commutative92.5%
distribute-rgt-neg-in92.5%
metadata-eval92.5%
Simplified92.5%
Taylor expanded in x around inf 70.1%
associate-/l*70.0%
Simplified70.0%
if 8.09999999999999966e-128 < z Initial program 87.9%
div-sub84.5%
*-commutative84.5%
div-sub87.9%
cancel-sign-sub-inv87.9%
*-commutative87.9%
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%
clear-num90.0%
inv-pow90.0%
Applied egg-rr90.0%
unpow-190.0%
associate-/l*90.0%
Simplified90.0%
*-commutative90.2%
associate-*r*90.2%
metadata-eval90.2%
distribute-rgt-neg-in90.2%
distribute-lft-neg-in90.2%
fmm-def87.9%
associate-*l*87.9%
Applied egg-rr87.7%
Taylor expanded in x around 0 67.2%
*-commutative67.2%
*-commutative67.2%
associate-*r/67.3%
associate-*r*67.3%
*-commutative67.3%
*-commutative67.3%
*-commutative67.3%
associate-*l/67.3%
associate-/r/67.8%
associate-/l*67.3%
associate-/r/67.3%
Simplified67.3%
Final simplification69.4%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= z -1.65e+49) (* -4.5 (/ (* z t) a)) (if (<= z 1.56e-125) (* 0.5 (* x (/ y 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 (z <= -1.65e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 1.56e-125) {
tmp = 0.5 * (x * (y / 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 (z <= (-1.65d+49)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (z <= 1.56d-125) then
tmp = 0.5d0 * (x * (y / 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 (z <= -1.65e+49) {
tmp = -4.5 * ((z * t) / a);
} else if (z <= 1.56e-125) {
tmp = 0.5 * (x * (y / 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 z <= -1.65e+49: tmp = -4.5 * ((z * t) / a) elif z <= 1.56e-125: tmp = 0.5 * (x * (y / 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 (z <= -1.65e+49) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (z <= 1.56e-125) tmp = Float64(0.5 * Float64(x * Float64(y / 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 (z <= -1.65e+49)
tmp = -4.5 * ((z * t) / a);
elseif (z <= 1.56e-125)
tmp = 0.5 * (x * (y / 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[z, -1.65e+49], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.56e-125], N[(0.5 * N[(x * N[(y / 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}\;z \leq -1.65 \cdot 10^{+49}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;z \leq 1.56 \cdot 10^{-125}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if z < -1.6499999999999999e49Initial program 85.7%
div-sub80.2%
*-commutative80.2%
div-sub85.7%
cancel-sign-sub-inv85.7%
*-commutative85.7%
fma-define87.7%
distribute-rgt-neg-in87.7%
associate-*r*87.7%
distribute-lft-neg-in87.7%
*-commutative87.7%
distribute-rgt-neg-in87.7%
metadata-eval87.7%
Simplified87.7%
Taylor expanded in x around 0 71.5%
if -1.6499999999999999e49 < z < 1.5599999999999999e-125Initial program 92.5%
div-sub89.9%
*-commutative89.9%
div-sub92.5%
cancel-sign-sub-inv92.5%
*-commutative92.5%
fma-define92.5%
distribute-rgt-neg-in92.5%
associate-*r*92.5%
distribute-lft-neg-in92.5%
*-commutative92.5%
distribute-rgt-neg-in92.5%
metadata-eval92.5%
Simplified92.5%
Taylor expanded in x around inf 70.1%
associate-/l*70.0%
Simplified70.0%
if 1.5599999999999999e-125 < z Initial program 87.9%
div-sub84.5%
*-commutative84.5%
div-sub87.9%
cancel-sign-sub-inv87.9%
*-commutative87.9%
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 0 67.2%
associate-/l*67.3%
Simplified67.3%
Final simplification69.4%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -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 89.5%
div-sub86.0%
*-commutative86.0%
div-sub89.5%
cancel-sign-sub-inv89.5%
*-commutative89.5%
fma-define90.7%
distribute-rgt-neg-in90.7%
associate-*r*90.7%
distribute-lft-neg-in90.7%
*-commutative90.7%
distribute-rgt-neg-in90.7%
metadata-eval90.7%
Simplified90.7%
Taylor expanded in x around 0 54.0%
associate-*r/54.0%
associate-*r*54.0%
associate-*l/54.8%
associate-*r/54.8%
associate-*l*54.8%
Simplified54.8%
Final simplification54.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 89.5%
div-sub86.0%
*-commutative86.0%
div-sub89.5%
cancel-sign-sub-inv89.5%
*-commutative89.5%
fma-define90.7%
distribute-rgt-neg-in90.7%
associate-*r*90.7%
distribute-lft-neg-in90.7%
*-commutative90.7%
distribute-rgt-neg-in90.7%
metadata-eval90.7%
Simplified90.7%
Taylor expanded in x around 0 54.0%
associate-/l*52.5%
Simplified52.5%
(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 2024163
(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)))