
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))
double code(double a, double b) {
return ((((double) M_PI) / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
public static double code(double a, double b) {
return ((Math.PI / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b));
}
def code(a, b): return ((math.pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b))
function code(a, b) return Float64(Float64(Float64(pi / 2.0) * Float64(1.0 / Float64(Float64(b * b) - Float64(a * a)))) * Float64(Float64(1.0 / a) - Float64(1.0 / b))) end
function tmp = code(a, b) tmp = ((pi / 2.0) * (1.0 / ((b * b) - (a * a)))) * ((1.0 / a) - (1.0 / b)); end
code[a_, b_] := N[(N[(N[(Pi / 2.0), $MachinePrecision] * N[(1.0 / N[(N[(b * b), $MachinePrecision] - N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / a), $MachinePrecision] - N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\frac{\pi}{2} \cdot \frac{1}{b \cdot b - a \cdot a}\right) \cdot \left(\frac{1}{a} - \frac{1}{b}\right)
\end{array}
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= a -6.5e+136) (/ (* -0.5 (/ PI (* a b))) (- b a)) (/ (* PI -0.5) (* b (* a (- (- a) b))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (a <= -6.5e+136) {
tmp = (-0.5 * (((double) M_PI) / (a * b))) / (b - a);
} else {
tmp = (((double) M_PI) * -0.5) / (b * (a * (-a - b)));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (a <= -6.5e+136) {
tmp = (-0.5 * (Math.PI / (a * b))) / (b - a);
} else {
tmp = (Math.PI * -0.5) / (b * (a * (-a - b)));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if a <= -6.5e+136: tmp = (-0.5 * (math.pi / (a * b))) / (b - a) else: tmp = (math.pi * -0.5) / (b * (a * (-a - b))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (a <= -6.5e+136) tmp = Float64(Float64(-0.5 * Float64(pi / Float64(a * b))) / Float64(b - a)); else tmp = Float64(Float64(pi * -0.5) / Float64(b * Float64(a * Float64(Float64(-a) - b)))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (a <= -6.5e+136)
tmp = (-0.5 * (pi / (a * b))) / (b - a);
else
tmp = (pi * -0.5) / (b * (a * (-a - b)));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[a, -6.5e+136], N[(N[(-0.5 * N[(Pi / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision], N[(N[(Pi * -0.5), $MachinePrecision] / N[(b * N[(a * N[((-a) - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -6.5 \cdot 10^{+136}:\\
\;\;\;\;\frac{-0.5 \cdot \frac{\pi}{a \cdot b}}{b - a}\\
\mathbf{else}:\\
\;\;\;\;\frac{\pi \cdot -0.5}{b \cdot \left(a \cdot \left(\left(-a\right) - b\right)\right)}\\
\end{array}
\end{array}
if a < -6.4999999999999998e136Initial program 68.8%
associate-*r/68.8%
*-rgt-identity68.8%
associate-*l/68.9%
difference-of-squares84.9%
*-commutative84.9%
times-frac99.8%
sub-neg99.8%
distribute-neg-frac99.8%
metadata-eval99.8%
Simplified99.8%
associate-*l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in a around inf 99.8%
if -6.4999999999999998e136 < a Initial program 84.4%
*-commutative84.4%
associate-*r*84.4%
associate-*r/84.3%
associate-/l*84.3%
/-rgt-identity84.3%
associate-/l*84.4%
difference-of-squares90.5%
associate-/l*90.4%
associate-/l*99.7%
associate-*r/90.7%
sub-neg90.7%
distribute-neg-frac90.7%
metadata-eval90.7%
Simplified90.7%
Taylor expanded in a around inf 62.2%
Taylor expanded in b around 0 97.2%
associate-*r/97.2%
Simplified97.2%
frac-2neg97.2%
metadata-eval97.2%
associate-/l/96.8%
*-commutative96.8%
frac-times96.6%
*-un-lft-identity96.6%
*-commutative96.6%
Applied egg-rr96.6%
Final simplification96.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* (* PI 0.5) (/ (+ (/ 1.0 a) (/ -1.0 b)) (+ a b))) (- b a)))
assert(a < b);
double code(double a, double b) {
return ((((double) M_PI) * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a);
}
assert a < b;
public static double code(double a, double b) {
return ((Math.PI * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a);
}
[a, b] = sort([a, b]) def code(a, b): return ((math.pi * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(pi * 0.5) * Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) / Float64(a + b))) / Float64(b - a)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((pi * 0.5) * (((1.0 / a) + (-1.0 / b)) / (a + b))) / (b - a);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(Pi * 0.5), $MachinePrecision] * N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\left(\pi \cdot 0.5\right) \cdot \frac{\frac{1}{a} + \frac{-1}{b}}{a + b}}{b - a}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
associate-*l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Final simplification99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ (+ (/ 1.0 a) (/ -1.0 b)) (+ a b)) (/ (/ PI 2.0) (- b a))))
assert(a < b);
double code(double a, double b) {
return (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((((double) M_PI) / 2.0) / (b - a));
}
assert a < b;
public static double code(double a, double b) {
return (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((Math.PI / 2.0) / (b - a));
}
[a, b] = sort([a, b]) def code(a, b): return (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((math.pi / 2.0) / (b - a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(Float64(1.0 / a) + Float64(-1.0 / b)) / Float64(a + b)) * Float64(Float64(pi / 2.0) / Float64(b - a))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (((1.0 / a) + (-1.0 / b)) / (a + b)) * ((pi / 2.0) / (b - a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(N[(1.0 / a), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] / N[(a + b), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi / 2.0), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{1}{a} + \frac{-1}{b}}{a + b} \cdot \frac{\frac{\pi}{2}}{b - a}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Final simplification99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 3.8e-80) (/ (* 0.5 (/ PI a)) (* a b)) (* (/ -1.0 b) (* -0.5 (/ (/ PI a) b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 3.8e-80) {
tmp = (0.5 * (((double) M_PI) / a)) / (a * b);
} else {
tmp = (-1.0 / b) * (-0.5 * ((((double) M_PI) / a) / b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 3.8e-80) {
tmp = (0.5 * (Math.PI / a)) / (a * b);
} else {
tmp = (-1.0 / b) * (-0.5 * ((Math.PI / a) / b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 3.8e-80: tmp = (0.5 * (math.pi / a)) / (a * b) else: tmp = (-1.0 / b) * (-0.5 * ((math.pi / a) / b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 3.8e-80) tmp = Float64(Float64(0.5 * Float64(pi / a)) / Float64(a * b)); else tmp = Float64(Float64(-1.0 / b) * Float64(-0.5 * Float64(Float64(pi / a) / b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 3.8e-80)
tmp = (0.5 * (pi / a)) / (a * b);
else
tmp = (-1.0 / b) * (-0.5 * ((pi / a) / b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 3.8e-80], N[(N[(0.5 * N[(Pi / a), $MachinePrecision]), $MachinePrecision] / N[(a * b), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / b), $MachinePrecision] * N[(-0.5 * N[(N[(Pi / a), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 3.8 \cdot 10^{-80}:\\
\;\;\;\;\frac{0.5 \cdot \frac{\pi}{a}}{a \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{b} \cdot \left(-0.5 \cdot \frac{\frac{\pi}{a}}{b}\right)\\
\end{array}
\end{array}
if b < 3.79999999999999967e-80Initial program 81.5%
associate-*r/81.5%
*-rgt-identity81.5%
associate-*l/81.5%
difference-of-squares88.9%
*-commutative88.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 73.1%
Taylor expanded in b around 0 73.3%
associate-*r/93.8%
Simplified73.3%
associate-/l*73.3%
frac-times73.3%
metadata-eval73.3%
Applied egg-rr73.3%
associate-/r*73.3%
div-inv73.3%
div-inv73.3%
clear-num73.3%
*-commutative73.3%
Applied egg-rr73.3%
associate-*r/73.4%
*-rgt-identity73.4%
*-commutative73.4%
Simplified73.4%
if 3.79999999999999967e-80 < b Initial program 85.2%
*-commutative85.2%
associate-*r*85.3%
associate-*r/85.2%
associate-/l*85.2%
/-rgt-identity85.2%
associate-/l*85.3%
difference-of-squares91.7%
associate-/l*91.6%
associate-/l*99.7%
associate-*r/91.6%
sub-neg91.6%
distribute-neg-frac91.6%
metadata-eval91.6%
Simplified91.6%
Taylor expanded in a around inf 55.6%
Taylor expanded in b around 0 99.7%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in a around 0 88.4%
associate-/r*88.5%
Simplified88.5%
Final simplification78.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 1.8e-80) (* (/ (* PI -0.5) a) (/ -1.0 (* a b))) (* (/ -1.0 b) (* -0.5 (/ (/ PI a) b)))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.8e-80) {
tmp = ((((double) M_PI) * -0.5) / a) * (-1.0 / (a * b));
} else {
tmp = (-1.0 / b) * (-0.5 * ((((double) M_PI) / a) / b));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1.8e-80) {
tmp = ((Math.PI * -0.5) / a) * (-1.0 / (a * b));
} else {
tmp = (-1.0 / b) * (-0.5 * ((Math.PI / a) / b));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.8e-80: tmp = ((math.pi * -0.5) / a) * (-1.0 / (a * b)) else: tmp = (-1.0 / b) * (-0.5 * ((math.pi / a) / b)) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1.8e-80) tmp = Float64(Float64(Float64(pi * -0.5) / a) * Float64(-1.0 / Float64(a * b))); else tmp = Float64(Float64(-1.0 / b) * Float64(-0.5 * Float64(Float64(pi / a) / b))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 1.8e-80)
tmp = ((pi * -0.5) / a) * (-1.0 / (a * b));
else
tmp = (-1.0 / b) * (-0.5 * ((pi / a) / b));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 1.8e-80], N[(N[(N[(Pi * -0.5), $MachinePrecision] / a), $MachinePrecision] * N[(-1.0 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-1.0 / b), $MachinePrecision] * N[(-0.5 * N[(N[(Pi / a), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.8 \cdot 10^{-80}:\\
\;\;\;\;\frac{\pi \cdot -0.5}{a} \cdot \frac{-1}{a \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{b} \cdot \left(-0.5 \cdot \frac{\frac{\pi}{a}}{b}\right)\\
\end{array}
\end{array}
if b < 1.8e-80Initial program 81.5%
associate-*r/81.5%
*-rgt-identity81.5%
associate-*l/81.5%
difference-of-squares88.9%
*-commutative88.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 73.1%
Taylor expanded in b around 0 73.3%
associate-*r/93.8%
Simplified73.3%
if 1.8e-80 < b Initial program 85.2%
*-commutative85.2%
associate-*r*85.3%
associate-*r/85.2%
associate-/l*85.2%
/-rgt-identity85.2%
associate-/l*85.3%
difference-of-squares91.7%
associate-/l*91.6%
associate-/l*99.7%
associate-*r/91.6%
sub-neg91.6%
distribute-neg-frac91.6%
metadata-eval91.6%
Simplified91.6%
Taylor expanded in a around inf 55.6%
Taylor expanded in b around 0 99.7%
associate-*r/99.7%
Simplified99.7%
Taylor expanded in a around 0 88.4%
associate-/r*88.5%
Simplified88.5%
Final simplification78.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 1.35e-78) (* (/ (* PI -0.5) a) (/ -1.0 (* a b))) (/ 0.5 (/ (* a b) (/ PI (- b a))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 1.35e-78) {
tmp = ((((double) M_PI) * -0.5) / a) * (-1.0 / (a * b));
} else {
tmp = 0.5 / ((a * b) / (((double) M_PI) / (b - a)));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 1.35e-78) {
tmp = ((Math.PI * -0.5) / a) * (-1.0 / (a * b));
} else {
tmp = 0.5 / ((a * b) / (Math.PI / (b - a)));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 1.35e-78: tmp = ((math.pi * -0.5) / a) * (-1.0 / (a * b)) else: tmp = 0.5 / ((a * b) / (math.pi / (b - a))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 1.35e-78) tmp = Float64(Float64(Float64(pi * -0.5) / a) * Float64(-1.0 / Float64(a * b))); else tmp = Float64(0.5 / Float64(Float64(a * b) / Float64(pi / Float64(b - a)))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 1.35e-78)
tmp = ((pi * -0.5) / a) * (-1.0 / (a * b));
else
tmp = 0.5 / ((a * b) / (pi / (b - a)));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 1.35e-78], N[(N[(N[(Pi * -0.5), $MachinePrecision] / a), $MachinePrecision] * N[(-1.0 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 / N[(N[(a * b), $MachinePrecision] / N[(Pi / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 1.35 \cdot 10^{-78}:\\
\;\;\;\;\frac{\pi \cdot -0.5}{a} \cdot \frac{-1}{a \cdot b}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{\frac{a \cdot b}{\frac{\pi}{b - a}}}\\
\end{array}
\end{array}
if b < 1.34999999999999997e-78Initial program 81.5%
associate-*r/81.5%
*-rgt-identity81.5%
associate-*l/81.5%
difference-of-squares88.9%
*-commutative88.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 73.1%
Taylor expanded in b around 0 73.3%
associate-*r/93.8%
Simplified73.3%
if 1.34999999999999997e-78 < b Initial program 85.2%
associate-*r/85.3%
*-rgt-identity85.3%
associate-*l/85.2%
difference-of-squares91.6%
*-commutative91.6%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
associate-*l/99.7%
div-inv99.7%
metadata-eval99.7%
Applied egg-rr99.7%
Taylor expanded in a around 0 94.6%
expm1-log1p-u80.1%
expm1-udef58.7%
associate-*r/58.7%
*-commutative58.7%
Applied egg-rr58.7%
expm1-def80.1%
expm1-log1p94.6%
metadata-eval94.6%
distribute-rgt-neg-in94.6%
associate-/l/94.6%
distribute-rgt-neg-in94.6%
metadata-eval94.6%
*-commutative94.6%
Simplified94.6%
associate-/l*94.5%
div-inv94.5%
*-commutative94.5%
*-commutative94.5%
Applied egg-rr94.5%
associate-*r/94.5%
metadata-eval94.5%
associate-/l*94.6%
*-commutative94.6%
Simplified94.6%
Final simplification81.1%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 8.2e+101) (/ (* PI 0.5) (* a (* b (+ a b)))) (/ 0.5 (/ (* a b) (/ PI (- b a))))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 8.2e+101) {
tmp = (((double) M_PI) * 0.5) / (a * (b * (a + b)));
} else {
tmp = 0.5 / ((a * b) / (((double) M_PI) / (b - a)));
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 8.2e+101) {
tmp = (Math.PI * 0.5) / (a * (b * (a + b)));
} else {
tmp = 0.5 / ((a * b) / (Math.PI / (b - a)));
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 8.2e+101: tmp = (math.pi * 0.5) / (a * (b * (a + b))) else: tmp = 0.5 / ((a * b) / (math.pi / (b - a))) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 8.2e+101) tmp = Float64(Float64(pi * 0.5) / Float64(a * Float64(b * Float64(a + b)))); else tmp = Float64(0.5 / Float64(Float64(a * b) / Float64(pi / Float64(b - a)))); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 8.2e+101)
tmp = (pi * 0.5) / (a * (b * (a + b)));
else
tmp = 0.5 / ((a * b) / (pi / (b - a)));
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 8.2e+101], N[(N[(Pi * 0.5), $MachinePrecision] / N[(a * N[(b * N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 / N[(N[(a * b), $MachinePrecision] / N[(Pi / N[(b - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 8.2 \cdot 10^{+101}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{a \cdot \left(b \cdot \left(a + b\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{\frac{a \cdot b}{\frac{\pi}{b - a}}}\\
\end{array}
\end{array}
if b < 8.1999999999999999e101Initial program 85.0%
*-commutative85.0%
associate-*r*85.0%
associate-*r/85.0%
associate-/l*85.0%
/-rgt-identity85.0%
associate-/l*85.0%
difference-of-squares91.0%
associate-/l*90.9%
associate-/l*99.7%
associate-*r/91.3%
sub-neg91.3%
distribute-neg-frac91.3%
metadata-eval91.3%
Simplified91.3%
Taylor expanded in a around inf 64.3%
Taylor expanded in b around 0 94.9%
associate-*r/94.9%
Simplified94.9%
*-commutative94.9%
frac-2neg94.9%
metadata-eval94.9%
un-div-inv95.0%
associate-/l/94.6%
*-commutative94.6%
times-frac94.9%
Applied egg-rr94.9%
Simplified96.1%
if 8.1999999999999999e101 < b Initial program 74.7%
associate-*r/74.7%
*-rgt-identity74.7%
associate-*l/74.7%
difference-of-squares85.8%
*-commutative85.8%
times-frac99.8%
sub-neg99.8%
distribute-neg-frac99.8%
metadata-eval99.8%
Simplified99.8%
associate-*l/99.8%
div-inv99.8%
metadata-eval99.8%
Applied egg-rr99.8%
Taylor expanded in a around 0 99.7%
expm1-log1p-u94.2%
expm1-udef66.7%
associate-*r/66.7%
*-commutative66.7%
Applied egg-rr66.7%
expm1-def94.2%
expm1-log1p99.7%
metadata-eval99.7%
distribute-rgt-neg-in99.7%
associate-/l/99.8%
distribute-rgt-neg-in99.8%
metadata-eval99.8%
*-commutative99.8%
Simplified99.8%
associate-/l*99.8%
div-inv99.8%
*-commutative99.8%
*-commutative99.8%
Applied egg-rr99.8%
associate-*r/99.8%
metadata-eval99.8%
associate-/l*99.8%
*-commutative99.8%
Simplified99.8%
Final simplification96.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (if (<= b 8e+151) (/ (* PI 0.5) (* a (* b (+ a b)))) (/ (/ (* 0.5 (/ PI b)) a) (- b a))))
assert(a < b);
double code(double a, double b) {
double tmp;
if (b <= 8e+151) {
tmp = (((double) M_PI) * 0.5) / (a * (b * (a + b)));
} else {
tmp = ((0.5 * (((double) M_PI) / b)) / a) / (b - a);
}
return tmp;
}
assert a < b;
public static double code(double a, double b) {
double tmp;
if (b <= 8e+151) {
tmp = (Math.PI * 0.5) / (a * (b * (a + b)));
} else {
tmp = ((0.5 * (Math.PI / b)) / a) / (b - a);
}
return tmp;
}
[a, b] = sort([a, b]) def code(a, b): tmp = 0 if b <= 8e+151: tmp = (math.pi * 0.5) / (a * (b * (a + b))) else: tmp = ((0.5 * (math.pi / b)) / a) / (b - a) return tmp
a, b = sort([a, b]) function code(a, b) tmp = 0.0 if (b <= 8e+151) tmp = Float64(Float64(pi * 0.5) / Float64(a * Float64(b * Float64(a + b)))); else tmp = Float64(Float64(Float64(0.5 * Float64(pi / b)) / a) / Float64(b - a)); end return tmp end
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(a, b)
tmp = 0.0;
if (b <= 8e+151)
tmp = (pi * 0.5) / (a * (b * (a + b)));
else
tmp = ((0.5 * (pi / b)) / a) / (b - a);
end
tmp_2 = tmp;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := If[LessEqual[b, 8e+151], N[(N[(Pi * 0.5), $MachinePrecision] / N[(a * N[(b * N[(a + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(0.5 * N[(Pi / b), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / N[(b - a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq 8 \cdot 10^{+151}:\\
\;\;\;\;\frac{\pi \cdot 0.5}{a \cdot \left(b \cdot \left(a + b\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{0.5 \cdot \frac{\pi}{b}}{a}}{b - a}\\
\end{array}
\end{array}
if b < 8.00000000000000014e151Initial program 86.2%
*-commutative86.2%
associate-*r*86.2%
associate-*r/86.2%
associate-/l*86.2%
/-rgt-identity86.2%
associate-/l*86.2%
difference-of-squares91.7%
associate-/l*91.6%
associate-/l*99.6%
associate-*r/92.0%
sub-neg92.0%
distribute-neg-frac92.0%
metadata-eval92.0%
Simplified92.0%
Taylor expanded in a around inf 62.0%
Taylor expanded in b around 0 95.3%
associate-*r/95.3%
Simplified95.3%
*-commutative95.3%
frac-2neg95.3%
metadata-eval95.3%
un-div-inv95.3%
associate-/l/95.0%
*-commutative95.0%
times-frac95.3%
Applied egg-rr95.3%
Simplified96.4%
if 8.00000000000000014e151 < b Initial program 62.3%
associate-*r/62.3%
*-rgt-identity62.3%
associate-*l/62.3%
difference-of-squares79.0%
*-commutative79.0%
times-frac100.0%
sub-neg100.0%
distribute-neg-frac100.0%
metadata-eval100.0%
Simplified100.0%
Taylor expanded in a around inf 78.7%
*-commutative78.7%
clear-num78.7%
frac-times78.7%
metadata-eval78.7%
div-inv78.7%
metadata-eval78.7%
Applied egg-rr78.7%
associate-/r*78.7%
*-commutative78.7%
associate-/l/78.7%
associate-/r*79.0%
associate-*r/79.0%
associate-/l*79.0%
*-commutative79.0%
associate-/r*78.7%
*-commutative78.7%
associate-*l/78.7%
neg-mul-178.7%
distribute-rgt-neg-in78.7%
metadata-eval78.7%
Simplified78.7%
expm1-log1p-u78.5%
expm1-udef78.6%
div-inv78.6%
*-commutative78.6%
associate-/l*78.6%
frac-times78.6%
metadata-eval78.6%
Applied egg-rr78.6%
expm1-def78.5%
expm1-log1p78.7%
*-commutative78.7%
Simplified78.7%
div-inv78.7%
metadata-eval78.7%
associate-*r/78.7%
*-commutative78.7%
add-sqr-sqrt28.2%
sqrt-unprod89.3%
sqr-neg89.3%
sqrt-unprod61.0%
add-sqr-sqrt99.9%
clear-num99.8%
times-frac99.8%
*-commutative99.8%
*-un-lft-identity99.8%
*-un-lft-identity99.8%
distribute-rgt-neg-in99.8%
times-frac100.0%
*-commutative100.0%
Applied egg-rr100.0%
associate-*l/99.9%
*-lft-identity99.9%
neg-mul-199.9%
times-frac99.9%
metadata-eval99.9%
Simplified99.9%
Final simplification96.9%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* (/ -0.5 b) (/ PI a)) (- (- a) b)))
assert(a < b);
double code(double a, double b) {
return ((-0.5 / b) * (((double) M_PI) / a)) / (-a - b);
}
assert a < b;
public static double code(double a, double b) {
return ((-0.5 / b) * (Math.PI / a)) / (-a - b);
}
[a, b] = sort([a, b]) def code(a, b): return ((-0.5 / b) * (math.pi / a)) / (-a - b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(-0.5 / b) * Float64(pi / a)) / Float64(Float64(-a) - b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((-0.5 / b) * (pi / a)) / (-a - b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(-0.5 / b), $MachinePrecision] * N[(Pi / a), $MachinePrecision]), $MachinePrecision] / N[((-a) - b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{-0.5}{b} \cdot \frac{\pi}{a}}{\left(-a\right) - b}
\end{array}
Initial program 82.9%
*-commutative82.9%
associate-*r*82.8%
associate-*r/82.8%
associate-/l*82.8%
/-rgt-identity82.8%
associate-/l*82.9%
difference-of-squares89.9%
associate-/l*89.8%
associate-/l*99.7%
associate-*r/90.1%
sub-neg90.1%
distribute-neg-frac90.1%
metadata-eval90.1%
Simplified90.1%
Taylor expanded in a around inf 64.4%
Taylor expanded in b around 0 95.9%
associate-*r/95.9%
Simplified95.9%
Applied egg-rr99.7%
Final simplification99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (/ PI (+ a b)) (/ (- b) (/ -0.5 a))))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / (a + b)) / (-b / (-0.5 / a));
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / (a + b)) / (-b / (-0.5 / a));
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / (a + b)) / (-b / (-0.5 / a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / Float64(a + b)) / Float64(Float64(-b) / Float64(-0.5 / a))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / (a + b)) / (-b / (-0.5 / a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi / N[(a + b), $MachinePrecision]), $MachinePrecision] / N[((-b) / N[(-0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\frac{\pi}{a + b}}{\frac{-b}{\frac{-0.5}{a}}}
\end{array}
Initial program 82.9%
*-commutative82.9%
associate-*r*82.8%
associate-*r/82.8%
associate-/l*82.8%
/-rgt-identity82.8%
associate-/l*82.9%
difference-of-squares89.9%
associate-/l*89.8%
associate-/l*99.7%
associate-*r/90.1%
sub-neg90.1%
distribute-neg-frac90.1%
metadata-eval90.1%
Simplified90.1%
Taylor expanded in a around inf 64.4%
Taylor expanded in b around 0 95.9%
associate-*r/95.9%
Simplified95.9%
*-commutative95.9%
frac-2neg95.9%
metadata-eval95.9%
un-div-inv96.0%
associate-/l/95.7%
*-commutative95.7%
times-frac95.9%
Applied egg-rr95.9%
associate-/l*99.6%
+-commutative99.6%
Simplified99.6%
Final simplification99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ (* PI -0.5) (* a (* b (- a)))))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) * -0.5) / (a * (b * -a));
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI * -0.5) / (a * (b * -a));
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi * -0.5) / (a * (b * -a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi * -0.5) / Float64(a * Float64(b * Float64(-a)))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi * -0.5) / (a * (b * -a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi * -0.5), $MachinePrecision] / N[(a * N[(b * (-a)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi \cdot -0.5}{a \cdot \left(b \cdot \left(-a\right)\right)}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 60.3%
associate-*r/95.9%
Simplified60.3%
*-commutative60.3%
frac-2neg60.3%
metadata-eval60.3%
frac-times60.6%
*-un-lft-identity60.6%
*-commutative60.6%
Applied egg-rr60.6%
Final simplification60.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ PI a) (/ -0.5 (* a b))))
assert(a < b);
double code(double a, double b) {
return (((double) M_PI) / a) * (-0.5 / (a * b));
}
assert a < b;
public static double code(double a, double b) {
return (Math.PI / a) * (-0.5 / (a * b));
}
[a, b] = sort([a, b]) def code(a, b): return (math.pi / a) * (-0.5 / (a * b))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(pi / a) * Float64(-0.5 / Float64(a * b))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (pi / a) * (-0.5 / (a * b));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(Pi / a), $MachinePrecision] * N[(-0.5 / N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{\pi}{a} \cdot \frac{-0.5}{a \cdot b}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 60.3%
associate-*r/95.9%
Simplified60.3%
*-commutative60.3%
frac-2neg60.3%
metadata-eval60.3%
frac-times60.6%
*-un-lft-identity60.6%
*-commutative60.6%
Applied egg-rr60.6%
*-commutative60.6%
times-frac60.3%
add-sqr-sqrt29.3%
sqrt-unprod43.2%
sqr-neg43.2%
sqrt-unprod16.1%
add-sqr-sqrt27.3%
*-commutative27.3%
Applied egg-rr27.3%
Final simplification27.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ -0.5 (* (* a b) (/ a PI))))
assert(a < b);
double code(double a, double b) {
return -0.5 / ((a * b) * (a / ((double) M_PI)));
}
assert a < b;
public static double code(double a, double b) {
return -0.5 / ((a * b) * (a / Math.PI));
}
[a, b] = sort([a, b]) def code(a, b): return -0.5 / ((a * b) * (a / math.pi))
a, b = sort([a, b]) function code(a, b) return Float64(-0.5 / Float64(Float64(a * b) * Float64(a / pi))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = -0.5 / ((a * b) * (a / pi));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(-0.5 / N[(N[(a * b), $MachinePrecision] * N[(a / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{-0.5}{\left(a \cdot b\right) \cdot \frac{a}{\pi}}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 60.3%
associate-*r/95.9%
Simplified60.3%
associate-/l*60.2%
frac-times60.2%
metadata-eval60.2%
Applied egg-rr60.2%
expm1-log1p-u47.6%
expm1-udef43.1%
frac-2neg43.1%
metadata-eval43.1%
*-commutative43.1%
distribute-lft-neg-in43.1%
add-sqr-sqrt21.7%
sqrt-unprod34.0%
sqr-neg34.0%
sqrt-unprod16.8%
add-sqr-sqrt31.2%
*-commutative31.2%
*-commutative31.2%
Applied egg-rr31.2%
expm1-def25.6%
expm1-log1p27.3%
*-commutative27.3%
Simplified27.3%
Final simplification27.3%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ 0.5 (* (* a b) (/ a PI))))
assert(a < b);
double code(double a, double b) {
return 0.5 / ((a * b) * (a / ((double) M_PI)));
}
assert a < b;
public static double code(double a, double b) {
return 0.5 / ((a * b) * (a / Math.PI));
}
[a, b] = sort([a, b]) def code(a, b): return 0.5 / ((a * b) * (a / math.pi))
a, b = sort([a, b]) function code(a, b) return Float64(0.5 / Float64(Float64(a * b) * Float64(a / pi))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = 0.5 / ((a * b) * (a / pi));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(0.5 / N[(N[(a * b), $MachinePrecision] * N[(a / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5}{\left(a \cdot b\right) \cdot \frac{a}{\pi}}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 60.3%
associate-*r/95.9%
Simplified60.3%
associate-/l*60.2%
frac-times60.2%
metadata-eval60.2%
Applied egg-rr60.2%
Final simplification60.2%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (/ 0.5 (/ (* a (* a b)) PI)))
assert(a < b);
double code(double a, double b) {
return 0.5 / ((a * (a * b)) / ((double) M_PI));
}
assert a < b;
public static double code(double a, double b) {
return 0.5 / ((a * (a * b)) / Math.PI);
}
[a, b] = sort([a, b]) def code(a, b): return 0.5 / ((a * (a * b)) / math.pi)
a, b = sort([a, b]) function code(a, b) return Float64(0.5 / Float64(Float64(a * Float64(a * b)) / pi)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = 0.5 / ((a * (a * b)) / pi);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(0.5 / N[(N[(a * N[(a * b), $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{0.5}{\frac{a \cdot \left(a \cdot b\right)}{\pi}}
\end{array}
Initial program 82.9%
associate-*r/82.9%
*-rgt-identity82.9%
associate-*l/82.8%
difference-of-squares89.9%
*-commutative89.9%
times-frac99.7%
sub-neg99.7%
distribute-neg-frac99.7%
metadata-eval99.7%
Simplified99.7%
Taylor expanded in a around inf 66.3%
Taylor expanded in b around 0 60.3%
associate-*r/95.9%
Simplified60.3%
associate-/l*60.2%
frac-times60.2%
metadata-eval60.2%
Applied egg-rr60.2%
associate-*l/60.5%
*-commutative60.5%
Applied egg-rr60.5%
Final simplification60.5%
herbie shell --seed 2024011
(FPCore (a b)
:name "NMSE Section 6.1 mentioned, B"
:precision binary64
(* (* (/ PI 2.0) (/ 1.0 (- (* b b) (* a a)))) (- (/ 1.0 a) (/ 1.0 b))))