
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 3.8e-13)
(/
(sqrt (* (* t_0 F) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(if (<= B_m 9.5e+127)
(*
(sqrt
(*
F
(/
(- (+ A C) (hypot B_m (- A C)))
(fma -4.0 (* A C) (pow B_m 2.0)))))
(- (sqrt 2.0)))
(if (<= B_m 1.6e+287)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 3.8e-13) {
tmp = sqrt(((t_0 * F) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else if (B_m <= 9.5e+127) {
tmp = sqrt((F * (((A + C) - hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
} else if (B_m <= 1.6e+287) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 3.8e-13) tmp = Float64(sqrt(Float64(Float64(t_0 * F) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); elseif (B_m <= 9.5e+127) tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(A + C) - hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0))); elseif (B_m <= 1.6e+287) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 3.8e-13], N[(N[Sqrt[N[(N[(t$95$0 * F), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 9.5e+127], N[(N[Sqrt[N[(F * N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.6e+287], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 3.8 \cdot 10^{-13}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot F\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 9.5 \cdot 10^{+127}:\\
\;\;\;\;\sqrt{F \cdot \frac{\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;B\_m \leq 1.6 \cdot 10^{+287}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.8e-13Initial program 21.1%
Simplified27.4%
Taylor expanded in C around inf 14.7%
mul-1-neg14.7%
Simplified14.7%
if 3.8e-13 < B < 9.49999999999999975e127Initial program 47.6%
Taylor expanded in F around 0 53.5%
mul-1-neg53.5%
Simplified74.3%
if 9.49999999999999975e127 < B < 1.60000000000000005e287Initial program 0.3%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr63.3%
neg-sub063.3%
associate-/l*63.3%
Simplified63.3%
if 1.60000000000000005e287 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification26.8%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 6.4e-6)
(/
(sqrt (* (* t_0 F) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
(- t_0))
(if (<= B_m 3.4e+104)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (/ -1.0 B_m) (pow 2.0 -0.5)))
(if (<= B_m 1.95e+287)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 6.4e-6) {
tmp = sqrt(((t_0 * F) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_0;
} else if (B_m <= 3.4e+104) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * ((-1.0 / B_m) / pow(2.0, -0.5));
} else if (B_m <= 1.95e+287) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 6.4e-6) tmp = Float64(sqrt(Float64(Float64(t_0 * F) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_0)); elseif (B_m <= 3.4e+104) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-1.0 / B_m) / (2.0 ^ -0.5))); elseif (B_m <= 1.95e+287) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 6.4e-6], N[(N[Sqrt[N[(N[(t$95$0 * F), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 3.4e+104], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(-1.0 / B$95$m), $MachinePrecision] / N[Power[2.0, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1.95e+287], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 6.4 \cdot 10^{-6}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot F\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 3.4 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\frac{-1}{B\_m}}{{2}^{-0.5}}\\
\mathbf{elif}\;B\_m \leq 1.95 \cdot 10^{+287}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 6.3999999999999997e-6Initial program 21.1%
Simplified27.4%
Taylor expanded in C around inf 14.7%
mul-1-neg14.7%
Simplified14.7%
if 6.3999999999999997e-6 < B < 3.3999999999999997e104Initial program 55.9%
Taylor expanded in C around 0 61.5%
mul-1-neg61.5%
+-commutative61.5%
unpow261.5%
unpow261.5%
hypot-define66.5%
Simplified66.5%
clear-num66.6%
inv-pow66.6%
Applied egg-rr66.6%
unpow-166.6%
Simplified66.6%
inv-pow66.6%
div-inv66.5%
unpow-prod-down66.5%
inv-pow66.5%
pow1/266.5%
pow-flip66.5%
metadata-eval66.5%
Applied egg-rr66.5%
*-commutative66.5%
unpow-166.5%
associate-*l/66.6%
*-lft-identity66.6%
Simplified66.6%
if 3.3999999999999997e104 < B < 1.9500000000000001e287Initial program 6.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr61.0%
neg-sub061.0%
associate-/l*61.0%
Simplified61.0%
if 1.9500000000000001e287 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification25.6%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 2.8e-6)
(/ (sqrt (* (* t_0 F) (* A 4.0))) (- t_0))
(if (<= B_m 3.1e+104)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (/ -1.0 B_m) (pow 2.0 -0.5)))
(if (<= B_m 3.5e+287)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m)))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
double tmp;
if (B_m <= 2.8e-6) {
tmp = sqrt(((t_0 * F) * (A * 4.0))) / -t_0;
} else if (B_m <= 3.1e+104) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * ((-1.0 / B_m) / pow(2.0, -0.5));
} else if (B_m <= 3.5e+287) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0))) tmp = 0.0 if (B_m <= 2.8e-6) tmp = Float64(sqrt(Float64(Float64(t_0 * F) * Float64(A * 4.0))) / Float64(-t_0)); elseif (B_m <= 3.1e+104) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-1.0 / B_m) / (2.0 ^ -0.5))); elseif (B_m <= 3.5e+287) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.8e-6], N[(N[Sqrt[N[(N[(t$95$0 * F), $MachinePrecision] * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 3.1e+104], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(-1.0 / B$95$m), $MachinePrecision] / N[Power[2.0, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 3.5e+287], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;B\_m \leq 2.8 \cdot 10^{-6}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot F\right) \cdot \left(A \cdot 4\right)}}{-t\_0}\\
\mathbf{elif}\;B\_m \leq 3.1 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\frac{-1}{B\_m}}{{2}^{-0.5}}\\
\mathbf{elif}\;B\_m \leq 3.5 \cdot 10^{+287}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 2.79999999999999987e-6Initial program 21.1%
Simplified27.4%
Taylor expanded in A around -inf 15.2%
if 2.79999999999999987e-6 < B < 3.10000000000000017e104Initial program 55.9%
Taylor expanded in C around 0 61.5%
mul-1-neg61.5%
+-commutative61.5%
unpow261.5%
unpow261.5%
hypot-define66.5%
Simplified66.5%
clear-num66.6%
inv-pow66.6%
Applied egg-rr66.6%
unpow-166.6%
Simplified66.6%
inv-pow66.6%
div-inv66.5%
unpow-prod-down66.5%
inv-pow66.5%
pow1/266.5%
pow-flip66.5%
metadata-eval66.5%
Applied egg-rr66.5%
*-commutative66.5%
unpow-166.5%
associate-*l/66.6%
*-lft-identity66.6%
Simplified66.6%
if 3.10000000000000017e104 < B < 3.49999999999999976e287Initial program 6.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr61.0%
neg-sub061.0%
associate-/l*61.0%
Simplified61.0%
if 3.49999999999999976e287 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification25.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4.8e-6)
(/
(sqrt (* -8.0 (* (* A C) (* F (+ A A)))))
(- (fma C (* A -4.0) (pow B_m 2.0))))
(if (<= B_m 3.4e+104)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (/ -1.0 B_m) (pow 2.0 -0.5)))
(if (<= B_m 1e+287)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4.8e-6) {
tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
} else if (B_m <= 3.4e+104) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * ((-1.0 / B_m) / pow(2.0, -0.5));
} else if (B_m <= 1e+287) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4.8e-6) tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0)))); elseif (B_m <= 3.4e+104) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-1.0 / B_m) / (2.0 ^ -0.5))); elseif (B_m <= 1e+287) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4.8e-6], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 3.4e+104], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(-1.0 / B$95$m), $MachinePrecision] / N[Power[2.0, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 1e+287], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-6}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\
\mathbf{elif}\;B\_m \leq 3.4 \cdot 10^{+104}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\frac{-1}{B\_m}}{{2}^{-0.5}}\\
\mathbf{elif}\;B\_m \leq 10^{+287}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 4.7999999999999998e-6Initial program 21.1%
Simplified23.8%
Taylor expanded in C around inf 13.4%
associate-*r*13.8%
mul-1-neg13.8%
Simplified13.8%
if 4.7999999999999998e-6 < B < 3.3999999999999997e104Initial program 55.9%
Taylor expanded in C around 0 61.5%
mul-1-neg61.5%
+-commutative61.5%
unpow261.5%
unpow261.5%
hypot-define66.5%
Simplified66.5%
clear-num66.6%
inv-pow66.6%
Applied egg-rr66.6%
unpow-166.6%
Simplified66.6%
inv-pow66.6%
div-inv66.5%
unpow-prod-down66.5%
inv-pow66.5%
pow1/266.5%
pow-flip66.5%
metadata-eval66.5%
Applied egg-rr66.5%
*-commutative66.5%
unpow-166.5%
associate-*l/66.6%
*-lft-identity66.6%
Simplified66.6%
if 3.3999999999999997e104 < B < 1.0000000000000001e287Initial program 6.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr61.0%
neg-sub061.0%
associate-/l*61.0%
Simplified61.0%
if 1.0000000000000001e287 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification24.9%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 3.1e-6)
(/
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 6.8e+103)
(* (sqrt (* F (- A (hypot B_m A)))) (/ (/ -1.0 B_m) (pow 2.0 -0.5)))
(if (<= B_m 5.6e+287)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 3.1e-6) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 6.8e+103) {
tmp = sqrt((F * (A - hypot(B_m, A)))) * ((-1.0 / B_m) / pow(2.0, -0.5));
} else if (B_m <= 5.6e+287) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 3.1e-6) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 6.8e+103) tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(Float64(-1.0 / B_m) / (2.0 ^ -0.5))); elseif (B_m <= 5.6e+287) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 3.1e-6], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 6.8e+103], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[(-1.0 / B$95$m), $MachinePrecision] / N[Power[2.0, -0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 5.6e+287], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 3.1 \cdot 10^{-6}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 6.8 \cdot 10^{+103}:\\
\;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\frac{-1}{B\_m}}{{2}^{-0.5}}\\
\mathbf{elif}\;B\_m \leq 5.6 \cdot 10^{+287}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.1e-6Initial program 21.1%
Simplified27.4%
Taylor expanded in B around 0 17.1%
associate-*r*17.1%
Simplified17.1%
Taylor expanded in C around inf 13.4%
mul-1-neg13.4%
Simplified13.4%
if 3.1e-6 < B < 6.7999999999999997e103Initial program 55.9%
Taylor expanded in C around 0 61.5%
mul-1-neg61.5%
+-commutative61.5%
unpow261.5%
unpow261.5%
hypot-define66.5%
Simplified66.5%
clear-num66.6%
inv-pow66.6%
Applied egg-rr66.6%
unpow-166.6%
Simplified66.6%
inv-pow66.6%
div-inv66.5%
unpow-prod-down66.5%
inv-pow66.5%
pow1/266.5%
pow-flip66.5%
metadata-eval66.5%
Applied egg-rr66.5%
*-commutative66.5%
unpow-166.5%
associate-*l/66.6%
*-lft-identity66.6%
Simplified66.6%
if 6.7999999999999997e103 < B < 5.60000000000000002e287Initial program 6.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr61.0%
neg-sub061.0%
associate-/l*61.0%
Simplified61.0%
if 5.60000000000000002e287 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification24.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 4e-6)
(/
(sqrt (* -8.0 (* A (* C (* F (+ A A))))))
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 2.85e+104)
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))
(if (<= B_m 8.5e+286)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 4e-6) {
tmp = sqrt((-8.0 * (A * (C * (F * (A + A)))))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 2.85e+104) {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
} else if (B_m <= 8.5e+286) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 4e-6) tmp = Float64(sqrt(Float64(-8.0 * Float64(A * Float64(C * Float64(F * Float64(A + A)))))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 2.85e+104) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); elseif (B_m <= 8.5e+286) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 4e-6], N[(N[Sqrt[N[(-8.0 * N[(A * N[(C * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 2.85e+104], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[B$95$m, 8.5e+286], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 4 \cdot 10^{-6}:\\
\;\;\;\;\frac{\sqrt{-8 \cdot \left(A \cdot \left(C \cdot \left(F \cdot \left(A + A\right)\right)\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 2.85 \cdot 10^{+104}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\mathbf{elif}\;B\_m \leq 8.5 \cdot 10^{+286}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 3.99999999999999982e-6Initial program 21.1%
Simplified27.4%
Taylor expanded in B around 0 17.1%
associate-*r*17.1%
Simplified17.1%
Taylor expanded in C around inf 13.4%
mul-1-neg13.4%
Simplified13.4%
if 3.99999999999999982e-6 < B < 2.84999999999999993e104Initial program 55.9%
Taylor expanded in C around 0 61.5%
mul-1-neg61.5%
+-commutative61.5%
unpow261.5%
unpow261.5%
hypot-define66.5%
Simplified66.5%
neg-sub066.5%
associate-*l/66.5%
pow1/266.5%
pow1/266.5%
pow-prod-down66.5%
Applied egg-rr66.5%
neg-sub066.5%
distribute-neg-frac266.5%
unpow1/266.5%
Simplified66.5%
if 2.84999999999999993e104 < B < 8.50000000000000081e286Initial program 6.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr61.0%
neg-sub061.0%
associate-/l*61.0%
Simplified61.0%
if 8.50000000000000081e286 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification24.5%
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
:precision binary64
(if (<= B_m 2e-13)
(/
(sqrt (* (* A 4.0) (* (* A -4.0) (* C F))))
(- (fma B_m B_m (* A (* C -4.0)))))
(if (<= B_m 6.8e+103)
(/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))
(if (<= B_m 1.06e+287)
(- (sqrt (* -2.0 (/ F B_m))))
(/ (sqrt (* F (* B_m -2.0))) (- B_m))))))B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (B_m <= 2e-13) {
tmp = sqrt(((A * 4.0) * ((A * -4.0) * (C * F)))) / -fma(B_m, B_m, (A * (C * -4.0)));
} else if (B_m <= 6.8e+103) {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
} else if (B_m <= 1.06e+287) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (B_m <= 2e-13) tmp = Float64(sqrt(Float64(Float64(A * 4.0) * Float64(Float64(A * -4.0) * Float64(C * F)))) / Float64(-fma(B_m, B_m, Float64(A * Float64(C * -4.0))))); elseif (B_m <= 6.8e+103) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); elseif (B_m <= 1.06e+287) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2e-13], N[(N[Sqrt[N[(N[(A * 4.0), $MachinePrecision] * N[(N[(A * -4.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 6.8e+103], N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[B$95$m, 1.06e+287], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2 \cdot 10^{-13}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot 4\right) \cdot \left(\left(A \cdot -4\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)}\\
\mathbf{elif}\;B\_m \leq 6.8 \cdot 10^{+103}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\mathbf{elif}\;B\_m \leq 1.06 \cdot 10^{+287}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if B < 2.0000000000000001e-13Initial program 21.1%
Simplified27.4%
Taylor expanded in B around 0 17.1%
associate-*r*17.1%
Simplified17.1%
Taylor expanded in A around -inf 12.3%
if 2.0000000000000001e-13 < B < 6.7999999999999997e103Initial program 55.9%
Taylor expanded in C around 0 61.5%
mul-1-neg61.5%
+-commutative61.5%
unpow261.5%
unpow261.5%
hypot-define66.5%
Simplified66.5%
neg-sub066.5%
associate-*l/66.5%
pow1/266.5%
pow1/266.5%
pow-prod-down66.5%
Applied egg-rr66.5%
neg-sub066.5%
distribute-neg-frac266.5%
unpow1/266.5%
Simplified66.5%
if 6.7999999999999997e103 < B < 1.06e287Initial program 6.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.0%
Simplified1.0%
Taylor expanded in F around 0 1.0%
Applied egg-rr61.0%
neg-sub061.0%
associate-/l*61.0%
Simplified61.0%
if 1.06e287 < B Initial program 0.0%
Taylor expanded in C around 0 2.4%
mul-1-neg2.4%
+-commutative2.4%
unpow22.4%
unpow22.4%
hypot-define50.8%
Simplified50.8%
neg-sub050.8%
associate-*l/50.8%
pow1/250.8%
pow1/250.8%
pow-prod-down51.6%
Applied egg-rr51.6%
neg-sub051.6%
distribute-neg-frac251.6%
unpow1/251.6%
Simplified51.6%
Taylor expanded in A around 0 51.6%
associate-*r*51.6%
Simplified51.6%
Final simplification23.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F -2.5e+31) (- (sqrt (* -2.0 (/ F B_m)))) (/ (sqrt (* 2.0 (* F (- A (hypot B_m A))))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -2.5e+31) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -2.5e+31) {
tmp = -Math.sqrt((-2.0 * (F / B_m)));
} else {
tmp = Math.sqrt((2.0 * (F * (A - Math.hypot(B_m, A))))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= -2.5e+31: tmp = -math.sqrt((-2.0 * (F / B_m))) else: tmp = math.sqrt((2.0 * (F * (A - math.hypot(B_m, A))))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= -2.5e+31) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A - hypot(B_m, A))))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= -2.5e+31)
tmp = -sqrt((-2.0 * (F / B_m)));
else
tmp = sqrt((2.0 * (F * (A - hypot(B_m, A))))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, -2.5e+31], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -2.5 \cdot 10^{+31}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -2.50000000000000013e31Initial program 18.3%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt0.9%
Simplified0.9%
Taylor expanded in F around 0 0.9%
Applied egg-rr21.3%
neg-sub021.3%
associate-/l*21.3%
Simplified21.3%
if -2.50000000000000013e31 < F Initial program 23.7%
Taylor expanded in C around 0 7.6%
mul-1-neg7.6%
+-commutative7.6%
unpow27.6%
unpow27.6%
hypot-define14.7%
Simplified14.7%
neg-sub014.7%
associate-*l/14.7%
pow1/214.7%
pow1/214.8%
pow-prod-down14.9%
Applied egg-rr14.9%
neg-sub014.9%
distribute-neg-frac214.9%
unpow1/214.7%
Simplified14.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F -28000000.0) (- (sqrt (* -2.0 (/ F B_m)))) (/ (sqrt (+ (* -2.0 (* B_m F)) (* 2.0 (* A F)))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -28000000.0) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= (-28000000.0d0)) then
tmp = -sqrt(((-2.0d0) * (f / b_m)))
else
tmp = sqrt((((-2.0d0) * (b_m * f)) + (2.0d0 * (a * f)))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -28000000.0) {
tmp = -Math.sqrt((-2.0 * (F / B_m)));
} else {
tmp = Math.sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= -28000000.0: tmp = -math.sqrt((-2.0 * (F / B_m))) else: tmp = math.sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= -28000000.0) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(Float64(-2.0 * Float64(B_m * F)) + Float64(2.0 * Float64(A * F)))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= -28000000.0)
tmp = -sqrt((-2.0 * (F / B_m)));
else
tmp = sqrt(((-2.0 * (B_m * F)) + (2.0 * (A * F)))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, -28000000.0], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(N[(-2.0 * N[(B$95$m * F), $MachinePrecision]), $MachinePrecision] + N[(2.0 * N[(A * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -28000000:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(B\_m \cdot F\right) + 2 \cdot \left(A \cdot F\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -2.8e7Initial program 19.2%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt0.9%
Simplified0.9%
Taylor expanded in F around 0 0.9%
Applied egg-rr20.2%
neg-sub020.2%
associate-/l*20.2%
Simplified20.2%
if -2.8e7 < F Initial program 23.2%
Taylor expanded in C around 0 7.9%
mul-1-neg7.9%
+-commutative7.9%
unpow27.9%
unpow27.9%
hypot-define15.2%
Simplified15.2%
neg-sub015.2%
associate-*l/15.2%
pow1/215.2%
pow1/215.3%
pow-prod-down15.3%
Applied egg-rr15.3%
neg-sub015.3%
distribute-neg-frac215.3%
unpow1/215.2%
Simplified15.2%
Taylor expanded in A around 0 12.7%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (if (<= F -5.2e+57) (- (sqrt (* -2.0 (/ F B_m)))) (/ (sqrt (* F (* B_m -2.0))) (- B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -5.2e+57) {
tmp = -sqrt((-2.0 * (F / B_m)));
} else {
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: tmp
if (f <= (-5.2d+57)) then
tmp = -sqrt(((-2.0d0) * (f / b_m)))
else
tmp = sqrt((f * (b_m * (-2.0d0)))) / -b_m
end if
code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
double tmp;
if (F <= -5.2e+57) {
tmp = -Math.sqrt((-2.0 * (F / B_m)));
} else {
tmp = Math.sqrt((F * (B_m * -2.0))) / -B_m;
}
return tmp;
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): tmp = 0 if F <= -5.2e+57: tmp = -math.sqrt((-2.0 * (F / B_m))) else: tmp = math.sqrt((F * (B_m * -2.0))) / -B_m return tmp
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) tmp = 0.0 if (F <= -5.2e+57) tmp = Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))); else tmp = Float64(sqrt(Float64(F * Float64(B_m * -2.0))) / Float64(-B_m)); end return tmp end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
tmp = 0.0;
if (F <= -5.2e+57)
tmp = -sqrt((-2.0 * (F / B_m)));
else
tmp = sqrt((F * (B_m * -2.0))) / -B_m;
end
tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := If[LessEqual[F, -5.2e+57], (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(B$95$m * -2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;F \leq -5.2 \cdot 10^{+57}:\\
\;\;\;\;-\sqrt{-2 \cdot \frac{F}{B\_m}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{F \cdot \left(B\_m \cdot -2\right)}}{-B\_m}\\
\end{array}
\end{array}
if F < -5.2e57Initial program 17.8%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt0.9%
Simplified0.9%
Taylor expanded in F around 0 0.9%
Applied egg-rr23.1%
neg-sub023.1%
associate-/l*23.1%
Simplified23.1%
if -5.2e57 < F Initial program 23.6%
Taylor expanded in C around 0 7.3%
mul-1-neg7.3%
+-commutative7.3%
unpow27.3%
unpow27.3%
hypot-define14.1%
Simplified14.1%
neg-sub014.1%
associate-*l/14.1%
pow1/214.1%
pow1/214.2%
pow-prod-down14.2%
Applied egg-rr14.2%
neg-sub014.2%
distribute-neg-frac214.2%
unpow1/214.1%
Simplified14.1%
Taylor expanded in A around 0 13.0%
associate-*r*13.0%
Simplified13.0%
Final simplification16.6%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (- (sqrt (* -2.0 (/ F B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return -sqrt((-2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = -sqrt(((-2.0d0) * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return -Math.sqrt((-2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return -math.sqrt((-2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return Float64(-sqrt(Float64(-2.0 * Float64(F / B_m)))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = -sqrt((-2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{-2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 21.6%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.9%
Simplified1.9%
Taylor expanded in F around 0 1.9%
Applied egg-rr14.0%
neg-sub014.0%
associate-/l*14.0%
Simplified14.0%
B_m = (fabs.f64 B) NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. (FPCore (A B_m C F) :precision binary64 (sqrt (* -2.0 (/ F B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
return sqrt((-2.0 * (F / B_m)));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b_m
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((-2.0d0) * (f / b_m)))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
return Math.sqrt((-2.0 * (F / B_m)));
}
B_m = math.fabs(B) [A, B_m, C, F] = sort([A, B_m, C, F]) def code(A, B_m, C, F): return math.sqrt((-2.0 * (F / B_m)))
B_m = abs(B) A, B_m, C, F = sort([A, B_m, C, F]) function code(A, B_m, C, F) return sqrt(Float64(-2.0 * Float64(F / B_m))) end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
tmp = sqrt((-2.0 * (F / B_m)));
end
B_m = N[Abs[B], $MachinePrecision] NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function. code[A_, B$95$m_, C_, F_] := N[Sqrt[N[(-2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\sqrt{-2 \cdot \frac{F}{B\_m}}
\end{array}
Initial program 21.6%
Taylor expanded in B around -inf 0.0%
mul-1-neg0.0%
unpow20.0%
rem-square-sqrt1.9%
Simplified1.9%
Taylor expanded in F around 0 1.9%
Applied egg-rr2.0%
+-lft-identity2.0%
associate-/l*2.0%
Simplified2.0%
herbie shell --seed 2024113
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))