
(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 6 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 (if (or (<= (* x y) (- INFINITY)) (not (<= (* x y) 5e+259))) (* 0.5 (* y (/ x a))) (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0))))
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)) || !((x * y) <= 5e+259)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
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) || !((x * y) <= 5e+259)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
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) or not ((x * y) <= 5e+259): tmp = 0.5 * (y * (x / a)) else: tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0) 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)) || !(Float64(x * y) <= 5e+259)) tmp = Float64(0.5 * Float64(y * Float64(x / a))); else tmp = Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)); 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) || ~(((x * y) <= 5e+259)))
tmp = 0.5 * (y * (x / a));
else
tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
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], (-Infinity)], N[Not[LessEqual[N[(x * y), $MachinePrecision], 5e+259]], $MachinePrecision]], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $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 \lor \neg \left(x \cdot y \leq 5 \cdot 10^{+259}\right):\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0 or 5.00000000000000033e259 < (*.f64 x y) Initial program 52.2%
sub-neg52.2%
+-commutative52.2%
neg-sub052.2%
associate-+l-52.2%
sub0-neg52.2%
neg-mul-152.2%
associate-/l*52.2%
associate-/r/52.2%
*-commutative52.2%
sub-neg52.2%
+-commutative52.2%
neg-sub052.2%
associate-+l-52.2%
sub0-neg52.2%
distribute-lft-neg-out52.2%
distribute-rgt-neg-in52.2%
Simplified55.5%
associate-*r/55.5%
clear-num55.5%
*-commutative55.5%
Applied egg-rr55.5%
Taylor expanded in x around inf 58.5%
associate-*r/90.6%
Simplified90.6%
if -inf.0 < (*.f64 x y) < 5.00000000000000033e259Initial program 97.1%
Final simplification96.3%
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) (- INFINITY)) (not (<= (* x y) 5e+259))) (* 0.5 (* y (/ x a))) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))))
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)) || !((x * y) <= 5e+259)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
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) || !((x * y) <= 5e+259)) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
}
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) or not ((x * y) <= 5e+259): tmp = 0.5 * (y * (x / a)) else: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) 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)) || !(Float64(x * y) <= 5e+259)) tmp = Float64(0.5 * Float64(y * 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 = 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) || ~(((x * y) <= 5e+259)))
tmp = 0.5 * (y * (x / a));
else
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
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], (-Infinity)], N[Not[LessEqual[N[(x * y), $MachinePrecision], 5e+259]], $MachinePrecision]], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $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] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty \lor \neg \left(x \cdot y \leq 5 \cdot 10^{+259}\right):\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\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.0 or 5.00000000000000033e259 < (*.f64 x y) Initial program 52.2%
sub-neg52.2%
+-commutative52.2%
neg-sub052.2%
associate-+l-52.2%
sub0-neg52.2%
neg-mul-152.2%
associate-/l*52.2%
associate-/r/52.2%
*-commutative52.2%
sub-neg52.2%
+-commutative52.2%
neg-sub052.2%
associate-+l-52.2%
sub0-neg52.2%
distribute-lft-neg-out52.2%
distribute-rgt-neg-in52.2%
Simplified55.5%
associate-*r/55.5%
clear-num55.5%
*-commutative55.5%
Applied egg-rr55.5%
Taylor expanded in x around inf 58.5%
associate-*r/90.6%
Simplified90.6%
if -inf.0 < (*.f64 x y) < 5.00000000000000033e259Initial program 97.1%
associate-*l*97.1%
Simplified97.1%
Final simplification96.3%
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.5e-96) (* -4.5 (* t (/ z a))) (if (<= t 8.2e+92) (* 0.5 (* y (/ 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 (t <= -1.5e-96) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 8.2e+92) {
tmp = 0.5 * (y * (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 (t <= (-1.5d-96)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 8.2d+92) then
tmp = 0.5d0 * (y * (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 (t <= -1.5e-96) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 8.2e+92) {
tmp = 0.5 * (y * (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 t <= -1.5e-96: tmp = -4.5 * (t * (z / a)) elif t <= 8.2e+92: tmp = 0.5 * (y * (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 (t <= -1.5e-96) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 8.2e+92) tmp = Float64(0.5 * Float64(y * Float64(x / 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.5e-96)
tmp = -4.5 * (t * (z / a));
elseif (t <= 8.2e+92)
tmp = 0.5 * (y * (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[LessEqual[t, -1.5e-96], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 8.2e+92], N[(0.5 * N[(y * N[(x / 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.5 \cdot 10^{-96}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 8.2 \cdot 10^{+92}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if t < -1.5e-96Initial program 89.2%
sub-neg89.2%
+-commutative89.2%
neg-sub089.2%
associate-+l-89.2%
sub0-neg89.2%
neg-mul-189.2%
associate-/l*89.2%
associate-/r/89.1%
*-commutative89.1%
sub-neg89.1%
+-commutative89.1%
neg-sub089.1%
associate-+l-89.1%
sub0-neg89.1%
distribute-lft-neg-out89.1%
distribute-rgt-neg-in89.1%
Simplified90.3%
associate-*r/90.4%
clear-num90.3%
*-commutative90.3%
Applied egg-rr90.3%
Taylor expanded in x around 0 61.7%
*-commutative61.7%
*-commutative61.7%
associate-*r/65.2%
associate-*l*65.2%
Simplified65.2%
Taylor expanded in z around 0 61.7%
associate-*r/62.9%
Simplified62.9%
if -1.5e-96 < t < 8.20000000000000047e92Initial program 94.6%
sub-neg94.6%
+-commutative94.6%
neg-sub094.6%
associate-+l-94.6%
sub0-neg94.6%
neg-mul-194.6%
associate-/l*94.0%
associate-/r/94.6%
*-commutative94.6%
sub-neg94.6%
+-commutative94.6%
neg-sub094.6%
associate-+l-94.6%
sub0-neg94.6%
distribute-lft-neg-out94.6%
distribute-rgt-neg-in94.6%
Simplified94.5%
associate-*r/94.6%
clear-num93.9%
*-commutative93.9%
Applied egg-rr93.9%
Taylor expanded in x around inf 64.3%
associate-*r/62.8%
Simplified62.8%
if 8.20000000000000047e92 < t Initial program 86.7%
sub-neg86.7%
+-commutative86.7%
neg-sub086.7%
associate-+l-86.7%
sub0-neg86.7%
neg-mul-186.7%
associate-/l*86.7%
associate-/r/86.7%
*-commutative86.7%
sub-neg86.7%
+-commutative86.7%
neg-sub086.7%
associate-+l-86.7%
sub0-neg86.7%
distribute-lft-neg-out86.7%
distribute-rgt-neg-in86.7%
Simplified86.8%
Taylor expanded in x around 0 76.0%
associate-/l*80.1%
associate-/r/80.3%
Simplified80.3%
Final simplification65.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.5e-96) (* -4.5 (* t (/ z a))) (if (<= t 2.5e+92) (* 0.5 (* y (/ x a))) (* z (* -4.5 (/ 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.5e-96) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 2.5e+92) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = z * (-4.5 * (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.5d-96)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 2.5d+92) then
tmp = 0.5d0 * (y * (x / a))
else
tmp = z * ((-4.5d0) * (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.5e-96) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 2.5e+92) {
tmp = 0.5 * (y * (x / a));
} else {
tmp = z * (-4.5 * (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.5e-96: tmp = -4.5 * (t * (z / a)) elif t <= 2.5e+92: tmp = 0.5 * (y * (x / a)) else: tmp = z * (-4.5 * (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.5e-96) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 2.5e+92) tmp = Float64(0.5 * Float64(y * Float64(x / a))); else tmp = Float64(z * Float64(-4.5 * 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.5e-96)
tmp = -4.5 * (t * (z / a));
elseif (t <= 2.5e+92)
tmp = 0.5 * (y * (x / a));
else
tmp = z * (-4.5 * (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.5e-96], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.5e+92], N[(0.5 * N[(y * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(-4.5 * 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.5 \cdot 10^{-96}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 2.5 \cdot 10^{+92}:\\
\;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(-4.5 \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if t < -1.5e-96Initial program 89.2%
sub-neg89.2%
+-commutative89.2%
neg-sub089.2%
associate-+l-89.2%
sub0-neg89.2%
neg-mul-189.2%
associate-/l*89.2%
associate-/r/89.1%
*-commutative89.1%
sub-neg89.1%
+-commutative89.1%
neg-sub089.1%
associate-+l-89.1%
sub0-neg89.1%
distribute-lft-neg-out89.1%
distribute-rgt-neg-in89.1%
Simplified90.3%
associate-*r/90.4%
clear-num90.3%
*-commutative90.3%
Applied egg-rr90.3%
Taylor expanded in x around 0 61.7%
*-commutative61.7%
*-commutative61.7%
associate-*r/65.2%
associate-*l*65.2%
Simplified65.2%
Taylor expanded in z around 0 61.7%
associate-*r/62.9%
Simplified62.9%
if -1.5e-96 < t < 2.50000000000000011e92Initial program 94.6%
sub-neg94.6%
+-commutative94.6%
neg-sub094.6%
associate-+l-94.6%
sub0-neg94.6%
neg-mul-194.6%
associate-/l*94.0%
associate-/r/94.6%
*-commutative94.6%
sub-neg94.6%
+-commutative94.6%
neg-sub094.6%
associate-+l-94.6%
sub0-neg94.6%
distribute-lft-neg-out94.6%
distribute-rgt-neg-in94.6%
Simplified94.5%
associate-*r/94.6%
clear-num93.9%
*-commutative93.9%
Applied egg-rr93.9%
Taylor expanded in x around inf 64.3%
associate-*r/62.8%
Simplified62.8%
if 2.50000000000000011e92 < t Initial program 86.7%
sub-neg86.7%
+-commutative86.7%
neg-sub086.7%
associate-+l-86.7%
sub0-neg86.7%
neg-mul-186.7%
associate-/l*86.7%
associate-/r/86.7%
*-commutative86.7%
sub-neg86.7%
+-commutative86.7%
neg-sub086.7%
associate-+l-86.7%
sub0-neg86.7%
distribute-lft-neg-out86.7%
distribute-rgt-neg-in86.7%
Simplified86.8%
associate-*r/86.8%
clear-num86.8%
*-commutative86.8%
Applied egg-rr86.8%
Taylor expanded in x around 0 76.0%
*-commutative76.0%
*-commutative76.0%
associate-*r/80.3%
associate-*l*80.3%
Simplified80.3%
Final simplification65.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 (* -4.5 (* t (/ z a))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / 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) * (t * (z / 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 * (t * (z / a));
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / 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 * (t * (z / 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[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 91.5%
sub-neg91.5%
+-commutative91.5%
neg-sub091.5%
associate-+l-91.5%
sub0-neg91.5%
neg-mul-191.5%
associate-/l*91.2%
associate-/r/91.4%
*-commutative91.4%
sub-neg91.4%
+-commutative91.4%
neg-sub091.4%
associate-+l-91.4%
sub0-neg91.4%
distribute-lft-neg-out91.4%
distribute-rgt-neg-in91.4%
Simplified91.8%
associate-*r/91.9%
clear-num91.5%
*-commutative91.5%
Applied egg-rr91.5%
Taylor expanded in x around 0 54.6%
*-commutative54.6%
*-commutative54.6%
associate-*r/55.5%
associate-*l*55.5%
Simplified55.5%
Taylor expanded in z around 0 54.6%
associate-*r/55.0%
Simplified55.0%
Final simplification55.0%
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 91.5%
sub-neg91.5%
+-commutative91.5%
neg-sub091.5%
associate-+l-91.5%
sub0-neg91.5%
neg-mul-191.5%
associate-/l*91.2%
associate-/r/91.4%
*-commutative91.4%
sub-neg91.4%
+-commutative91.4%
neg-sub091.4%
associate-+l-91.4%
sub0-neg91.4%
distribute-lft-neg-out91.4%
distribute-rgt-neg-in91.4%
Simplified91.8%
Taylor expanded in x around 0 54.6%
associate-/l*55.0%
associate-/r/55.5%
Simplified55.5%
Final simplification55.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 2023213
(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)))