
(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 7 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 and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 -4e+303)
(fma (/ x 2.0) (/ y a) (* (* t -4.5) (/ z a)))
(if (<= t_1 5e+217)
(+ (* (* x y) (/ 0.5 a)) (* (/ 0.5 a) (* z (* t -9.0))))
(fma (/ x 2.0) (/ y a) (/ (* t -4.5) (/ a z)))))))assert(x < y);
assert(z < t);
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 <= -4e+303) {
tmp = fma((x / 2.0), (y / a), ((t * -4.5) * (z / a)));
} else if (t_1 <= 5e+217) {
tmp = ((x * y) * (0.5 / a)) + ((0.5 / a) * (z * (t * -9.0)));
} else {
tmp = fma((x / 2.0), (y / a), ((t * -4.5) / (a / z)));
}
return tmp;
}
x, y = sort([x, y]) z, t = sort([z, t]) 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 <= -4e+303) tmp = fma(Float64(x / 2.0), Float64(y / a), Float64(Float64(t * -4.5) * Float64(z / a))); elseif (t_1 <= 5e+217) tmp = Float64(Float64(Float64(x * y) * Float64(0.5 / a)) + Float64(Float64(0.5 / a) * Float64(z * Float64(t * -9.0)))); else tmp = fma(Float64(x / 2.0), Float64(y / a), Float64(Float64(t * -4.5) / Float64(a / z))); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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, -4e+303], N[(N[(x / 2.0), $MachinePrecision] * N[(y / a), $MachinePrecision] + N[(N[(t * -4.5), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+217], N[(N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision] + N[(N[(0.5 / a), $MachinePrecision] * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / 2.0), $MachinePrecision] * N[(y / a), $MachinePrecision] + N[(N[(t * -4.5), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -4 \cdot 10^{+303}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{2}, \frac{y}{a}, \left(t \cdot -4.5\right) \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t_1 \leq 5 \cdot 10^{+217}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a} + \frac{0.5}{a} \cdot \left(z \cdot \left(t \cdot -9\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{2}, \frac{y}{a}, \frac{t \cdot -4.5}{\frac{a}{z}}\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -4e303Initial program 70.7%
*-commutative70.7%
*-commutative70.7%
associate-*l*70.7%
Simplified70.7%
div-sub67.6%
sub-neg67.6%
*-commutative67.6%
times-frac88.3%
div-inv88.3%
associate-*r*88.3%
*-commutative88.3%
associate-*l*88.3%
*-commutative88.3%
associate-/r*88.3%
metadata-eval88.3%
Applied egg-rr88.3%
fma-def88.3%
associate-*r/88.3%
distribute-neg-frac88.3%
*-commutative88.3%
associate-*l*88.3%
distribute-rgt-neg-in88.3%
metadata-eval88.3%
metadata-eval88.3%
associate-*l/88.3%
*-commutative88.3%
associate-/l*96.7%
associate-*l/96.7%
Simplified96.7%
div-inv96.6%
clear-num96.7%
Applied egg-rr96.7%
if -4e303 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 5.00000000000000041e217Initial program 98.5%
*-commutative98.5%
*-commutative98.5%
associate-*l*98.6%
Simplified98.6%
Taylor expanded in a around 0 99.1%
associate-*r/99.1%
cancel-sign-sub-inv99.1%
metadata-eval99.1%
+-commutative99.1%
associate-/l*98.4%
+-commutative98.4%
metadata-eval98.4%
cancel-sign-sub-inv98.4%
fma-neg98.4%
*-commutative98.4%
distribute-lft-neg-in98.4%
metadata-eval98.4%
*-commutative98.4%
associate-*l*98.4%
Simplified98.4%
associate-/r/99.1%
associate-*r*99.1%
metadata-eval99.1%
distribute-rgt-neg-in99.1%
*-commutative99.1%
fma-def99.1%
distribute-lft-in99.1%
*-commutative99.1%
distribute-rgt-neg-in99.1%
metadata-eval99.1%
associate-*r*99.1%
Applied egg-rr99.1%
if 5.00000000000000041e217 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 78.4%
*-commutative78.4%
*-commutative78.4%
associate-*l*78.3%
Simplified78.3%
div-sub68.8%
sub-neg68.8%
*-commutative68.8%
times-frac81.3%
div-inv81.2%
associate-*r*81.2%
*-commutative81.2%
associate-*l*81.3%
*-commutative81.3%
associate-/r*81.3%
metadata-eval81.3%
Applied egg-rr81.3%
fma-def83.2%
associate-*r/83.2%
distribute-neg-frac83.2%
*-commutative83.2%
associate-*l*83.2%
distribute-rgt-neg-in83.2%
metadata-eval83.2%
metadata-eval83.2%
associate-*l/83.2%
*-commutative83.2%
associate-/l*88.5%
associate-*l/88.4%
Simplified88.4%
Final simplification96.6%
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (or (<= t_1 -4e+303) (not (<= t_1 5e+262)))
(fma (/ x 2.0) (/ y a) (* (* t -4.5) (/ z a)))
(+ (* (* x y) (/ 0.5 a)) (* (/ 0.5 a) (* z (* t -9.0)))))))assert(x < y);
assert(z < t);
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 <= -4e+303) || !(t_1 <= 5e+262)) {
tmp = fma((x / 2.0), (y / a), ((t * -4.5) * (z / a)));
} else {
tmp = ((x * y) * (0.5 / a)) + ((0.5 / a) * (z * (t * -9.0)));
}
return tmp;
}
x, y = sort([x, y]) z, t = sort([z, t]) 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 <= -4e+303) || !(t_1 <= 5e+262)) tmp = fma(Float64(x / 2.0), Float64(y / a), Float64(Float64(t * -4.5) * Float64(z / a))); else tmp = Float64(Float64(Float64(x * y) * Float64(0.5 / a)) + Float64(Float64(0.5 / a) * Float64(z * Float64(t * -9.0)))); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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[Or[LessEqual[t$95$1, -4e+303], N[Not[LessEqual[t$95$1, 5e+262]], $MachinePrecision]], N[(N[(x / 2.0), $MachinePrecision] * N[(y / a), $MachinePrecision] + N[(N[(t * -4.5), $MachinePrecision] * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision] + N[(N[(0.5 / a), $MachinePrecision] * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -4 \cdot 10^{+303} \lor \neg \left(t_1 \leq 5 \cdot 10^{+262}\right):\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{2}, \frac{y}{a}, \left(t \cdot -4.5\right) \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a} + \frac{0.5}{a} \cdot \left(z \cdot \left(t \cdot -9\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -4e303 or 5.00000000000000008e262 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 73.3%
*-commutative73.3%
*-commutative73.3%
associate-*l*73.3%
Simplified73.3%
div-sub65.6%
sub-neg65.6%
*-commutative65.6%
times-frac82.5%
div-inv82.5%
associate-*r*82.5%
*-commutative82.5%
associate-*l*82.5%
*-commutative82.5%
associate-/r*82.5%
metadata-eval82.5%
Applied egg-rr82.5%
fma-def83.8%
associate-*r/83.8%
distribute-neg-frac83.8%
*-commutative83.8%
associate-*l*83.8%
distribute-rgt-neg-in83.8%
metadata-eval83.8%
metadata-eval83.8%
associate-*l/83.8%
*-commutative83.8%
associate-/l*90.9%
associate-*l/90.8%
Simplified90.8%
div-inv90.8%
clear-num90.8%
Applied egg-rr90.8%
if -4e303 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 5.00000000000000008e262Initial program 98.6%
*-commutative98.6%
*-commutative98.6%
associate-*l*98.6%
Simplified98.6%
Taylor expanded in a around 0 99.1%
associate-*r/99.1%
cancel-sign-sub-inv99.1%
metadata-eval99.1%
+-commutative99.1%
associate-/l*98.4%
+-commutative98.4%
metadata-eval98.4%
cancel-sign-sub-inv98.4%
fma-neg98.5%
*-commutative98.5%
distribute-lft-neg-in98.5%
metadata-eval98.5%
*-commutative98.5%
associate-*l*98.4%
Simplified98.4%
associate-/r/99.1%
associate-*r*99.1%
metadata-eval99.1%
distribute-rgt-neg-in99.1%
*-commutative99.1%
fma-def99.1%
distribute-lft-in99.1%
*-commutative99.1%
distribute-rgt-neg-in99.1%
metadata-eval99.1%
associate-*r*99.1%
Applied egg-rr99.1%
Final simplification96.6%
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (or (<= t_1 -2e+266) (not (<= t_1 2e+307)))
(+ (* z (* (/ 0.5 a) (* t -9.0))) (* x (/ y (* 2.0 a))))
(/ t_1 (* 2.0 a)))))assert(x < y);
assert(z < t);
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 <= -2e+266) || !(t_1 <= 2e+307)) {
tmp = (z * ((0.5 / a) * (t * -9.0))) + (x * (y / (2.0 * a)));
} else {
tmp = t_1 / (2.0 * a);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 = (x * y) - ((z * 9.0d0) * t)
if ((t_1 <= (-2d+266)) .or. (.not. (t_1 <= 2d+307))) then
tmp = (z * ((0.5d0 / a) * (t * (-9.0d0)))) + (x * (y / (2.0d0 * a)))
else
tmp = t_1 / (2.0d0 * a)
end if
code = tmp
end function
assert x < y;
assert z < t;
public static 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 <= -2e+266) || !(t_1 <= 2e+307)) {
tmp = (z * ((0.5 / a) * (t * -9.0))) + (x * (y / (2.0 * a)));
} else {
tmp = t_1 / (2.0 * a);
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if (t_1 <= -2e+266) or not (t_1 <= 2e+307): tmp = (z * ((0.5 / a) * (t * -9.0))) + (x * (y / (2.0 * a))) else: tmp = t_1 / (2.0 * a) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) 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 <= -2e+266) || !(t_1 <= 2e+307)) tmp = Float64(Float64(z * Float64(Float64(0.5 / a) * Float64(t * -9.0))) + Float64(x * Float64(y / Float64(2.0 * a)))); else tmp = Float64(t_1 / Float64(2.0 * a)); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if ((t_1 <= -2e+266) || ~((t_1 <= 2e+307)))
tmp = (z * ((0.5 / a) * (t * -9.0))) + (x * (y / (2.0 * a)));
else
tmp = t_1 / (2.0 * a);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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[Or[LessEqual[t$95$1, -2e+266], N[Not[LessEqual[t$95$1, 2e+307]], $MachinePrecision]], N[(N[(z * N[(N[(0.5 / a), $MachinePrecision] * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * N[(y / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -2 \cdot 10^{+266} \lor \neg \left(t_1 \leq 2 \cdot 10^{+307}\right):\\
\;\;\;\;z \cdot \left(\frac{0.5}{a} \cdot \left(t \cdot -9\right)\right) + x \cdot \frac{y}{2 \cdot a}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{2 \cdot a}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -2.0000000000000001e266 or 1.99999999999999997e307 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 70.7%
*-commutative70.7%
*-commutative70.7%
associate-*l*70.7%
Simplified70.7%
Taylor expanded in a around 0 70.7%
associate-*r/70.7%
cancel-sign-sub-inv70.7%
metadata-eval70.7%
+-commutative70.7%
associate-/l*70.7%
+-commutative70.7%
metadata-eval70.7%
cancel-sign-sub-inv70.7%
fma-neg72.1%
*-commutative72.1%
distribute-lft-neg-in72.1%
metadata-eval72.1%
*-commutative72.1%
associate-*l*72.1%
Simplified72.1%
add-cube-cbrt72.1%
pow372.1%
Applied egg-rr72.1%
unpow372.1%
add-cube-cbrt72.1%
associate-/r/72.1%
fma-udef70.7%
+-commutative70.7%
distribute-rgt-out66.5%
associate-*l*75.6%
associate-*r*94.1%
clear-num94.1%
un-div-inv94.1%
div-inv94.1%
metadata-eval94.1%
Applied egg-rr94.1%
if -2.0000000000000001e266 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 1.99999999999999997e307Initial program 98.6%
Final simplification97.4%
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= (* x y) (- INFINITY))
(* 0.5 (/ x (/ a y)))
(if (<= (* x y) 5e+217)
(/ (- (* x y) (* 9.0 (* z t))) (* 2.0 a))
(* 0.5 (* x (/ y a))))))assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = 0.5 * (x / (a / y));
} else if ((x * y) <= 5e+217) {
tmp = ((x * y) - (9.0 * (z * t))) / (2.0 * a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = 0.5 * (x / (a / y));
} else if ((x * y) <= 5e+217) {
tmp = ((x * y) - (9.0 * (z * t))) / (2.0 * a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = 0.5 * (x / (a / y)) elif (x * y) <= 5e+217: tmp = ((x * y) - (9.0 * (z * t))) / (2.0 * a) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (Float64(x * y) <= 5e+217) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(2.0 * a)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = 0.5 * (x / (a / y));
elseif ((x * y) <= 5e+217)
tmp = ((x * y) - (9.0 * (z * t))) / (2.0 * a);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+217], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+217}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{2 \cdot a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 58.5%
*-commutative58.5%
*-commutative58.5%
associate-*l*58.5%
Simplified58.5%
Taylor expanded in x around inf 58.5%
associate-/l*94.1%
Simplified94.1%
if -inf.0 < (*.f64 x y) < 5.00000000000000041e217Initial program 96.1%
fma-neg96.1%
associate-*l*96.1%
distribute-rgt-neg-in96.1%
*-commutative96.1%
distribute-rgt-neg-in96.1%
metadata-eval96.1%
Simplified96.1%
*-commutative96.1%
metadata-eval96.1%
distribute-lft-neg-in96.1%
distribute-rgt-neg-in96.1%
fma-neg96.1%
associate-*r*96.1%
*-commutative96.1%
associate-*l*96.1%
Applied egg-rr96.1%
if 5.00000000000000041e217 < (*.f64 x y) Initial program 73.1%
*-commutative73.1%
*-commutative73.1%
associate-*l*73.1%
Simplified73.1%
Taylor expanded in x around inf 73.2%
associate-*r/93.7%
Simplified93.7%
Final simplification95.7%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= (* x y) -500000000.0) (not (<= (* x y) 2e-87))) (* y (* 0.5 (/ x a))) (* -4.5 (/ (* z t) a))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) <= -500000000.0) || !((x * y) <= 2e-87)) {
tmp = y * (0.5 * (x / a));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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) <= (-500000000.0d0)) .or. (.not. ((x * y) <= 2d-87))) then
tmp = y * (0.5d0 * (x / a))
else
tmp = (-4.5d0) * ((z * t) / a)
end if
code = tmp
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) <= -500000000.0) || !((x * y) <= 2e-87)) {
tmp = y * (0.5 * (x / a));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if ((x * y) <= -500000000.0) or not ((x * y) <= 2e-87): tmp = y * (0.5 * (x / a)) else: tmp = -4.5 * ((z * t) / a) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((Float64(x * y) <= -500000000.0) || !(Float64(x * y) <= 2e-87)) tmp = Float64(y * Float64(0.5 * Float64(x / a))); else tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (((x * y) <= -500000000.0) || ~(((x * y) <= 2e-87)))
tmp = y * (0.5 * (x / a));
else
tmp = -4.5 * ((z * t) / a);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(x * y), $MachinePrecision], -500000000.0], N[Not[LessEqual[N[(x * y), $MachinePrecision], 2e-87]], $MachinePrecision]], N[(y * N[(0.5 * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -500000000 \lor \neg \left(x \cdot y \leq 2 \cdot 10^{-87}\right):\\
\;\;\;\;y \cdot \left(0.5 \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -5e8 or 2.00000000000000004e-87 < (*.f64 x y) Initial program 86.6%
*-commutative86.6%
*-commutative86.6%
associate-*l*86.6%
Simplified86.6%
Taylor expanded in x around inf 68.3%
associate-*r/68.3%
*-commutative68.3%
associate-*r*68.3%
Simplified68.3%
associate-/l*72.0%
associate-/r/72.7%
*-commutative72.7%
associate-*l/72.7%
metadata-eval72.7%
div-inv72.7%
*-commutative72.7%
associate-/r*72.7%
associate-*r/67.7%
associate-*l/71.4%
*-un-lft-identity71.4%
*-commutative71.4%
times-frac72.0%
metadata-eval72.0%
Applied egg-rr72.0%
if -5e8 < (*.f64 x y) < 2.00000000000000004e-87Initial program 96.5%
*-commutative96.5%
*-commutative96.5%
associate-*l*96.5%
Simplified96.5%
Taylor expanded in x around 0 81.0%
Final simplification75.9%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -1.56e-133) (* -4.5 (/ (* z t) a)) (if (<= t 4e+49) (* 0.5 (* x (/ y a))) (* -4.5 (* z (/ t a))))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.56e-133) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 4e+49) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (t <= (-1.56d-133)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (t <= 4d+49) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.56e-133) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 4e+49) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -1.56e-133: tmp = -4.5 * ((z * t) / a) elif t <= 4e+49: tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.56e-133) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (t <= 4e+49) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.56e-133)
tmp = -4.5 * ((z * t) / a);
elseif (t <= 4e+49)
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.56e-133], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 4e+49], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.56 \cdot 10^{-133}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;t \leq 4 \cdot 10^{+49}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if t < -1.56e-133Initial program 88.6%
*-commutative88.6%
*-commutative88.6%
associate-*l*88.6%
Simplified88.6%
Taylor expanded in x around 0 62.2%
if -1.56e-133 < t < 3.99999999999999979e49Initial program 94.1%
*-commutative94.1%
*-commutative94.1%
associate-*l*94.1%
Simplified94.1%
Taylor expanded in x around inf 74.5%
associate-*r/76.0%
Simplified76.0%
if 3.99999999999999979e49 < t Initial program 87.1%
*-commutative87.1%
*-commutative87.1%
associate-*l*87.1%
Simplified87.1%
Taylor expanded in x around 0 73.9%
associate-/l*73.6%
Simplified73.6%
associate-/r/81.0%
Applied egg-rr81.0%
Final simplification72.5%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t 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);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t 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] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 90.9%
*-commutative90.9%
*-commutative90.9%
associate-*l*90.9%
Simplified90.9%
Taylor expanded in x around 0 50.7%
associate-/l*48.9%
Simplified48.9%
associate-/r/50.6%
Applied egg-rr50.6%
Final simplification50.6%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2023336
(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)))