
(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 9 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 (* (* z 9.0) t)))
(if (<= t_1 (- INFINITY))
(* (/ t a) (* z -4.5))
(if (<= t_1 1e+249)
(/ (- (* x y) t_1) (* a 2.0))
(* -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 t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (t / a) * (z * -4.5);
} else if (t_1 <= 1e+249) {
tmp = ((x * y) - t_1) / (a * 2.0);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = (t / a) * (z * -4.5);
} else if (t_1 <= 1e+249) {
tmp = ((x * y) - t_1) / (a * 2.0);
} 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): t_1 = (z * 9.0) * t tmp = 0 if t_1 <= -math.inf: tmp = (t / a) * (z * -4.5) elif t_1 <= 1e+249: tmp = ((x * y) - t_1) / (a * 2.0) 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) t_1 = Float64(Float64(z * 9.0) * t) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(t / a) * Float64(z * -4.5)); elseif (t_1 <= 1e+249) tmp = Float64(Float64(Float64(x * y) - t_1) / Float64(a * 2.0)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (z * 9.0) * t;
tmp = 0.0;
if (t_1 <= -Inf)
tmp = (t / a) * (z * -4.5);
elseif (t_1 <= 1e+249)
tmp = ((x * y) - t_1) / (a * 2.0);
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_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+249], N[(N[(N[(x * y), $MachinePrecision] - t$95$1), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -\infty:\\
\;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\
\mathbf{elif}\;t_1 \leq 10^{+249}:\\
\;\;\;\;\frac{x \cdot y - t_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < -inf.0Initial program 64.7%
associate-*l*64.7%
Simplified64.7%
Taylor expanded in x around 0 64.7%
*-commutative64.7%
times-frac64.7%
associate-*l/99.9%
metadata-eval99.9%
associate-*l*99.9%
Applied egg-rr99.9%
if -inf.0 < (*.f64 (*.f64 z 9) t) < 9.9999999999999992e248Initial program 95.4%
if 9.9999999999999992e248 < (*.f64 (*.f64 z 9) t) Initial program 68.4%
associate-*l*68.5%
Simplified68.5%
Taylor expanded in x around 0 74.3%
associate-/l*99.8%
associate-/r/100.0%
Simplified100.0%
Final simplification96.0%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* -4.5 (* z (/ t a)))) (t_2 (* 0.5 (/ y (/ a x)))))
(if (<= (* x y) -1e+61)
t_2
(if (<= (* x y) -1e+21)
t_1
(if (<= (* x y) -5e-26)
(* 0.5 (* y (/ x a)))
(if (<= (* x y) 5e-91)
(* (/ -4.5 a) (* z t))
(if (<= (* x y) 5e+18)
(/ 0.5 (/ a (* x y)))
(if (<= (* x y) 5e+117) t_1 t_2))))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = -4.5 * (z * (t / a));
double t_2 = 0.5 * (y / (a / x));
double tmp;
if ((x * y) <= -1e+61) {
tmp = t_2;
} else if ((x * y) <= -1e+21) {
tmp = t_1;
} else if ((x * y) <= -5e-26) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e-91) {
tmp = (-4.5 / a) * (z * t);
} else if ((x * y) <= 5e+18) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+117) {
tmp = t_1;
} else {
tmp = t_2;
}
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 = (-4.5d0) * (z * (t / a))
t_2 = 0.5d0 * (y / (a / x))
if ((x * y) <= (-1d+61)) then
tmp = t_2
else if ((x * y) <= (-1d+21)) then
tmp = t_1
else if ((x * y) <= (-5d-26)) then
tmp = 0.5d0 * (y * (x / a))
else if ((x * y) <= 5d-91) then
tmp = ((-4.5d0) / a) * (z * t)
else if ((x * y) <= 5d+18) then
tmp = 0.5d0 / (a / (x * y))
else if ((x * y) <= 5d+117) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = -4.5 * (z * (t / a));
double t_2 = 0.5 * (y / (a / x));
double tmp;
if ((x * y) <= -1e+61) {
tmp = t_2;
} else if ((x * y) <= -1e+21) {
tmp = t_1;
} else if ((x * y) <= -5e-26) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e-91) {
tmp = (-4.5 / a) * (z * t);
} else if ((x * y) <= 5e+18) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+117) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = -4.5 * (z * (t / a)) t_2 = 0.5 * (y / (a / x)) tmp = 0 if (x * y) <= -1e+61: tmp = t_2 elif (x * y) <= -1e+21: tmp = t_1 elif (x * y) <= -5e-26: tmp = 0.5 * (y * (x / a)) elif (x * y) <= 5e-91: tmp = (-4.5 / a) * (z * t) elif (x * y) <= 5e+18: tmp = 0.5 / (a / (x * y)) elif (x * y) <= 5e+117: tmp = t_1 else: tmp = t_2 return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(-4.5 * Float64(z * Float64(t / a))) t_2 = Float64(0.5 * Float64(y / Float64(a / x))) tmp = 0.0 if (Float64(x * y) <= -1e+61) tmp = t_2; elseif (Float64(x * y) <= -1e+21) tmp = t_1; elseif (Float64(x * y) <= -5e-26) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (Float64(x * y) <= 5e-91) tmp = Float64(Float64(-4.5 / a) * Float64(z * t)); elseif (Float64(x * y) <= 5e+18) tmp = Float64(0.5 / Float64(a / Float64(x * y))); elseif (Float64(x * y) <= 5e+117) tmp = t_1; else tmp = t_2; end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = -4.5 * (z * (t / a));
t_2 = 0.5 * (y / (a / x));
tmp = 0.0;
if ((x * y) <= -1e+61)
tmp = t_2;
elseif ((x * y) <= -1e+21)
tmp = t_1;
elseif ((x * y) <= -5e-26)
tmp = 0.5 * (y * (x / a));
elseif ((x * y) <= 5e-91)
tmp = (-4.5 / a) * (z * t);
elseif ((x * y) <= 5e+18)
tmp = 0.5 / (a / (x * y));
elseif ((x * y) <= 5e+117)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+61], t$95$2, If[LessEqual[N[(x * y), $MachinePrecision], -1e+21], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -5e-26], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-91], N[(N[(-4.5 / a), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+18], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+117], t$95$1, t$95$2]]]]]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := -4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
t_2 := 0.5 \cdot \frac{y}{\frac{a}{x}}\\
\mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+61}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{+21}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-26}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-91}:\\
\;\;\;\;\frac{-4.5}{a} \cdot \left(z \cdot t\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+18}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+117}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999949e60 or 4.99999999999999983e117 < (*.f64 x y) Initial program 86.1%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in a around 0 86.1%
associate-*r/86.1%
cancel-sign-sub-inv86.1%
metadata-eval86.1%
+-commutative86.1%
associate-/l*86.0%
+-commutative86.0%
metadata-eval86.0%
cancel-sign-sub-inv86.0%
fma-neg87.0%
*-commutative87.0%
distribute-lft-neg-in87.0%
metadata-eval87.0%
*-commutative87.0%
*-commutative87.0%
associate-*l*87.0%
Simplified87.0%
Taylor expanded in x around inf 74.4%
associate-/l*80.4%
associate-/r/81.3%
Simplified81.3%
*-commutative81.3%
clear-num81.2%
un-div-inv81.4%
Applied egg-rr81.4%
if -9.99999999999999949e60 < (*.f64 x y) < -1e21 or 5e18 < (*.f64 x y) < 4.99999999999999983e117Initial program 86.4%
associate-*l*86.5%
Simplified86.5%
Taylor expanded in x around 0 57.6%
associate-/l*66.1%
associate-/r/66.3%
Simplified66.3%
if -1e21 < (*.f64 x y) < -5.00000000000000019e-26Initial program 99.7%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in a around 0 99.4%
associate-*r/99.4%
cancel-sign-sub-inv99.4%
metadata-eval99.4%
+-commutative99.4%
associate-/l*99.3%
+-commutative99.3%
metadata-eval99.3%
cancel-sign-sub-inv99.3%
fma-neg99.4%
*-commutative99.4%
distribute-lft-neg-in99.4%
metadata-eval99.4%
*-commutative99.4%
*-commutative99.4%
associate-*l*99.3%
Simplified99.3%
Taylor expanded in x around inf 71.0%
associate-/l*70.9%
associate-/r/62.4%
Simplified62.4%
if -5.00000000000000019e-26 < (*.f64 x y) < 4.99999999999999997e-91Initial program 95.4%
associate-*l*95.4%
Simplified95.4%
Taylor expanded in x around 0 88.0%
associate-/l*88.3%
associate-/r/79.7%
Simplified79.7%
associate-*l/88.0%
associate-*r/88.0%
Applied egg-rr88.0%
associate-/l*87.6%
associate-/r/88.0%
Applied egg-rr88.0%
if 4.99999999999999997e-91 < (*.f64 x y) < 5e18Initial program 99.7%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in a around 0 99.8%
associate-*r/99.8%
cancel-sign-sub-inv99.8%
metadata-eval99.8%
+-commutative99.8%
associate-/l*99.8%
+-commutative99.8%
metadata-eval99.8%
cancel-sign-sub-inv99.8%
fma-neg99.8%
*-commutative99.8%
distribute-lft-neg-in99.8%
metadata-eval99.8%
*-commutative99.8%
*-commutative99.8%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in x around inf 67.4%
Final simplification81.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* 0.5 (/ y (/ a x)))))
(if (<= (* x y) -1e+61)
t_1
(if (<= (* x y) -1e+21)
(/ z (/ (* a -0.2222222222222222) t))
(if (<= (* x y) -5e-26)
(* 0.5 (* y (/ x a)))
(if (<= (* x y) 5e-91)
(* (/ -4.5 a) (* z t))
(if (<= (* x y) 5e+18)
(/ 0.5 (/ a (* x y)))
(if (<= (* x y) 5e+117) (* -4.5 (* z (/ t 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 / (a / x));
double tmp;
if ((x * y) <= -1e+61) {
tmp = t_1;
} else if ((x * y) <= -1e+21) {
tmp = z / ((a * -0.2222222222222222) / t);
} else if ((x * y) <= -5e-26) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e-91) {
tmp = (-4.5 / a) * (z * t);
} else if ((x * y) <= 5e+18) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+117) {
tmp = -4.5 * (z * (t / 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 / (a / x))
if ((x * y) <= (-1d+61)) then
tmp = t_1
else if ((x * y) <= (-1d+21)) then
tmp = z / ((a * (-0.2222222222222222d0)) / t)
else if ((x * y) <= (-5d-26)) then
tmp = 0.5d0 * (y * (x / a))
else if ((x * y) <= 5d-91) then
tmp = ((-4.5d0) / a) * (z * t)
else if ((x * y) <= 5d+18) then
tmp = 0.5d0 / (a / (x * y))
else if ((x * y) <= 5d+117) then
tmp = (-4.5d0) * (z * (t / 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 / (a / x));
double tmp;
if ((x * y) <= -1e+61) {
tmp = t_1;
} else if ((x * y) <= -1e+21) {
tmp = z / ((a * -0.2222222222222222) / t);
} else if ((x * y) <= -5e-26) {
tmp = 0.5 * (y * (x / a));
} else if ((x * y) <= 5e-91) {
tmp = (-4.5 / a) * (z * t);
} else if ((x * y) <= 5e+18) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+117) {
tmp = -4.5 * (z * (t / 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 / (a / x)) tmp = 0 if (x * y) <= -1e+61: tmp = t_1 elif (x * y) <= -1e+21: tmp = z / ((a * -0.2222222222222222) / t) elif (x * y) <= -5e-26: tmp = 0.5 * (y * (x / a)) elif (x * y) <= 5e-91: tmp = (-4.5 / a) * (z * t) elif (x * y) <= 5e+18: tmp = 0.5 / (a / (x * y)) elif (x * y) <= 5e+117: tmp = -4.5 * (z * (t / 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(a / x))) tmp = 0.0 if (Float64(x * y) <= -1e+61) tmp = t_1; elseif (Float64(x * y) <= -1e+21) tmp = Float64(z / Float64(Float64(a * -0.2222222222222222) / t)); elseif (Float64(x * y) <= -5e-26) tmp = Float64(0.5 * Float64(y * Float64(x / a))); elseif (Float64(x * y) <= 5e-91) tmp = Float64(Float64(-4.5 / a) * Float64(z * t)); elseif (Float64(x * y) <= 5e+18) tmp = Float64(0.5 / Float64(a / Float64(x * y))); elseif (Float64(x * y) <= 5e+117) tmp = Float64(-4.5 * Float64(z * Float64(t / 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 / (a / x));
tmp = 0.0;
if ((x * y) <= -1e+61)
tmp = t_1;
elseif ((x * y) <= -1e+21)
tmp = z / ((a * -0.2222222222222222) / t);
elseif ((x * y) <= -5e-26)
tmp = 0.5 * (y * (x / a));
elseif ((x * y) <= 5e-91)
tmp = (-4.5 / a) * (z * t);
elseif ((x * y) <= 5e+18)
tmp = 0.5 / (a / (x * y));
elseif ((x * y) <= 5e+117)
tmp = -4.5 * (z * (t / 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[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1e+61], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -1e+21], N[(z / N[(N[(a * -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -5e-26], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-91], N[(N[(-4.5 / a), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+18], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+117], N[(-4.5 * N[(z * N[(t / 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 \frac{y}{\frac{a}{x}}\\
\mathbf{if}\;x \cdot y \leq -1 \cdot 10^{+61}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;x \cdot y \leq -1 \cdot 10^{+21}:\\
\;\;\;\;\frac{z}{\frac{a \cdot -0.2222222222222222}{t}}\\
\mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-26}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-91}:\\
\;\;\;\;\frac{-4.5}{a} \cdot \left(z \cdot t\right)\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+18}:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+117}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999949e60 or 4.99999999999999983e117 < (*.f64 x y) Initial program 86.1%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in a around 0 86.1%
associate-*r/86.1%
cancel-sign-sub-inv86.1%
metadata-eval86.1%
+-commutative86.1%
associate-/l*86.0%
+-commutative86.0%
metadata-eval86.0%
cancel-sign-sub-inv86.0%
fma-neg87.0%
*-commutative87.0%
distribute-lft-neg-in87.0%
metadata-eval87.0%
*-commutative87.0%
*-commutative87.0%
associate-*l*87.0%
Simplified87.0%
Taylor expanded in x around inf 74.4%
associate-/l*80.4%
associate-/r/81.3%
Simplified81.3%
*-commutative81.3%
clear-num81.2%
un-div-inv81.4%
Applied egg-rr81.4%
if -9.99999999999999949e60 < (*.f64 x y) < -1e21Initial program 89.7%
associate-*l*89.7%
Simplified89.7%
Taylor expanded in x around 0 54.2%
*-commutative54.2%
associate-/r/54.1%
*-commutative54.1%
associate-/l*53.7%
div-inv53.7%
metadata-eval53.7%
Applied egg-rr53.7%
if -1e21 < (*.f64 x y) < -5.00000000000000019e-26Initial program 99.7%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in a around 0 99.4%
associate-*r/99.4%
cancel-sign-sub-inv99.4%
metadata-eval99.4%
+-commutative99.4%
associate-/l*99.3%
+-commutative99.3%
metadata-eval99.3%
cancel-sign-sub-inv99.3%
fma-neg99.4%
*-commutative99.4%
distribute-lft-neg-in99.4%
metadata-eval99.4%
*-commutative99.4%
*-commutative99.4%
associate-*l*99.3%
Simplified99.3%
Taylor expanded in x around inf 71.0%
associate-/l*70.9%
associate-/r/62.4%
Simplified62.4%
if -5.00000000000000019e-26 < (*.f64 x y) < 4.99999999999999997e-91Initial program 95.4%
associate-*l*95.4%
Simplified95.4%
Taylor expanded in x around 0 88.0%
associate-/l*88.3%
associate-/r/79.7%
Simplified79.7%
associate-*l/88.0%
associate-*r/88.0%
Applied egg-rr88.0%
associate-/l*87.6%
associate-/r/88.0%
Applied egg-rr88.0%
if 4.99999999999999997e-91 < (*.f64 x y) < 5e18Initial program 99.7%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in a around 0 99.8%
associate-*r/99.8%
cancel-sign-sub-inv99.8%
metadata-eval99.8%
+-commutative99.8%
associate-/l*99.8%
+-commutative99.8%
metadata-eval99.8%
cancel-sign-sub-inv99.8%
fma-neg99.8%
*-commutative99.8%
distribute-lft-neg-in99.8%
metadata-eval99.8%
*-commutative99.8%
*-commutative99.8%
associate-*l*99.7%
Simplified99.7%
Taylor expanded in x around inf 67.4%
if 5e18 < (*.f64 x y) < 4.99999999999999983e117Initial program 84.0%
associate-*l*84.1%
Simplified84.1%
Taylor expanded in x around 0 60.1%
associate-/l*67.9%
associate-/r/75.7%
Simplified75.7%
Final simplification81.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 (/ (- (* 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) {
return ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
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 = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
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 ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return ((x * y) - (z * (9.0 * t))) / (a * 2.0)
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
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[(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])\\
\\
\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}
\end{array}
Initial program 91.6%
associate-*l*91.6%
Simplified91.6%
Final simplification91.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 (or (<= y -4.9e-70) (not (<= y 5.5e+56))) (* 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 <= -4.9e-70) || !(y <= 5.5e+56)) {
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 <= (-4.9d-70)) .or. (.not. (y <= 5.5d+56))) 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 <= -4.9e-70) || !(y <= 5.5e+56)) {
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 <= -4.9e-70) or not (y <= 5.5e+56): 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 <= -4.9e-70) || !(y <= 5.5e+56)) 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 <= -4.9e-70) || ~((y <= 5.5e+56)))
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, -4.9e-70], N[Not[LessEqual[y, 5.5e+56]], $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 -4.9 \cdot 10^{-70} \lor \neg \left(y \leq 5.5 \cdot 10^{+56}\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 < -4.9e-70 or 5.5000000000000002e56 < y Initial program 89.9%
associate-*l*89.9%
Simplified89.9%
Taylor expanded in x around inf 63.6%
associate-*r/66.6%
Simplified66.6%
if -4.9e-70 < y < 5.5000000000000002e56Initial program 93.5%
associate-*l*93.5%
Simplified93.5%
Taylor expanded in x around 0 77.1%
Final simplification71.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 (or (<= y -2.8e-70) (not (<= y 5.7e+56))) (* 0.5 (* y (/ 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 ((y <= -2.8e-70) || !(y <= 5.7e+56)) {
tmp = 0.5 * (y * (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 ((y <= (-2.8d-70)) .or. (.not. (y <= 5.7d+56))) then
tmp = 0.5d0 * (y * (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 ((y <= -2.8e-70) || !(y <= 5.7e+56)) {
tmp = 0.5 * (y * (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 (y <= -2.8e-70) or not (y <= 5.7e+56): tmp = 0.5 * (y * (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 ((y <= -2.8e-70) || !(y <= 5.7e+56)) tmp = Float64(0.5 * Float64(y * 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 ((y <= -2.8e-70) || ~((y <= 5.7e+56)))
tmp = 0.5 * (y * (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[y, -2.8e-70], N[Not[LessEqual[y, 5.7e+56]], $MachinePrecision]], N[(0.5 * N[(y * N[(x / 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^{-70} \lor \neg \left(y \leq 5.7 \cdot 10^{+56}\right):\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if y < -2.7999999999999999e-70 or 5.7000000000000002e56 < y Initial program 89.9%
associate-*l*89.9%
Simplified89.9%
Taylor expanded in a around 0 89.9%
associate-*r/89.9%
cancel-sign-sub-inv89.9%
metadata-eval89.9%
+-commutative89.9%
associate-/l*89.7%
+-commutative89.7%
metadata-eval89.7%
cancel-sign-sub-inv89.7%
fma-neg90.5%
*-commutative90.5%
distribute-lft-neg-in90.5%
metadata-eval90.5%
*-commutative90.5%
*-commutative90.5%
associate-*l*90.5%
Simplified90.5%
Taylor expanded in x around inf 63.6%
associate-/l*65.5%
associate-/r/65.5%
Simplified65.5%
if -2.7999999999999999e-70 < y < 5.7000000000000002e56Initial program 93.5%
associate-*l*93.5%
Simplified93.5%
Taylor expanded in x around 0 77.1%
Final simplification71.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= y -1.2e-68) (not (<= y 4.7e+56))) (* 0.5 (/ y (/ a x))) (* -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 <= -1.2e-68) || !(y <= 4.7e+56)) {
tmp = 0.5 * (y / (a / x));
} 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 <= (-1.2d-68)) .or. (.not. (y <= 4.7d+56))) then
tmp = 0.5d0 * (y / (a / x))
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 <= -1.2e-68) || !(y <= 4.7e+56)) {
tmp = 0.5 * (y / (a / x));
} 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 <= -1.2e-68) or not (y <= 4.7e+56): tmp = 0.5 * (y / (a / x)) 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 <= -1.2e-68) || !(y <= 4.7e+56)) tmp = Float64(0.5 * Float64(y / Float64(a / x))); 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 <= -1.2e-68) || ~((y <= 4.7e+56)))
tmp = 0.5 * (y / (a / x));
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, -1.2e-68], N[Not[LessEqual[y, 4.7e+56]], $MachinePrecision]], N[(0.5 * N[(y / N[(a / x), $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 -1.2 \cdot 10^{-68} \lor \neg \left(y \leq 4.7 \cdot 10^{+56}\right):\\
\;\;\;\;0.5 \cdot \frac{y}{\frac{a}{x}}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if y < -1.19999999999999996e-68 or 4.7e56 < y Initial program 89.9%
associate-*l*89.9%
Simplified89.9%
Taylor expanded in a around 0 89.9%
associate-*r/89.9%
cancel-sign-sub-inv89.9%
metadata-eval89.9%
+-commutative89.9%
associate-/l*89.7%
+-commutative89.7%
metadata-eval89.7%
cancel-sign-sub-inv89.7%
fma-neg90.5%
*-commutative90.5%
distribute-lft-neg-in90.5%
metadata-eval90.5%
*-commutative90.5%
*-commutative90.5%
associate-*l*90.5%
Simplified90.5%
Taylor expanded in x around inf 63.6%
associate-/l*65.5%
associate-/r/65.5%
Simplified65.5%
*-commutative65.5%
clear-num64.9%
un-div-inv65.0%
Applied egg-rr65.0%
if -1.19999999999999996e-68 < y < 4.7e56Initial program 93.5%
associate-*l*93.5%
Simplified93.5%
Taylor expanded in x around 0 77.1%
Final simplification70.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 (or (<= y -4.1e-73) (not (<= y 4.6e+57))) (* 0.5 (/ y (/ a x))) (* (/ -4.5 a) (* z t))))
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 <= -4.1e-73) || !(y <= 4.6e+57)) {
tmp = 0.5 * (y / (a / x));
} else {
tmp = (-4.5 / a) * (z * t);
}
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 <= (-4.1d-73)) .or. (.not. (y <= 4.6d+57))) then
tmp = 0.5d0 * (y / (a / x))
else
tmp = ((-4.5d0) / a) * (z * t)
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 <= -4.1e-73) || !(y <= 4.6e+57)) {
tmp = 0.5 * (y / (a / x));
} else {
tmp = (-4.5 / a) * (z * t);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (y <= -4.1e-73) or not (y <= 4.6e+57): tmp = 0.5 * (y / (a / x)) else: tmp = (-4.5 / a) * (z * t) 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 <= -4.1e-73) || !(y <= 4.6e+57)) tmp = Float64(0.5 * Float64(y / Float64(a / x))); else tmp = Float64(Float64(-4.5 / a) * Float64(z * t)); 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 <= -4.1e-73) || ~((y <= 4.6e+57)))
tmp = 0.5 * (y / (a / x));
else
tmp = (-4.5 / a) * (z * t);
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, -4.1e-73], N[Not[LessEqual[y, 4.6e+57]], $MachinePrecision]], N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.5 / a), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -4.1 \cdot 10^{-73} \lor \neg \left(y \leq 4.6 \cdot 10^{+57}\right):\\
\;\;\;\;0.5 \cdot \frac{y}{\frac{a}{x}}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4.5}{a} \cdot \left(z \cdot t\right)\\
\end{array}
\end{array}
if y < -4.10000000000000016e-73 or 4.5999999999999998e57 < y Initial program 90.0%
associate-*l*90.0%
Simplified90.0%
Taylor expanded in a around 0 90.0%
associate-*r/90.0%
cancel-sign-sub-inv90.0%
metadata-eval90.0%
+-commutative90.0%
associate-/l*89.6%
+-commutative89.6%
metadata-eval89.6%
cancel-sign-sub-inv89.6%
fma-neg90.4%
*-commutative90.4%
distribute-lft-neg-in90.4%
metadata-eval90.4%
*-commutative90.4%
*-commutative90.4%
associate-*l*90.3%
Simplified90.3%
Taylor expanded in x around inf 63.8%
associate-/l*65.7%
associate-/r/65.7%
Simplified65.7%
*-commutative65.7%
clear-num65.1%
un-div-inv65.2%
Applied egg-rr65.2%
if -4.10000000000000016e-73 < y < 4.5999999999999998e57Initial program 93.4%
associate-*l*93.4%
Simplified93.4%
Taylor expanded in x around 0 77.6%
associate-/l*79.1%
associate-/r/74.0%
Simplified74.0%
associate-*l/77.6%
associate-*r/77.5%
Applied egg-rr77.5%
associate-/l*77.5%
associate-/r/77.6%
Applied egg-rr77.6%
Final simplification71.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = (-4.5d0) * (z * (t / a))
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 91.6%
associate-*l*91.6%
Simplified91.6%
Taylor expanded in x around 0 55.1%
associate-/l*56.6%
associate-/r/54.3%
Simplified54.3%
Final simplification54.3%
(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 2023331
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:herbie-target
(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)))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))