
(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: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 (- INFINITY))
(- (* (/ x a) (* y 0.5)) (* z (/ (* 9.0 t) (* a 2.0))))
(if (<= t_1 4e+269)
(/ (+ (* x y) (* z (* t -9.0))) (* a 2.0))
(* (/ (fma x (/ y t) (* z -9.0)) 2.0) (/ t a))))))assert(x < y && y < z && z < t && 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 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = ((x / a) * (y * 0.5)) - (z * ((9.0 * t) / (a * 2.0)));
} else if (t_1 <= 4e+269) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (fma(x, (y / t), (z * -9.0)) / 2.0) * (t / a);
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) 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 <= Float64(-Inf)) tmp = Float64(Float64(Float64(x / a) * Float64(y * 0.5)) - Float64(z * Float64(Float64(9.0 * t) / Float64(a * 2.0)))); elseif (t_1 <= 4e+269) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(Float64(fma(x, Float64(y / t), Float64(z * -9.0)) / 2.0) * Float64(t / a)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] - N[(z * N[(N[(9.0 * t), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+269], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * N[(y / t), $MachinePrecision] + N[(z * -9.0), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] * N[(t / a), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right) - z \cdot \frac{9 \cdot t}{a \cdot 2}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+269}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \frac{y}{t}, z \cdot -9\right)}{2} \cdot \frac{t}{a}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0Initial program 67.4%
div-sub67.4%
*-commutative67.4%
div-sub67.4%
cancel-sign-sub-inv67.4%
*-commutative67.4%
fma-define67.4%
distribute-rgt-neg-in67.4%
associate-*r*67.4%
distribute-lft-neg-in67.4%
*-commutative67.4%
distribute-rgt-neg-in67.4%
metadata-eval67.4%
Simplified67.4%
*-commutative67.4%
associate-*r*67.4%
metadata-eval67.4%
distribute-rgt-neg-in67.4%
distribute-lft-neg-in67.4%
fma-neg67.4%
div-sub67.4%
*-commutative67.4%
associate-/r*67.4%
associate-*r/67.4%
div-inv67.4%
metadata-eval67.4%
associate-*l*67.4%
associate-/l*83.3%
Applied egg-rr83.3%
Taylor expanded in x around 0 83.3%
associate-*r/83.3%
*-commutative83.3%
associate-*r*83.3%
associate-*l/95.5%
*-commutative95.5%
Simplified95.5%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.0000000000000002e269Initial program 99.5%
div-sub98.5%
*-commutative98.5%
div-sub99.5%
cancel-sign-sub-inv99.5%
*-commutative99.5%
fma-define99.5%
distribute-rgt-neg-in99.5%
associate-*r*99.6%
distribute-lft-neg-in99.6%
*-commutative99.6%
distribute-rgt-neg-in99.6%
metadata-eval99.6%
Simplified99.6%
*-commutative99.6%
associate-*r*99.5%
metadata-eval99.5%
distribute-rgt-neg-in99.5%
distribute-lft-neg-in99.5%
fma-define99.5%
+-commutative99.5%
distribute-lft-neg-in99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
associate-*r*99.6%
*-commutative99.6%
Applied egg-rr99.6%
if 4.0000000000000002e269 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 68.3%
Taylor expanded in t around inf 70.7%
*-commutative70.7%
*-commutative70.7%
times-frac86.1%
cancel-sign-sub-inv86.1%
associate-/l*88.4%
fma-define88.4%
metadata-eval88.4%
Applied egg-rr88.4%
Final simplification97.4%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 (- (* x y) (* (* z 9.0) t))))
(if (or (<= t_1 (- INFINITY)) (not (<= t_1 5e+260)))
(- (* (/ x a) (* y 0.5)) (* z (/ (* 9.0 t) (* a 2.0))))
(/ (+ (* x y) (* z (* t -9.0))) (* a 2.0)))))assert(x < y && y < z && z < t && 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 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 5e+260)) {
tmp = ((x / a) * (y * 0.5)) - (z * ((9.0 * t) / (a * 2.0)));
} else {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
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 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 5e+260)) {
tmp = ((x / a) * (y * 0.5)) - (z * ((9.0 * t) / (a * 2.0)));
} else {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if (t_1 <= -math.inf) or not (t_1 <= 5e+260): tmp = ((x / a) * (y * 0.5)) - (z * ((9.0 * t) / (a * 2.0))) else: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) 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 <= Float64(-Inf)) || !(t_1 <= 5e+260)) tmp = Float64(Float64(Float64(x / a) * Float64(y * 0.5)) - Float64(z * Float64(Float64(9.0 * t) / Float64(a * 2.0)))); else tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if ((t_1 <= -Inf) || ~((t_1 <= 5e+260)))
tmp = ((x / a) * (y * 0.5)) - (z * ((9.0 * t) / (a * 2.0)));
else
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 5e+260]], $MachinePrecision]], N[(N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] - N[(z * N[(N[(9.0 * t), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $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}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 5 \cdot 10^{+260}\right):\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right) - z \cdot \frac{9 \cdot t}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 4.9999999999999996e260 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 68.5%
div-sub68.5%
*-commutative68.5%
div-sub68.5%
cancel-sign-sub-inv68.5%
*-commutative68.5%
fma-define70.0%
distribute-rgt-neg-in70.0%
associate-*r*70.0%
distribute-lft-neg-in70.0%
*-commutative70.0%
distribute-rgt-neg-in70.0%
metadata-eval70.0%
Simplified70.0%
*-commutative70.0%
associate-*r*70.0%
metadata-eval70.0%
distribute-rgt-neg-in70.0%
distribute-lft-neg-in70.0%
fma-neg68.5%
div-sub68.5%
*-commutative68.5%
associate-/r*68.5%
associate-*r/68.5%
div-inv68.5%
metadata-eval68.5%
associate-*l*68.5%
associate-/l*83.9%
Applied egg-rr83.9%
Taylor expanded in x around 0 83.9%
associate-*r/83.9%
*-commutative83.9%
associate-*r*83.9%
associate-*l/95.3%
*-commutative95.3%
Simplified95.3%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.9999999999999996e260Initial program 99.5%
div-sub98.5%
*-commutative98.5%
div-sub99.5%
cancel-sign-sub-inv99.5%
*-commutative99.5%
fma-define99.5%
distribute-rgt-neg-in99.5%
associate-*r*99.6%
distribute-lft-neg-in99.6%
*-commutative99.6%
distribute-rgt-neg-in99.6%
metadata-eval99.6%
Simplified99.6%
*-commutative99.6%
associate-*r*99.5%
metadata-eval99.5%
distribute-rgt-neg-in99.5%
distribute-lft-neg-in99.5%
fma-define99.5%
+-commutative99.5%
distribute-lft-neg-in99.5%
distribute-rgt-neg-in99.5%
metadata-eval99.5%
associate-*r*99.6%
*-commutative99.6%
Applied egg-rr99.6%
Final simplification98.5%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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))
(* z (+ (* (/ t a) -4.5) (* 0.5 (/ (* x y) (* z a)))))
(if (<= t_1 2e+259)
(/ (+ (* x y) (* z (* t -9.0))) (* a 2.0))
(* (/ z a) (* t -4.5))))))assert(x < y && y < z && z < t && 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 = z * (((t / a) * -4.5) + (0.5 * ((x * y) / (z * a))));
} else if (t_1 <= 2e+259) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (z / a) * (t * -4.5);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
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 = z * (((t / a) * -4.5) + (0.5 * ((x * y) / (z * a))));
} else if (t_1 <= 2e+259) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (z / a) * (t * -4.5);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [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 = z * (((t / a) * -4.5) + (0.5 * ((x * y) / (z * a)))) elif t_1 <= 2e+259: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = (z / a) * (t * -4.5) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) 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(z * Float64(Float64(Float64(t / a) * -4.5) + Float64(0.5 * Float64(Float64(x * y) / Float64(z * a))))); elseif (t_1 <= 2e+259) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(Float64(z / a) * Float64(t * -4.5)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 = z * (((t / a) * -4.5) + (0.5 * ((x * y) / (z * a))));
elseif (t_1 <= 2e+259)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = (z / a) * (t * -4.5);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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[(z * N[(N[(N[(t / a), $MachinePrecision] * -4.5), $MachinePrecision] + N[(0.5 * N[(N[(x * y), $MachinePrecision] / N[(z * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+259], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[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:\\
\;\;\;\;z \cdot \left(\frac{t}{a} \cdot -4.5 + 0.5 \cdot \frac{x \cdot y}{z \cdot a}\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+259}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0Initial program 57.7%
div-sub57.7%
*-commutative57.7%
div-sub57.7%
cancel-sign-sub-inv57.7%
*-commutative57.7%
fma-define57.7%
distribute-rgt-neg-in57.7%
associate-*r*57.7%
distribute-lft-neg-in57.7%
*-commutative57.7%
distribute-rgt-neg-in57.7%
metadata-eval57.7%
Simplified57.7%
Taylor expanded in z around inf 99.8%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2e259Initial program 96.2%
div-sub95.3%
*-commutative95.3%
div-sub96.2%
cancel-sign-sub-inv96.2%
*-commutative96.2%
fma-define96.2%
distribute-rgt-neg-in96.2%
associate-*r*96.3%
distribute-lft-neg-in96.3%
*-commutative96.3%
distribute-rgt-neg-in96.3%
metadata-eval96.3%
Simplified96.3%
*-commutative96.3%
associate-*r*96.2%
metadata-eval96.2%
distribute-rgt-neg-in96.2%
distribute-lft-neg-in96.2%
fma-define96.2%
+-commutative96.2%
distribute-lft-neg-in96.2%
distribute-rgt-neg-in96.2%
metadata-eval96.2%
associate-*r*96.3%
*-commutative96.3%
Applied egg-rr96.3%
if 2e259 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 64.4%
div-sub64.4%
*-commutative64.4%
div-sub64.4%
cancel-sign-sub-inv64.4%
*-commutative64.4%
fma-define70.7%
distribute-rgt-neg-in70.7%
associate-*r*70.7%
distribute-lft-neg-in70.7%
*-commutative70.7%
distribute-rgt-neg-in70.7%
metadata-eval70.7%
Simplified70.7%
Taylor expanded in x around 0 70.8%
associate-/l*99.7%
*-commutative99.7%
associate-*l*99.4%
*-commutative99.4%
associate-*l*100.0%
*-commutative100.0%
Simplified100.0%
Final simplification96.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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))
(* -4.5 (* t (/ z a)))
(if (<= t_1 2e+259)
(/ (+ (* x y) (* z (* t -9.0))) (* a 2.0))
(* (/ z a) (* t -4.5))))))assert(x < y && y < z && z < t && 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 = -4.5 * (t * (z / a));
} else if (t_1 <= 2e+259) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (z / a) * (t * -4.5);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
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 = -4.5 * (t * (z / a));
} else if (t_1 <= 2e+259) {
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (z / a) * (t * -4.5);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [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 = -4.5 * (t * (z / a)) elif t_1 <= 2e+259: tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0) else: tmp = (z / a) * (t * -4.5) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) 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(-4.5 * Float64(t * Float64(z / a))); elseif (t_1 <= 2e+259) tmp = Float64(Float64(Float64(x * y) + Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(Float64(z / a) * Float64(t * -4.5)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 = -4.5 * (t * (z / a));
elseif (t_1 <= 2e+259)
tmp = ((x * y) + (z * (t * -9.0))) / (a * 2.0);
else
tmp = (z / a) * (t * -4.5);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+259], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[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:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+259}:\\
\;\;\;\;\frac{x \cdot y + z \cdot \left(t \cdot -9\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0Initial program 57.7%
div-sub57.7%
*-commutative57.7%
div-sub57.7%
cancel-sign-sub-inv57.7%
*-commutative57.7%
fma-define57.7%
distribute-rgt-neg-in57.7%
associate-*r*57.7%
distribute-lft-neg-in57.7%
*-commutative57.7%
distribute-rgt-neg-in57.7%
metadata-eval57.7%
Simplified57.7%
Taylor expanded in x around 0 63.0%
associate-/l*94.4%
Simplified94.4%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2e259Initial program 96.2%
div-sub95.3%
*-commutative95.3%
div-sub96.2%
cancel-sign-sub-inv96.2%
*-commutative96.2%
fma-define96.2%
distribute-rgt-neg-in96.2%
associate-*r*96.3%
distribute-lft-neg-in96.3%
*-commutative96.3%
distribute-rgt-neg-in96.3%
metadata-eval96.3%
Simplified96.3%
*-commutative96.3%
associate-*r*96.2%
metadata-eval96.2%
distribute-rgt-neg-in96.2%
distribute-lft-neg-in96.2%
fma-define96.2%
+-commutative96.2%
distribute-lft-neg-in96.2%
distribute-rgt-neg-in96.2%
metadata-eval96.2%
associate-*r*96.3%
*-commutative96.3%
Applied egg-rr96.3%
if 2e259 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 64.4%
div-sub64.4%
*-commutative64.4%
div-sub64.4%
cancel-sign-sub-inv64.4%
*-commutative64.4%
fma-define70.7%
distribute-rgt-neg-in70.7%
associate-*r*70.7%
distribute-lft-neg-in70.7%
*-commutative70.7%
distribute-rgt-neg-in70.7%
metadata-eval70.7%
Simplified70.7%
Taylor expanded in x around 0 70.8%
associate-/l*99.7%
*-commutative99.7%
associate-*l*99.4%
*-commutative99.4%
associate-*l*100.0%
*-commutative100.0%
Simplified100.0%
Final simplification96.4%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. 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.5e-73) (not (<= y 280000.0))) (* 0.5 (* x (/ y a))) (* -4.5 (/ (* z t) a))))
assert(x < y && y < z && z < t && 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.5e-73) || !(y <= 280000.0)) {
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.
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.5d-73)) .or. (.not. (y <= 280000.0d0))) 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;
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.5e-73) || !(y <= 280000.0)) {
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]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (y <= -2.5e-73) or not (y <= 280000.0): 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]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if ((y <= -2.5e-73) || !(y <= 280000.0)) 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])){:}
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.5e-73) || ~((y <= 280000.0)))
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. 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.5e-73], N[Not[LessEqual[y, 280000.0]], $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])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -2.5 \cdot 10^{-73} \lor \neg \left(y \leq 280000\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 < -2.4999999999999999e-73 or 2.8e5 < y Initial program 89.2%
div-sub88.6%
*-commutative88.6%
div-sub89.2%
cancel-sign-sub-inv89.2%
*-commutative89.2%
fma-define89.9%
distribute-rgt-neg-in89.9%
associate-*r*89.9%
distribute-lft-neg-in89.9%
*-commutative89.9%
distribute-rgt-neg-in89.9%
metadata-eval89.9%
Simplified89.9%
Taylor expanded in x around inf 66.5%
associate-/l*69.5%
Simplified69.5%
if -2.4999999999999999e-73 < y < 2.8e5Initial program 94.9%
div-sub93.9%
*-commutative93.9%
div-sub94.9%
cancel-sign-sub-inv94.9%
*-commutative94.9%
fma-define94.9%
distribute-rgt-neg-in94.9%
associate-*r*95.0%
distribute-lft-neg-in95.0%
*-commutative95.0%
distribute-rgt-neg-in95.0%
metadata-eval95.0%
Simplified95.0%
Taylor expanded in x around 0 69.9%
Final simplification69.7%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= x -4.6e+49) (* 0.5 (/ y (/ a x))) (if (<= x 3.8e-187) (* -4.5 (/ (* z t) a)) (* 0.5 (* x (/ y a))))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -4.6e+49) {
tmp = 0.5 * (y / (a / x));
} else if (x <= 3.8e-187) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: tmp
if (x <= (-4.6d+49)) then
tmp = 0.5d0 * (y / (a / x))
else if (x <= 3.8d-187) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -4.6e+49) {
tmp = 0.5 * (y / (a / x));
} else if (x <= 3.8e-187) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if x <= -4.6e+49: tmp = 0.5 * (y / (a / x)) elif x <= 3.8e-187: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (x <= -4.6e+49) tmp = Float64(0.5 * Float64(y / Float64(a / x))); elseif (x <= 3.8e-187) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (x <= -4.6e+49)
tmp = 0.5 * (y / (a / x));
elseif (x <= 3.8e-187)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[x, -4.6e+49], N[(0.5 * N[(y / N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.8e-187], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -4.6 \cdot 10^{+49}:\\
\;\;\;\;0.5 \cdot \frac{y}{\frac{a}{x}}\\
\mathbf{elif}\;x \leq 3.8 \cdot 10^{-187}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if x < -4.60000000000000004e49Initial program 89.3%
div-sub85.5%
*-commutative85.5%
div-sub89.3%
cancel-sign-sub-inv89.3%
*-commutative89.3%
fma-define89.3%
distribute-rgt-neg-in89.3%
associate-*r*89.3%
distribute-lft-neg-in89.3%
*-commutative89.3%
distribute-rgt-neg-in89.3%
metadata-eval89.3%
Simplified89.3%
Taylor expanded in x around inf 77.8%
associate-/l*77.8%
Simplified77.8%
Taylor expanded in x around 0 77.8%
associate-*r/77.8%
*-commutative77.8%
associate-/r/84.8%
Simplified84.8%
if -4.60000000000000004e49 < x < 3.80000000000000025e-187Initial program 95.3%
div-sub95.3%
*-commutative95.3%
div-sub95.3%
cancel-sign-sub-inv95.3%
*-commutative95.3%
fma-define95.3%
distribute-rgt-neg-in95.3%
associate-*r*95.5%
distribute-lft-neg-in95.5%
*-commutative95.5%
distribute-rgt-neg-in95.5%
metadata-eval95.5%
Simplified95.5%
Taylor expanded in x around 0 73.4%
if 3.80000000000000025e-187 < x Initial program 89.5%
div-sub89.5%
*-commutative89.5%
div-sub89.5%
cancel-sign-sub-inv89.5%
*-commutative89.5%
fma-define90.4%
distribute-rgt-neg-in90.4%
associate-*r*90.4%
distribute-lft-neg-in90.4%
*-commutative90.4%
distribute-rgt-neg-in90.4%
metadata-eval90.4%
Simplified90.4%
Taylor expanded in x around inf 57.6%
associate-/l*59.3%
Simplified59.3%
Final simplification69.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. 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 (<= a 1.5e-101) (* -4.5 (/ (* z t) a)) (* -4.5 (* t (/ z a)))))
assert(x < y && y < z && z < t && 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 (a <= 1.5e-101) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 (a <= 1.5d-101) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = (-4.5d0) * (t * (z / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
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 (a <= 1.5e-101) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if a <= 1.5e-101: tmp = -4.5 * ((z * t) / a) else: tmp = -4.5 * (t * (z / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (a <= 1.5e-101) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(-4.5 * Float64(t * Float64(z / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 (a <= 1.5e-101)
tmp = -4.5 * ((z * t) / a);
else
tmp = -4.5 * (t * (z / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[a, 1.5e-101], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq 1.5 \cdot 10^{-101}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if a < 1.5000000000000002e-101Initial program 92.8%
div-sub91.6%
*-commutative91.6%
div-sub92.8%
cancel-sign-sub-inv92.8%
*-commutative92.8%
fma-define93.3%
distribute-rgt-neg-in93.3%
associate-*r*93.4%
distribute-lft-neg-in93.4%
*-commutative93.4%
distribute-rgt-neg-in93.4%
metadata-eval93.4%
Simplified93.4%
Taylor expanded in x around 0 49.6%
if 1.5000000000000002e-101 < a Initial program 88.7%
div-sub88.7%
*-commutative88.7%
div-sub88.7%
cancel-sign-sub-inv88.7%
*-commutative88.7%
fma-define88.7%
distribute-rgt-neg-in88.7%
associate-*r*88.7%
distribute-lft-neg-in88.7%
*-commutative88.7%
distribute-rgt-neg-in88.7%
metadata-eval88.7%
Simplified88.7%
Taylor expanded in x around 0 49.0%
associate-/l*47.9%
Simplified47.9%
Final simplification49.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* t (/ z a))))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = (-4.5d0) * (t * (z / a))
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 91.5%
div-sub90.7%
*-commutative90.7%
div-sub91.5%
cancel-sign-sub-inv91.5%
*-commutative91.5%
fma-define91.9%
distribute-rgt-neg-in91.9%
associate-*r*92.0%
distribute-lft-neg-in92.0%
*-commutative92.0%
distribute-rgt-neg-in92.0%
metadata-eval92.0%
Simplified92.0%
Taylor expanded in x around 0 49.4%
associate-/l*49.1%
Simplified49.1%
(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 2024130
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:alt
(! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))