
(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 13 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}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (* (* 4.0 A) C))
(t_1 (* 2.0 (* (- (pow B 2.0) t_0) F)))
(t_2 (- t_0 (pow B 2.0)))
(t_3
(/
(sqrt (* t_1 (- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_2)))
(if (<= t_3 (- INFINITY))
(/
(sqrt (* 2.0 (* F (+ A (fma (/ B C) (* B -0.5) A)))))
(- (sqrt (fma C (* A -4.0) (* B B)))))
(if (<= t_3 -5e-208)
(/
(*
(sqrt (* 2.0 (fma B B (* C (* A -4.0)))))
(sqrt (* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
t_2)
(/ (sqrt (* t_1 (+ A (fma (/ (* B B) C) -0.5 A)))) t_2)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (4.0 * A) * C;
double t_1 = 2.0 * ((pow(B, 2.0) - t_0) * F);
double t_2 = t_0 - pow(B, 2.0);
double t_3 = sqrt((t_1 * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt((2.0 * (F * (A + fma((B / C), (B * -0.5), A))))) / -sqrt(fma(C, (A * -4.0), (B * B)));
} else if (t_3 <= -5e-208) {
tmp = (sqrt((2.0 * fma(B, B, (C * (A * -4.0))))) * sqrt((F * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))))))) / t_2;
} else {
tmp = sqrt((t_1 * (A + fma(((B * B) / C), -0.5, A)))) / t_2;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(4.0 * A) * C) t_1 = Float64(2.0 * Float64(Float64((B ^ 2.0) - t_0) * F)) t_2 = Float64(t_0 - (B ^ 2.0)) t_3 = Float64(sqrt(Float64(t_1 * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A + fma(Float64(B / C), Float64(B * -0.5), A))))) / Float64(-sqrt(fma(C, Float64(A * -4.0), Float64(B * B))))); elseif (t_3 <= -5e-208) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(B, B, Float64(C * Float64(A * -4.0))))) * sqrt(Float64(F * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))))) / t_2); else tmp = Float64(sqrt(Float64(t_1 * Float64(A + fma(Float64(Float64(B * B) / C), -0.5, A)))) / t_2); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t$95$1 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[N[(2.0 * N[(F * N[(A + N[(N[(B / C), $MachinePrecision] * N[(B * -0.5), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -5e-208], N[(N[(N[Sqrt[N[(2.0 * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(t$95$1 * N[(A + N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := 2 \cdot \left(\left({B}^{2} - t\_0\right) \cdot F\right)\\
t_2 := t\_0 - {B}^{2}\\
t_3 := \frac{\sqrt{t\_1 \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A + \mathsf{fma}\left(\frac{B}{C}, B \cdot -0.5, A\right)\right)\right)}}{-\sqrt{\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-208}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)} \cdot \sqrt{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_1 \cdot \left(A + \mathsf{fma}\left(\frac{B \cdot B}{C}, -0.5, A\right)\right)}}{t\_2}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.0
Applied rewrites23.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites19.6%
Applied rewrites26.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999963e-208Initial program 97.3%
Applied rewrites98.3%
if -4.99999999999999963e-208 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.0%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.6
Applied rewrites15.6%
Final simplification29.7%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1
(/
(sqrt (* 2.0 (* F (+ A (fma (/ B C) (* B -0.5) A)))))
(- (sqrt t_0))))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B 2.0)))))
(if (<= t_3 -2e+141)
t_1
(if (<= t_3 -2e-157)
(*
(sqrt
(/
(* F (- (+ A C) (sqrt (fma B B (* (- A C) (- A C))))))
(fma (* A C) -4.0 (* B B))))
(- (sqrt 2.0)))
(if (<= t_3 0.0)
t_1
(/
(sqrt (* 2.0 (* (* F t_0) (fma B (* (/ B C) -0.5) (+ A A)))))
(* 4.0 (* A C))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = sqrt((2.0 * (F * (A + fma((B / C), (B * -0.5), A))))) / -sqrt(t_0);
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -2e+141) {
tmp = t_1;
} else if (t_3 <= -2e-157) {
tmp = sqrt(((F * ((A + C) - sqrt(fma(B, B, ((A - C) * (A - C)))))) / fma((A * C), -4.0, (B * B)))) * -sqrt(2.0);
} else if (t_3 <= 0.0) {
tmp = t_1;
} else {
tmp = sqrt((2.0 * ((F * t_0) * fma(B, ((B / C) * -0.5), (A + A))))) / (4.0 * (A * C));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A + fma(Float64(B / C), Float64(B * -0.5), A))))) / Float64(-sqrt(t_0))) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= -2e+141) tmp = t_1; elseif (t_3 <= -2e-157) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C)))))) / fma(Float64(A * C), -4.0, Float64(B * B)))) * Float64(-sqrt(2.0))); elseif (t_3 <= 0.0) tmp = t_1; else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * fma(B, Float64(Float64(B / C) * -0.5), Float64(A + A))))) / Float64(4.0 * Float64(A * C))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(2.0 * N[(F * N[(A + N[(N[(B / C), $MachinePrecision] * N[(B * -0.5), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[t$95$0], $MachinePrecision])), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+141], t$95$1, If[LessEqual[t$95$3, -2e-157], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 0.0], t$95$1, N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(B * N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \frac{\sqrt{2 \cdot \left(F \cdot \left(A + \mathsf{fma}\left(\frac{B}{C}, B \cdot -0.5, A\right)\right)\right)}}{-\sqrt{t\_0}}\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -2 \cdot 10^{+141}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-157}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 0:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_0\right) \cdot \mathsf{fma}\left(B, \frac{B}{C} \cdot -0.5, A + A\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000003e141 or -1.99999999999999989e-157 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 0.0Initial program 9.8%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6425.2
Applied rewrites25.2%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites21.0%
Applied rewrites25.8%
if -2.00000000000000003e141 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999989e-157Initial program 96.9%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites97.3%
if 0.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 9.1%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.2
Applied rewrites12.2%
Applied rewrites12.2%
Taylor expanded in C around inf
lower-*.f64N/A
*-commutativeN/A
lower-*.f6412.6
Applied rewrites12.6%
Final simplification27.4%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2 (- t_1 (pow B 2.0)))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_2)))
(if (<= t_3 (- INFINITY))
(/ (sqrt (* 2.0 (* F (+ A (fma (/ B C) (* B -0.5) A))))) (- (sqrt t_0)))
(if (<= t_3 -5e-208)
(/
(*
(sqrt (* 2.0 (fma B B (* C (* A -4.0)))))
(sqrt (* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
t_2)
(/
(sqrt (* 2.0 (* (* F t_0) (fma B (* (/ B C) -0.5) (+ A A)))))
(- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = t_1 - pow(B, 2.0);
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_2;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = sqrt((2.0 * (F * (A + fma((B / C), (B * -0.5), A))))) / -sqrt(t_0);
} else if (t_3 <= -5e-208) {
tmp = (sqrt((2.0 * fma(B, B, (C * (A * -4.0))))) * sqrt((F * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))))))) / t_2;
} else {
tmp = sqrt((2.0 * ((F * t_0) * fma(B, ((B / C) * -0.5), (A + A))))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(t_1 - (B ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_2) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A + fma(Float64(B / C), Float64(B * -0.5), A))))) / Float64(-sqrt(t_0))); elseif (t_3 <= -5e-208) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(B, B, Float64(C * Float64(A * -4.0))))) * sqrt(Float64(F * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))))) / t_2); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * fma(B, Float64(Float64(B / C) * -0.5), Float64(A + A))))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[Sqrt[N[(2.0 * N[(F * N[(A + N[(N[(B / C), $MachinePrecision] * N[(B * -0.5), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[t$95$0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -5e-208], N[(N[(N[Sqrt[N[(2.0 * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(B * N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := t\_1 - {B}^{2}\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A + \mathsf{fma}\left(\frac{B}{C}, B \cdot -0.5, A\right)\right)\right)}}{-\sqrt{t\_0}}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-208}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)} \cdot \sqrt{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_0\right) \cdot \mathsf{fma}\left(B, \frac{B}{C} \cdot -0.5, A + A\right)\right)}}{-t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.2%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.0
Applied rewrites23.0%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites19.6%
Applied rewrites26.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999963e-208Initial program 97.3%
Applied rewrites98.3%
if -4.99999999999999963e-208 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.0%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.6
Applied rewrites15.6%
Applied rewrites15.6%
Final simplification29.7%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -2e+230)
(/ (sqrt (* 2.0 (* F (+ A (fma (/ B C) (* B -0.5) A))))) (- (sqrt t_0)))
(if (<= t_2 -5e-208)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (fma B B (* C (* A -4.0))) (* 2.0 F))))
(fma B (- B) (* A (* 4.0 C))))
(/
(sqrt (* 2.0 (* (* F t_0) (fma B (* (/ B C) -0.5) (+ A A)))))
(- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -2e+230) {
tmp = sqrt((2.0 * (F * (A + fma((B / C), (B * -0.5), A))))) / -sqrt(t_0);
} else if (t_2 <= -5e-208) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * (fma(B, B, (C * (A * -4.0))) * (2.0 * F)))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = sqrt((2.0 * ((F * t_0) * fma(B, ((B / C) * -0.5), (A + A))))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -2e+230) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A + fma(Float64(B / C), Float64(B * -0.5), A))))) / Float64(-sqrt(t_0))); elseif (t_2 <= -5e-208) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(fma(B, B, Float64(C * Float64(A * -4.0))) * Float64(2.0 * F)))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * fma(B, Float64(Float64(B / C) * -0.5), Float64(A + A))))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+230], N[(N[Sqrt[N[(2.0 * N[(F * N[(A + N[(N[(B / C), $MachinePrecision] * N[(B * -0.5), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[t$95$0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -5e-208], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(B * N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+230}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A + \mathsf{fma}\left(\frac{B}{C}, B \cdot -0.5, A\right)\right)\right)}}{-\sqrt{t\_0}}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-208}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right) \cdot \left(2 \cdot F\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_0\right) \cdot \mathsf{fma}\left(B, \frac{B}{C} \cdot -0.5, A + A\right)\right)}}{-t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.0000000000000002e230Initial program 5.1%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6422.6
Applied rewrites22.6%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites19.2%
Applied rewrites25.9%
if -2.0000000000000002e230 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999963e-208Initial program 97.2%
Applied rewrites97.2%
if -4.99999999999999963e-208 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.0%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.6
Applied rewrites15.6%
Applied rewrites15.6%
Final simplification29.1%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma C (* A -4.0) (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -2e+141)
(/ (sqrt (* 2.0 (* F (+ A (fma (/ B C) (* B -0.5) A))))) (- (sqrt t_0)))
(if (<= t_2 -2e-157)
(*
(sqrt
(/
(* F (- (+ A C) (sqrt (fma B B (* (- A C) (- A C))))))
(fma (* A C) -4.0 (* B B))))
(- (sqrt 2.0)))
(/
(sqrt (* 2.0 (* (* F t_0) (fma B (* (/ B C) -0.5) (+ A A)))))
(- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(C, (A * -4.0), (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -2e+141) {
tmp = sqrt((2.0 * (F * (A + fma((B / C), (B * -0.5), A))))) / -sqrt(t_0);
} else if (t_2 <= -2e-157) {
tmp = sqrt(((F * ((A + C) - sqrt(fma(B, B, ((A - C) * (A - C)))))) / fma((A * C), -4.0, (B * B)))) * -sqrt(2.0);
} else {
tmp = sqrt((2.0 * ((F * t_0) * fma(B, ((B / C) * -0.5), (A + A))))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(C, Float64(A * -4.0), Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -2e+141) tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(A + fma(Float64(B / C), Float64(B * -0.5), A))))) / Float64(-sqrt(t_0))); elseif (t_2 <= -2e-157) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C)))))) / fma(Float64(A * C), -4.0, Float64(B * B)))) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(2.0 * Float64(Float64(F * t_0) * fma(B, Float64(Float64(B / C) * -0.5), Float64(A + A))))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+141], N[(N[Sqrt[N[(2.0 * N[(F * N[(A + N[(N[(B / C), $MachinePrecision] * N[(B * -0.5), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[t$95$0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, -2e-157], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * N[(N[(F * t$95$0), $MachinePrecision] * N[(B * N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+141}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(A + \mathsf{fma}\left(\frac{B}{C}, B \cdot -0.5, A\right)\right)\right)}}{-\sqrt{t\_0}}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-157}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right)}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \left(\left(F \cdot t\_0\right) \cdot \mathsf{fma}\left(B, \frac{B}{C} \cdot -0.5, A + A\right)\right)}}{-t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000003e141Initial program 8.7%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6423.7
Applied rewrites23.7%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites20.5%
Applied rewrites26.9%
if -2.00000000000000003e141 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.99999999999999989e-157Initial program 96.9%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites97.3%
if -1.99999999999999989e-157 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 9.6%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6415.3
Applied rewrites15.3%
Applied rewrites15.3%
Final simplification27.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= (pow B 2.0) 1e-196)
(/ (sqrt (* -16.0 (* (* A A) (* C F)))) (- (fma C (* A -4.0) (* B B))))
(if (<= (pow B 2.0) 1e+290)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* (sqrt (* A F)) (/ (- 2.0) B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (pow(B, 2.0) <= 1e-196) {
tmp = sqrt((-16.0 * ((A * A) * (C * F)))) / -fma(C, (A * -4.0), (B * B));
} else if (pow(B, 2.0) <= 1e+290) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if ((B ^ 2.0) <= 1e-196) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F)))) / Float64(-fma(C, Float64(A * -4.0), Float64(B * B)))); elseif ((B ^ 2.0) <= 1e+290) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(sqrt(Float64(A * F)) * Float64(Float64(-2.0) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-196], N[(N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e+290], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 10^{-196}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}\\
\mathbf{elif}\;{B}^{2} \leq 10^{+290}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-196Initial program 23.7%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.0
Applied rewrites26.0%
Applied rewrites26.0%
Taylor expanded in C around inf
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.2
Applied rewrites16.2%
if 1e-196 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e290Initial program 30.2%
Applied rewrites30.2%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites20.0%
if 1.00000000000000006e290 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f640.0
Applied rewrites0.0%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-/.f644.5
Applied rewrites4.5%
Final simplification14.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= (pow B 2.0) 1e-196)
(/ (sqrt (* -16.0 (* (* A A) (* C F)))) (- (fma C (* A -4.0) (* B B))))
(if (<= (pow B 2.0) 2e+289)
(/ (* B (sqrt (* -2.0 (* B F)))) (- (* 4.0 (* A C)) (* B B)))
(* (sqrt (* A F)) (/ (- 2.0) B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (pow(B, 2.0) <= 1e-196) {
tmp = sqrt((-16.0 * ((A * A) * (C * F)))) / -fma(C, (A * -4.0), (B * B));
} else if (pow(B, 2.0) <= 2e+289) {
tmp = (B * sqrt((-2.0 * (B * F)))) / ((4.0 * (A * C)) - (B * B));
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if ((B ^ 2.0) <= 1e-196) tmp = Float64(sqrt(Float64(-16.0 * Float64(Float64(A * A) * Float64(C * F)))) / Float64(-fma(C, Float64(A * -4.0), Float64(B * B)))); elseif ((B ^ 2.0) <= 2e+289) tmp = Float64(Float64(B * sqrt(Float64(-2.0 * Float64(B * F)))) / Float64(Float64(4.0 * Float64(A * C)) - Float64(B * B))); else tmp = Float64(sqrt(Float64(A * F)) * Float64(Float64(-2.0) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-196], N[(N[Sqrt[N[(-16.0 * N[(N[(A * A), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e+289], N[(N[(B * N[Sqrt[N[(-2.0 * N[(B * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] - N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 10^{-196}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(\left(A \cdot A\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, B \cdot B\right)}\\
\mathbf{elif}\;{B}^{2} \leq 2 \cdot 10^{+289}:\\
\;\;\;\;\frac{B \cdot \sqrt{-2 \cdot \left(B \cdot F\right)}}{4 \cdot \left(A \cdot C\right) - B \cdot B}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1e-196Initial program 23.7%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6426.0
Applied rewrites26.0%
Applied rewrites26.0%
Taylor expanded in C around inf
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.2
Applied rewrites16.2%
if 1e-196 < (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e289Initial program 29.5%
Applied rewrites29.5%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f647.8
Applied rewrites7.8%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6410.7
Applied rewrites10.7%
Applied rewrites18.0%
if 2.0000000000000001e289 < (pow.f64 B #s(literal 2 binary64)) Initial program 1.5%
Applied rewrites1.5%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f640.5
Applied rewrites0.5%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-/.f644.9
Applied rewrites4.9%
Final simplification13.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma B B (* C (* A -4.0)))))
(if (<= B 7e-16)
(* (sqrt (* (* t_0 (* 2.0 F)) (* 2.0 A))) (/ -1.0 t_0))
(if (<= B 6.5e+152)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* (sqrt (* A F)) (/ (- 2.0) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (C * (A * -4.0)));
double tmp;
if (B <= 7e-16) {
tmp = sqrt(((t_0 * (2.0 * F)) * (2.0 * A))) * (-1.0 / t_0);
} else if (B <= 6.5e+152) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(C * Float64(A * -4.0))) tmp = 0.0 if (B <= 7e-16) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(2.0 * F)) * Float64(2.0 * A))) * Float64(-1.0 / t_0)); elseif (B <= 6.5e+152) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(sqrt(Float64(A * F)) * Float64(Float64(-2.0) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 7e-16], N[(N[Sqrt[N[(N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 6.5e+152], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\\
\mathbf{if}\;B \leq 7 \cdot 10^{-16}:\\
\;\;\;\;\sqrt{\left(t\_0 \cdot \left(2 \cdot F\right)\right) \cdot \left(2 \cdot A\right)} \cdot \frac{-1}{t\_0}\\
\mathbf{elif}\;B \leq 6.5 \cdot 10^{+152}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if B < 7.00000000000000035e-16Initial program 21.1%
Applied rewrites21.0%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f6412.0
Applied rewrites12.0%
Taylor expanded in A around inf
lower-*.f6418.3
Applied rewrites18.3%
if 7.00000000000000035e-16 < B < 6.4999999999999997e152Initial program 34.9%
Applied rewrites35.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites50.2%
if 6.4999999999999997e152 < B Initial program 0.1%
Applied rewrites0.1%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f640.1
Applied rewrites0.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-/.f646.1
Applied rewrites6.1%
Final simplification20.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B 7e-16)
(*
(/ -1.0 (fma B B (* C (* A -4.0))))
(sqrt (* (* A -8.0) (* (* C F) (+ A A)))))
(if (<= B 6.5e+152)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* (sqrt (* A F)) (/ (- 2.0) B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 7e-16) {
tmp = (-1.0 / fma(B, B, (C * (A * -4.0)))) * sqrt(((A * -8.0) * ((C * F) * (A + A))));
} else if (B <= 6.5e+152) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = sqrt((A * F)) * (-2.0 / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if (B <= 7e-16) tmp = Float64(Float64(-1.0 / fma(B, B, Float64(C * Float64(A * -4.0)))) * sqrt(Float64(Float64(A * -8.0) * Float64(Float64(C * F) * Float64(A + A))))); elseif (B <= 6.5e+152) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(sqrt(Float64(A * F)) * Float64(Float64(-2.0) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, 7e-16], N[(N[(-1.0 / N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(N[(C * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 6.5e+152], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 7 \cdot 10^{-16}:\\
\;\;\;\;\frac{-1}{\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)} \cdot \sqrt{\left(A \cdot -8\right) \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)}\\
\mathbf{elif}\;B \leq 6.5 \cdot 10^{+152}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\end{array}
\end{array}
if B < 7.00000000000000035e-16Initial program 21.1%
Applied rewrites21.0%
Taylor expanded in C around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6414.8
Applied rewrites14.8%
if 7.00000000000000035e-16 < B < 6.4999999999999997e152Initial program 34.9%
Applied rewrites35.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites50.2%
if 6.4999999999999997e152 < B Initial program 0.1%
Applied rewrites0.1%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f640.1
Applied rewrites0.1%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-/.f646.1
Applied rewrites6.1%
Final simplification18.2%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (if (<= A -6.8e+64) (* (sqrt (* A F)) (/ (- 2.0) B)) (/ (* B (sqrt (* -2.0 (* B F)))) (- (* 4.0 (* A C)) (* B B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (A <= -6.8e+64) {
tmp = sqrt((A * F)) * (-2.0 / B);
} else {
tmp = (B * sqrt((-2.0 * (B * F)))) / ((4.0 * (A * C)) - (B * B));
}
return tmp;
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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) :: tmp
if (a <= (-6.8d+64)) then
tmp = sqrt((a * f)) * (-2.0d0 / b)
else
tmp = (b * sqrt(((-2.0d0) * (b * f)))) / ((4.0d0 * (a * c)) - (b * b))
end if
code = tmp
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
double tmp;
if (A <= -6.8e+64) {
tmp = Math.sqrt((A * F)) * (-2.0 / B);
} else {
tmp = (B * Math.sqrt((-2.0 * (B * F)))) / ((4.0 * (A * C)) - (B * B));
}
return tmp;
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): tmp = 0 if A <= -6.8e+64: tmp = math.sqrt((A * F)) * (-2.0 / B) else: tmp = (B * math.sqrt((-2.0 * (B * F)))) / ((4.0 * (A * C)) - (B * B)) return tmp
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if (A <= -6.8e+64) tmp = Float64(sqrt(Float64(A * F)) * Float64(Float64(-2.0) / B)); else tmp = Float64(Float64(B * sqrt(Float64(-2.0 * Float64(B * F)))) / Float64(Float64(4.0 * Float64(A * C)) - Float64(B * B))); end return tmp end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp_2 = code(A, B, C, F)
tmp = 0.0;
if (A <= -6.8e+64)
tmp = sqrt((A * F)) * (-2.0 / B);
else
tmp = (B * sqrt((-2.0 * (B * F)))) / ((4.0 * (A * C)) - (B * B));
end
tmp_2 = tmp;
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[A, -6.8e+64], N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision], N[(N[(B * N[Sqrt[N[(-2.0 * N[(B * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision] - N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;A \leq -6.8 \cdot 10^{+64}:\\
\;\;\;\;\sqrt{A \cdot F} \cdot \frac{-2}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{B \cdot \sqrt{-2 \cdot \left(B \cdot F\right)}}{4 \cdot \left(A \cdot C\right) - B \cdot B}\\
\end{array}
\end{array}
if A < -6.8000000000000003e64Initial program 18.8%
Applied rewrites18.8%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f6434.8
Applied rewrites34.8%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-/.f646.2
Applied rewrites6.2%
if -6.8000000000000003e64 < A Initial program 20.3%
Applied rewrites20.2%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f646.3
Applied rewrites6.3%
Applied rewrites9.9%
Final simplification9.2%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* (sqrt (* A F)) (/ (- 2.0) B)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((A * F)) * (-2.0 / B);
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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
code = sqrt((a * f)) * (-2.0d0 / b)
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((A * F)) * (-2.0 / B);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((A * F)) * (-2.0 / B)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(A * F)) * Float64(Float64(-2.0) / B)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((A * F)) * (-2.0 / B);
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{A \cdot F} \cdot \frac{-2}{B}
\end{array}
Initial program 20.0%
Applied rewrites20.0%
Taylor expanded in A around -inf
mul-1-negN/A
lower-neg.f6410.5
Applied rewrites10.5%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-/.f642.7
Applied rewrites2.7%
Final simplification2.7%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (sqrt (/ 2.0 (/ B F))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((2.0 / (B / F)));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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
code = sqrt((2.0d0 / (b / f)))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((2.0 / (B / F)));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((2.0 / (B / F)))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(2.0 / Float64(B / F))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((2.0 / (B / F)));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[Sqrt[N[(2.0 / N[(B / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{\frac{2}{\frac{B}{F}}}
\end{array}
Initial program 20.0%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lift-*.f64N/A
mul-1-negN/A
remove-double-negN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f641.8
Applied rewrites1.8%
lift-/.f64N/A
*-commutativeN/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f641.9
Applied rewrites1.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (sqrt (* F (/ 2.0 B))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((F * (2.0 / B)));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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
code = sqrt((f * (2.0d0 / b)))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((F * (2.0 / B)));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((F * (2.0 / B)))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(F * Float64(2.0 / B))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((F * (2.0 / B)));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[Sqrt[N[(F * N[(2.0 / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{F \cdot \frac{2}{B}}
\end{array}
Initial program 20.0%
Taylor expanded in B around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
lift-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lift-*.f64N/A
mul-1-negN/A
remove-double-negN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f641.8
Applied rewrites1.8%
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f641.8
Applied rewrites1.8%
herbie shell --seed 2024216
(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))))