
(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 8 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: 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))
(* (/ x a) (/ y 2.0))
(if (or (<= (* x y) -2e-198) (not (<= (* x y) 5e-289)))
(/ (- (* x y) (* 9.0 (* z t))) (* a 2.0))
(/ t (/ a (* z -4.5))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x / a) * (y / 2.0);
} else if (((x * y) <= -2e-198) || !((x * y) <= 5e-289)) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = t / (a / (z * -4.5));
}
return tmp;
}
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 = (x / a) * (y / 2.0);
} else if (((x * y) <= -2e-198) || !((x * y) <= 5e-289)) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = t / (a / (z * -4.5));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = (x / a) * (y / 2.0) elif ((x * y) <= -2e-198) or not ((x * y) <= 5e-289): tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = t / (a / (z * -4.5)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x / a) * Float64(y / 2.0)); elseif ((Float64(x * y) <= -2e-198) || !(Float64(x * y) <= 5e-289)) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = Float64(t / Float64(a / Float64(z * -4.5))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = (x / a) * (y / 2.0);
elseif (((x * y) <= -2e-198) || ~(((x * y) <= 5e-289)))
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = t / (a / (z * -4.5));
end
tmp_2 = tmp;
end
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[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[(x * y), $MachinePrecision], -2e-198], N[Not[LessEqual[N[(x * y), $MachinePrecision], 5e-289]], $MachinePrecision]], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t / N[(a / N[(z * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2}\\
\mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-198} \lor \neg \left(x \cdot y \leq 5 \cdot 10^{-289}\right):\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{\frac{a}{z \cdot -4.5}}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 50.0%
*-commutative50.0%
*-commutative50.0%
associate-*l*50.0%
Simplified50.0%
Taylor expanded in a around 0 50.0%
associate-*r/50.0%
cancel-sign-sub-inv50.0%
metadata-eval50.0%
+-commutative50.0%
associate-/l*50.0%
+-commutative50.0%
metadata-eval50.0%
cancel-sign-sub-inv50.0%
fma-neg54.4%
*-commutative54.4%
distribute-lft-neg-in54.4%
metadata-eval54.4%
*-commutative54.4%
associate-*l*54.4%
Simplified54.4%
Taylor expanded in x around inf 54.4%
associate-*r/54.4%
associate-*l/54.4%
*-commutative54.4%
associate-*l*95.4%
associate-*r/95.4%
Simplified95.4%
expm1-log1p-u28.7%
expm1-udef28.7%
associate-/l*28.7%
div-inv28.7%
metadata-eval28.7%
Applied egg-rr28.7%
expm1-def28.7%
expm1-log1p95.4%
associate-*r/54.4%
times-frac95.6%
Simplified95.6%
if -inf.0 < (*.f64 x y) < -1.9999999999999998e-198 or 5.00000000000000029e-289 < (*.f64 x y) Initial program 94.3%
fma-neg94.3%
associate-*l*94.3%
distribute-rgt-neg-in94.3%
*-commutative94.3%
distribute-rgt-neg-in94.3%
metadata-eval94.3%
Simplified94.3%
*-commutative94.3%
metadata-eval94.3%
distribute-lft-neg-in94.3%
distribute-rgt-neg-in94.3%
fma-neg94.3%
associate-*r*94.3%
*-commutative94.3%
associate-*l*94.3%
Applied egg-rr94.3%
if -1.9999999999999998e-198 < (*.f64 x y) < 5.00000000000000029e-289Initial program 86.5%
*-commutative86.5%
*-commutative86.5%
associate-*l*86.3%
Simplified86.3%
Taylor expanded in x around 0 86.2%
*-commutative86.2%
associate-/l*92.6%
associate-*l/92.6%
Simplified92.6%
associate-*l/92.6%
associate-/r/92.5%
associate-*l*92.6%
Applied egg-rr92.6%
associate-*l/86.5%
associate-/l*92.7%
Applied egg-rr92.7%
Final simplification94.1%
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)) (* (/ x a) (/ y 2.0)) (/ (fma x y (* z (* t -9.0))) (* a 2.0))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x / a) * (y / 2.0);
} else {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x / a) * Float64(y / 2.0)); else tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); end return tmp end
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[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 50.0%
*-commutative50.0%
*-commutative50.0%
associate-*l*50.0%
Simplified50.0%
Taylor expanded in a around 0 50.0%
associate-*r/50.0%
cancel-sign-sub-inv50.0%
metadata-eval50.0%
+-commutative50.0%
associate-/l*50.0%
+-commutative50.0%
metadata-eval50.0%
cancel-sign-sub-inv50.0%
fma-neg54.4%
*-commutative54.4%
distribute-lft-neg-in54.4%
metadata-eval54.4%
*-commutative54.4%
associate-*l*54.4%
Simplified54.4%
Taylor expanded in x around inf 54.4%
associate-*r/54.4%
associate-*l/54.4%
*-commutative54.4%
associate-*l*95.4%
associate-*r/95.4%
Simplified95.4%
expm1-log1p-u28.7%
expm1-udef28.7%
associate-/l*28.7%
div-inv28.7%
metadata-eval28.7%
Applied egg-rr28.7%
expm1-def28.7%
expm1-log1p95.4%
associate-*r/54.4%
times-frac95.6%
Simplified95.6%
if -inf.0 < (*.f64 x y) Initial program 92.9%
fma-neg92.9%
associate-*l*92.9%
distribute-rgt-neg-in92.9%
*-commutative92.9%
distribute-rgt-neg-in92.9%
metadata-eval92.9%
Simplified92.9%
Final simplification93.2%
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)) (* (/ x a) (/ y 2.0)) (/ (- (* x y) (* z (* t 9.0))) (* a 2.0))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = (x / a) * (y / 2.0);
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
return tmp;
}
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 = (x / a) * (y / 2.0);
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = (x / a) * (y / 2.0) else: tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(Float64(x / a) * Float64(y / 2.0)); else tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(t * 9.0))) / Float64(a * 2.0)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = (x / a) * (y / 2.0);
else
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
end
tmp_2 = tmp;
end
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[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(t * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 50.0%
*-commutative50.0%
*-commutative50.0%
associate-*l*50.0%
Simplified50.0%
Taylor expanded in a around 0 50.0%
associate-*r/50.0%
cancel-sign-sub-inv50.0%
metadata-eval50.0%
+-commutative50.0%
associate-/l*50.0%
+-commutative50.0%
metadata-eval50.0%
cancel-sign-sub-inv50.0%
fma-neg54.4%
*-commutative54.4%
distribute-lft-neg-in54.4%
metadata-eval54.4%
*-commutative54.4%
associate-*l*54.4%
Simplified54.4%
Taylor expanded in x around inf 54.4%
associate-*r/54.4%
associate-*l/54.4%
*-commutative54.4%
associate-*l*95.4%
associate-*r/95.4%
Simplified95.4%
expm1-log1p-u28.7%
expm1-udef28.7%
associate-/l*28.7%
div-inv28.7%
metadata-eval28.7%
Applied egg-rr28.7%
expm1-def28.7%
expm1-log1p95.4%
associate-*r/54.4%
times-frac95.6%
Simplified95.6%
if -inf.0 < (*.f64 x y) Initial program 92.9%
*-commutative92.9%
*-commutative92.9%
associate-*l*92.9%
Simplified92.9%
Final simplification93.2%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= t -7e-15) (not (<= t 7.6e+73))) (* -4.5 (* t (/ z a))) (* 0.5 (* x (/ y a)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t <= -7e-15) || !(t <= 7.6e+73)) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
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 <= (-7d-15)) .or. (.not. (t <= 7.6d+73))) then
tmp = (-4.5d0) * (t * (z / a))
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t <= -7e-15) || !(t <= 7.6e+73)) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (t <= -7e-15) or not (t <= 7.6e+73): tmp = -4.5 * (t * (z / a)) else: tmp = 0.5 * (x * (y / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((t <= -7e-15) || !(t <= 7.6e+73)) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((t <= -7e-15) || ~((t <= 7.6e+73)))
tmp = -4.5 * (t * (z / a));
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -7e-15], N[Not[LessEqual[t, 7.6e+73]], $MachinePrecision]], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -7 \cdot 10^{-15} \lor \neg \left(t \leq 7.6 \cdot 10^{+73}\right):\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if t < -7.0000000000000001e-15 or 7.60000000000000044e73 < t Initial program 86.0%
*-commutative86.0%
*-commutative86.0%
associate-*l*86.0%
Simplified86.0%
Taylor expanded in x around 0 60.5%
associate-/l*67.2%
Simplified67.2%
clear-num67.2%
associate-/r/67.2%
clear-num67.2%
Applied egg-rr67.2%
if -7.0000000000000001e-15 < t < 7.60000000000000044e73Initial program 91.2%
*-commutative91.2%
*-commutative91.2%
associate-*l*91.2%
Simplified91.2%
Taylor expanded in x around inf 68.8%
associate-*r/75.0%
Simplified75.0%
Final simplification71.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= t -8.6e-16) (not (<= t 3.5e+52))) (* -4.5 (* t (/ z a))) (* (/ x a) (/ y 2.0))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t <= -8.6e-16) || !(t <= 3.5e+52)) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = (x / a) * (y / 2.0);
}
return tmp;
}
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 <= (-8.6d-16)) .or. (.not. (t <= 3.5d+52))) then
tmp = (-4.5d0) * (t * (z / a))
else
tmp = (x / a) * (y / 2.0d0)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((t <= -8.6e-16) || !(t <= 3.5e+52)) {
tmp = -4.5 * (t * (z / a));
} else {
tmp = (x / a) * (y / 2.0);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (t <= -8.6e-16) or not (t <= 3.5e+52): tmp = -4.5 * (t * (z / a)) else: tmp = (x / a) * (y / 2.0) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((t <= -8.6e-16) || !(t <= 3.5e+52)) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); else tmp = Float64(Float64(x / a) * Float64(y / 2.0)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((t <= -8.6e-16) || ~((t <= 3.5e+52)))
tmp = -4.5 * (t * (z / a));
else
tmp = (x / a) * (y / 2.0);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -8.6e-16], N[Not[LessEqual[t, 3.5e+52]], $MachinePrecision]], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -8.6 \cdot 10^{-16} \lor \neg \left(t \leq 3.5 \cdot 10^{+52}\right):\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2}\\
\end{array}
\end{array}
if t < -8.5999999999999997e-16 or 3.5e52 < t Initial program 85.4%
*-commutative85.4%
*-commutative85.4%
associate-*l*85.4%
Simplified85.4%
Taylor expanded in x around 0 60.3%
associate-/l*66.9%
Simplified66.9%
clear-num66.9%
associate-/r/66.9%
clear-num66.9%
Applied egg-rr66.9%
if -8.5999999999999997e-16 < t < 3.5e52Initial program 91.7%
*-commutative91.7%
*-commutative91.7%
associate-*l*91.7%
Simplified91.7%
Taylor expanded in a around 0 91.6%
associate-*r/91.7%
cancel-sign-sub-inv91.7%
metadata-eval91.7%
+-commutative91.7%
associate-/l*91.5%
+-commutative91.5%
metadata-eval91.5%
cancel-sign-sub-inv91.5%
fma-neg91.5%
*-commutative91.5%
distribute-lft-neg-in91.5%
metadata-eval91.5%
*-commutative91.5%
associate-*l*91.6%
Simplified91.6%
Taylor expanded in x around inf 69.6%
associate-*r/69.6%
associate-*l/69.6%
*-commutative69.6%
associate-*l*75.3%
associate-*r/75.3%
Simplified75.3%
expm1-log1p-u46.8%
expm1-udef32.0%
associate-/l*32.0%
div-inv32.0%
metadata-eval32.0%
Applied egg-rr32.0%
expm1-def46.8%
expm1-log1p75.3%
associate-*r/69.6%
times-frac69.7%
Simplified69.7%
Final simplification68.6%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -4.5e-15) (* -4.5 (* t (/ z a))) (if (<= t 2.35e+52) (* (/ x a) (/ y 2.0)) (/ t (/ a (* z -4.5))))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -4.5e-15) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 2.35e+52) {
tmp = (x / a) * (y / 2.0);
} else {
tmp = t / (a / (z * -4.5));
}
return tmp;
}
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 <= (-4.5d-15)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 2.35d+52) then
tmp = (x / a) * (y / 2.0d0)
else
tmp = t / (a / (z * (-4.5d0)))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -4.5e-15) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 2.35e+52) {
tmp = (x / a) * (y / 2.0);
} else {
tmp = t / (a / (z * -4.5));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -4.5e-15: tmp = -4.5 * (t * (z / a)) elif t <= 2.35e+52: tmp = (x / a) * (y / 2.0) else: tmp = t / (a / (z * -4.5)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -4.5e-15) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 2.35e+52) tmp = Float64(Float64(x / a) * Float64(y / 2.0)); else tmp = Float64(t / Float64(a / Float64(z * -4.5))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -4.5e-15)
tmp = -4.5 * (t * (z / a));
elseif (t <= 2.35e+52)
tmp = (x / a) * (y / 2.0);
else
tmp = t / (a / (z * -4.5));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -4.5e-15], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.35e+52], N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision], N[(t / N[(a / N[(z * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -4.5 \cdot 10^{-15}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 2.35 \cdot 10^{+52}:\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{\frac{a}{z \cdot -4.5}}\\
\end{array}
\end{array}
if t < -4.4999999999999998e-15Initial program 87.4%
*-commutative87.4%
*-commutative87.4%
associate-*l*87.4%
Simplified87.4%
Taylor expanded in x around 0 56.3%
associate-/l*63.1%
Simplified63.1%
clear-num63.0%
associate-/r/63.0%
clear-num63.1%
Applied egg-rr63.1%
if -4.4999999999999998e-15 < t < 2.35e52Initial program 91.7%
*-commutative91.7%
*-commutative91.7%
associate-*l*91.7%
Simplified91.7%
Taylor expanded in a around 0 91.6%
associate-*r/91.7%
cancel-sign-sub-inv91.7%
metadata-eval91.7%
+-commutative91.7%
associate-/l*91.5%
+-commutative91.5%
metadata-eval91.5%
cancel-sign-sub-inv91.5%
fma-neg91.5%
*-commutative91.5%
distribute-lft-neg-in91.5%
metadata-eval91.5%
*-commutative91.5%
associate-*l*91.6%
Simplified91.6%
Taylor expanded in x around inf 69.6%
associate-*r/69.6%
associate-*l/69.6%
*-commutative69.6%
associate-*l*75.3%
associate-*r/75.3%
Simplified75.3%
expm1-log1p-u46.8%
expm1-udef32.0%
associate-/l*32.0%
div-inv32.0%
metadata-eval32.0%
Applied egg-rr32.0%
expm1-def46.8%
expm1-log1p75.3%
associate-*r/69.6%
times-frac69.7%
Simplified69.7%
if 2.35e52 < t Initial program 81.6%
*-commutative81.6%
*-commutative81.6%
associate-*l*81.7%
Simplified81.7%
Taylor expanded in x around 0 67.8%
*-commutative67.8%
associate-/l*74.1%
associate-*l/74.1%
Simplified74.1%
associate-*l/74.1%
associate-/r/77.9%
associate-*l*77.9%
Applied egg-rr77.9%
associate-*l/67.8%
associate-/l*74.1%
Applied egg-rr74.1%
Final simplification68.5%
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.9e-15) (* -4.5 (* t (/ z a))) (if (<= t 2.3e+52) (* (/ x a) (/ y 2.0)) (/ (* t -4.5) (/ a z)))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.9e-15) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 2.3e+52) {
tmp = (x / a) * (y / 2.0);
} else {
tmp = (t * -4.5) / (a / z);
}
return tmp;
}
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.9d-15)) then
tmp = (-4.5d0) * (t * (z / a))
else if (t <= 2.3d+52) then
tmp = (x / a) * (y / 2.0d0)
else
tmp = (t * (-4.5d0)) / (a / z)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.9e-15) {
tmp = -4.5 * (t * (z / a));
} else if (t <= 2.3e+52) {
tmp = (x / a) * (y / 2.0);
} else {
tmp = (t * -4.5) / (a / z);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -1.9e-15: tmp = -4.5 * (t * (z / a)) elif t <= 2.3e+52: tmp = (x / a) * (y / 2.0) else: tmp = (t * -4.5) / (a / z) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.9e-15) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t <= 2.3e+52) tmp = Float64(Float64(x / a) * Float64(y / 2.0)); else tmp = Float64(Float64(t * -4.5) / Float64(a / z)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.9e-15)
tmp = -4.5 * (t * (z / a));
elseif (t <= 2.3e+52)
tmp = (x / a) * (y / 2.0);
else
tmp = (t * -4.5) / (a / z);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.9e-15], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.3e+52], N[(N[(x / a), $MachinePrecision] * N[(y / 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(t * -4.5), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.9 \cdot 10^{-15}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t \leq 2.3 \cdot 10^{+52}:\\
\;\;\;\;\frac{x}{a} \cdot \frac{y}{2}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot -4.5}{\frac{a}{z}}\\
\end{array}
\end{array}
if t < -1.9000000000000001e-15Initial program 87.4%
*-commutative87.4%
*-commutative87.4%
associate-*l*87.4%
Simplified87.4%
Taylor expanded in x around 0 56.3%
associate-/l*63.1%
Simplified63.1%
clear-num63.0%
associate-/r/63.0%
clear-num63.1%
Applied egg-rr63.1%
if -1.9000000000000001e-15 < t < 2.3e52Initial program 91.7%
*-commutative91.7%
*-commutative91.7%
associate-*l*91.7%
Simplified91.7%
Taylor expanded in a around 0 91.6%
associate-*r/91.7%
cancel-sign-sub-inv91.7%
metadata-eval91.7%
+-commutative91.7%
associate-/l*91.5%
+-commutative91.5%
metadata-eval91.5%
cancel-sign-sub-inv91.5%
fma-neg91.5%
*-commutative91.5%
distribute-lft-neg-in91.5%
metadata-eval91.5%
*-commutative91.5%
associate-*l*91.6%
Simplified91.6%
Taylor expanded in x around inf 69.6%
associate-*r/69.6%
associate-*l/69.6%
*-commutative69.6%
associate-*l*75.3%
associate-*r/75.3%
Simplified75.3%
expm1-log1p-u46.8%
expm1-udef32.0%
associate-/l*32.0%
div-inv32.0%
metadata-eval32.0%
Applied egg-rr32.0%
expm1-def46.8%
expm1-log1p75.3%
associate-*r/69.6%
times-frac69.7%
Simplified69.7%
if 2.3e52 < t Initial program 81.6%
*-commutative81.6%
*-commutative81.6%
associate-*l*81.7%
Simplified81.7%
Taylor expanded in x around 0 67.8%
*-commutative67.8%
associate-/l*74.1%
associate-*l/74.1%
Simplified74.1%
Final simplification68.5%
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(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
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 z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
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}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 89.1%
*-commutative89.1%
*-commutative89.1%
associate-*l*89.1%
Simplified89.1%
Taylor expanded in x around 0 44.6%
associate-/l*48.0%
Simplified48.0%
clear-num48.0%
associate-/r/48.4%
clear-num48.4%
Applied egg-rr48.4%
Final simplification48.4%
(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 2023306
(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)))