
(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 12 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 (* t (* z 9.0))))
(if (<= t_1 -2e+296)
(* (/ t a) (* z -4.5))
(if (<= t_1 2e-239)
(/ (- (* x y) (* z (* t 9.0))) (* a 2.0))
(if (<= t_1 200000.0)
(- (/ (* x (/ y a)) 2.0) (/ (* (* z t) 4.5) a))
(if (<= t_1 2e+294)
(/ (- (* x y) t_1) (* 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 = t * (z * 9.0);
double tmp;
if (t_1 <= -2e+296) {
tmp = (t / a) * (z * -4.5);
} else if (t_1 <= 2e-239) {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
} else if (t_1 <= 200000.0) {
tmp = ((x * (y / a)) / 2.0) - (((z * t) * 4.5) / a);
} else if (t_1 <= 2e+294) {
tmp = ((x * y) - t_1) / (a * 2.0);
} else {
tmp = (z / a) * (t * -4.5);
}
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) :: t_1
real(8) :: tmp
t_1 = t * (z * 9.0d0)
if (t_1 <= (-2d+296)) then
tmp = (t / a) * (z * (-4.5d0))
else if (t_1 <= 2d-239) then
tmp = ((x * y) - (z * (t * 9.0d0))) / (a * 2.0d0)
else if (t_1 <= 200000.0d0) then
tmp = ((x * (y / a)) / 2.0d0) - (((z * t) * 4.5d0) / a)
else if (t_1 <= 2d+294) then
tmp = ((x * y) - t_1) / (a * 2.0d0)
else
tmp = (z / a) * (t * (-4.5d0))
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 t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= -2e+296) {
tmp = (t / a) * (z * -4.5);
} else if (t_1 <= 2e-239) {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
} else if (t_1 <= 200000.0) {
tmp = ((x * (y / a)) / 2.0) - (((z * t) * 4.5) / a);
} else if (t_1 <= 2e+294) {
tmp = ((x * y) - t_1) / (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 = t * (z * 9.0) tmp = 0 if t_1 <= -2e+296: tmp = (t / a) * (z * -4.5) elif t_1 <= 2e-239: tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0) elif t_1 <= 200000.0: tmp = ((x * (y / a)) / 2.0) - (((z * t) * 4.5) / a) elif t_1 <= 2e+294: tmp = ((x * y) - t_1) / (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(t * Float64(z * 9.0)) tmp = 0.0 if (t_1 <= -2e+296) tmp = Float64(Float64(t / a) * Float64(z * -4.5)); elseif (t_1 <= 2e-239) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(t * 9.0))) / Float64(a * 2.0)); elseif (t_1 <= 200000.0) tmp = Float64(Float64(Float64(x * Float64(y / a)) / 2.0) - Float64(Float64(Float64(z * t) * 4.5) / a)); elseif (t_1 <= 2e+294) tmp = Float64(Float64(Float64(x * y) - t_1) / 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 = t * (z * 9.0);
tmp = 0.0;
if (t_1 <= -2e+296)
tmp = (t / a) * (z * -4.5);
elseif (t_1 <= 2e-239)
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
elseif (t_1 <= 200000.0)
tmp = ((x * (y / a)) / 2.0) - (((z * t) * 4.5) / a);
elseif (t_1 <= 2e+294)
tmp = ((x * y) - t_1) / (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[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+296], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-239], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(t * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 200000.0], N[(N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - N[(N[(N[(z * t), $MachinePrecision] * 4.5), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+294], N[(N[(N[(x * y), $MachinePrecision] - t$95$1), $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 := t \cdot \left(z \cdot 9\right)\\
\mathbf{if}\;t_1 \leq -2 \cdot 10^{+296}:\\
\;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\
\mathbf{elif}\;t_1 \leq 2 \cdot 10^{-239}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\mathbf{elif}\;t_1 \leq 200000:\\
\;\;\;\;\frac{x \cdot \frac{y}{a}}{2} - \frac{\left(z \cdot t\right) \cdot 4.5}{a}\\
\mathbf{elif}\;t_1 \leq 2 \cdot 10^{+294}:\\
\;\;\;\;\frac{x \cdot y - t_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < -1.99999999999999996e296Initial program 68.0%
associate-*l*68.0%
Simplified68.0%
Taylor expanded in x around 0 82.1%
*-commutative82.1%
associate-/l*99.8%
associate-*l/99.9%
Simplified99.9%
associate-*l/99.8%
associate-/r/99.8%
associate-*l*99.9%
Applied egg-rr99.9%
if -1.99999999999999996e296 < (*.f64 (*.f64 z 9) t) < 2.0000000000000002e-239Initial program 96.5%
associate-*l*96.5%
Simplified96.5%
if 2.0000000000000002e-239 < (*.f64 (*.f64 z 9) t) < 2e5Initial program 87.5%
associate-*l*87.5%
Simplified87.5%
div-sub87.5%
sub-neg87.5%
*-commutative87.5%
times-frac93.0%
div-inv92.9%
associate-*r*92.9%
*-commutative92.9%
associate-*l*93.0%
*-commutative93.0%
associate-/r*93.0%
metadata-eval93.0%
Applied egg-rr93.0%
sub-neg93.0%
associate-*l/93.0%
associate-*r/93.0%
*-commutative93.0%
associate-*l*93.0%
*-commutative93.0%
metadata-eval93.0%
Simplified93.0%
if 2e5 < (*.f64 (*.f64 z 9) t) < 2.00000000000000013e294Initial program 99.6%
if 2.00000000000000013e294 < (*.f64 (*.f64 z 9) t) Initial program 52.6%
associate-*l*57.7%
Simplified57.7%
Taylor expanded in x around 0 57.7%
*-commutative57.7%
associate-/l*89.1%
associate-*l/89.0%
Simplified89.0%
clear-num89.0%
associate-/r/89.1%
clear-num89.3%
Applied egg-rr89.3%
Final simplification96.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 (if (<= (* a 2.0) 2e-59) (/ (fma x y (* z (* t -9.0))) (* a 2.0)) (fma -4.5 (* z (/ t a)) (/ (* x (* y 0.5)) 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 * 2.0) <= 2e-59) {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = fma(-4.5, (z * (t / a)), ((x * (y * 0.5)) / 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 (Float64(a * 2.0) <= 2e-59) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = fma(-4.5, Float64(z * Float64(t / a)), Float64(Float64(x * Float64(y * 0.5)) / 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_] := If[LessEqual[N[(a * 2.0), $MachinePrecision], 2e-59], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] + N[(N[(x * N[(y * 0.5), $MachinePrecision]), $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}\;a \cdot 2 \leq 2 \cdot 10^{-59}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-4.5, z \cdot \frac{t}{a}, \frac{x \cdot \left(y \cdot 0.5\right)}{a}\right)\\
\end{array}
\end{array}
if (*.f64 a 2) < 2.0000000000000001e-59Initial program 92.0%
*-commutative92.0%
*-commutative92.0%
cancel-sign-sub-inv92.0%
fma-def93.1%
distribute-rgt-neg-in93.1%
associate-*r*93.6%
distribute-lft-neg-in93.6%
*-commutative93.6%
distribute-rgt-neg-in93.6%
metadata-eval93.6%
Simplified93.6%
if 2.0000000000000001e-59 < (*.f64 a 2) Initial program 83.6%
associate-*l*83.5%
Simplified83.5%
Taylor expanded in x around 0 83.6%
fma-def83.6%
associate-/l*90.9%
associate-/r/87.7%
associate-*r/87.7%
*-commutative87.7%
associate-*r*87.7%
Simplified87.7%
Final simplification92.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
(let* ((t_1 (* t (* z 9.0))))
(if (<= t_1 -2e+296)
(* (/ t a) (* z -4.5))
(if (<= t_1 2e+294)
(/ (- (* x y) t_1) (* 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 = t * (z * 9.0);
double tmp;
if (t_1 <= -2e+296) {
tmp = (t / a) * (z * -4.5);
} else if (t_1 <= 2e+294) {
tmp = ((x * y) - t_1) / (a * 2.0);
} else {
tmp = (z / a) * (t * -4.5);
}
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) :: t_1
real(8) :: tmp
t_1 = t * (z * 9.0d0)
if (t_1 <= (-2d+296)) then
tmp = (t / a) * (z * (-4.5d0))
else if (t_1 <= 2d+294) then
tmp = ((x * y) - t_1) / (a * 2.0d0)
else
tmp = (z / a) * (t * (-4.5d0))
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 t_1 = t * (z * 9.0);
double tmp;
if (t_1 <= -2e+296) {
tmp = (t / a) * (z * -4.5);
} else if (t_1 <= 2e+294) {
tmp = ((x * y) - t_1) / (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 = t * (z * 9.0) tmp = 0 if t_1 <= -2e+296: tmp = (t / a) * (z * -4.5) elif t_1 <= 2e+294: tmp = ((x * y) - t_1) / (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(t * Float64(z * 9.0)) tmp = 0.0 if (t_1 <= -2e+296) tmp = Float64(Float64(t / a) * Float64(z * -4.5)); elseif (t_1 <= 2e+294) tmp = Float64(Float64(Float64(x * y) - t_1) / 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 = t * (z * 9.0);
tmp = 0.0;
if (t_1 <= -2e+296)
tmp = (t / a) * (z * -4.5);
elseif (t_1 <= 2e+294)
tmp = ((x * y) - t_1) / (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[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+296], N[(N[(t / a), $MachinePrecision] * N[(z * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+294], N[(N[(N[(x * y), $MachinePrecision] - t$95$1), $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 := t \cdot \left(z \cdot 9\right)\\
\mathbf{if}\;t_1 \leq -2 \cdot 10^{+296}:\\
\;\;\;\;\frac{t}{a} \cdot \left(z \cdot -4.5\right)\\
\mathbf{elif}\;t_1 \leq 2 \cdot 10^{+294}:\\
\;\;\;\;\frac{x \cdot y - t_1}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < -1.99999999999999996e296Initial program 68.0%
associate-*l*68.0%
Simplified68.0%
Taylor expanded in x around 0 82.1%
*-commutative82.1%
associate-/l*99.8%
associate-*l/99.9%
Simplified99.9%
associate-*l/99.8%
associate-/r/99.8%
associate-*l*99.9%
Applied egg-rr99.9%
if -1.99999999999999996e296 < (*.f64 (*.f64 z 9) t) < 2.00000000000000013e294Initial program 95.1%
if 2.00000000000000013e294 < (*.f64 (*.f64 z 9) t) Initial program 52.6%
associate-*l*57.7%
Simplified57.7%
Taylor expanded in x around 0 57.7%
*-commutative57.7%
associate-/l*89.1%
associate-*l/89.0%
Simplified89.0%
clear-num89.0%
associate-/r/89.1%
clear-num89.3%
Applied egg-rr89.3%
Final simplification95.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
(if (or (<= z -5.4e+174)
(and (not (<= z -2.3e+151))
(or (<= z -2.1e+66) (not (<= z 6.2e-118)))))
(* -4.5 (/ t (/ a z)))
(* 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 ((z <= -5.4e+174) || (!(z <= -2.3e+151) && ((z <= -2.1e+66) || !(z <= 6.2e-118)))) {
tmp = -4.5 * (t / (a / z));
} 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 ((z <= (-5.4d+174)) .or. (.not. (z <= (-2.3d+151))) .and. (z <= (-2.1d+66)) .or. (.not. (z <= 6.2d-118))) then
tmp = (-4.5d0) * (t / (a / z))
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 ((z <= -5.4e+174) || (!(z <= -2.3e+151) && ((z <= -2.1e+66) || !(z <= 6.2e-118)))) {
tmp = -4.5 * (t / (a / z));
} 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 (z <= -5.4e+174) or (not (z <= -2.3e+151) and ((z <= -2.1e+66) or not (z <= 6.2e-118))): tmp = -4.5 * (t / (a / z)) 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 ((z <= -5.4e+174) || (!(z <= -2.3e+151) && ((z <= -2.1e+66) || !(z <= 6.2e-118)))) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); 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 ((z <= -5.4e+174) || (~((z <= -2.3e+151)) && ((z <= -2.1e+66) || ~((z <= 6.2e-118)))))
tmp = -4.5 * (t / (a / z));
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[Or[LessEqual[z, -5.4e+174], And[N[Not[LessEqual[z, -2.3e+151]], $MachinePrecision], Or[LessEqual[z, -2.1e+66], N[Not[LessEqual[z, 6.2e-118]], $MachinePrecision]]]], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $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}\;z \leq -5.4 \cdot 10^{+174} \lor \neg \left(z \leq -2.3 \cdot 10^{+151}\right) \land \left(z \leq -2.1 \cdot 10^{+66} \lor \neg \left(z \leq 6.2 \cdot 10^{-118}\right)\right):\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if z < -5.3999999999999998e174 or -2.3000000000000001e151 < z < -2.10000000000000005e66 or 6.2000000000000002e-118 < z Initial program 85.9%
associate-*l*86.6%
Simplified86.6%
Taylor expanded in x around 0 63.0%
associate-/l*68.3%
Simplified68.3%
if -5.3999999999999998e174 < z < -2.3000000000000001e151 or -2.10000000000000005e66 < z < 6.2000000000000002e-118Initial program 94.6%
associate-*l*94.5%
Simplified94.5%
Taylor expanded in x around inf 77.6%
associate-*r/73.7%
Simplified73.7%
Final simplification70.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
(if (or (<= z -5.4e+174)
(not (or (<= z -3e+149) (and (not (<= z -2.45e+69)) (<= z 6e-118)))))
(* -4.5 (/ t (/ a z)))
(* 0.5 (/ x (/ a y)))))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 ((z <= -5.4e+174) || !((z <= -3e+149) || (!(z <= -2.45e+69) && (z <= 6e-118)))) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x / (a / y));
}
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 ((z <= (-5.4d+174)) .or. (.not. (z <= (-3d+149)) .or. (.not. (z <= (-2.45d+69))) .and. (z <= 6d-118))) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = 0.5d0 * (x / (a / y))
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 ((z <= -5.4e+174) || !((z <= -3e+149) || (!(z <= -2.45e+69) && (z <= 6e-118)))) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x / (a / y));
}
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 (z <= -5.4e+174) or not ((z <= -3e+149) or (not (z <= -2.45e+69) and (z <= 6e-118))): tmp = -4.5 * (t / (a / z)) else: tmp = 0.5 * (x / (a / y)) 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 ((z <= -5.4e+174) || !((z <= -3e+149) || (!(z <= -2.45e+69) && (z <= 6e-118)))) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); 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 ((z <= -5.4e+174) || ~(((z <= -3e+149) || (~((z <= -2.45e+69)) && (z <= 6e-118)))))
tmp = -4.5 * (t / (a / z));
else
tmp = 0.5 * (x / (a / y));
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[z, -5.4e+174], N[Not[Or[LessEqual[z, -3e+149], And[N[Not[LessEqual[z, -2.45e+69]], $MachinePrecision], LessEqual[z, 6e-118]]]], $MachinePrecision]], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $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}\;z \leq -5.4 \cdot 10^{+174} \lor \neg \left(z \leq -3 \cdot 10^{+149} \lor \neg \left(z \leq -2.45 \cdot 10^{+69}\right) \land z \leq 6 \cdot 10^{-118}\right):\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if z < -5.3999999999999998e174 or -3.00000000000000003e149 < z < -2.45e69 or 6.00000000000000035e-118 < z Initial program 85.9%
associate-*l*86.6%
Simplified86.6%
Taylor expanded in x around 0 63.0%
associate-/l*68.3%
Simplified68.3%
if -5.3999999999999998e174 < z < -3.00000000000000003e149 or -2.45e69 < z < 6.00000000000000035e-118Initial program 94.6%
associate-*l*94.5%
Simplified94.5%
Taylor expanded in x around inf 77.6%
associate-/l*72.6%
Simplified72.6%
Final simplification70.3%
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 (* 0.5 (/ x (/ a y)))))
(if (<= x -3.45e+115)
t_1
(if (<= x -3.8e-30)
(* z (* -4.5 (/ t a)))
(if (or (<= x -5.1e-92) (not (<= x 8.5e-172)))
t_1
(* -4.5 (/ t (/ a z))))))))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 = 0.5 * (x / (a / y));
double tmp;
if (x <= -3.45e+115) {
tmp = t_1;
} else if (x <= -3.8e-30) {
tmp = z * (-4.5 * (t / a));
} else if ((x <= -5.1e-92) || !(x <= 8.5e-172)) {
tmp = t_1;
} else {
tmp = -4.5 * (t / (a / z));
}
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) :: t_1
real(8) :: tmp
t_1 = 0.5d0 * (x / (a / y))
if (x <= (-3.45d+115)) then
tmp = t_1
else if (x <= (-3.8d-30)) then
tmp = z * ((-4.5d0) * (t / a))
else if ((x <= (-5.1d-92)) .or. (.not. (x <= 8.5d-172))) then
tmp = t_1
else
tmp = (-4.5d0) * (t / (a / z))
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 t_1 = 0.5 * (x / (a / y));
double tmp;
if (x <= -3.45e+115) {
tmp = t_1;
} else if (x <= -3.8e-30) {
tmp = z * (-4.5 * (t / a));
} else if ((x <= -5.1e-92) || !(x <= 8.5e-172)) {
tmp = t_1;
} else {
tmp = -4.5 * (t / (a / z));
}
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 = 0.5 * (x / (a / y)) tmp = 0 if x <= -3.45e+115: tmp = t_1 elif x <= -3.8e-30: tmp = z * (-4.5 * (t / a)) elif (x <= -5.1e-92) or not (x <= 8.5e-172): tmp = t_1 else: tmp = -4.5 * (t / (a / z)) 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(0.5 * Float64(x / Float64(a / y))) tmp = 0.0 if (x <= -3.45e+115) tmp = t_1; elseif (x <= -3.8e-30) tmp = Float64(z * Float64(-4.5 * Float64(t / a))); elseif ((x <= -5.1e-92) || !(x <= 8.5e-172)) tmp = t_1; else tmp = Float64(-4.5 * Float64(t / Float64(a / z))); 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 = 0.5 * (x / (a / y));
tmp = 0.0;
if (x <= -3.45e+115)
tmp = t_1;
elseif (x <= -3.8e-30)
tmp = z * (-4.5 * (t / a));
elseif ((x <= -5.1e-92) || ~((x <= 8.5e-172)))
tmp = t_1;
else
tmp = -4.5 * (t / (a / z));
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[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.45e+115], t$95$1, If[LessEqual[x, -3.8e-30], N[(z * N[(-4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[x, -5.1e-92], N[Not[LessEqual[x, 8.5e-172]], $MachinePrecision]], t$95$1, N[(-4.5 * N[(t / N[(a / z), $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}
t_1 := 0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{if}\;x \leq -3.45 \cdot 10^{+115}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;x \leq -3.8 \cdot 10^{-30}:\\
\;\;\;\;z \cdot \left(-4.5 \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;x \leq -5.1 \cdot 10^{-92} \lor \neg \left(x \leq 8.5 \cdot 10^{-172}\right):\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\end{array}
\end{array}
if x < -3.44999999999999983e115 or -3.8000000000000003e-30 < x < -5.09999999999999972e-92 or 8.49999999999999963e-172 < x Initial program 92.4%
associate-*l*93.1%
Simplified93.1%
Taylor expanded in x around inf 65.6%
associate-/l*63.7%
Simplified63.7%
if -3.44999999999999983e115 < x < -3.8000000000000003e-30Initial program 88.4%
associate-*l*88.4%
Simplified88.4%
Taylor expanded in x around 0 53.0%
*-commutative53.0%
associate-/l*58.5%
associate-*l/58.5%
Simplified58.5%
*-commutative58.5%
associate-*r/58.5%
associate-/r/55.8%
associate-*r*55.8%
Applied egg-rr55.8%
if -5.09999999999999972e-92 < x < 8.49999999999999963e-172Initial program 86.1%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in x around 0 69.3%
associate-/l*78.9%
Simplified78.9%
Final simplification67.3%
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 (* 0.5 (/ x (/ a y)))))
(if (<= x -3.9e+117)
t_1
(if (<= x -1.05e-30)
(* z (* -4.5 (/ t a)))
(if (<= x -8e-92)
(* (* y 0.5) (/ x a))
(if (<= x 8.5e-172) (* -4.5 (/ t (/ a z))) t_1))))))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 = 0.5 * (x / (a / y));
double tmp;
if (x <= -3.9e+117) {
tmp = t_1;
} else if (x <= -1.05e-30) {
tmp = z * (-4.5 * (t / a));
} else if (x <= -8e-92) {
tmp = (y * 0.5) * (x / a);
} else if (x <= 8.5e-172) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = 0.5d0 * (x / (a / y))
if (x <= (-3.9d+117)) then
tmp = t_1
else if (x <= (-1.05d-30)) then
tmp = z * ((-4.5d0) * (t / a))
else if (x <= (-8d-92)) then
tmp = (y * 0.5d0) * (x / a)
else if (x <= 8.5d-172) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = t_1
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 t_1 = 0.5 * (x / (a / y));
double tmp;
if (x <= -3.9e+117) {
tmp = t_1;
} else if (x <= -1.05e-30) {
tmp = z * (-4.5 * (t / a));
} else if (x <= -8e-92) {
tmp = (y * 0.5) * (x / a);
} else if (x <= 8.5e-172) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = t_1;
}
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 = 0.5 * (x / (a / y)) tmp = 0 if x <= -3.9e+117: tmp = t_1 elif x <= -1.05e-30: tmp = z * (-4.5 * (t / a)) elif x <= -8e-92: tmp = (y * 0.5) * (x / a) elif x <= 8.5e-172: tmp = -4.5 * (t / (a / z)) else: tmp = t_1 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(0.5 * Float64(x / Float64(a / y))) tmp = 0.0 if (x <= -3.9e+117) tmp = t_1; elseif (x <= -1.05e-30) tmp = Float64(z * Float64(-4.5 * Float64(t / a))); elseif (x <= -8e-92) tmp = Float64(Float64(y * 0.5) * Float64(x / a)); elseif (x <= 8.5e-172) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = t_1; 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 = 0.5 * (x / (a / y));
tmp = 0.0;
if (x <= -3.9e+117)
tmp = t_1;
elseif (x <= -1.05e-30)
tmp = z * (-4.5 * (t / a));
elseif (x <= -8e-92)
tmp = (y * 0.5) * (x / a);
elseif (x <= 8.5e-172)
tmp = -4.5 * (t / (a / z));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.9e+117], t$95$1, If[LessEqual[x, -1.05e-30], N[(z * N[(-4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -8e-92], N[(N[(y * 0.5), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.5e-172], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\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 := 0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{if}\;x \leq -3.9 \cdot 10^{+117}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;x \leq -1.05 \cdot 10^{-30}:\\
\;\;\;\;z \cdot \left(-4.5 \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;x \leq -8 \cdot 10^{-92}:\\
\;\;\;\;\left(y \cdot 0.5\right) \cdot \frac{x}{a}\\
\mathbf{elif}\;x \leq 8.5 \cdot 10^{-172}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if x < -3.8999999999999999e117 or 8.49999999999999963e-172 < x Initial program 91.9%
associate-*l*92.6%
Simplified92.6%
Taylor expanded in x around inf 65.9%
associate-/l*64.5%
Simplified64.5%
if -3.8999999999999999e117 < x < -1.0500000000000001e-30Initial program 88.4%
associate-*l*88.4%
Simplified88.4%
Taylor expanded in x around 0 53.0%
*-commutative53.0%
associate-/l*58.5%
associate-*l/58.5%
Simplified58.5%
*-commutative58.5%
associate-*r/58.5%
associate-/r/55.8%
associate-*r*55.8%
Applied egg-rr55.8%
if -1.0500000000000001e-30 < x < -7.9999999999999999e-92Initial program 99.8%
associate-*l*99.8%
Simplified99.8%
Taylor expanded in a around 0 99.8%
associate-*r/99.8%
cancel-sign-sub-inv99.8%
metadata-eval99.8%
+-commutative99.8%
associate-/l*99.2%
+-commutative99.2%
metadata-eval99.2%
cancel-sign-sub-inv99.2%
fma-neg99.2%
*-commutative99.2%
distribute-lft-neg-in99.2%
metadata-eval99.2%
*-commutative99.2%
associate-*l*99.1%
Simplified99.1%
Taylor expanded in x around inf 60.8%
associate-/r*61.0%
Simplified61.0%
metadata-eval61.0%
associate-*l/61.0%
div-inv61.0%
associate-*l/52.7%
div-inv52.7%
clear-num53.0%
associate-/r/61.2%
associate-*l*61.2%
Applied egg-rr61.2%
if -7.9999999999999999e-92 < x < 8.49999999999999963e-172Initial program 86.1%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in x around 0 69.3%
associate-/l*78.9%
Simplified78.9%
Final simplification67.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 (<= (* x y) -0.0008) (/ 0.5 (/ a (* x y))) (if (<= (* x y) 5e+45) (* -4.5 (/ t (/ a z))) (* 0.5 (/ x (/ a y))))))
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 * y) <= -0.0008) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+45) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x / (a / y));
}
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 * y) <= (-0.0008d0)) then
tmp = 0.5d0 / (a / (x * y))
else if ((x * y) <= 5d+45) then
tmp = (-4.5d0) * (t / (a / z))
else
tmp = 0.5d0 * (x / (a / y))
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 * y) <= -0.0008) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+45) {
tmp = -4.5 * (t / (a / z));
} else {
tmp = 0.5 * (x / (a / y));
}
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 * y) <= -0.0008: tmp = 0.5 / (a / (x * y)) elif (x * y) <= 5e+45: tmp = -4.5 * (t / (a / z)) else: tmp = 0.5 * (x / (a / y)) 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 (Float64(x * y) <= -0.0008) tmp = Float64(0.5 / Float64(a / Float64(x * y))); elseif (Float64(x * y) <= 5e+45) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); 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 * y) <= -0.0008)
tmp = 0.5 / (a / (x * y));
elseif ((x * y) <= 5e+45)
tmp = -4.5 * (t / (a / z));
else
tmp = 0.5 * (x / (a / y));
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[N[(x * y), $MachinePrecision], -0.0008], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+45], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $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 \cdot y \leq -0.0008:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+45}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -8.00000000000000038e-4Initial program 89.3%
associate-*l*89.3%
Simplified89.3%
Taylor expanded in a around 0 89.3%
associate-*r/89.3%
cancel-sign-sub-inv89.3%
metadata-eval89.3%
+-commutative89.3%
associate-/l*89.2%
+-commutative89.2%
metadata-eval89.2%
cancel-sign-sub-inv89.2%
fma-neg92.4%
*-commutative92.4%
distribute-lft-neg-in92.4%
metadata-eval92.4%
*-commutative92.4%
associate-*l*92.4%
Simplified92.4%
Taylor expanded in x around inf 75.9%
if -8.00000000000000038e-4 < (*.f64 x y) < 5e45Initial program 90.6%
associate-*l*91.3%
Simplified91.3%
Taylor expanded in x around 0 71.5%
associate-/l*72.7%
Simplified72.7%
if 5e45 < (*.f64 x y) Initial program 88.7%
associate-*l*88.7%
Simplified88.7%
Taylor expanded in x around inf 77.7%
associate-/l*78.1%
Simplified78.1%
Final simplification74.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 (<= (* x y) -0.0008) (/ 0.5 (/ a (* x y))) (if (<= (* x y) 5e+45) (/ t (/ (/ a z) -4.5)) (* 0.5 (/ x (/ a y))))))
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 * y) <= -0.0008) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+45) {
tmp = t / ((a / z) / -4.5);
} else {
tmp = 0.5 * (x / (a / y));
}
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 * y) <= (-0.0008d0)) then
tmp = 0.5d0 / (a / (x * y))
else if ((x * y) <= 5d+45) then
tmp = t / ((a / z) / (-4.5d0))
else
tmp = 0.5d0 * (x / (a / y))
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 * y) <= -0.0008) {
tmp = 0.5 / (a / (x * y));
} else if ((x * y) <= 5e+45) {
tmp = t / ((a / z) / -4.5);
} else {
tmp = 0.5 * (x / (a / y));
}
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 * y) <= -0.0008: tmp = 0.5 / (a / (x * y)) elif (x * y) <= 5e+45: tmp = t / ((a / z) / -4.5) else: tmp = 0.5 * (x / (a / y)) 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 (Float64(x * y) <= -0.0008) tmp = Float64(0.5 / Float64(a / Float64(x * y))); elseif (Float64(x * y) <= 5e+45) tmp = Float64(t / Float64(Float64(a / z) / -4.5)); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); 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 * y) <= -0.0008)
tmp = 0.5 / (a / (x * y));
elseif ((x * y) <= 5e+45)
tmp = t / ((a / z) / -4.5);
else
tmp = 0.5 * (x / (a / y));
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[N[(x * y), $MachinePrecision], -0.0008], N[(0.5 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+45], N[(t / N[(N[(a / z), $MachinePrecision] / -4.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $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 \cdot y \leq -0.0008:\\
\;\;\;\;\frac{0.5}{\frac{a}{x \cdot y}}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+45}:\\
\;\;\;\;\frac{t}{\frac{\frac{a}{z}}{-4.5}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -8.00000000000000038e-4Initial program 89.3%
associate-*l*89.3%
Simplified89.3%
Taylor expanded in a around 0 89.3%
associate-*r/89.3%
cancel-sign-sub-inv89.3%
metadata-eval89.3%
+-commutative89.3%
associate-/l*89.2%
+-commutative89.2%
metadata-eval89.2%
cancel-sign-sub-inv89.2%
fma-neg92.4%
*-commutative92.4%
distribute-lft-neg-in92.4%
metadata-eval92.4%
*-commutative92.4%
associate-*l*92.4%
Simplified92.4%
Taylor expanded in x around inf 75.9%
if -8.00000000000000038e-4 < (*.f64 x y) < 5e45Initial program 90.6%
associate-*l*91.3%
Simplified91.3%
div-sub91.3%
sub-neg91.3%
*-commutative91.3%
times-frac84.9%
div-inv84.8%
associate-*r*84.1%
*-commutative84.1%
associate-*l*84.9%
*-commutative84.9%
associate-/r*84.9%
metadata-eval84.9%
Applied egg-rr84.9%
sub-neg84.9%
associate-*l/84.9%
associate-*r/84.9%
*-commutative84.9%
associate-*l*84.9%
*-commutative84.9%
metadata-eval84.9%
Simplified84.9%
Taylor expanded in x around 0 71.5%
associate-/l*72.7%
associate-*r/72.7%
*-commutative72.7%
associate-/l*72.7%
Simplified72.7%
if 5e45 < (*.f64 x y) Initial program 88.7%
associate-*l*88.7%
Simplified88.7%
Taylor expanded in x around inf 77.7%
associate-/l*78.1%
Simplified78.1%
Final simplification74.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 (<= (* x y) -0.0008) (/ (* x (* y 0.5)) a) (if (<= (* x y) 5e+45) (/ t (/ (/ a z) -4.5)) (* 0.5 (/ x (/ a y))))))
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 * y) <= -0.0008) {
tmp = (x * (y * 0.5)) / a;
} else if ((x * y) <= 5e+45) {
tmp = t / ((a / z) / -4.5);
} else {
tmp = 0.5 * (x / (a / y));
}
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 * y) <= (-0.0008d0)) then
tmp = (x * (y * 0.5d0)) / a
else if ((x * y) <= 5d+45) then
tmp = t / ((a / z) / (-4.5d0))
else
tmp = 0.5d0 * (x / (a / y))
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 * y) <= -0.0008) {
tmp = (x * (y * 0.5)) / a;
} else if ((x * y) <= 5e+45) {
tmp = t / ((a / z) / -4.5);
} else {
tmp = 0.5 * (x / (a / y));
}
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 * y) <= -0.0008: tmp = (x * (y * 0.5)) / a elif (x * y) <= 5e+45: tmp = t / ((a / z) / -4.5) else: tmp = 0.5 * (x / (a / y)) 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 (Float64(x * y) <= -0.0008) tmp = Float64(Float64(x * Float64(y * 0.5)) / a); elseif (Float64(x * y) <= 5e+45) tmp = Float64(t / Float64(Float64(a / z) / -4.5)); else tmp = Float64(0.5 * Float64(x / Float64(a / y))); 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 * y) <= -0.0008)
tmp = (x * (y * 0.5)) / a;
elseif ((x * y) <= 5e+45)
tmp = t / ((a / z) / -4.5);
else
tmp = 0.5 * (x / (a / y));
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[N[(x * y), $MachinePrecision], -0.0008], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e+45], N[(t / N[(N[(a / z), $MachinePrecision] / -4.5), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x / N[(a / y), $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 \cdot y \leq -0.0008:\\
\;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\
\mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{+45}:\\
\;\;\;\;\frac{t}{\frac{\frac{a}{z}}{-4.5}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -8.00000000000000038e-4Initial program 89.3%
associate-*l*89.3%
Simplified89.3%
Taylor expanded in x around inf 76.0%
associate-*r/76.0%
*-commutative76.0%
associate-*r*76.0%
Simplified76.0%
if -8.00000000000000038e-4 < (*.f64 x y) < 5e45Initial program 90.6%
associate-*l*91.3%
Simplified91.3%
div-sub91.3%
sub-neg91.3%
*-commutative91.3%
times-frac84.9%
div-inv84.8%
associate-*r*84.1%
*-commutative84.1%
associate-*l*84.9%
*-commutative84.9%
associate-/r*84.9%
metadata-eval84.9%
Applied egg-rr84.9%
sub-neg84.9%
associate-*l/84.9%
associate-*r/84.9%
*-commutative84.9%
associate-*l*84.9%
*-commutative84.9%
metadata-eval84.9%
Simplified84.9%
Taylor expanded in x around 0 71.5%
associate-/l*72.7%
associate-*r/72.7%
*-commutative72.7%
associate-/l*72.7%
Simplified72.7%
if 5e45 < (*.f64 x y) Initial program 88.7%
associate-*l*88.7%
Simplified88.7%
Taylor expanded in x around inf 77.7%
associate-/l*78.1%
Simplified78.1%
Final simplification74.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 (<= z -3.2e+221) (* (/ z a) (* t -4.5)) (/ (- (* 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 tmp;
if (z <= -3.2e+221) {
tmp = (z / a) * (t * -4.5);
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
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 (z <= (-3.2d+221)) then
tmp = (z / a) * (t * (-4.5d0))
else
tmp = ((x * y) - (z * (t * 9.0d0))) / (a * 2.0d0)
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 (z <= -3.2e+221) {
tmp = (z / a) * (t * -4.5);
} 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): tmp = 0 if z <= -3.2e+221: tmp = (z / a) * (t * -4.5) 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) tmp = 0.0 if (z <= -3.2e+221) tmp = Float64(Float64(z / a) * Float64(t * -4.5)); 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)
tmp = 0.0;
if (z <= -3.2e+221)
tmp = (z / a) * (t * -4.5);
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_] := If[LessEqual[z, -3.2e+221], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $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}
\mathbf{if}\;z \leq -3.2 \cdot 10^{+221}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\end{array}
\end{array}
if z < -3.2e221Initial program 63.8%
associate-*l*63.7%
Simplified63.7%
Taylor expanded in x around 0 59.4%
*-commutative59.4%
associate-/l*78.8%
associate-*l/78.9%
Simplified78.9%
clear-num78.9%
associate-/r/78.8%
clear-num78.9%
Applied egg-rr78.9%
if -3.2e221 < z Initial program 92.6%
associate-*l*93.0%
Simplified93.0%
Final simplification91.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 (* -4.5 (/ t (/ a z))))
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 / (a / z));
}
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 / (a / z))
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 / (a / z));
}
[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 / (a / z))
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(a / z))) 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 / (a / z));
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[(a / z), $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 \frac{t}{\frac{a}{z}}
\end{array}
Initial program 89.9%
associate-*l*90.3%
Simplified90.3%
Taylor expanded in x around 0 48.2%
associate-/l*50.7%
Simplified50.7%
Final simplification50.7%
(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 2023332
(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)))