
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 8.8e-21)
(/ (* z (fma a (* t -4.0) (/ (fma 9.0 (* x y) b) z))) (* c_m z))
(if (<= c_m 7.2e+219)
(fma
a
(* t (/ -4.0 c_m))
(fma x (/ (* 9.0 y) (* c_m z)) (/ b (* c_m z))))
(/ (fma 9.0 (/ (* x y) c_m) (/ (fma a (* -4.0 (* z t)) b) c_m)) z)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 8.8e-21) {
tmp = (z * fma(a, (t * -4.0), (fma(9.0, (x * y), b) / z))) / (c_m * z);
} else if (c_m <= 7.2e+219) {
tmp = fma(a, (t * (-4.0 / c_m)), fma(x, ((9.0 * y) / (c_m * z)), (b / (c_m * z))));
} else {
tmp = fma(9.0, ((x * y) / c_m), (fma(a, (-4.0 * (z * t)), b) / c_m)) / z;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 8.8e-21) tmp = Float64(Float64(z * fma(a, Float64(t * -4.0), Float64(fma(9.0, Float64(x * y), b) / z))) / Float64(c_m * z)); elseif (c_m <= 7.2e+219) tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), fma(x, Float64(Float64(9.0 * y) / Float64(c_m * z)), Float64(b / Float64(c_m * z)))); else tmp = Float64(fma(9.0, Float64(Float64(x * y) / c_m), Float64(fma(a, Float64(-4.0 * Float64(z * t)), b) / c_m)) / z); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 8.8e-21], N[(N[(z * N[(a * N[(t * -4.0), $MachinePrecision] + N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[c$95$m, 7.2e+219], N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * N[(N[(9.0 * y), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c$95$m), $MachinePrecision] + N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 8.8 \cdot 10^{-21}:\\
\;\;\;\;\frac{z \cdot \mathsf{fma}\left(a, t \cdot -4, \frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z}\right)}{c\_m \cdot z}\\
\mathbf{elif}\;c\_m \leq 7.2 \cdot 10^{+219}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \mathsf{fma}\left(x, \frac{9 \cdot y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, \frac{x \cdot y}{c\_m}, \frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)}{c\_m}\right)}{z}\\
\end{array}
\end{array}
if c < 8.8000000000000002e-21Initial program 86.5%
Taylor expanded in z around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-outN/A
remove-double-negN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6485.2
Applied rewrites85.2%
if 8.8000000000000002e-21 < c < 7.20000000000000012e219Initial program 66.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites87.9%
if 7.20000000000000012e219 < c Initial program 64.0%
Taylor expanded in z around 0
lower-/.f64N/A
Applied rewrites84.5%
Final simplification85.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* 9.0 (* x (/ y (* c_m z))))) (t_2 (* y (* 9.0 x))))
(*
c_s
(if (<= t_2 -1e+285)
t_1
(if (<= t_2 -1e-183)
(* -4.0 (* a (/ t c_m)))
(if (<= t_2 2e+127) (/ (/ b z) c_m) t_1))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = 9.0 * (x * (y / (c_m * z)));
double t_2 = y * (9.0 * x);
double tmp;
if (t_2 <= -1e+285) {
tmp = t_1;
} else if (t_2 <= -1e-183) {
tmp = -4.0 * (a * (t / c_m));
} else if (t_2 <= 2e+127) {
tmp = (b / z) / c_m;
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * (x * (y / (c_m * z)))
t_2 = y * (9.0d0 * x)
if (t_2 <= (-1d+285)) then
tmp = t_1
else if (t_2 <= (-1d-183)) then
tmp = (-4.0d0) * (a * (t / c_m))
else if (t_2 <= 2d+127) then
tmp = (b / z) / c_m
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = 9.0 * (x * (y / (c_m * z)));
double t_2 = y * (9.0 * x);
double tmp;
if (t_2 <= -1e+285) {
tmp = t_1;
} else if (t_2 <= -1e-183) {
tmp = -4.0 * (a * (t / c_m));
} else if (t_2 <= 2e+127) {
tmp = (b / z) / c_m;
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = 9.0 * (x * (y / (c_m * z))) t_2 = y * (9.0 * x) tmp = 0 if t_2 <= -1e+285: tmp = t_1 elif t_2 <= -1e-183: tmp = -4.0 * (a * (t / c_m)) elif t_2 <= 2e+127: tmp = (b / z) / c_m else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(9.0 * Float64(x * Float64(y / Float64(c_m * z)))) t_2 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if (t_2 <= -1e+285) tmp = t_1; elseif (t_2 <= -1e-183) tmp = Float64(-4.0 * Float64(a * Float64(t / c_m))); elseif (t_2 <= 2e+127) tmp = Float64(Float64(b / z) / c_m); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = 9.0 * (x * (y / (c_m * z)));
t_2 = y * (9.0 * x);
tmp = 0.0;
if (t_2 <= -1e+285)
tmp = t_1;
elseif (t_2 <= -1e-183)
tmp = -4.0 * (a * (t / c_m));
elseif (t_2 <= 2e+127)
tmp = (b / z) / c_m;
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(y / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -1e+285], t$95$1, If[LessEqual[t$95$2, -1e-183], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2e+127], N[(N[(b / z), $MachinePrecision] / c$95$m), $MachinePrecision], t$95$1]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{y}{c\_m \cdot z}\right)\\
t_2 := y \cdot \left(9 \cdot x\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+285}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-183}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c\_m}\right)\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+127}:\\
\;\;\;\;\frac{\frac{b}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999998e284 or 1.99999999999999991e127 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 81.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites80.0%
Taylor expanded in x around inf
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6479.1
Applied rewrites79.1%
if -9.9999999999999998e284 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.00000000000000001e-183Initial program 73.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6478.4
Applied rewrites78.4%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6445.6
Applied rewrites45.6%
if -1.00000000000000001e-183 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999991e127Initial program 85.0%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6457.2
Applied rewrites57.2%
associate-/r*N/A
lower-/.f64N/A
lower-/.f6458.9
Applied rewrites58.9%
Final simplification58.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* 9.0 x))))
(*
c_s
(if (<= t_1 -2e+165)
(/ (* y (/ (* 9.0 x) c_m)) z)
(if (<= t_1 5e+89)
(/ (fma -4.0 (* a t) (/ b z)) c_m)
(/ (fma (* t (* z a)) -4.0 (* x (* 9.0 y))) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * x);
double tmp;
if (t_1 <= -2e+165) {
tmp = (y * ((9.0 * x) / c_m)) / z;
} else if (t_1 <= 5e+89) {
tmp = fma(-4.0, (a * t), (b / z)) / c_m;
} else {
tmp = fma((t * (z * a)), -4.0, (x * (9.0 * y))) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if (t_1 <= -2e+165) tmp = Float64(Float64(y * Float64(Float64(9.0 * x) / c_m)) / z); elseif (t_1 <= 5e+89) tmp = Float64(fma(-4.0, Float64(a * t), Float64(b / z)) / c_m); else tmp = Float64(fma(Float64(t * Float64(z * a)), -4.0, Float64(x * Float64(9.0 * y))) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+165], N[(N[(y * N[(N[(9.0 * x), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 5e+89], N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[(t * N[(z * a), $MachinePrecision]), $MachinePrecision] * -4.0 + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot x\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+165}:\\
\;\;\;\;\frac{y \cdot \frac{9 \cdot x}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+89}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, a \cdot t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot \left(z \cdot a\right), -4, x \cdot \left(9 \cdot y\right)\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999998e165Initial program 76.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.7%
Taylor expanded in a around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6479.3
Applied rewrites79.3%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6482.2
Applied rewrites82.2%
if -1.9999999999999998e165 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999983e89Initial program 81.0%
Taylor expanded in z around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-outN/A
remove-double-negN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6480.8
Applied rewrites80.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6482.4
Applied rewrites82.4%
if 4.99999999999999983e89 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 82.1%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6474.2
Applied rewrites74.2%
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6476.7
Applied rewrites76.7%
Final simplification81.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* 9.0 x))))
(*
c_s
(if (<= t_1 -2e+165)
(/ (* y (/ (* 9.0 x) c_m)) z)
(if (<= t_1 1e+63)
(/ (fma -4.0 (* a t) (/ b z)) c_m)
(/ (fma x (* 9.0 y) b) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * x);
double tmp;
if (t_1 <= -2e+165) {
tmp = (y * ((9.0 * x) / c_m)) / z;
} else if (t_1 <= 1e+63) {
tmp = fma(-4.0, (a * t), (b / z)) / c_m;
} else {
tmp = fma(x, (9.0 * y), b) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if (t_1 <= -2e+165) tmp = Float64(Float64(y * Float64(Float64(9.0 * x) / c_m)) / z); elseif (t_1 <= 1e+63) tmp = Float64(fma(-4.0, Float64(a * t), Float64(b / z)) / c_m); else tmp = Float64(fma(x, Float64(9.0 * y), b) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+165], N[(N[(y * N[(N[(9.0 * x), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e+63], N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot x\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+165}:\\
\;\;\;\;\frac{y \cdot \frac{9 \cdot x}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{+63}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, a \cdot t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999998e165Initial program 76.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.7%
Taylor expanded in a around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6479.3
Applied rewrites79.3%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6482.2
Applied rewrites82.2%
if -1.9999999999999998e165 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000006e63Initial program 80.7%
Taylor expanded in z around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-outN/A
remove-double-negN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6481.0
Applied rewrites81.0%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6482.6
Applied rewrites82.6%
if 1.00000000000000006e63 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 83.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6474.5
Applied rewrites74.4%
Taylor expanded in z around 0
lower-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.8
Applied rewrites75.8%
Final simplification81.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* 9.0 x))))
(*
c_s
(if (<= t_1 -2e-117)
(/ (/ (fma 9.0 (* x y) b) c_m) z)
(if (<= t_1 4e-154)
(/ (fma (* z (* a t)) -4.0 b) (* c_m z))
(/ (fma x (* 9.0 y) b) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * x);
double tmp;
if (t_1 <= -2e-117) {
tmp = (fma(9.0, (x * y), b) / c_m) / z;
} else if (t_1 <= 4e-154) {
tmp = fma((z * (a * t)), -4.0, b) / (c_m * z);
} else {
tmp = fma(x, (9.0 * y), b) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if (t_1 <= -2e-117) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / c_m) / z); elseif (t_1 <= 4e-154) tmp = Float64(fma(Float64(z * Float64(a * t)), -4.0, b) / Float64(c_m * z)); else tmp = Float64(fma(x, Float64(9.0 * y), b) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e-117], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 4e-154], N[(N[(N[(z * N[(a * t), $MachinePrecision]), $MachinePrecision] * -4.0 + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot x\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-117}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-154}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(a \cdot t\right), -4, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.00000000000000006e-117Initial program 78.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites83.7%
Taylor expanded in a around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6472.8
Applied rewrites72.8%
if -2.00000000000000006e-117 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.9999999999999999e-154Initial program 79.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.4
Applied rewrites77.4%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f6477.4
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6480.7
Applied rewrites80.7%
if 3.9999999999999999e-154 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 84.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6480.1
Applied rewrites80.1%
Taylor expanded in z around 0
lower-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.4
Applied rewrites72.4%
Final simplification75.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* 9.0 x))))
(*
c_s
(if (<= t_1 -2e+63)
(/ (* y (/ (* 9.0 x) c_m)) z)
(if (<= t_1 4e-154)
(/ (fma (* z (* a t)) -4.0 b) (* c_m z))
(/ (fma x (* 9.0 y) b) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * x);
double tmp;
if (t_1 <= -2e+63) {
tmp = (y * ((9.0 * x) / c_m)) / z;
} else if (t_1 <= 4e-154) {
tmp = fma((z * (a * t)), -4.0, b) / (c_m * z);
} else {
tmp = fma(x, (9.0 * y), b) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if (t_1 <= -2e+63) tmp = Float64(Float64(y * Float64(Float64(9.0 * x) / c_m)) / z); elseif (t_1 <= 4e-154) tmp = Float64(fma(Float64(z * Float64(a * t)), -4.0, b) / Float64(c_m * z)); else tmp = Float64(fma(x, Float64(9.0 * y), b) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+63], N[(N[(y * N[(N[(9.0 * x), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 4e-154], N[(N[(N[(z * N[(a * t), $MachinePrecision]), $MachinePrecision] * -4.0 + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot x\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+63}:\\
\;\;\;\;\frac{y \cdot \frac{9 \cdot x}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-154}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(a \cdot t\right), -4, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.00000000000000012e63Initial program 76.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites83.0%
Taylor expanded in a around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6476.0
Applied rewrites76.0%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6475.9
Applied rewrites75.9%
if -2.00000000000000012e63 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.9999999999999999e-154Initial program 80.1%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6471.5
Applied rewrites71.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f6471.5
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6474.0
Applied rewrites74.0%
if 3.9999999999999999e-154 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 84.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6480.1
Applied rewrites80.1%
Taylor expanded in z around 0
lower-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.4
Applied rewrites72.4%
Final simplification73.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* y (* 9.0 x))))
(*
c_s
(if (<= t_1 -2e+63)
(/ (* y (/ (* 9.0 x) c_m)) z)
(if (<= t_1 1e-237)
(/ (fma a (* -4.0 (* z t)) b) (* c_m z))
(/ (fma x (* 9.0 y) b) (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = y * (9.0 * x);
double tmp;
if (t_1 <= -2e+63) {
tmp = (y * ((9.0 * x) / c_m)) / z;
} else if (t_1 <= 1e-237) {
tmp = fma(a, (-4.0 * (z * t)), b) / (c_m * z);
} else {
tmp = fma(x, (9.0 * y), b) / (c_m * z);
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if (t_1 <= -2e+63) tmp = Float64(Float64(y * Float64(Float64(9.0 * x) / c_m)) / z); elseif (t_1 <= 1e-237) tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), b) / Float64(c_m * z)); else tmp = Float64(fma(x, Float64(9.0 * y), b) / Float64(c_m * z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+63], N[(N[(y * N[(N[(9.0 * x), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-237], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot x\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+63}:\\
\;\;\;\;\frac{y \cdot \frac{9 \cdot x}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-237}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.00000000000000012e63Initial program 76.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites83.0%
Taylor expanded in a around 0
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6476.0
Applied rewrites76.0%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f6475.9
Applied rewrites75.9%
if -2.00000000000000012e63 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999999e-238Initial program 78.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6470.4
Applied rewrites70.4%
if 9.9999999999999999e-238 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 85.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6482.3
Applied rewrites82.3%
Taylor expanded in z around 0
lower-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6473.7
Applied rewrites73.7%
Final simplification72.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma -4.0 (* a t) (/ b z)) c_m)))
(*
c_s
(if (<= z -1.1e+51)
t_1
(if (<= z 3.1e+140)
(/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* c_m z))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(-4.0, (a * t), (b / z)) / c_m;
double tmp;
if (z <= -1.1e+51) {
tmp = t_1;
} else if (z <= 3.1e+140) {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(-4.0, Float64(a * t), Float64(b / z)) / c_m) tmp = 0.0 if (z <= -1.1e+51) tmp = t_1; elseif (z <= 3.1e+140) tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.1e+51], t$95$1, If[LessEqual[z, 3.1e+140], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(-4, a \cdot t, \frac{b}{z}\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.1 \cdot 10^{+51}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 3.1 \cdot 10^{+140}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.09999999999999996e51 or 3.1e140 < z Initial program 52.4%
Taylor expanded in z around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-outN/A
remove-double-negN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6461.8
Applied rewrites61.8%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6481.0
Applied rewrites81.0%
if -1.09999999999999996e51 < z < 3.1e140Initial program 94.8%
Final simplification90.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma -4.0 (* a t) (/ b z)) c_m)))
(*
c_s
(if (<= z -1.1e+51)
t_1
(if (<= z 6.6e+210)
(/ (fma (* z -4.0) (* a t) (fma x (* 9.0 y) b)) (* c_m z))
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(-4.0, (a * t), (b / z)) / c_m;
double tmp;
if (z <= -1.1e+51) {
tmp = t_1;
} else if (z <= 6.6e+210) {
tmp = fma((z * -4.0), (a * t), fma(x, (9.0 * y), b)) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(-4.0, Float64(a * t), Float64(b / z)) / c_m) tmp = 0.0 if (z <= -1.1e+51) tmp = t_1; elseif (z <= 6.6e+210) tmp = Float64(fma(Float64(z * -4.0), Float64(a * t), fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.1e+51], t$95$1, If[LessEqual[z, 6.6e+210], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(a * t), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(-4, a \cdot t, \frac{b}{z}\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.1 \cdot 10^{+51}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 6.6 \cdot 10^{+210}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, a \cdot t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.09999999999999996e51 or 6.5999999999999999e210 < z Initial program 49.2%
Taylor expanded in z around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-outN/A
remove-double-negN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6459.1
Applied rewrites59.1%
Taylor expanded in x around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6482.5
Applied rewrites82.5%
if -1.09999999999999996e51 < z < 6.5999999999999999e210Initial program 92.6%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
Applied rewrites90.0%
Final simplification87.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* -4.0 (* a (/ t c_m)))))
(*
c_s
(if (<= t -1.65e+216)
t_1
(if (<= t 1.2e-59) (/ (fma x (* 9.0 y) b) (* c_m z)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = -4.0 * (a * (t / c_m));
double tmp;
if (t <= -1.65e+216) {
tmp = t_1;
} else if (t <= 1.2e-59) {
tmp = fma(x, (9.0 * y), b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(-4.0 * Float64(a * Float64(t / c_m))) tmp = 0.0 if (t <= -1.65e+216) tmp = t_1; elseif (t <= 1.2e-59) tmp = Float64(fma(x, Float64(9.0 * y), b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t, -1.65e+216], t$95$1, If[LessEqual[t, 1.2e-59], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot \frac{t}{c\_m}\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -1.65 \cdot 10^{+216}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 1.2 \cdot 10^{-59}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if t < -1.65e216 or 1.20000000000000008e-59 < t Initial program 75.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6457.4
Applied rewrites57.4%
if -1.65e216 < t < 1.20000000000000008e-59Initial program 83.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6487.1
Applied rewrites87.1%
Taylor expanded in z around 0
lower-/.f64N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6470.5
Applied rewrites70.5%
Final simplification65.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* -4.0 (* a (/ t c_m)))))
(*
c_s
(if (<= t -1.65e+216)
t_1
(if (<= t 1.2e-59) (/ (fma 9.0 (* x y) b) (* c_m z)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = -4.0 * (a * (t / c_m));
double tmp;
if (t <= -1.65e+216) {
tmp = t_1;
} else if (t <= 1.2e-59) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(-4.0 * Float64(a * Float64(t / c_m))) tmp = 0.0 if (t <= -1.65e+216) tmp = t_1; elseif (t <= 1.2e-59) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t, -1.65e+216], t$95$1, If[LessEqual[t, 1.2e-59], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot \frac{t}{c\_m}\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -1.65 \cdot 10^{+216}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 1.2 \cdot 10^{-59}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if t < -1.65e216 or 1.20000000000000008e-59 < t Initial program 75.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6469.0
Applied rewrites69.0%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6457.4
Applied rewrites57.4%
if -1.65e216 < t < 1.20000000000000008e-59Initial program 83.3%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6470.5
Applied rewrites70.5%
Final simplification65.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= b -6e+30)
(/ (/ b z) c_m)
(if (<= b 4.2e+47) (* -4.0 (* a (/ t c_m))) (/ (/ b c_m) z)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -6e+30) {
tmp = (b / z) / c_m;
} else if (b <= 4.2e+47) {
tmp = -4.0 * (a * (t / c_m));
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (b <= (-6d+30)) then
tmp = (b / z) / c_m
else if (b <= 4.2d+47) then
tmp = (-4.0d0) * (a * (t / c_m))
else
tmp = (b / c_m) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -6e+30) {
tmp = (b / z) / c_m;
} else if (b <= 4.2e+47) {
tmp = -4.0 * (a * (t / c_m));
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if b <= -6e+30: tmp = (b / z) / c_m elif b <= 4.2e+47: tmp = -4.0 * (a * (t / c_m)) else: tmp = (b / c_m) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (b <= -6e+30) tmp = Float64(Float64(b / z) / c_m); elseif (b <= 4.2e+47) tmp = Float64(-4.0 * Float64(a * Float64(t / c_m))); else tmp = Float64(Float64(b / c_m) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (b <= -6e+30)
tmp = (b / z) / c_m;
elseif (b <= 4.2e+47)
tmp = -4.0 * (a * (t / c_m));
else
tmp = (b / c_m) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[b, -6e+30], N[(N[(b / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[b, 4.2e+47], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -6 \cdot 10^{+30}:\\
\;\;\;\;\frac{\frac{b}{z}}{c\_m}\\
\mathbf{elif}\;b \leq 4.2 \cdot 10^{+47}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if b < -5.99999999999999956e30Initial program 79.2%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6460.3
Applied rewrites60.3%
associate-/r*N/A
lower-/.f64N/A
lower-/.f6460.5
Applied rewrites60.5%
if -5.99999999999999956e30 < b < 4.2e47Initial program 80.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6482.3
Applied rewrites82.3%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6445.5
Applied rewrites45.5%
if 4.2e47 < b Initial program 82.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6463.0
Applied rewrites63.0%
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.8
Applied rewrites71.8%
Final simplification54.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= b -6e+30)
(/ b (* c_m z))
(if (<= b 4.2e+47) (* -4.0 (* a (/ t c_m))) (/ (/ b c_m) z)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -6e+30) {
tmp = b / (c_m * z);
} else if (b <= 4.2e+47) {
tmp = -4.0 * (a * (t / c_m));
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: tmp
if (b <= (-6d+30)) then
tmp = b / (c_m * z)
else if (b <= 4.2d+47) then
tmp = (-4.0d0) * (a * (t / c_m))
else
tmp = (b / c_m) / z
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (b <= -6e+30) {
tmp = b / (c_m * z);
} else if (b <= 4.2e+47) {
tmp = -4.0 * (a * (t / c_m));
} else {
tmp = (b / c_m) / z;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): tmp = 0 if b <= -6e+30: tmp = b / (c_m * z) elif b <= 4.2e+47: tmp = -4.0 * (a * (t / c_m)) else: tmp = (b / c_m) / z return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (b <= -6e+30) tmp = Float64(b / Float64(c_m * z)); elseif (b <= 4.2e+47) tmp = Float64(-4.0 * Float64(a * Float64(t / c_m))); else tmp = Float64(Float64(b / c_m) / z); end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
tmp = 0.0;
if (b <= -6e+30)
tmp = b / (c_m * z);
elseif (b <= 4.2e+47)
tmp = -4.0 * (a * (t / c_m));
else
tmp = (b / c_m) / z;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[b, -6e+30], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.2e+47], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -6 \cdot 10^{+30}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{elif}\;b \leq 4.2 \cdot 10^{+47}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if b < -5.99999999999999956e30Initial program 79.2%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6460.3
Applied rewrites60.3%
if -5.99999999999999956e30 < b < 4.2e47Initial program 80.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6482.3
Applied rewrites82.3%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6445.5
Applied rewrites45.5%
if 4.2e47 < b Initial program 82.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6463.0
Applied rewrites63.0%
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6471.8
Applied rewrites71.8%
Final simplification54.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ b (* c_m z))))
(*
c_s
(if (<= b -6e+30) t_1 (if (<= b 1.55e+53) (* -4.0 (* a (/ t c_m))) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = b / (c_m * z);
double tmp;
if (b <= -6e+30) {
tmp = t_1;
} else if (b <= 1.55e+53) {
tmp = -4.0 * (a * (t / c_m));
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = b / (c_m * z)
if (b <= (-6d+30)) then
tmp = t_1
else if (b <= 1.55d+53) then
tmp = (-4.0d0) * (a * (t / c_m))
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = b / (c_m * z);
double tmp;
if (b <= -6e+30) {
tmp = t_1;
} else if (b <= 1.55e+53) {
tmp = -4.0 * (a * (t / c_m));
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = b / (c_m * z) tmp = 0 if b <= -6e+30: tmp = t_1 elif b <= 1.55e+53: tmp = -4.0 * (a * (t / c_m)) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(b / Float64(c_m * z)) tmp = 0.0 if (b <= -6e+30) tmp = t_1; elseif (b <= 1.55e+53) tmp = Float64(-4.0 * Float64(a * Float64(t / c_m))); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = b / (c_m * z);
tmp = 0.0;
if (b <= -6e+30)
tmp = t_1;
elseif (b <= 1.55e+53)
tmp = -4.0 * (a * (t / c_m));
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[b, -6e+30], t$95$1, If[LessEqual[b, 1.55e+53], N[(-4.0 * N[(a * N[(t / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -6 \cdot 10^{+30}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 1.55 \cdot 10^{+53}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c\_m}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if b < -5.99999999999999956e30 or 1.5500000000000001e53 < b Initial program 80.7%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6461.6
Applied rewrites61.6%
if -5.99999999999999956e30 < b < 1.5500000000000001e53Initial program 80.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6482.3
Applied rewrites82.3%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6445.5
Applied rewrites45.5%
Final simplification52.9%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* -4.0 (* t (/ a c_m))))) (* c_s (if (<= a -2.1e-87) t_1 (if (<= a 1.2e+38) (/ b (* c_m z)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = -4.0 * (t * (a / c_m));
double tmp;
if (a <= -2.1e-87) {
tmp = t_1;
} else if (a <= 1.2e+38) {
tmp = b / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * (t * (a / c_m))
if (a <= (-2.1d-87)) then
tmp = t_1
else if (a <= 1.2d+38) then
tmp = b / (c_m * z)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = -4.0 * (t * (a / c_m));
double tmp;
if (a <= -2.1e-87) {
tmp = t_1;
} else if (a <= 1.2e+38) {
tmp = b / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = -4.0 * (t * (a / c_m)) tmp = 0 if a <= -2.1e-87: tmp = t_1 elif a <= 1.2e+38: tmp = b / (c_m * z) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(-4.0 * Float64(t * Float64(a / c_m))) tmp = 0.0 if (a <= -2.1e-87) tmp = t_1; elseif (a <= 1.2e+38) tmp = Float64(b / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = -4.0 * (t * (a / c_m));
tmp = 0.0;
if (a <= -2.1e-87)
tmp = t_1;
elseif (a <= 1.2e+38)
tmp = b / (c_m * z);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(-4.0 * N[(t * N[(a / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[a, -2.1e-87], t$95$1, If[LessEqual[a, 1.2e+38], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot \frac{a}{c\_m}\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -2.1 \cdot 10^{-87}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 1.2 \cdot 10^{+38}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if a < -2.10000000000000007e-87 or 1.20000000000000009e38 < a Initial program 81.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-+.f64N/A
associate-/r*N/A
clear-numN/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6481.0
Applied rewrites80.9%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6449.5
Applied rewrites49.5%
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6453.3
Applied rewrites53.3%
if -2.10000000000000007e-87 < a < 1.20000000000000009e38Initial program 79.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6448.3
Applied rewrites48.3%
Final simplification50.7%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (/ b (* c_m z))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (c_m * z));
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
code = c_s * (b / (c_m * z))
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (c_m * z));
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): return c_s * (b / (c_m * z))
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) return Float64(c_s * Float64(b / Float64(c_m * z))) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp = code(c_s, x, y, z, t, a, b, c_m)
tmp = c_s * (b / (c_m * z));
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{c\_m \cdot z}
\end{array}
Initial program 80.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6440.0
Applied rewrites40.0%
Final simplification40.0%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024214
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))