
(FPCore (x y z t a b c i) :precision binary64 (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * Math.log(y)) + z) + t) + a) + ((b - 0.5) * Math.log(c))) + (y * i);
}
def code(x, y, z, t, a, b, c, i): return (((((x * math.log(y)) + z) + t) + a) + ((b - 0.5) * math.log(c))) + (y * i)
function code(x, y, z, t, a, b, c, i) return Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 22 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c i) :precision binary64 (+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i);
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
code = (((((x * log(y)) + z) + t) + a) + ((b - 0.5d0) * log(c))) + (y * i)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (((((x * Math.log(y)) + z) + t) + a) + ((b - 0.5) * Math.log(c))) + (y * i);
}
def code(x, y, z, t, a, b, c, i): return (((((x * math.log(y)) + z) + t) + a) + ((b - 0.5) * math.log(c))) + (y * i)
function code(x, y, z, t, a, b, c, i) return Float64(Float64(Float64(Float64(Float64(Float64(x * log(y)) + z) + t) + a) + Float64(Float64(b - 0.5) * log(c))) + Float64(y * i)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (((((x * log(y)) + z) + t) + a) + ((b - 0.5) * log(c))) + (y * i); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(N[(N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision] + t), $MachinePrecision] + a), $MachinePrecision] + N[(N[(b - 0.5), $MachinePrecision] * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(x \cdot \log y + z\right) + t\right) + a\right) + \left(b - 0.5\right) \cdot \log c\right) + y \cdot i
\end{array}
(FPCore (x y z t a b c i) :precision binary64 (fma y i (fma (+ b -0.5) (log c) (+ z (+ t (fma x (log y) a))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return fma(y, i, fma((b + -0.5), log(c), (z + (t + fma(x, log(y), a)))));
}
function code(x, y, z, t, a, b, c, i) return fma(y, i, fma(Float64(b + -0.5), log(c), Float64(z + Float64(t + fma(x, log(y), a))))) end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(y * i + N[(N[(b + -0.5), $MachinePrecision] * N[Log[c], $MachinePrecision] + N[(z + N[(t + N[(x * N[Log[y], $MachinePrecision] + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\mathsf{fma}\left(y, i, \mathsf{fma}\left(b + -0.5, \log c, z + \left(t + \mathsf{fma}\left(x, \log y, a\right)\right)\right)\right)
\end{array}
Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* x (log y))))
(if (<= x -9e+152)
(+ a (+ t_1 (* y i)))
(if (<= x 5e+141)
(+ (+ z (+ t a)) (fma (log c) (+ b -0.5) (* y i)))
(+ (* y i) (+ t_1 (* b (log c))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = x * log(y);
double tmp;
if (x <= -9e+152) {
tmp = a + (t_1 + (y * i));
} else if (x <= 5e+141) {
tmp = (z + (t + a)) + fma(log(c), (b + -0.5), (y * i));
} else {
tmp = (y * i) + (t_1 + (b * log(c)));
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) t_1 = Float64(x * log(y)) tmp = 0.0 if (x <= -9e+152) tmp = Float64(a + Float64(t_1 + Float64(y * i))); elseif (x <= 5e+141) tmp = Float64(Float64(z + Float64(t + a)) + fma(log(c), Float64(b + -0.5), Float64(y * i))); else tmp = Float64(Float64(y * i) + Float64(t_1 + Float64(b * log(c)))); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -9e+152], N[(a + N[(t$95$1 + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5e+141], N[(N[(z + N[(t + a), $MachinePrecision]), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b + -0.5), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(t$95$1 + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot \log y\\
\mathbf{if}\;x \leq -9 \cdot 10^{+152}:\\
\;\;\;\;a + \left(t\_1 + y \cdot i\right)\\
\mathbf{elif}\;x \leq 5 \cdot 10^{+141}:\\
\;\;\;\;\left(z + \left(t + a\right)\right) + \mathsf{fma}\left(\log c, b + -0.5, y \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot i + \left(t\_1 + b \cdot \log c\right)\\
\end{array}
\end{array}
if x < -9.0000000000000002e152Initial program 99.7%
associate-+l+99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+l+99.7%
+-commutative99.7%
fma-define99.7%
+-commutative99.7%
fma-define99.7%
sub-neg99.7%
metadata-eval99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in y around inf 62.4%
Taylor expanded in a around inf 54.3%
Taylor expanded in y around 0 85.1%
if -9.0000000000000002e152 < x < 5.00000000000000025e141Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 94.7%
associate-+r+94.7%
+-commutative94.7%
*-commutative94.7%
sub-neg94.7%
metadata-eval94.7%
+-commutative94.7%
distribute-rgt-out94.7%
+-commutative94.7%
distribute-rgt-in94.7%
associate-+r+94.7%
+-commutative94.7%
+-commutative94.7%
+-commutative94.7%
fma-define94.7%
+-commutative94.7%
Simplified94.7%
if 5.00000000000000025e141 < x Initial program 99.9%
add-cube-cbrt99.6%
pow399.6%
sub-neg99.6%
metadata-eval99.6%
*-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in b around inf 99.9%
*-commutative99.9%
Simplified99.9%
Taylor expanded in t around 0 91.4%
Taylor expanded in x around inf 83.0%
Final simplification92.5%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* x (log y))))
(if (<= x -2.9e+153)
(+ a (+ t_1 (* y i)))
(if (<= x 5e+141)
(+ (* y i) (+ (* (log c) (- b 0.5)) (+ a (+ z t))))
(+ (* y i) (+ t_1 (* b (log c))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = x * log(y);
double tmp;
if (x <= -2.9e+153) {
tmp = a + (t_1 + (y * i));
} else if (x <= 5e+141) {
tmp = (y * i) + ((log(c) * (b - 0.5)) + (a + (z + t)));
} else {
tmp = (y * i) + (t_1 + (b * log(c)));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = x * log(y)
if (x <= (-2.9d+153)) then
tmp = a + (t_1 + (y * i))
else if (x <= 5d+141) then
tmp = (y * i) + ((log(c) * (b - 0.5d0)) + (a + (z + t)))
else
tmp = (y * i) + (t_1 + (b * log(c)))
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 i) {
double t_1 = x * Math.log(y);
double tmp;
if (x <= -2.9e+153) {
tmp = a + (t_1 + (y * i));
} else if (x <= 5e+141) {
tmp = (y * i) + ((Math.log(c) * (b - 0.5)) + (a + (z + t)));
} else {
tmp = (y * i) + (t_1 + (b * Math.log(c)));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = x * math.log(y) tmp = 0 if x <= -2.9e+153: tmp = a + (t_1 + (y * i)) elif x <= 5e+141: tmp = (y * i) + ((math.log(c) * (b - 0.5)) + (a + (z + t))) else: tmp = (y * i) + (t_1 + (b * math.log(c))) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(x * log(y)) tmp = 0.0 if (x <= -2.9e+153) tmp = Float64(a + Float64(t_1 + Float64(y * i))); elseif (x <= 5e+141) tmp = Float64(Float64(y * i) + Float64(Float64(log(c) * Float64(b - 0.5)) + Float64(a + Float64(z + t)))); else tmp = Float64(Float64(y * i) + Float64(t_1 + Float64(b * log(c)))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = x * log(y); tmp = 0.0; if (x <= -2.9e+153) tmp = a + (t_1 + (y * i)); elseif (x <= 5e+141) tmp = (y * i) + ((log(c) * (b - 0.5)) + (a + (z + t))); else tmp = (y * i) + (t_1 + (b * log(c))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.9e+153], N[(a + N[(t$95$1 + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5e+141], N[(N[(y * i), $MachinePrecision] + N[(N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision] + N[(a + N[(z + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(t$95$1 + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot \log y\\
\mathbf{if}\;x \leq -2.9 \cdot 10^{+153}:\\
\;\;\;\;a + \left(t\_1 + y \cdot i\right)\\
\mathbf{elif}\;x \leq 5 \cdot 10^{+141}:\\
\;\;\;\;y \cdot i + \left(\log c \cdot \left(b - 0.5\right) + \left(a + \left(z + t\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot i + \left(t\_1 + b \cdot \log c\right)\\
\end{array}
\end{array}
if x < -2.90000000000000002e153Initial program 99.7%
associate-+l+99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+l+99.7%
+-commutative99.7%
fma-define99.7%
+-commutative99.7%
fma-define99.7%
sub-neg99.7%
metadata-eval99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in y around inf 62.4%
Taylor expanded in a around inf 54.3%
Taylor expanded in y around 0 85.1%
if -2.90000000000000002e153 < x < 5.00000000000000025e141Initial program 99.9%
Taylor expanded in x around 0 94.7%
if 5.00000000000000025e141 < x Initial program 99.9%
add-cube-cbrt99.6%
pow399.6%
sub-neg99.6%
metadata-eval99.6%
*-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in b around inf 99.9%
*-commutative99.9%
Simplified99.9%
Taylor expanded in t around 0 91.4%
Taylor expanded in x around inf 83.0%
Final simplification92.5%
(FPCore (x y z t a b c i) :precision binary64 (+ (+ (+ a (+ t (+ z (* x (log y))))) (* (log c) (- b 0.5))) (* y i)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return ((a + (t + (z + (x * log(y))))) + (log(c) * (b - 0.5))) + (y * i);
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
code = ((a + (t + (z + (x * log(y))))) + (log(c) * (b - 0.5d0))) + (y * i)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return ((a + (t + (z + (x * Math.log(y))))) + (Math.log(c) * (b - 0.5))) + (y * i);
}
def code(x, y, z, t, a, b, c, i): return ((a + (t + (z + (x * math.log(y))))) + (math.log(c) * (b - 0.5))) + (y * i)
function code(x, y, z, t, a, b, c, i) return Float64(Float64(Float64(a + Float64(t + Float64(z + Float64(x * log(y))))) + Float64(log(c) * Float64(b - 0.5))) + Float64(y * i)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = ((a + (t + (z + (x * log(y))))) + (log(c) * (b - 0.5))) + (y * i); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(N[(a + N[(t + N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(a + \left(t + \left(z + x \cdot \log y\right)\right)\right) + \log c \cdot \left(b - 0.5\right)\right) + y \cdot i
\end{array}
Initial program 99.9%
Final simplification99.9%
(FPCore (x y z t a b c i) :precision binary64 (if (<= a 9e+71) (+ (* y i) (+ (+ z (* x (log y))) (* b (log c)))) (fma y i (+ a (+ t (+ z (* (log c) (- b 0.5))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (a <= 9e+71) {
tmp = (y * i) + ((z + (x * log(y))) + (b * log(c)));
} else {
tmp = fma(y, i, (a + (t + (z + (log(c) * (b - 0.5))))));
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (a <= 9e+71) tmp = Float64(Float64(y * i) + Float64(Float64(z + Float64(x * log(y))) + Float64(b * log(c)))); else tmp = fma(y, i, Float64(a + Float64(t + Float64(z + Float64(log(c) * Float64(b - 0.5)))))); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[a, 9e+71], N[(N[(y * i), $MachinePrecision] + N[(N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * i + N[(a + N[(t + N[(z + N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \leq 9 \cdot 10^{+71}:\\
\;\;\;\;y \cdot i + \left(\left(z + x \cdot \log y\right) + b \cdot \log c\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(y, i, a + \left(t + \left(z + \log c \cdot \left(b - 0.5\right)\right)\right)\right)\\
\end{array}
\end{array}
if a < 9.00000000000000087e71Initial program 99.9%
add-cube-cbrt99.6%
pow399.6%
sub-neg99.6%
metadata-eval99.6%
*-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in b around inf 98.2%
*-commutative98.2%
Simplified98.2%
Taylor expanded in t around 0 83.1%
Taylor expanded in a around 0 70.6%
if 9.00000000000000087e71 < a Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 94.5%
Final simplification75.5%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* b (log c))))
(if (<= a 3e+73)
(+ (* y i) (+ (+ z (* x (log y))) t_1))
(+ (* y i) (+ t_1 (+ a (+ z t)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = b * log(c);
double tmp;
if (a <= 3e+73) {
tmp = (y * i) + ((z + (x * log(y))) + t_1);
} else {
tmp = (y * i) + (t_1 + (a + (z + t)));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = b * log(c)
if (a <= 3d+73) then
tmp = (y * i) + ((z + (x * log(y))) + t_1)
else
tmp = (y * i) + (t_1 + (a + (z + t)))
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 i) {
double t_1 = b * Math.log(c);
double tmp;
if (a <= 3e+73) {
tmp = (y * i) + ((z + (x * Math.log(y))) + t_1);
} else {
tmp = (y * i) + (t_1 + (a + (z + t)));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = b * math.log(c) tmp = 0 if a <= 3e+73: tmp = (y * i) + ((z + (x * math.log(y))) + t_1) else: tmp = (y * i) + (t_1 + (a + (z + t))) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(b * log(c)) tmp = 0.0 if (a <= 3e+73) tmp = Float64(Float64(y * i) + Float64(Float64(z + Float64(x * log(y))) + t_1)); else tmp = Float64(Float64(y * i) + Float64(t_1 + Float64(a + Float64(z + t)))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = b * log(c); tmp = 0.0; if (a <= 3e+73) tmp = (y * i) + ((z + (x * log(y))) + t_1); else tmp = (y * i) + (t_1 + (a + (z + t))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, 3e+73], N[(N[(y * i), $MachinePrecision] + N[(N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(t$95$1 + N[(a + N[(z + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \log c\\
\mathbf{if}\;a \leq 3 \cdot 10^{+73}:\\
\;\;\;\;y \cdot i + \left(\left(z + x \cdot \log y\right) + t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot i + \left(t\_1 + \left(a + \left(z + t\right)\right)\right)\\
\end{array}
\end{array}
if a < 3.00000000000000011e73Initial program 99.9%
add-cube-cbrt99.6%
pow399.6%
sub-neg99.6%
metadata-eval99.6%
*-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in b around inf 98.2%
*-commutative98.2%
Simplified98.2%
Taylor expanded in t around 0 83.1%
Taylor expanded in a around 0 70.6%
if 3.00000000000000011e73 < a Initial program 99.9%
add-cube-cbrt99.8%
pow399.8%
sub-neg99.8%
metadata-eval99.8%
*-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in b around inf 99.9%
*-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 94.4%
Final simplification75.5%
(FPCore (x y z t a b c i) :precision binary64 (+ (* y i) (+ (* (log c) (- b 0.5)) (+ a (+ z (* x (log y)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (y * i) + ((log(c) * (b - 0.5)) + (a + (z + (x * log(y)))));
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
code = (y * i) + ((log(c) * (b - 0.5d0)) + (a + (z + (x * log(y)))))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (y * i) + ((Math.log(c) * (b - 0.5)) + (a + (z + (x * Math.log(y)))));
}
def code(x, y, z, t, a, b, c, i): return (y * i) + ((math.log(c) * (b - 0.5)) + (a + (z + (x * math.log(y)))))
function code(x, y, z, t, a, b, c, i) return Float64(Float64(y * i) + Float64(Float64(log(c) * Float64(b - 0.5)) + Float64(a + Float64(z + Float64(x * log(y)))))) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (y * i) + ((log(c) * (b - 0.5)) + (a + (z + (x * log(y))))); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(y * i), $MachinePrecision] + N[(N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision] + N[(a + N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
y \cdot i + \left(\log c \cdot \left(b - 0.5\right) + \left(a + \left(z + x \cdot \log y\right)\right)\right)
\end{array}
Initial program 99.9%
Taylor expanded in t around 0 86.4%
Final simplification86.4%
(FPCore (x y z t a b c i) :precision binary64 (+ (* y i) (+ (+ a (+ z (* x (log y)))) (* b (log c)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (y * i) + ((a + (z + (x * log(y)))) + (b * log(c)));
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
code = (y * i) + ((a + (z + (x * log(y)))) + (b * log(c)))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return (y * i) + ((a + (z + (x * Math.log(y)))) + (b * Math.log(c)));
}
def code(x, y, z, t, a, b, c, i): return (y * i) + ((a + (z + (x * math.log(y)))) + (b * math.log(c)))
function code(x, y, z, t, a, b, c, i) return Float64(Float64(y * i) + Float64(Float64(a + Float64(z + Float64(x * log(y)))) + Float64(b * log(c)))) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = (y * i) + ((a + (z + (x * log(y)))) + (b * log(c))); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(N[(y * i), $MachinePrecision] + N[(N[(a + N[(z + N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
y \cdot i + \left(\left(a + \left(z + x \cdot \log y\right)\right) + b \cdot \log c\right)
\end{array}
Initial program 99.9%
add-cube-cbrt99.7%
pow399.6%
sub-neg99.6%
metadata-eval99.6%
*-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in b around inf 98.6%
*-commutative98.6%
Simplified98.6%
Taylor expanded in t around 0 85.1%
Final simplification85.1%
(FPCore (x y z t a b c i)
:precision binary64
(if (<= z -2.2e+264)
z
(if (<= z -3e+135)
(* y (+ i (+ (/ a y) (+ (/ t y) (/ z y)))))
(if (or (<= z -8e+69)
(and (not (<= z -1400000000000.0)) (<= z -1.1e-131)))
(+ (* y i) (+ a (* b (log c))))
(+ a (+ (* x (log y)) (* y i)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (z <= -2.2e+264) {
tmp = z;
} else if (z <= -3e+135) {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
} else if ((z <= -8e+69) || (!(z <= -1400000000000.0) && (z <= -1.1e-131))) {
tmp = (y * i) + (a + (b * log(c)));
} else {
tmp = a + ((x * log(y)) + (y * i));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (z <= (-2.2d+264)) then
tmp = z
else if (z <= (-3d+135)) then
tmp = y * (i + ((a / y) + ((t / y) + (z / y))))
else if ((z <= (-8d+69)) .or. (.not. (z <= (-1400000000000.0d0))) .and. (z <= (-1.1d-131))) then
tmp = (y * i) + (a + (b * log(c)))
else
tmp = a + ((x * log(y)) + (y * i))
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 i) {
double tmp;
if (z <= -2.2e+264) {
tmp = z;
} else if (z <= -3e+135) {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
} else if ((z <= -8e+69) || (!(z <= -1400000000000.0) && (z <= -1.1e-131))) {
tmp = (y * i) + (a + (b * Math.log(c)));
} else {
tmp = a + ((x * Math.log(y)) + (y * i));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if z <= -2.2e+264: tmp = z elif z <= -3e+135: tmp = y * (i + ((a / y) + ((t / y) + (z / y)))) elif (z <= -8e+69) or (not (z <= -1400000000000.0) and (z <= -1.1e-131)): tmp = (y * i) + (a + (b * math.log(c))) else: tmp = a + ((x * math.log(y)) + (y * i)) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (z <= -2.2e+264) tmp = z; elseif (z <= -3e+135) tmp = Float64(y * Float64(i + Float64(Float64(a / y) + Float64(Float64(t / y) + Float64(z / y))))); elseif ((z <= -8e+69) || (!(z <= -1400000000000.0) && (z <= -1.1e-131))) tmp = Float64(Float64(y * i) + Float64(a + Float64(b * log(c)))); else tmp = Float64(a + Float64(Float64(x * log(y)) + Float64(y * i))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (z <= -2.2e+264) tmp = z; elseif (z <= -3e+135) tmp = y * (i + ((a / y) + ((t / y) + (z / y)))); elseif ((z <= -8e+69) || (~((z <= -1400000000000.0)) && (z <= -1.1e-131))) tmp = (y * i) + (a + (b * log(c))); else tmp = a + ((x * log(y)) + (y * i)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[z, -2.2e+264], z, If[LessEqual[z, -3e+135], N[(y * N[(i + N[(N[(a / y), $MachinePrecision] + N[(N[(t / y), $MachinePrecision] + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[z, -8e+69], And[N[Not[LessEqual[z, -1400000000000.0]], $MachinePrecision], LessEqual[z, -1.1e-131]]], N[(N[(y * i), $MachinePrecision] + N[(a + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.2 \cdot 10^{+264}:\\
\;\;\;\;z\\
\mathbf{elif}\;z \leq -3 \cdot 10^{+135}:\\
\;\;\;\;y \cdot \left(i + \left(\frac{a}{y} + \left(\frac{t}{y} + \frac{z}{y}\right)\right)\right)\\
\mathbf{elif}\;z \leq -8 \cdot 10^{+69} \lor \neg \left(z \leq -1400000000000\right) \land z \leq -1.1 \cdot 10^{-131}:\\
\;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\
\mathbf{else}:\\
\;\;\;\;a + \left(x \cdot \log y + y \cdot i\right)\\
\end{array}
\end{array}
if z < -2.2e264Initial program 100.0%
associate-+l+100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+r+100.0%
+-commutative100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+l+100.0%
+-commutative100.0%
fma-define100.0%
+-commutative100.0%
fma-define100.0%
sub-neg100.0%
metadata-eval100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in x around 0 100.0%
Taylor expanded in z around inf 88.7%
if -2.2e264 < z < -3e135Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 88.3%
Taylor expanded in y around inf 69.1%
Taylor expanded in z around inf 65.4%
if -3e135 < z < -8.0000000000000006e69 or -1.4e12 < z < -1.1e-131Initial program 99.7%
add-cube-cbrt99.1%
pow399.1%
sub-neg99.1%
metadata-eval99.1%
*-commutative99.1%
Applied egg-rr99.1%
Taylor expanded in b around inf 97.1%
*-commutative97.1%
Simplified97.1%
Taylor expanded in a around inf 74.3%
if -8.0000000000000006e69 < z < -1.4e12 or -1.1e-131 < z Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in y around inf 74.3%
Taylor expanded in a around inf 50.5%
Taylor expanded in y around 0 63.0%
Final simplification65.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* (log c) (- b 0.5))) (t_2 (+ a (+ (* x (log y)) (* y i)))))
(if (<= z -1.6e+72)
(+ t (+ z (+ t_1 (* y i))))
(if (<= z -1.12e+14)
t_2
(if (<= z -6.2e-135)
(+ (* y i) (+ a t_1))
(if (<= z -3.5e-271) t_2 (+ (* y i) (+ a (* b (log c))))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = log(c) * (b - 0.5);
double t_2 = a + ((x * log(y)) + (y * i));
double tmp;
if (z <= -1.6e+72) {
tmp = t + (z + (t_1 + (y * i)));
} else if (z <= -1.12e+14) {
tmp = t_2;
} else if (z <= -6.2e-135) {
tmp = (y * i) + (a + t_1);
} else if (z <= -3.5e-271) {
tmp = t_2;
} else {
tmp = (y * i) + (a + (b * log(c)));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = log(c) * (b - 0.5d0)
t_2 = a + ((x * log(y)) + (y * i))
if (z <= (-1.6d+72)) then
tmp = t + (z + (t_1 + (y * i)))
else if (z <= (-1.12d+14)) then
tmp = t_2
else if (z <= (-6.2d-135)) then
tmp = (y * i) + (a + t_1)
else if (z <= (-3.5d-271)) then
tmp = t_2
else
tmp = (y * i) + (a + (b * log(c)))
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 i) {
double t_1 = Math.log(c) * (b - 0.5);
double t_2 = a + ((x * Math.log(y)) + (y * i));
double tmp;
if (z <= -1.6e+72) {
tmp = t + (z + (t_1 + (y * i)));
} else if (z <= -1.12e+14) {
tmp = t_2;
} else if (z <= -6.2e-135) {
tmp = (y * i) + (a + t_1);
} else if (z <= -3.5e-271) {
tmp = t_2;
} else {
tmp = (y * i) + (a + (b * Math.log(c)));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = math.log(c) * (b - 0.5) t_2 = a + ((x * math.log(y)) + (y * i)) tmp = 0 if z <= -1.6e+72: tmp = t + (z + (t_1 + (y * i))) elif z <= -1.12e+14: tmp = t_2 elif z <= -6.2e-135: tmp = (y * i) + (a + t_1) elif z <= -3.5e-271: tmp = t_2 else: tmp = (y * i) + (a + (b * math.log(c))) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(log(c) * Float64(b - 0.5)) t_2 = Float64(a + Float64(Float64(x * log(y)) + Float64(y * i))) tmp = 0.0 if (z <= -1.6e+72) tmp = Float64(t + Float64(z + Float64(t_1 + Float64(y * i)))); elseif (z <= -1.12e+14) tmp = t_2; elseif (z <= -6.2e-135) tmp = Float64(Float64(y * i) + Float64(a + t_1)); elseif (z <= -3.5e-271) tmp = t_2; else tmp = Float64(Float64(y * i) + Float64(a + Float64(b * log(c)))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = log(c) * (b - 0.5); t_2 = a + ((x * log(y)) + (y * i)); tmp = 0.0; if (z <= -1.6e+72) tmp = t + (z + (t_1 + (y * i))); elseif (z <= -1.12e+14) tmp = t_2; elseif (z <= -6.2e-135) tmp = (y * i) + (a + t_1); elseif (z <= -3.5e-271) tmp = t_2; else tmp = (y * i) + (a + (b * log(c))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.6e+72], N[(t + N[(z + N[(t$95$1 + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.12e+14], t$95$2, If[LessEqual[z, -6.2e-135], N[(N[(y * i), $MachinePrecision] + N[(a + t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -3.5e-271], t$95$2, N[(N[(y * i), $MachinePrecision] + N[(a + N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log c \cdot \left(b - 0.5\right)\\
t_2 := a + \left(x \cdot \log y + y \cdot i\right)\\
\mathbf{if}\;z \leq -1.6 \cdot 10^{+72}:\\
\;\;\;\;t + \left(z + \left(t\_1 + y \cdot i\right)\right)\\
\mathbf{elif}\;z \leq -1.12 \cdot 10^{+14}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq -6.2 \cdot 10^{-135}:\\
\;\;\;\;y \cdot i + \left(a + t\_1\right)\\
\mathbf{elif}\;z \leq -3.5 \cdot 10^{-271}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;y \cdot i + \left(a + b \cdot \log c\right)\\
\end{array}
\end{array}
if z < -1.6000000000000001e72Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 88.7%
Taylor expanded in a around 0 77.8%
if -1.6000000000000001e72 < z < -1.12e14 or -6.2000000000000001e-135 < z < -3.4999999999999999e-271Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in y around inf 66.1%
Taylor expanded in a around inf 54.0%
Taylor expanded in y around 0 74.4%
if -1.12e14 < z < -6.2000000000000001e-135Initial program 99.7%
Taylor expanded in a around inf 86.1%
if -3.4999999999999999e-271 < z Initial program 99.9%
add-cube-cbrt99.7%
pow399.7%
sub-neg99.7%
metadata-eval99.7%
*-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in b around inf 98.3%
*-commutative98.3%
Simplified98.3%
Taylor expanded in a around inf 58.4%
Final simplification67.4%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* b (log c))) (t_2 (+ a (+ (* x (log y)) (* y i)))))
(if (<= z -5.5e+73)
(+ (* y i) (+ z t_1))
(if (<= z -125000000000.0)
t_2
(if (<= z -2.9e-135)
(+ (* y i) (+ a (* (log c) (- b 0.5))))
(if (<= z -2.3e-272) t_2 (+ (* y i) (+ a t_1))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = b * log(c);
double t_2 = a + ((x * log(y)) + (y * i));
double tmp;
if (z <= -5.5e+73) {
tmp = (y * i) + (z + t_1);
} else if (z <= -125000000000.0) {
tmp = t_2;
} else if (z <= -2.9e-135) {
tmp = (y * i) + (a + (log(c) * (b - 0.5)));
} else if (z <= -2.3e-272) {
tmp = t_2;
} else {
tmp = (y * i) + (a + t_1);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = b * log(c)
t_2 = a + ((x * log(y)) + (y * i))
if (z <= (-5.5d+73)) then
tmp = (y * i) + (z + t_1)
else if (z <= (-125000000000.0d0)) then
tmp = t_2
else if (z <= (-2.9d-135)) then
tmp = (y * i) + (a + (log(c) * (b - 0.5d0)))
else if (z <= (-2.3d-272)) then
tmp = t_2
else
tmp = (y * i) + (a + t_1)
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 i) {
double t_1 = b * Math.log(c);
double t_2 = a + ((x * Math.log(y)) + (y * i));
double tmp;
if (z <= -5.5e+73) {
tmp = (y * i) + (z + t_1);
} else if (z <= -125000000000.0) {
tmp = t_2;
} else if (z <= -2.9e-135) {
tmp = (y * i) + (a + (Math.log(c) * (b - 0.5)));
} else if (z <= -2.3e-272) {
tmp = t_2;
} else {
tmp = (y * i) + (a + t_1);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = b * math.log(c) t_2 = a + ((x * math.log(y)) + (y * i)) tmp = 0 if z <= -5.5e+73: tmp = (y * i) + (z + t_1) elif z <= -125000000000.0: tmp = t_2 elif z <= -2.9e-135: tmp = (y * i) + (a + (math.log(c) * (b - 0.5))) elif z <= -2.3e-272: tmp = t_2 else: tmp = (y * i) + (a + t_1) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(b * log(c)) t_2 = Float64(a + Float64(Float64(x * log(y)) + Float64(y * i))) tmp = 0.0 if (z <= -5.5e+73) tmp = Float64(Float64(y * i) + Float64(z + t_1)); elseif (z <= -125000000000.0) tmp = t_2; elseif (z <= -2.9e-135) tmp = Float64(Float64(y * i) + Float64(a + Float64(log(c) * Float64(b - 0.5)))); elseif (z <= -2.3e-272) tmp = t_2; else tmp = Float64(Float64(y * i) + Float64(a + t_1)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = b * log(c); t_2 = a + ((x * log(y)) + (y * i)); tmp = 0.0; if (z <= -5.5e+73) tmp = (y * i) + (z + t_1); elseif (z <= -125000000000.0) tmp = t_2; elseif (z <= -2.9e-135) tmp = (y * i) + (a + (log(c) * (b - 0.5))); elseif (z <= -2.3e-272) tmp = t_2; else tmp = (y * i) + (a + t_1); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.5e+73], N[(N[(y * i), $MachinePrecision] + N[(z + t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -125000000000.0], t$95$2, If[LessEqual[z, -2.9e-135], N[(N[(y * i), $MachinePrecision] + N[(a + N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.3e-272], t$95$2, N[(N[(y * i), $MachinePrecision] + N[(a + t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \log c\\
t_2 := a + \left(x \cdot \log y + y \cdot i\right)\\
\mathbf{if}\;z \leq -5.5 \cdot 10^{+73}:\\
\;\;\;\;y \cdot i + \left(z + t\_1\right)\\
\mathbf{elif}\;z \leq -125000000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq -2.9 \cdot 10^{-135}:\\
\;\;\;\;y \cdot i + \left(a + \log c \cdot \left(b - 0.5\right)\right)\\
\mathbf{elif}\;z \leq -2.3 \cdot 10^{-272}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;y \cdot i + \left(a + t\_1\right)\\
\end{array}
\end{array}
if z < -5.5000000000000003e73Initial program 99.9%
add-cube-cbrt99.8%
pow399.8%
sub-neg99.8%
metadata-eval99.8%
*-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in b around inf 99.9%
*-commutative99.9%
Simplified99.9%
Taylor expanded in t around 0 93.1%
Taylor expanded in z around inf 72.6%
if -5.5000000000000003e73 < z < -1.25e11 or -2.9000000000000002e-135 < z < -2.29999999999999989e-272Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in y around inf 63.8%
Taylor expanded in a around inf 51.7%
Taylor expanded in y around 0 74.4%
if -1.25e11 < z < -2.9000000000000002e-135Initial program 99.7%
Taylor expanded in a around inf 86.6%
if -2.29999999999999989e-272 < z Initial program 99.9%
add-cube-cbrt99.7%
pow399.7%
sub-neg99.7%
metadata-eval99.7%
*-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in b around inf 98.3%
*-commutative98.3%
Simplified98.3%
Taylor expanded in a around inf 58.4%
Final simplification66.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ (* x (log y)) (* y i))))
(if (<= x -1.15e+154)
(+ a t_1)
(if (<= x 6e+237)
(+ (* y i) (+ (* (log c) (- b 0.5)) (+ a (+ z t))))
t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = (x * log(y)) + (y * i);
double tmp;
if (x <= -1.15e+154) {
tmp = a + t_1;
} else if (x <= 6e+237) {
tmp = (y * i) + ((log(c) * (b - 0.5)) + (a + (z + t)));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = (x * log(y)) + (y * i)
if (x <= (-1.15d+154)) then
tmp = a + t_1
else if (x <= 6d+237) then
tmp = (y * i) + ((log(c) * (b - 0.5d0)) + (a + (z + t)))
else
tmp = t_1
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 i) {
double t_1 = (x * Math.log(y)) + (y * i);
double tmp;
if (x <= -1.15e+154) {
tmp = a + t_1;
} else if (x <= 6e+237) {
tmp = (y * i) + ((Math.log(c) * (b - 0.5)) + (a + (z + t)));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = (x * math.log(y)) + (y * i) tmp = 0 if x <= -1.15e+154: tmp = a + t_1 elif x <= 6e+237: tmp = (y * i) + ((math.log(c) * (b - 0.5)) + (a + (z + t))) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(Float64(x * log(y)) + Float64(y * i)) tmp = 0.0 if (x <= -1.15e+154) tmp = Float64(a + t_1); elseif (x <= 6e+237) tmp = Float64(Float64(y * i) + Float64(Float64(log(c) * Float64(b - 0.5)) + Float64(a + Float64(z + t)))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = (x * log(y)) + (y * i); tmp = 0.0; if (x <= -1.15e+154) tmp = a + t_1; elseif (x <= 6e+237) tmp = (y * i) + ((log(c) * (b - 0.5)) + (a + (z + t))); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.15e+154], N[(a + t$95$1), $MachinePrecision], If[LessEqual[x, 6e+237], N[(N[(y * i), $MachinePrecision] + N[(N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision] + N[(a + N[(z + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot \log y + y \cdot i\\
\mathbf{if}\;x \leq -1.15 \cdot 10^{+154}:\\
\;\;\;\;a + t\_1\\
\mathbf{elif}\;x \leq 6 \cdot 10^{+237}:\\
\;\;\;\;y \cdot i + \left(\log c \cdot \left(b - 0.5\right) + \left(a + \left(z + t\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.15e154Initial program 99.7%
associate-+l+99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+l+99.7%
+-commutative99.7%
fma-define99.7%
+-commutative99.7%
fma-define99.7%
sub-neg99.7%
metadata-eval99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in y around inf 62.4%
Taylor expanded in a around inf 54.3%
Taylor expanded in y around 0 85.1%
if -1.15e154 < x < 6e237Initial program 99.9%
Taylor expanded in x around 0 93.3%
if 6e237 < x Initial program 100.0%
associate-+l+100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+r+100.0%
+-commutative100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+l+100.0%
+-commutative100.0%
fma-define100.0%
+-commutative100.0%
fma-define100.0%
sub-neg100.0%
metadata-eval100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in y around inf 62.1%
Taylor expanded in x around inf 53.3%
mul-1-neg53.3%
log-rec53.3%
distribute-rgt-neg-out53.3%
distribute-frac-neg53.3%
remove-double-neg53.3%
associate-/l*53.3%
Simplified53.3%
Taylor expanded in y around 0 90.0%
Final simplification92.2%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* b (log c))))
(if (<= z -5.8e+72)
(+ (* y i) (+ z t_1))
(if (or (<= z -200000000000.0) (not (<= z -2.15e-130)))
(+ a (+ (* x (log y)) (* y i)))
(+ (* y i) (+ a t_1))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = b * log(c);
double tmp;
if (z <= -5.8e+72) {
tmp = (y * i) + (z + t_1);
} else if ((z <= -200000000000.0) || !(z <= -2.15e-130)) {
tmp = a + ((x * log(y)) + (y * i));
} else {
tmp = (y * i) + (a + t_1);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = b * log(c)
if (z <= (-5.8d+72)) then
tmp = (y * i) + (z + t_1)
else if ((z <= (-200000000000.0d0)) .or. (.not. (z <= (-2.15d-130)))) then
tmp = a + ((x * log(y)) + (y * i))
else
tmp = (y * i) + (a + t_1)
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 i) {
double t_1 = b * Math.log(c);
double tmp;
if (z <= -5.8e+72) {
tmp = (y * i) + (z + t_1);
} else if ((z <= -200000000000.0) || !(z <= -2.15e-130)) {
tmp = a + ((x * Math.log(y)) + (y * i));
} else {
tmp = (y * i) + (a + t_1);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = b * math.log(c) tmp = 0 if z <= -5.8e+72: tmp = (y * i) + (z + t_1) elif (z <= -200000000000.0) or not (z <= -2.15e-130): tmp = a + ((x * math.log(y)) + (y * i)) else: tmp = (y * i) + (a + t_1) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(b * log(c)) tmp = 0.0 if (z <= -5.8e+72) tmp = Float64(Float64(y * i) + Float64(z + t_1)); elseif ((z <= -200000000000.0) || !(z <= -2.15e-130)) tmp = Float64(a + Float64(Float64(x * log(y)) + Float64(y * i))); else tmp = Float64(Float64(y * i) + Float64(a + t_1)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = b * log(c); tmp = 0.0; if (z <= -5.8e+72) tmp = (y * i) + (z + t_1); elseif ((z <= -200000000000.0) || ~((z <= -2.15e-130))) tmp = a + ((x * log(y)) + (y * i)); else tmp = (y * i) + (a + t_1); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.8e+72], N[(N[(y * i), $MachinePrecision] + N[(z + t$95$1), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[z, -200000000000.0], N[Not[LessEqual[z, -2.15e-130]], $MachinePrecision]], N[(a + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * i), $MachinePrecision] + N[(a + t$95$1), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \log c\\
\mathbf{if}\;z \leq -5.8 \cdot 10^{+72}:\\
\;\;\;\;y \cdot i + \left(z + t\_1\right)\\
\mathbf{elif}\;z \leq -200000000000 \lor \neg \left(z \leq -2.15 \cdot 10^{-130}\right):\\
\;\;\;\;a + \left(x \cdot \log y + y \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot i + \left(a + t\_1\right)\\
\end{array}
\end{array}
if z < -5.80000000000000034e72Initial program 99.9%
add-cube-cbrt99.8%
pow399.8%
sub-neg99.8%
metadata-eval99.8%
*-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in b around inf 99.9%
*-commutative99.9%
Simplified99.9%
Taylor expanded in t around 0 93.1%
Taylor expanded in z around inf 72.6%
if -5.80000000000000034e72 < z < -2e11 or -2.15000000000000014e-130 < z Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in y around inf 73.9%
Taylor expanded in a around inf 50.3%
Taylor expanded in y around 0 63.1%
if -2e11 < z < -2.15000000000000014e-130Initial program 99.7%
add-cube-cbrt99.0%
pow399.1%
sub-neg99.1%
metadata-eval99.1%
*-commutative99.1%
Applied egg-rr99.1%
Taylor expanded in b around inf 96.2%
*-commutative96.2%
Simplified96.2%
Taylor expanded in a around inf 82.2%
Final simplification66.8%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ (* x (log y)) (* y i))))
(if (<= x -9.6e+153)
(+ a t_1)
(if (<= x 6.6e+236) (+ (* y i) (+ (* b (log c)) (+ a (+ z t)))) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = (x * log(y)) + (y * i);
double tmp;
if (x <= -9.6e+153) {
tmp = a + t_1;
} else if (x <= 6.6e+236) {
tmp = (y * i) + ((b * log(c)) + (a + (z + t)));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = (x * log(y)) + (y * i)
if (x <= (-9.6d+153)) then
tmp = a + t_1
else if (x <= 6.6d+236) then
tmp = (y * i) + ((b * log(c)) + (a + (z + t)))
else
tmp = t_1
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 i) {
double t_1 = (x * Math.log(y)) + (y * i);
double tmp;
if (x <= -9.6e+153) {
tmp = a + t_1;
} else if (x <= 6.6e+236) {
tmp = (y * i) + ((b * Math.log(c)) + (a + (z + t)));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = (x * math.log(y)) + (y * i) tmp = 0 if x <= -9.6e+153: tmp = a + t_1 elif x <= 6.6e+236: tmp = (y * i) + ((b * math.log(c)) + (a + (z + t))) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(Float64(x * log(y)) + Float64(y * i)) tmp = 0.0 if (x <= -9.6e+153) tmp = Float64(a + t_1); elseif (x <= 6.6e+236) tmp = Float64(Float64(y * i) + Float64(Float64(b * log(c)) + Float64(a + Float64(z + t)))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = (x * log(y)) + (y * i); tmp = 0.0; if (x <= -9.6e+153) tmp = a + t_1; elseif (x <= 6.6e+236) tmp = (y * i) + ((b * log(c)) + (a + (z + t))); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -9.6e+153], N[(a + t$95$1), $MachinePrecision], If[LessEqual[x, 6.6e+236], N[(N[(y * i), $MachinePrecision] + N[(N[(b * N[Log[c], $MachinePrecision]), $MachinePrecision] + N[(a + N[(z + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot \log y + y \cdot i\\
\mathbf{if}\;x \leq -9.6 \cdot 10^{+153}:\\
\;\;\;\;a + t\_1\\
\mathbf{elif}\;x \leq 6.6 \cdot 10^{+236}:\\
\;\;\;\;y \cdot i + \left(b \cdot \log c + \left(a + \left(z + t\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -9.5999999999999997e153Initial program 99.7%
associate-+l+99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+l+99.7%
+-commutative99.7%
fma-define99.7%
+-commutative99.7%
fma-define99.7%
sub-neg99.7%
metadata-eval99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in y around inf 62.4%
Taylor expanded in a around inf 54.3%
Taylor expanded in y around 0 85.1%
if -9.5999999999999997e153 < x < 6.5999999999999998e236Initial program 99.9%
add-cube-cbrt99.6%
pow399.6%
sub-neg99.6%
metadata-eval99.6%
*-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in b around inf 98.4%
*-commutative98.4%
Simplified98.4%
Taylor expanded in x around 0 92.0%
if 6.5999999999999998e236 < x Initial program 100.0%
associate-+l+100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+r+100.0%
+-commutative100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+l+100.0%
+-commutative100.0%
fma-define100.0%
+-commutative100.0%
fma-define100.0%
sub-neg100.0%
metadata-eval100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in y around inf 62.1%
Taylor expanded in x around inf 53.3%
mul-1-neg53.3%
log-rec53.3%
distribute-rgt-neg-out53.3%
distribute-frac-neg53.3%
remove-double-neg53.3%
associate-/l*53.3%
Simplified53.3%
Taylor expanded in y around 0 90.0%
Final simplification91.1%
(FPCore (x y z t a b c i)
:precision binary64
(if (<= z -6.2e+263)
z
(if (<= z -6e+71)
(* y (+ i (+ (/ a y) (+ (/ t y) (/ z y)))))
(+ a (+ (* x (log y)) (* y i))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (z <= -6.2e+263) {
tmp = z;
} else if (z <= -6e+71) {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
} else {
tmp = a + ((x * log(y)) + (y * i));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (z <= (-6.2d+263)) then
tmp = z
else if (z <= (-6d+71)) then
tmp = y * (i + ((a / y) + ((t / y) + (z / y))))
else
tmp = a + ((x * log(y)) + (y * i))
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 i) {
double tmp;
if (z <= -6.2e+263) {
tmp = z;
} else if (z <= -6e+71) {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
} else {
tmp = a + ((x * Math.log(y)) + (y * i));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if z <= -6.2e+263: tmp = z elif z <= -6e+71: tmp = y * (i + ((a / y) + ((t / y) + (z / y)))) else: tmp = a + ((x * math.log(y)) + (y * i)) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (z <= -6.2e+263) tmp = z; elseif (z <= -6e+71) tmp = Float64(y * Float64(i + Float64(Float64(a / y) + Float64(Float64(t / y) + Float64(z / y))))); else tmp = Float64(a + Float64(Float64(x * log(y)) + Float64(y * i))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (z <= -6.2e+263) tmp = z; elseif (z <= -6e+71) tmp = y * (i + ((a / y) + ((t / y) + (z / y)))); else tmp = a + ((x * log(y)) + (y * i)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[z, -6.2e+263], z, If[LessEqual[z, -6e+71], N[(y * N[(i + N[(N[(a / y), $MachinePrecision] + N[(N[(t / y), $MachinePrecision] + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a + N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] + N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6.2 \cdot 10^{+263}:\\
\;\;\;\;z\\
\mathbf{elif}\;z \leq -6 \cdot 10^{+71}:\\
\;\;\;\;y \cdot \left(i + \left(\frac{a}{y} + \left(\frac{t}{y} + \frac{z}{y}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;a + \left(x \cdot \log y + y \cdot i\right)\\
\end{array}
\end{array}
if z < -6.2000000000000005e263Initial program 100.0%
associate-+l+100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+r+100.0%
+-commutative100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+l+100.0%
+-commutative100.0%
fma-define100.0%
+-commutative100.0%
fma-define100.0%
sub-neg100.0%
metadata-eval100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in x around 0 100.0%
Taylor expanded in z around inf 88.7%
if -6.2000000000000005e263 < z < -6.00000000000000025e71Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 86.1%
Taylor expanded in y around inf 67.2%
Taylor expanded in z around inf 58.8%
if -6.00000000000000025e71 < z Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in y around inf 74.2%
Taylor expanded in a around inf 49.0%
Taylor expanded in y around 0 60.6%
Final simplification61.2%
(FPCore (x y z t a b c i) :precision binary64 (if (<= y 6e-52) (+ a (* (log c) (- b 0.5))) (* y (+ i (+ (/ a y) (+ (/ t y) (/ z y)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (y <= 6e-52) {
tmp = a + (log(c) * (b - 0.5));
} else {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (y <= 6d-52) then
tmp = a + (log(c) * (b - 0.5d0))
else
tmp = y * (i + ((a / y) + ((t / y) + (z / y))))
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 i) {
double tmp;
if (y <= 6e-52) {
tmp = a + (Math.log(c) * (b - 0.5));
} else {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if y <= 6e-52: tmp = a + (math.log(c) * (b - 0.5)) else: tmp = y * (i + ((a / y) + ((t / y) + (z / y)))) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (y <= 6e-52) tmp = Float64(a + Float64(log(c) * Float64(b - 0.5))); else tmp = Float64(y * Float64(i + Float64(Float64(a / y) + Float64(Float64(t / y) + Float64(z / y))))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (y <= 6e-52) tmp = a + (log(c) * (b - 0.5)); else tmp = y * (i + ((a / y) + ((t / y) + (z / y)))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, 6e-52], N[(a + N[(N[Log[c], $MachinePrecision] * N[(b - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(i + N[(N[(a / y), $MachinePrecision] + N[(N[(t / y), $MachinePrecision] + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq 6 \cdot 10^{-52}:\\
\;\;\;\;a + \log c \cdot \left(b - 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(i + \left(\frac{a}{y} + \left(\frac{t}{y} + \frac{z}{y}\right)\right)\right)\\
\end{array}
\end{array}
if y < 6e-52Initial program 99.9%
Taylor expanded in a around inf 43.5%
Taylor expanded in y around 0 42.1%
if 6e-52 < y Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 89.8%
Taylor expanded in y around inf 87.4%
Taylor expanded in z around inf 76.9%
(FPCore (x y z t a b c i) :precision binary64 (if (<= y 1.95e-44) z (* y (+ i (+ (/ a y) (+ (/ t y) (/ z y)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (y <= 1.95e-44) {
tmp = z;
} else {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (y <= 1.95d-44) then
tmp = z
else
tmp = y * (i + ((a / y) + ((t / y) + (z / y))))
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 i) {
double tmp;
if (y <= 1.95e-44) {
tmp = z;
} else {
tmp = y * (i + ((a / y) + ((t / y) + (z / y))));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if y <= 1.95e-44: tmp = z else: tmp = y * (i + ((a / y) + ((t / y) + (z / y)))) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (y <= 1.95e-44) tmp = z; else tmp = Float64(y * Float64(i + Float64(Float64(a / y) + Float64(Float64(t / y) + Float64(z / y))))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (y <= 1.95e-44) tmp = z; else tmp = y * (i + ((a / y) + ((t / y) + (z / y)))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[y, 1.95e-44], z, N[(y * N[(i + N[(N[(a / y), $MachinePrecision] + N[(N[(t / y), $MachinePrecision] + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq 1.95 \cdot 10^{-44}:\\
\;\;\;\;z\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(i + \left(\frac{a}{y} + \left(\frac{t}{y} + \frac{z}{y}\right)\right)\right)\\
\end{array}
\end{array}
if y < 1.9500000000000001e-44Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 75.5%
Taylor expanded in z around inf 20.1%
if 1.9500000000000001e-44 < y Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 90.3%
Taylor expanded in y around inf 88.4%
Taylor expanded in z around inf 77.7%
(FPCore (x y z t a b c i) :precision binary64 (if (<= i -1.4e+75) (* y i) (if (<= i 3e-271) z (if (<= i 95000000000000.0) a (* y i)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (i <= -1.4e+75) {
tmp = y * i;
} else if (i <= 3e-271) {
tmp = z;
} else if (i <= 95000000000000.0) {
tmp = a;
} else {
tmp = y * i;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (i <= (-1.4d+75)) then
tmp = y * i
else if (i <= 3d-271) then
tmp = z
else if (i <= 95000000000000.0d0) then
tmp = a
else
tmp = y * i
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 i) {
double tmp;
if (i <= -1.4e+75) {
tmp = y * i;
} else if (i <= 3e-271) {
tmp = z;
} else if (i <= 95000000000000.0) {
tmp = a;
} else {
tmp = y * i;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if i <= -1.4e+75: tmp = y * i elif i <= 3e-271: tmp = z elif i <= 95000000000000.0: tmp = a else: tmp = y * i return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (i <= -1.4e+75) tmp = Float64(y * i); elseif (i <= 3e-271) tmp = z; elseif (i <= 95000000000000.0) tmp = a; else tmp = Float64(y * i); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (i <= -1.4e+75) tmp = y * i; elseif (i <= 3e-271) tmp = z; elseif (i <= 95000000000000.0) tmp = a; else tmp = y * i; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[i, -1.4e+75], N[(y * i), $MachinePrecision], If[LessEqual[i, 3e-271], z, If[LessEqual[i, 95000000000000.0], a, N[(y * i), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;i \leq -1.4 \cdot 10^{+75}:\\
\;\;\;\;y \cdot i\\
\mathbf{elif}\;i \leq 3 \cdot 10^{-271}:\\
\;\;\;\;z\\
\mathbf{elif}\;i \leq 95000000000000:\\
\;\;\;\;a\\
\mathbf{else}:\\
\;\;\;\;y \cdot i\\
\end{array}
\end{array}
if i < -1.40000000000000006e75 or 9.5e13 < i Initial program 99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+l+99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+l+99.8%
associate-+l+99.8%
+-commutative99.8%
fma-define99.8%
+-commutative99.8%
fma-define99.8%
sub-neg99.8%
metadata-eval99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in y around inf 56.1%
*-commutative56.1%
Simplified56.1%
if -1.40000000000000006e75 < i < 3.00000000000000002e-271Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 85.9%
Taylor expanded in z around inf 23.1%
if 3.00000000000000002e-271 < i < 9.5e13Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 73.1%
Taylor expanded in a around inf 18.0%
(FPCore (x y z t a b c i) :precision binary64 (if (<= z -1.35e+248) z (if (<= z -3e+16) (* y (+ i (/ z y))) (* y (+ i (/ a y))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (z <= -1.35e+248) {
tmp = z;
} else if (z <= -3e+16) {
tmp = y * (i + (z / y));
} else {
tmp = y * (i + (a / y));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (z <= (-1.35d+248)) then
tmp = z
else if (z <= (-3d+16)) then
tmp = y * (i + (z / y))
else
tmp = y * (i + (a / y))
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 i) {
double tmp;
if (z <= -1.35e+248) {
tmp = z;
} else if (z <= -3e+16) {
tmp = y * (i + (z / y));
} else {
tmp = y * (i + (a / y));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if z <= -1.35e+248: tmp = z elif z <= -3e+16: tmp = y * (i + (z / y)) else: tmp = y * (i + (a / y)) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (z <= -1.35e+248) tmp = z; elseif (z <= -3e+16) tmp = Float64(y * Float64(i + Float64(z / y))); else tmp = Float64(y * Float64(i + Float64(a / y))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (z <= -1.35e+248) tmp = z; elseif (z <= -3e+16) tmp = y * (i + (z / y)); else tmp = y * (i + (a / y)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[z, -1.35e+248], z, If[LessEqual[z, -3e+16], N[(y * N[(i + N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(i + N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.35 \cdot 10^{+248}:\\
\;\;\;\;z\\
\mathbf{elif}\;z \leq -3 \cdot 10^{+16}:\\
\;\;\;\;y \cdot \left(i + \frac{z}{y}\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(i + \frac{a}{y}\right)\\
\end{array}
\end{array}
if z < -1.34999999999999994e248Initial program 100.0%
associate-+l+100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+r+100.0%
+-commutative100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+l+100.0%
+-commutative100.0%
fma-define100.0%
+-commutative100.0%
fma-define100.0%
sub-neg100.0%
metadata-eval100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in x around 0 100.0%
Taylor expanded in z around inf 79.6%
if -1.34999999999999994e248 < z < -3e16Initial program 99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+l+99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+l+99.8%
associate-+l+99.8%
+-commutative99.8%
fma-define99.8%
+-commutative99.8%
fma-define99.8%
sub-neg99.8%
metadata-eval99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in x around 0 76.8%
Taylor expanded in y around inf 62.9%
Taylor expanded in z around inf 46.7%
if -3e16 < z Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 86.1%
Taylor expanded in y around inf 65.9%
Taylor expanded in a around inf 40.1%
(FPCore (x y z t a b c i) :precision binary64 (if (<= z -2.8e+135) z (* y (+ i (/ a y)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (z <= -2.8e+135) {
tmp = z;
} else {
tmp = y * (i + (a / y));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (z <= (-2.8d+135)) then
tmp = z
else
tmp = y * (i + (a / y))
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 i) {
double tmp;
if (z <= -2.8e+135) {
tmp = z;
} else {
tmp = y * (i + (a / y));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if z <= -2.8e+135: tmp = z else: tmp = y * (i + (a / y)) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (z <= -2.8e+135) tmp = z; else tmp = Float64(y * Float64(i + Float64(a / y))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (z <= -2.8e+135) tmp = z; else tmp = y * (i + (a / y)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[z, -2.8e+135], z, N[(y * N[(i + N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.8 \cdot 10^{+135}:\\
\;\;\;\;z\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(i + \frac{a}{y}\right)\\
\end{array}
\end{array}
if z < -2.80000000000000002e135Initial program 100.0%
associate-+l+100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+r+100.0%
+-commutative100.0%
+-commutative100.0%
associate-+l+100.0%
associate-+l+100.0%
+-commutative100.0%
fma-define100.0%
+-commutative100.0%
fma-define100.0%
sub-neg100.0%
metadata-eval100.0%
+-commutative100.0%
Simplified100.0%
Taylor expanded in x around 0 91.1%
Taylor expanded in z around inf 44.2%
if -2.80000000000000002e135 < z Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 83.9%
Taylor expanded in y around inf 65.1%
Taylor expanded in a around inf 38.6%
(FPCore (x y z t a b c i) :precision binary64 (if (<= z -2.6e+21) z a))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (z <= -2.6e+21) {
tmp = z;
} else {
tmp = a;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
real(8) :: tmp
if (z <= (-2.6d+21)) then
tmp = z
else
tmp = a
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 i) {
double tmp;
if (z <= -2.6e+21) {
tmp = z;
} else {
tmp = a;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if z <= -2.6e+21: tmp = z else: tmp = a return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (z <= -2.6e+21) tmp = z; else tmp = a; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (z <= -2.6e+21) tmp = z; else tmp = a; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[z, -2.6e+21], z, a]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.6 \cdot 10^{+21}:\\
\;\;\;\;z\\
\mathbf{else}:\\
\;\;\;\;a\\
\end{array}
\end{array}
if z < -2.6e21Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 81.8%
Taylor expanded in z around inf 35.0%
if -2.6e21 < z Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 85.7%
Taylor expanded in a around inf 19.6%
(FPCore (x y z t a b c i) :precision binary64 a)
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return a;
}
real(8) function code(x, y, z, t, a, b, c, i)
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), intent (in) :: i
code = a
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return a;
}
def code(x, y, z, t, a, b, c, i): return a
function code(x, y, z, t, a, b, c, i) return a end
function tmp = code(x, y, z, t, a, b, c, i) tmp = a; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := a
\begin{array}{l}
\\
a
\end{array}
Initial program 99.9%
associate-+l+99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+r+99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
associate-+l+99.9%
+-commutative99.9%
fma-define99.9%
+-commutative99.9%
fma-define99.9%
sub-neg99.9%
metadata-eval99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in x around 0 84.8%
Taylor expanded in a around inf 17.8%
herbie shell --seed 2024096
(FPCore (x y z t a b c i)
:name "Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, B"
:precision binary64
(+ (+ (+ (+ (+ (* x (log y)) z) t) a) (* (- b 0.5) (log c))) (* y i)))