
(FPCore (x y z t a b) :precision binary64 (+ (- (+ (+ x y) z) (* z (log t))) (* (- a 0.5) b)))
double code(double x, double y, double z, double t, double a, double b) {
return (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = (((x + y) + z) - (z * log(t))) + ((a - 0.5d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return (((x + y) + z) - (z * Math.log(t))) + ((a - 0.5) * b);
}
def code(x, y, z, t, a, b): return (((x + y) + z) - (z * math.log(t))) + ((a - 0.5) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(Float64(x + y) + z) - Float64(z * log(t))) + Float64(Float64(a - 0.5) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(N[(x + y), $MachinePrecision] + z), $MachinePrecision] - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b) :precision binary64 (+ (- (+ (+ x y) z) (* z (log t))) (* (- a 0.5) b)))
double code(double x, double y, double z, double t, double a, double b) {
return (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = (((x + y) + z) - (z * log(t))) + ((a - 0.5d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return (((x + y) + z) - (z * Math.log(t))) + ((a - 0.5) * b);
}
def code(x, y, z, t, a, b): return (((x + y) + z) - (z * math.log(t))) + ((a - 0.5) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(Float64(x + y) + z) - Float64(z * log(t))) + Float64(Float64(a - 0.5) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = (((x + y) + z) - (z * log(t))) + ((a - 0.5) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(N[(x + y), $MachinePrecision] + z), $MachinePrecision] - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(x + y\right) + z\right) - z \cdot \log t\right) + \left(a - 0.5\right) \cdot b
\end{array}
(FPCore (x y z t a b) :precision binary64 (let* ((t_1 (log (pow t -0.5)))) (+ (* z (+ (+ t_1 t_1) 1.0)) (+ (+ x y) (* (+ -0.5 a) b)))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = log(pow(t, -0.5));
return (z * ((t_1 + t_1) + 1.0)) + ((x + y) + ((-0.5 + a) * b));
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
t_1 = log((t ** (-0.5d0)))
code = (z * ((t_1 + t_1) + 1.0d0)) + ((x + y) + (((-0.5d0) + a) * b))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = Math.log(Math.pow(t, -0.5));
return (z * ((t_1 + t_1) + 1.0)) + ((x + y) + ((-0.5 + a) * b));
}
def code(x, y, z, t, a, b): t_1 = math.log(math.pow(t, -0.5)) return (z * ((t_1 + t_1) + 1.0)) + ((x + y) + ((-0.5 + a) * b))
function code(x, y, z, t, a, b) t_1 = log((t ^ -0.5)) return Float64(Float64(z * Float64(Float64(t_1 + t_1) + 1.0)) + Float64(Float64(x + y) + Float64(Float64(-0.5 + a) * b))) end
function tmp = code(x, y, z, t, a, b) t_1 = log((t ^ -0.5)); tmp = (z * ((t_1 + t_1) + 1.0)) + ((x + y) + ((-0.5 + a) * b)); end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[Log[N[Power[t, -0.5], $MachinePrecision]], $MachinePrecision]}, N[(N[(z * N[(N[(t$95$1 + t$95$1), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x + y), $MachinePrecision] + N[(N[(-0.5 + a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \log \left({t}^{-0.5}\right)\\
z \cdot \left(\left(t\_1 + t\_1\right) + 1\right) + \left(\left(x + y\right) + \left(-0.5 + a\right) \cdot b\right)
\end{array}
\end{array}
Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
sub-negN/A
+-commutativeN/A
+-lowering-+.f64N/A
neg-logN/A
log-lowering-log.f64N/A
/-lowering-/.f6499.9%
Applied egg-rr99.9%
inv-powN/A
sqr-powN/A
log-prodN/A
+-lowering-+.f64N/A
log-lowering-log.f64N/A
metadata-evalN/A
pow-lowering-pow.f64N/A
log-lowering-log.f64N/A
metadata-evalN/A
pow-lowering-pow.f6499.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (- a 0.5))) (t_2 (+ (+ x y) t_1)))
(if (<= t_1 -1e+110)
t_2
(if (<= t_1 5e+178) (+ x (+ y (* z (+ 1.0 (log (/ 1.0 t)))))) t_2))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a - 0.5);
double t_2 = (x + y) + t_1;
double tmp;
if (t_1 <= -1e+110) {
tmp = t_2;
} else if (t_1 <= 5e+178) {
tmp = x + (y + (z * (1.0 + log((1.0 / t)))));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = b * (a - 0.5d0)
t_2 = (x + y) + t_1
if (t_1 <= (-1d+110)) then
tmp = t_2
else if (t_1 <= 5d+178) then
tmp = x + (y + (z * (1.0d0 + log((1.0d0 / t)))))
else
tmp = 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 t_1 = b * (a - 0.5);
double t_2 = (x + y) + t_1;
double tmp;
if (t_1 <= -1e+110) {
tmp = t_2;
} else if (t_1 <= 5e+178) {
tmp = x + (y + (z * (1.0 + Math.log((1.0 / t)))));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = b * (a - 0.5) t_2 = (x + y) + t_1 tmp = 0 if t_1 <= -1e+110: tmp = t_2 elif t_1 <= 5e+178: tmp = x + (y + (z * (1.0 + math.log((1.0 / t))))) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a - 0.5)) t_2 = Float64(Float64(x + y) + t_1) tmp = 0.0 if (t_1 <= -1e+110) tmp = t_2; elseif (t_1 <= 5e+178) tmp = Float64(x + Float64(y + Float64(z * Float64(1.0 + log(Float64(1.0 / t)))))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = b * (a - 0.5); t_2 = (x + y) + t_1; tmp = 0.0; if (t_1 <= -1e+110) tmp = t_2; elseif (t_1 <= 5e+178) tmp = x + (y + (z * (1.0 + log((1.0 / t))))); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x + y), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+110], t$95$2, If[LessEqual[t$95$1, 5e+178], N[(x + N[(y + N[(z * N[(1.0 + N[Log[N[(1.0 / t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(a - 0.5\right)\\
t_2 := \left(x + y\right) + t\_1\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+110}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+178}:\\
\;\;\;\;x + \left(y + z \cdot \left(1 + \log \left(\frac{1}{t}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -1e110 or 4.9999999999999999e178 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) Initial program 100.0%
Taylor expanded in z around 0
+-lowering-+.f6495.4%
Simplified95.4%
if -1e110 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 4.9999999999999999e178Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6494.5%
Simplified94.5%
sub-negN/A
log-recN/A
+-commutativeN/A
+-lowering-+.f64N/A
log-lowering-log.f64N/A
/-lowering-/.f6494.5%
Applied egg-rr94.5%
Final simplification94.8%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (- a 0.5))) (t_2 (+ (+ x y) t_1)))
(if (<= t_1 -1e+110)
t_2
(if (<= t_1 5e+178) (+ x (+ y (* z (- 1.0 (log t))))) t_2))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a - 0.5);
double t_2 = (x + y) + t_1;
double tmp;
if (t_1 <= -1e+110) {
tmp = t_2;
} else if (t_1 <= 5e+178) {
tmp = x + (y + (z * (1.0 - log(t))));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = b * (a - 0.5d0)
t_2 = (x + y) + t_1
if (t_1 <= (-1d+110)) then
tmp = t_2
else if (t_1 <= 5d+178) then
tmp = x + (y + (z * (1.0d0 - log(t))))
else
tmp = 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 t_1 = b * (a - 0.5);
double t_2 = (x + y) + t_1;
double tmp;
if (t_1 <= -1e+110) {
tmp = t_2;
} else if (t_1 <= 5e+178) {
tmp = x + (y + (z * (1.0 - Math.log(t))));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = b * (a - 0.5) t_2 = (x + y) + t_1 tmp = 0 if t_1 <= -1e+110: tmp = t_2 elif t_1 <= 5e+178: tmp = x + (y + (z * (1.0 - math.log(t)))) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a - 0.5)) t_2 = Float64(Float64(x + y) + t_1) tmp = 0.0 if (t_1 <= -1e+110) tmp = t_2; elseif (t_1 <= 5e+178) tmp = Float64(x + Float64(y + Float64(z * Float64(1.0 - log(t))))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = b * (a - 0.5); t_2 = (x + y) + t_1; tmp = 0.0; if (t_1 <= -1e+110) tmp = t_2; elseif (t_1 <= 5e+178) tmp = x + (y + (z * (1.0 - log(t)))); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x + y), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+110], t$95$2, If[LessEqual[t$95$1, 5e+178], N[(x + N[(y + N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(a - 0.5\right)\\
t_2 := \left(x + y\right) + t\_1\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+110}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+178}:\\
\;\;\;\;x + \left(y + z \cdot \left(1 - \log t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -1e110 or 4.9999999999999999e178 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) Initial program 100.0%
Taylor expanded in z around 0
+-lowering-+.f6495.4%
Simplified95.4%
if -1e110 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 4.9999999999999999e178Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6494.5%
Simplified94.5%
Final simplification94.8%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (- a 0.5))))
(if (<= b -8e+179)
(+ (+ x y) t_1)
(if (<= b 2.2e+172)
(+ (- (+ z (+ x y)) (* z (log t))) (* a b))
(+ x t_1)))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a - 0.5);
double tmp;
if (b <= -8e+179) {
tmp = (x + y) + t_1;
} else if (b <= 2.2e+172) {
tmp = ((z + (x + y)) - (z * log(t))) + (a * b);
} else {
tmp = x + t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = b * (a - 0.5d0)
if (b <= (-8d+179)) then
tmp = (x + y) + t_1
else if (b <= 2.2d+172) then
tmp = ((z + (x + y)) - (z * log(t))) + (a * b)
else
tmp = x + 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 t_1 = b * (a - 0.5);
double tmp;
if (b <= -8e+179) {
tmp = (x + y) + t_1;
} else if (b <= 2.2e+172) {
tmp = ((z + (x + y)) - (z * Math.log(t))) + (a * b);
} else {
tmp = x + t_1;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = b * (a - 0.5) tmp = 0 if b <= -8e+179: tmp = (x + y) + t_1 elif b <= 2.2e+172: tmp = ((z + (x + y)) - (z * math.log(t))) + (a * b) else: tmp = x + t_1 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a - 0.5)) tmp = 0.0 if (b <= -8e+179) tmp = Float64(Float64(x + y) + t_1); elseif (b <= 2.2e+172) tmp = Float64(Float64(Float64(z + Float64(x + y)) - Float64(z * log(t))) + Float64(a * b)); else tmp = Float64(x + t_1); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = b * (a - 0.5); tmp = 0.0; if (b <= -8e+179) tmp = (x + y) + t_1; elseif (b <= 2.2e+172) tmp = ((z + (x + y)) - (z * log(t))) + (a * b); else tmp = x + t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -8e+179], N[(N[(x + y), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[b, 2.2e+172], N[(N[(N[(z + N[(x + y), $MachinePrecision]), $MachinePrecision] - N[(z * N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x + t$95$1), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(a - 0.5\right)\\
\mathbf{if}\;b \leq -8 \cdot 10^{+179}:\\
\;\;\;\;\left(x + y\right) + t\_1\\
\mathbf{elif}\;b \leq 2.2 \cdot 10^{+172}:\\
\;\;\;\;\left(\left(z + \left(x + y\right)\right) - z \cdot \log t\right) + a \cdot b\\
\mathbf{else}:\\
\;\;\;\;x + t\_1\\
\end{array}
\end{array}
if b < -7.99999999999999984e179Initial program 99.9%
Taylor expanded in z around 0
+-lowering-+.f6499.9%
Simplified99.9%
if -7.99999999999999984e179 < b < 2.2000000000000001e172Initial program 99.8%
Taylor expanded in a around inf
*-commutativeN/A
*-lowering-*.f6496.3%
Simplified96.3%
if 2.2000000000000001e172 < b Initial program 100.0%
Taylor expanded in x around inf
Simplified92.4%
Final simplification96.4%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* z (- 1.0 (log t)))))
(if (<= z -1.1e+156)
(+ y t_1)
(if (<= z 1.1e+150) (+ (+ x y) (* b (- a 0.5))) (+ x t_1)))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = z * (1.0 - log(t));
double tmp;
if (z <= -1.1e+156) {
tmp = y + t_1;
} else if (z <= 1.1e+150) {
tmp = (x + y) + (b * (a - 0.5));
} else {
tmp = x + t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = z * (1.0d0 - log(t))
if (z <= (-1.1d+156)) then
tmp = y + t_1
else if (z <= 1.1d+150) then
tmp = (x + y) + (b * (a - 0.5d0))
else
tmp = x + 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 t_1 = z * (1.0 - Math.log(t));
double tmp;
if (z <= -1.1e+156) {
tmp = y + t_1;
} else if (z <= 1.1e+150) {
tmp = (x + y) + (b * (a - 0.5));
} else {
tmp = x + t_1;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = z * (1.0 - math.log(t)) tmp = 0 if z <= -1.1e+156: tmp = y + t_1 elif z <= 1.1e+150: tmp = (x + y) + (b * (a - 0.5)) else: tmp = x + t_1 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(z * Float64(1.0 - log(t))) tmp = 0.0 if (z <= -1.1e+156) tmp = Float64(y + t_1); elseif (z <= 1.1e+150) tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5))); else tmp = Float64(x + t_1); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = z * (1.0 - log(t)); tmp = 0.0; if (z <= -1.1e+156) tmp = y + t_1; elseif (z <= 1.1e+150) tmp = (x + y) + (b * (a - 0.5)); else tmp = x + t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.1e+156], N[(y + t$95$1), $MachinePrecision], If[LessEqual[z, 1.1e+150], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + t$95$1), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := z \cdot \left(1 - \log t\right)\\
\mathbf{if}\;z \leq -1.1 \cdot 10^{+156}:\\
\;\;\;\;y + t\_1\\
\mathbf{elif}\;z \leq 1.1 \cdot 10^{+150}:\\
\;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;x + t\_1\\
\end{array}
\end{array}
if z < -1.10000000000000002e156Initial program 99.5%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.5%
Simplified99.5%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6480.3%
Simplified80.3%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6477.6%
Simplified77.6%
if -1.10000000000000002e156 < z < 1.1e150Initial program 99.9%
Taylor expanded in z around 0
+-lowering-+.f6492.0%
Simplified92.0%
if 1.1e150 < z Initial program 99.7%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6482.9%
Simplified82.9%
Taylor expanded in y around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6478.3%
Simplified78.3%
Final simplification88.6%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (+ x (* z (- 1.0 (log t))))))
(if (<= z -1.66e+155)
t_1
(if (<= z 1.1e+142) (+ (+ x y) (* b (- a 0.5))) t_1))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = x + (z * (1.0 - log(t)));
double tmp;
if (z <= -1.66e+155) {
tmp = t_1;
} else if (z <= 1.1e+142) {
tmp = (x + y) + (b * (a - 0.5));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = x + (z * (1.0d0 - log(t)))
if (z <= (-1.66d+155)) then
tmp = t_1
else if (z <= 1.1d+142) then
tmp = (x + y) + (b * (a - 0.5d0))
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 t_1 = x + (z * (1.0 - Math.log(t)));
double tmp;
if (z <= -1.66e+155) {
tmp = t_1;
} else if (z <= 1.1e+142) {
tmp = (x + y) + (b * (a - 0.5));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = x + (z * (1.0 - math.log(t))) tmp = 0 if z <= -1.66e+155: tmp = t_1 elif z <= 1.1e+142: tmp = (x + y) + (b * (a - 0.5)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(x + Float64(z * Float64(1.0 - log(t)))) tmp = 0.0 if (z <= -1.66e+155) tmp = t_1; elseif (z <= 1.1e+142) tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = x + (z * (1.0 - log(t))); tmp = 0.0; if (z <= -1.66e+155) tmp = t_1; elseif (z <= 1.1e+142) tmp = (x + y) + (b * (a - 0.5)); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x + N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.66e+155], t$95$1, If[LessEqual[z, 1.1e+142], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x + z \cdot \left(1 - \log t\right)\\
\mathbf{if}\;z \leq -1.66 \cdot 10^{+155}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.1 \cdot 10^{+142}:\\
\;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -1.6600000000000001e155 or 1.09999999999999993e142 < z Initial program 99.6%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.7%
Simplified99.7%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6481.5%
Simplified81.5%
Taylor expanded in y around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6475.9%
Simplified75.9%
if -1.6600000000000001e155 < z < 1.09999999999999993e142Initial program 99.9%
Taylor expanded in z around 0
+-lowering-+.f6492.0%
Simplified92.0%
Final simplification88.1%
(FPCore (x y z t a b) :precision binary64 (+ (+ (+ x y) (* (+ -0.5 a) b)) (* z (+ 1.0 (log (/ 1.0 t))))))
double code(double x, double y, double z, double t, double a, double b) {
return ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 + log((1.0 / t))));
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x + y) + (((-0.5d0) + a) * b)) + (z * (1.0d0 + log((1.0d0 / t))))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 + Math.log((1.0 / t))));
}
def code(x, y, z, t, a, b): return ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 + math.log((1.0 / t))))
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x + y) + Float64(Float64(-0.5 + a) * b)) + Float64(z * Float64(1.0 + log(Float64(1.0 / t))))) end
function tmp = code(x, y, z, t, a, b) tmp = ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 + log((1.0 / t)))); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x + y), $MachinePrecision] + N[(N[(-0.5 + a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] + N[(z * N[(1.0 + N[Log[N[(1.0 / t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x + y\right) + \left(-0.5 + a\right) \cdot b\right) + z \cdot \left(1 + \log \left(\frac{1}{t}\right)\right)
\end{array}
Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
sub-negN/A
+-commutativeN/A
+-lowering-+.f64N/A
neg-logN/A
log-lowering-log.f64N/A
/-lowering-/.f6499.9%
Applied egg-rr99.9%
Final simplification99.9%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* z (- 1.0 (log t)))))
(if (<= z -4.6e+153)
t_1
(if (<= z 1.25e+150) (+ (+ x y) (* b (- a 0.5))) t_1))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = z * (1.0 - log(t));
double tmp;
if (z <= -4.6e+153) {
tmp = t_1;
} else if (z <= 1.25e+150) {
tmp = (x + y) + (b * (a - 0.5));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = z * (1.0d0 - log(t))
if (z <= (-4.6d+153)) then
tmp = t_1
else if (z <= 1.25d+150) then
tmp = (x + y) + (b * (a - 0.5d0))
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 t_1 = z * (1.0 - Math.log(t));
double tmp;
if (z <= -4.6e+153) {
tmp = t_1;
} else if (z <= 1.25e+150) {
tmp = (x + y) + (b * (a - 0.5));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = z * (1.0 - math.log(t)) tmp = 0 if z <= -4.6e+153: tmp = t_1 elif z <= 1.25e+150: tmp = (x + y) + (b * (a - 0.5)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(z * Float64(1.0 - log(t))) tmp = 0.0 if (z <= -4.6e+153) tmp = t_1; elseif (z <= 1.25e+150) tmp = Float64(Float64(x + y) + Float64(b * Float64(a - 0.5))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = z * (1.0 - log(t)); tmp = 0.0; if (z <= -4.6e+153) tmp = t_1; elseif (z <= 1.25e+150) tmp = (x + y) + (b * (a - 0.5)); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.6e+153], t$95$1, If[LessEqual[z, 1.25e+150], N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := z \cdot \left(1 - \log t\right)\\
\mathbf{if}\;z \leq -4.6 \cdot 10^{+153}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.25 \cdot 10^{+150}:\\
\;\;\;\;\left(x + y\right) + b \cdot \left(a - 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4.6000000000000003e153 or 1.25000000000000002e150 < z Initial program 99.6%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.7%
Simplified99.7%
Taylor expanded in z around inf
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6468.2%
Simplified68.2%
if -4.6000000000000003e153 < z < 1.25000000000000002e150Initial program 99.9%
Taylor expanded in z around 0
+-lowering-+.f6492.0%
Simplified92.0%
Final simplification86.2%
(FPCore (x y z t a b) :precision binary64 (+ (+ (+ x y) (* (+ -0.5 a) b)) (* z (- 1.0 (log t)))))
double code(double x, double y, double z, double t, double a, double b) {
return ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 - log(t)));
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x + y) + (((-0.5d0) + a) * b)) + (z * (1.0d0 - log(t)))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 - Math.log(t)));
}
def code(x, y, z, t, a, b): return ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 - math.log(t)))
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x + y) + Float64(Float64(-0.5 + a) * b)) + Float64(z * Float64(1.0 - log(t)))) end
function tmp = code(x, y, z, t, a, b) tmp = ((x + y) + ((-0.5 + a) * b)) + (z * (1.0 - log(t))); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x + y), $MachinePrecision] + N[(N[(-0.5 + a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] + N[(z * N[(1.0 - N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x + y\right) + \left(-0.5 + a\right) \cdot b\right) + z \cdot \left(1 - \log t\right)
\end{array}
Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Final simplification99.9%
(FPCore (x y z t a b) :precision binary64 (let* ((t_1 (* b (- a 0.5))) (t_2 (+ x t_1))) (if (<= t_1 -5e+169) t_2 (if (<= t_1 2e+168) (+ x y) t_2))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a - 0.5);
double t_2 = x + t_1;
double tmp;
if (t_1 <= -5e+169) {
tmp = t_2;
} else if (t_1 <= 2e+168) {
tmp = x + y;
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = b * (a - 0.5d0)
t_2 = x + t_1
if (t_1 <= (-5d+169)) then
tmp = t_2
else if (t_1 <= 2d+168) then
tmp = x + y
else
tmp = 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 t_1 = b * (a - 0.5);
double t_2 = x + t_1;
double tmp;
if (t_1 <= -5e+169) {
tmp = t_2;
} else if (t_1 <= 2e+168) {
tmp = x + y;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = b * (a - 0.5) t_2 = x + t_1 tmp = 0 if t_1 <= -5e+169: tmp = t_2 elif t_1 <= 2e+168: tmp = x + y else: tmp = t_2 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a - 0.5)) t_2 = Float64(x + t_1) tmp = 0.0 if (t_1 <= -5e+169) tmp = t_2; elseif (t_1 <= 2e+168) tmp = Float64(x + y); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = b * (a - 0.5); t_2 = x + t_1; tmp = 0.0; if (t_1 <= -5e+169) tmp = t_2; elseif (t_1 <= 2e+168) tmp = x + y; else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+169], t$95$2, If[LessEqual[t$95$1, 2e+168], N[(x + y), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(a - 0.5\right)\\
t_2 := x + t\_1\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+169}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+168}:\\
\;\;\;\;x + y\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < -5.00000000000000017e169 or 1.9999999999999999e168 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) Initial program 100.0%
Taylor expanded in x around inf
Simplified85.2%
if -5.00000000000000017e169 < (*.f64 (-.f64 a #s(literal 1/2 binary64)) b) < 1.9999999999999999e168Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6493.6%
Simplified93.6%
Taylor expanded in z around 0
+-lowering-+.f6461.9%
Simplified61.9%
Final simplification70.0%
(FPCore (x y z t a b) :precision binary64 (if (<= (+ x y) -4e+39) (+ x (* a b)) (if (<= (+ x y) 1e+25) (* (+ -0.5 a) b) (+ x y))))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((x + y) <= -4e+39) {
tmp = x + (a * b);
} else if ((x + y) <= 1e+25) {
tmp = (-0.5 + a) * b;
} else {
tmp = x + y;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if ((x + y) <= (-4d+39)) then
tmp = x + (a * b)
else if ((x + y) <= 1d+25) then
tmp = ((-0.5d0) + a) * b
else
tmp = x + y
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((x + y) <= -4e+39) {
tmp = x + (a * b);
} else if ((x + y) <= 1e+25) {
tmp = (-0.5 + a) * b;
} else {
tmp = x + y;
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if (x + y) <= -4e+39: tmp = x + (a * b) elif (x + y) <= 1e+25: tmp = (-0.5 + a) * b else: tmp = x + y return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (Float64(x + y) <= -4e+39) tmp = Float64(x + Float64(a * b)); elseif (Float64(x + y) <= 1e+25) tmp = Float64(Float64(-0.5 + a) * b); else tmp = Float64(x + y); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if ((x + y) <= -4e+39) tmp = x + (a * b); elseif ((x + y) <= 1e+25) tmp = (-0.5 + a) * b; else tmp = x + y; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(x + y), $MachinePrecision], -4e+39], N[(x + N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 1e+25], N[(N[(-0.5 + a), $MachinePrecision] * b), $MachinePrecision], N[(x + y), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x + y \leq -4 \cdot 10^{+39}:\\
\;\;\;\;x + a \cdot b\\
\mathbf{elif}\;x + y \leq 10^{+25}:\\
\;\;\;\;\left(-0.5 + a\right) \cdot b\\
\mathbf{else}:\\
\;\;\;\;x + y\\
\end{array}
\end{array}
if (+.f64 x y) < -3.99999999999999976e39Initial program 99.9%
Taylor expanded in x around inf
Simplified53.4%
Taylor expanded in a around inf
*-commutativeN/A
*-lowering-*.f6447.3%
Simplified47.3%
if -3.99999999999999976e39 < (+.f64 x y) < 1.00000000000000009e25Initial program 99.7%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in b around inf
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6451.2%
Simplified51.2%
if 1.00000000000000009e25 < (+.f64 x y) Initial program 99.9%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6481.2%
Simplified81.2%
Taylor expanded in z around 0
+-lowering-+.f6463.0%
Simplified63.0%
Final simplification54.1%
(FPCore (x y z t a b) :precision binary64 (if (<= (+ x y) -1e-92) (+ x (+ (* a b) (* -0.5 b))) (+ y (* b (- a 0.5)))))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((x + y) <= -1e-92) {
tmp = x + ((a * b) + (-0.5 * b));
} else {
tmp = y + (b * (a - 0.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if ((x + y) <= (-1d-92)) then
tmp = x + ((a * b) + ((-0.5d0) * b))
else
tmp = y + (b * (a - 0.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((x + y) <= -1e-92) {
tmp = x + ((a * b) + (-0.5 * b));
} else {
tmp = y + (b * (a - 0.5));
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if (x + y) <= -1e-92: tmp = x + ((a * b) + (-0.5 * b)) else: tmp = y + (b * (a - 0.5)) return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (Float64(x + y) <= -1e-92) tmp = Float64(x + Float64(Float64(a * b) + Float64(-0.5 * b))); else tmp = Float64(y + Float64(b * Float64(a - 0.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if ((x + y) <= -1e-92) tmp = x + ((a * b) + (-0.5 * b)); else tmp = y + (b * (a - 0.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(x + y), $MachinePrecision], -1e-92], N[(x + N[(N[(a * b), $MachinePrecision] + N[(-0.5 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x + y \leq -1 \cdot 10^{-92}:\\
\;\;\;\;x + \left(a \cdot b + -0.5 \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;y + b \cdot \left(a - 0.5\right)\\
\end{array}
\end{array}
if (+.f64 x y) < -9.99999999999999988e-93Initial program 99.9%
Taylor expanded in x around inf
Simplified57.8%
*-commutativeN/A
sub-negN/A
metadata-evalN/A
distribute-lft-inN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.8%
Applied egg-rr57.8%
if -9.99999999999999988e-93 < (+.f64 x y) Initial program 99.8%
Taylor expanded in y around inf
Simplified50.0%
Final simplification53.6%
(FPCore (x y z t a b) :precision binary64 (let* ((t_1 (* (+ -0.5 a) b))) (if (<= b -2.25e+168) t_1 (if (<= b 2.5e+47) (+ x y) t_1))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (-0.5 + a) * b;
double tmp;
if (b <= -2.25e+168) {
tmp = t_1;
} else if (b <= 2.5e+47) {
tmp = x + y;
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = ((-0.5d0) + a) * b
if (b <= (-2.25d+168)) then
tmp = t_1
else if (b <= 2.5d+47) then
tmp = x + y
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 t_1 = (-0.5 + a) * b;
double tmp;
if (b <= -2.25e+168) {
tmp = t_1;
} else if (b <= 2.5e+47) {
tmp = x + y;
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = (-0.5 + a) * b tmp = 0 if b <= -2.25e+168: tmp = t_1 elif b <= 2.5e+47: tmp = x + y else: tmp = t_1 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(Float64(-0.5 + a) * b) tmp = 0.0 if (b <= -2.25e+168) tmp = t_1; elseif (b <= 2.5e+47) tmp = Float64(x + y); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = (-0.5 + a) * b; tmp = 0.0; if (b <= -2.25e+168) tmp = t_1; elseif (b <= 2.5e+47) tmp = x + y; else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(-0.5 + a), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[b, -2.25e+168], t$95$1, If[LessEqual[b, 2.5e+47], N[(x + y), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(-0.5 + a\right) \cdot b\\
\mathbf{if}\;b \leq -2.25 \cdot 10^{+168}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 2.5 \cdot 10^{+47}:\\
\;\;\;\;x + y\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if b < -2.25000000000000006e168 or 2.50000000000000011e47 < b Initial program 99.9%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in b around inf
*-lowering-*.f64N/A
sub-negN/A
metadata-evalN/A
+-lowering-+.f6468.1%
Simplified68.1%
if -2.25000000000000006e168 < b < 2.50000000000000011e47Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6487.1%
Simplified87.1%
Taylor expanded in z around 0
+-lowering-+.f6458.7%
Simplified58.7%
Final simplification61.9%
(FPCore (x y z t a b) :precision binary64 (let* ((t_1 (* b (- a 0.5)))) (if (<= (+ x y) -1e-92) (+ x t_1) (+ y t_1))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a - 0.5);
double tmp;
if ((x + y) <= -1e-92) {
tmp = x + t_1;
} else {
tmp = y + t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = b * (a - 0.5d0)
if ((x + y) <= (-1d-92)) then
tmp = x + t_1
else
tmp = y + 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 t_1 = b * (a - 0.5);
double tmp;
if ((x + y) <= -1e-92) {
tmp = x + t_1;
} else {
tmp = y + t_1;
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = b * (a - 0.5) tmp = 0 if (x + y) <= -1e-92: tmp = x + t_1 else: tmp = y + t_1 return tmp
function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a - 0.5)) tmp = 0.0 if (Float64(x + y) <= -1e-92) tmp = Float64(x + t_1); else tmp = Float64(y + t_1); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = b * (a - 0.5); tmp = 0.0; if ((x + y) <= -1e-92) tmp = x + t_1; else tmp = y + t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x + y), $MachinePrecision], -1e-92], N[(x + t$95$1), $MachinePrecision], N[(y + t$95$1), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(a - 0.5\right)\\
\mathbf{if}\;x + y \leq -1 \cdot 10^{-92}:\\
\;\;\;\;x + t\_1\\
\mathbf{else}:\\
\;\;\;\;y + t\_1\\
\end{array}
\end{array}
if (+.f64 x y) < -9.99999999999999988e-93Initial program 99.9%
Taylor expanded in x around inf
Simplified57.8%
if -9.99999999999999988e-93 < (+.f64 x y) Initial program 99.8%
Taylor expanded in y around inf
Simplified50.0%
Final simplification53.6%
(FPCore (x y z t a b) :precision binary64 (if (<= b -6.8e+168) (* a b) (if (<= b 1.1e+161) (+ x y) (* a b))))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (b <= -6.8e+168) {
tmp = a * b;
} else if (b <= 1.1e+161) {
tmp = x + y;
} else {
tmp = a * b;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (b <= (-6.8d+168)) then
tmp = a * b
else if (b <= 1.1d+161) then
tmp = x + y
else
tmp = a * b
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (b <= -6.8e+168) {
tmp = a * b;
} else if (b <= 1.1e+161) {
tmp = x + y;
} else {
tmp = a * b;
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if b <= -6.8e+168: tmp = a * b elif b <= 1.1e+161: tmp = x + y else: tmp = a * b return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (b <= -6.8e+168) tmp = Float64(a * b); elseif (b <= 1.1e+161) tmp = Float64(x + y); else tmp = Float64(a * b); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if (b <= -6.8e+168) tmp = a * b; elseif (b <= 1.1e+161) tmp = x + y; else tmp = a * b; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -6.8e+168], N[(a * b), $MachinePrecision], If[LessEqual[b, 1.1e+161], N[(x + y), $MachinePrecision], N[(a * b), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -6.8 \cdot 10^{+168}:\\
\;\;\;\;a \cdot b\\
\mathbf{elif}\;b \leq 1.1 \cdot 10^{+161}:\\
\;\;\;\;x + y\\
\mathbf{else}:\\
\;\;\;\;a \cdot b\\
\end{array}
\end{array}
if b < -6.80000000000000005e168 or 1.1e161 < b Initial program 100.0%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval100.0%
Simplified100.0%
Taylor expanded in a around inf
*-commutativeN/A
*-lowering-*.f6449.5%
Simplified49.5%
if -6.80000000000000005e168 < b < 1.1e161Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in b around 0
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
log-lowering-log.f6483.1%
Simplified83.1%
Taylor expanded in z around 0
+-lowering-+.f6455.8%
Simplified55.8%
Final simplification54.3%
(FPCore (x y z t a b) :precision binary64 (if (<= y 7e-191) x (if (<= y 1.45e-32) (* a b) y)))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y <= 7e-191) {
tmp = x;
} else if (y <= 1.45e-32) {
tmp = a * b;
} else {
tmp = y;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (y <= 7d-191) then
tmp = x
else if (y <= 1.45d-32) then
tmp = a * b
else
tmp = y
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y <= 7e-191) {
tmp = x;
} else if (y <= 1.45e-32) {
tmp = a * b;
} else {
tmp = y;
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if y <= 7e-191: tmp = x elif y <= 1.45e-32: tmp = a * b else: tmp = y return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (y <= 7e-191) tmp = x; elseif (y <= 1.45e-32) tmp = Float64(a * b); else tmp = y; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if (y <= 7e-191) tmp = x; elseif (y <= 1.45e-32) tmp = a * b; else tmp = y; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, 7e-191], x, If[LessEqual[y, 1.45e-32], N[(a * b), $MachinePrecision], y]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq 7 \cdot 10^{-191}:\\
\;\;\;\;x\\
\mathbf{elif}\;y \leq 1.45 \cdot 10^{-32}:\\
\;\;\;\;a \cdot b\\
\mathbf{else}:\\
\;\;\;\;y\\
\end{array}
\end{array}
if y < 7.00000000000000013e-191Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in x around inf
Simplified27.2%
if 7.00000000000000013e-191 < y < 1.44999999999999998e-32Initial program 99.7%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in a around inf
*-commutativeN/A
*-lowering-*.f6427.6%
Simplified27.6%
if 1.44999999999999998e-32 < y Initial program 99.9%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval100.0%
Simplified100.0%
Taylor expanded in y around inf
Simplified47.7%
Final simplification32.6%
(FPCore (x y z t a b) :precision binary64 (+ (+ x y) (* b (- a 0.5))))
double code(double x, double y, double z, double t, double a, double b) {
return (x + y) + (b * (a - 0.5));
}
real(8) function code(x, y, z, t, a, b)
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
code = (x + y) + (b * (a - 0.5d0))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return (x + y) + (b * (a - 0.5));
}
def code(x, y, z, t, a, b): return (x + y) + (b * (a - 0.5))
function code(x, y, z, t, a, b) return Float64(Float64(x + y) + Float64(b * Float64(a - 0.5))) end
function tmp = code(x, y, z, t, a, b) tmp = (x + y) + (b * (a - 0.5)); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(x + y), $MachinePrecision] + N[(b * N[(a - 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x + y\right) + b \cdot \left(a - 0.5\right)
\end{array}
Initial program 99.8%
Taylor expanded in z around 0
+-lowering-+.f6477.2%
Simplified77.2%
Final simplification77.2%
(FPCore (x y z t a b) :precision binary64 (if (<= y 5.5e-139) x y))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y <= 5.5e-139) {
tmp = x;
} else {
tmp = y;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (y <= 5.5d-139) then
tmp = x
else
tmp = y
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y <= 5.5e-139) {
tmp = x;
} else {
tmp = y;
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if y <= 5.5e-139: tmp = x else: tmp = y return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (y <= 5.5e-139) tmp = x; else tmp = y; end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if (y <= 5.5e-139) tmp = x; else tmp = y; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, 5.5e-139], x, y]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq 5.5 \cdot 10^{-139}:\\
\;\;\;\;x\\
\mathbf{else}:\\
\;\;\;\;y\\
\end{array}
\end{array}
if y < 5.4999999999999997e-139Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in x around inf
Simplified28.2%
if 5.4999999999999997e-139 < y Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in y around inf
Simplified38.2%
(FPCore (x y z t a b) :precision binary64 x)
double code(double x, double y, double z, double t, double a, double b) {
return x;
}
real(8) function code(x, y, z, t, a, b)
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
code = x
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return x;
}
def code(x, y, z, t, a, b): return x
function code(x, y, z, t, a, b) return x end
function tmp = code(x, y, z, t, a, b) tmp = x; end
code[x_, y_, z_, t_, a_, b_] := x
\begin{array}{l}
\\
x
\end{array}
Initial program 99.8%
+-commutativeN/A
associate--l+N/A
associate-+r+N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-commutativeN/A
cancel-sign-sub-invN/A
distribute-rgt1-inN/A
*-commutativeN/A
*-lowering-*.f64N/A
+-commutativeN/A
unsub-negN/A
--lowering--.f64N/A
log-lowering-log.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in x around inf
Simplified23.8%
(FPCore (x y z t a b) :precision binary64 (+ (+ (+ x y) (/ (* (- 1.0 (pow (log t) 2.0)) z) (+ 1.0 (log t)))) (* (- a 0.5) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x + y) + (((1.0 - pow(log(t), 2.0)) * z) / (1.0 + log(t)))) + ((a - 0.5) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x + y) + (((1.0d0 - (log(t) ** 2.0d0)) * z) / (1.0d0 + log(t)))) + ((a - 0.5d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x + y) + (((1.0 - Math.pow(Math.log(t), 2.0)) * z) / (1.0 + Math.log(t)))) + ((a - 0.5) * b);
}
def code(x, y, z, t, a, b): return ((x + y) + (((1.0 - math.pow(math.log(t), 2.0)) * z) / (1.0 + math.log(t)))) + ((a - 0.5) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x + y) + Float64(Float64(Float64(1.0 - (log(t) ^ 2.0)) * z) / Float64(1.0 + log(t)))) + Float64(Float64(a - 0.5) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x + y) + (((1.0 - (log(t) ^ 2.0)) * z) / (1.0 + log(t)))) + ((a - 0.5) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x + y), $MachinePrecision] + N[(N[(N[(1.0 - N[Power[N[Log[t], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision] / N[(1.0 + N[Log[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a - 0.5), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(x + y\right) + \frac{\left(1 - {\log t}^{2}\right) \cdot z}{1 + \log t}\right) + \left(a - 0.5\right) \cdot b
\end{array}
herbie shell --seed 2024158
(FPCore (x y z t a b)
:name "Numeric.SpecFunctions:logBeta from math-functions-0.1.5.2, A"
:precision binary64
:alt
(! :herbie-platform default (+ (+ (+ x y) (/ (* (- 1 (pow (log t) 2)) z) (+ 1 (log t)))) (* (- a 1/2) b)))
(+ (- (+ (+ x y) z) (* z (log t))) (* (- a 0.5) b)))