
(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 23 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 (fma B B (* -4.0 (* A C))))
(t_1 (/ (* B B) C))
(t_2 (* (* 4.0 A) C))
(t_3 (- t_2 (pow B 2.0)))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/
-1.0
(/ t_0 (* (sqrt t_0) (sqrt (* (* 2.0 F) (+ A (fma -0.5 t_1 A)))))))
(if (<= t_4 -4e-214)
(/
(*
(sqrt (* 2.0 (fma B B (* C (* A -4.0)))))
(sqrt (* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
t_3)
(/
(sqrt (* (* 2.0 t_0) (* F (+ A (+ A (/ (* -0.5 (* B B)) C))))))
(- (* C (fma -4.0 A t_1))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double t_1 = (B * B) / C;
double t_2 = (4.0 * A) * C;
double t_3 = t_2 - pow(B, 2.0);
double t_4 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = -1.0 / (t_0 / (sqrt(t_0) * sqrt(((2.0 * F) * (A + fma(-0.5, t_1, A))))));
} else if (t_4 <= -4e-214) {
tmp = (sqrt((2.0 * fma(B, B, (C * (A * -4.0))))) * sqrt((F * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))))))) / t_3;
} else {
tmp = sqrt(((2.0 * t_0) * (F * (A + (A + ((-0.5 * (B * B)) / C)))))) / -(C * fma(-4.0, A, t_1));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_1 = Float64(Float64(B * B) / C) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(t_2 - (B ^ 2.0)) t_4 = 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)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(t_0) * sqrt(Float64(Float64(2.0 * F) * Float64(A + fma(-0.5, t_1, A))))))); elseif (t_4 <= -4e-214) 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_3); else tmp = Float64(sqrt(Float64(Float64(2.0 * t_0) * Float64(F * Float64(A + Float64(A + Float64(Float64(-0.5 * Float64(B * B)) / C)))))) / Float64(-Float64(C * fma(-4.0, A, t_1)))); 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = 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] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + N[(-0.5 * t$95$1 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -4e-214], 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$3), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(F * N[(A + N[(A + N[(N[(-0.5 * N[(B * B), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(-4.0 * A + t$95$1), $MachinePrecision]), $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, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \frac{B \cdot B}{C}\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := t\_2 - {B}^{2}\\
t_4 := \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\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + \mathsf{fma}\left(-0.5, t\_1, A\right)\right)}}}\\
\mathbf{elif}\;t\_4 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\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\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot t\_0\right) \cdot \left(F \cdot \left(A + \left(A + \frac{-0.5 \cdot \left(B \cdot B\right)}{C}\right)\right)\right)}}{-C \cdot \mathsf{fma}\left(-4, A, t\_1\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))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
Taylor expanded in C around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6438.0
Applied rewrites38.0%
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))) < -3.99999999999999965e-214Initial program 96.0%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites97.6%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6414.6
Applied rewrites14.6%
Taylor expanded in C around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.6
Applied rewrites14.6%
Final simplification35.5%
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 (* -4.0 (* A C))))
(t_1 (/ (* B B) C))
(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 (- INFINITY))
(/
-1.0
(/ t_0 (* (sqrt t_0) (sqrt (* (* 2.0 F) (+ A (fma -0.5 t_1 A)))))))
(if (<= t_3 -4e-214)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (* 2.0 F) (fma B B (* C (* A -4.0))))))
(fma B (- B) (* A (* 4.0 C))))
(/
(sqrt (* (* 2.0 t_0) (* F (+ A (+ A (/ (* -0.5 (* B B)) C))))))
(- (* C (fma -4.0 A t_1))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double t_1 = (B * B) / C;
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 <= -((double) INFINITY)) {
tmp = -1.0 / (t_0 / (sqrt(t_0) * sqrt(((2.0 * F) * (A + fma(-0.5, t_1, A))))));
} else if (t_3 <= -4e-214) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * ((2.0 * F) * fma(B, B, (C * (A * -4.0)))))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = sqrt(((2.0 * t_0) * (F * (A + (A + ((-0.5 * (B * B)) / C)))))) / -(C * fma(-4.0, A, t_1));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_1 = Float64(Float64(B * B) / C) 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 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(t_0) * sqrt(Float64(Float64(2.0 * F) * Float64(A + fma(-0.5, t_1, A))))))); elseif (t_3 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(Float64(2.0 * F) * fma(B, B, Float64(C * Float64(A * -4.0)))))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(sqrt(Float64(Float64(2.0 * t_0) * Float64(F * Float64(A + Float64(A + Float64(Float64(-0.5 * Float64(B * B)) / C)))))) / Float64(-Float64(C * fma(-4.0, A, t_1)))); 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] / C), $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, (-Infinity)], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + N[(-0.5 * t$95$1 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -4e-214], 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[(2.0 * F), $MachinePrecision] * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(F * N[(A + N[(A + N[(N[(-0.5 * N[(B * B), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(-4.0 * A + t$95$1), $MachinePrecision]), $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, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \frac{B \cdot B}{C}\\
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 -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + \mathsf{fma}\left(-0.5, t\_1, A\right)\right)}}}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\left(2 \cdot F\right) \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot t\_0\right) \cdot \left(F \cdot \left(A + \left(A + \frac{-0.5 \cdot \left(B \cdot B\right)}{C}\right)\right)\right)}}{-C \cdot \mathsf{fma}\left(-4, A, t\_1\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))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
Taylor expanded in C around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6438.0
Applied rewrites38.0%
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))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites96.1%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6414.6
Applied rewrites14.6%
Taylor expanded in C around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.6
Applied rewrites14.6%
Final simplification35.2%
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 (* -4.0 (* A C))))
(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 (- INFINITY))
(/ -1.0 (/ t_0 (* (sqrt t_0) (sqrt (* (* 2.0 F) (+ A A))))))
(if (<= t_2 -4e-214)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (* 2.0 F) (fma B B (* C (* A -4.0))))))
(fma B (- B) (* A (* 4.0 C))))
(/
(sqrt (* (* 2.0 t_0) (* F (+ A (+ A (/ (* -0.5 (* B B)) C))))))
(- (* C (fma -4.0 A (/ (* B B) C)))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
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 <= -((double) INFINITY)) {
tmp = -1.0 / (t_0 / (sqrt(t_0) * sqrt(((2.0 * F) * (A + A)))));
} else if (t_2 <= -4e-214) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * ((2.0 * F) * fma(B, B, (C * (A * -4.0)))))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = sqrt(((2.0 * t_0) * (F * (A + (A + ((-0.5 * (B * B)) / C)))))) / -(C * fma(-4.0, A, ((B * B) / C)));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) 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 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(t_0) * sqrt(Float64(Float64(2.0 * F) * Float64(A + A)))))); elseif (t_2 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(Float64(2.0 * F) * fma(B, B, Float64(C * Float64(A * -4.0)))))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(sqrt(Float64(Float64(2.0 * t_0) * Float64(F * Float64(A + Float64(A + Float64(Float64(-0.5 * Float64(B * B)) / C)))))) / Float64(-Float64(C * fma(-4.0, A, Float64(Float64(B * B) / 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[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $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, (-Infinity)], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-214], 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[(2.0 * F), $MachinePrecision] * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(F * N[(A + N[(A + N[(N[(-0.5 * N[(B * B), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(-4.0 * A + N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $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, -4 \cdot \left(A \cdot C\right)\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 -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\left(2 \cdot F\right) \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot t\_0\right) \cdot \left(F \cdot \left(A + \left(A + \frac{-0.5 \cdot \left(B \cdot B\right)}{C}\right)\right)\right)}}{-C \cdot \mathsf{fma}\left(-4, A, \frac{B \cdot B}{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))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
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))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites96.1%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6414.6
Applied rewrites14.6%
Taylor expanded in C around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.6
Applied rewrites14.6%
Final simplification33.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 B B (* -4.0 (* A C))))
(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 (- INFINITY))
(/ -1.0 (/ t_0 (* (sqrt t_0) (sqrt (* (* 2.0 F) (+ A A))))))
(if (<= t_2 -4e-214)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (* 2.0 F) (fma B B (* C (* A -4.0))))))
(fma B (- B) (* A (* 4.0 C))))
(/
-1.0
(/
t_0
(sqrt (* (* F t_0) (* 2.0 (+ A (+ A (/ (* -0.5 (* B B)) C))))))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
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 <= -((double) INFINITY)) {
tmp = -1.0 / (t_0 / (sqrt(t_0) * sqrt(((2.0 * F) * (A + A)))));
} else if (t_2 <= -4e-214) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * ((2.0 * F) * fma(B, B, (C * (A * -4.0)))))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = -1.0 / (t_0 / sqrt(((F * t_0) * (2.0 * (A + (A + ((-0.5 * (B * B)) / C)))))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) 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 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(t_0) * sqrt(Float64(Float64(2.0 * F) * Float64(A + A)))))); elseif (t_2 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(Float64(2.0 * F) * fma(B, B, Float64(C * Float64(A * -4.0)))))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(-1.0 / Float64(t_0 / sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + Float64(A + Float64(Float64(-0.5 * Float64(B * B)) / 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[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $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, (-Infinity)], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-214], 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[(2.0 * F), $MachinePrecision] * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 / N[(t$95$0 / N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(N[(-0.5 * N[(B * B), $MachinePrecision]), $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $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, -4 \cdot \left(A \cdot C\right)\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 -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\left(2 \cdot F\right) \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \left(A + \frac{-0.5 \cdot \left(B \cdot B\right)}{C}\right)\right)\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))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
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))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites96.1%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
Applied rewrites12.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6414.0
Applied rewrites14.0%
Final simplification32.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 B B (* -4.0 (* A C))))
(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 (- INFINITY))
(/ -1.0 (/ t_0 (* (sqrt t_0) (sqrt (* (* 2.0 F) (+ A A))))))
(if (<= t_2 -4e-214)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (* 2.0 F) (fma B B (* C (* A -4.0))))))
(fma B (- B) (* A (* 4.0 C))))
(/
(sqrt (* (* F t_0) (* 2.0 (+ A (fma -0.5 (/ (* B B) C) A)))))
(- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
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 <= -((double) INFINITY)) {
tmp = -1.0 / (t_0 / (sqrt(t_0) * sqrt(((2.0 * F) * (A + A)))));
} else if (t_2 <= -4e-214) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * ((2.0 * F) * fma(B, B, (C * (A * -4.0)))))) / fma(B, -B, (A * (4.0 * C)));
} else {
tmp = sqrt(((F * t_0) * (2.0 * (A + fma(-0.5, ((B * B) / C), A))))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) 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 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(t_0) * sqrt(Float64(Float64(2.0 * F) * Float64(A + A)))))); elseif (t_2 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(Float64(2.0 * F) * fma(B, B, Float64(C * Float64(A * -4.0)))))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); else tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), 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[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $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, (-Infinity)], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-214], 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[(2.0 * F), $MachinePrecision] * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + 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(B, B, -4 \cdot \left(A \cdot C\right)\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 -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\left(2 \cdot F\right) \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\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 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
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))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites96.1%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites12.7%
Taylor expanded in C around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6414.0
Applied rewrites14.0%
Final simplification32.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 (* (* 4.0 A) C))
(t_1
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_0) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B 2.0))))
(t_2 (fma B B (* -4.0 (* A C))))
(t_3 (- t_2))
(t_4 (* F t_2)))
(if (<= t_1 (- INFINITY))
(/ -1.0 (/ t_2 (* (sqrt t_2) (sqrt (* (* 2.0 F) (+ A A))))))
(if (<= t_1 -4e-214)
(/ (sqrt (* t_4 (* 2.0 (- A (sqrt (fma A A (* B B))))))) t_3)
(/ (sqrt (* t_4 (* 2.0 (+ A (fma -0.5 (/ (* B B) C) A))))) t_3)))))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 = sqrt(((2.0 * ((pow(B, 2.0) - t_0) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B, 2.0));
double t_2 = fma(B, B, (-4.0 * (A * C)));
double t_3 = -t_2;
double t_4 = F * t_2;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = -1.0 / (t_2 / (sqrt(t_2) * sqrt(((2.0 * F) * (A + A)))));
} else if (t_1 <= -4e-214) {
tmp = sqrt((t_4 * (2.0 * (A - sqrt(fma(A, A, (B * B))))))) / t_3;
} else {
tmp = sqrt((t_4 * (2.0 * (A + fma(-0.5, ((B * B) / C), A))))) / t_3;
}
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(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B ^ 2.0))) t_2 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_3 = Float64(-t_2) t_4 = Float64(F * t_2) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_2 / Float64(sqrt(t_2) * sqrt(Float64(Float64(2.0 * F) * Float64(A + A)))))); elseif (t_1 <= -4e-214) tmp = Float64(sqrt(Float64(t_4 * Float64(2.0 * Float64(A - sqrt(fma(A, A, Float64(B * B))))))) / t_3); else tmp = Float64(sqrt(Float64(t_4 * Float64(2.0 * Float64(A + fma(-0.5, Float64(Float64(B * B) / C), A))))) / t_3); 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[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $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$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$2)}, Block[{t$95$4 = N[(F * t$95$2), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(-1.0 / N[(t$95$2 / N[(N[Sqrt[t$95$2], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e-214], N[(N[Sqrt[N[(t$95$4 * N[(2.0 * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(t$95$4 * N[(2.0 * N[(A + N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $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 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B}^{2}}\\
t_2 := \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)\\
t_3 := -t\_2\\
t_4 := F \cdot t\_2\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_2}{\sqrt{t\_2} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{t\_4 \cdot \left(2 \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{t\_4 \cdot \left(2 \cdot \left(A + \mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right)\right)\right)}}{t\_3}\\
\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 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
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))) < -3.99999999999999965e-214Initial program 96.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6438.0
Applied rewrites38.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites38.0%
Taylor expanded in C around 0
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6476.0
Applied rewrites76.0%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites12.7%
Taylor expanded in C around inf
lower--.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6414.0
Applied rewrites14.0%
Final simplification28.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 (* -4.0 (* A C)))
(t_1 (fma B B 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 (- INFINITY))
(/ -1.0 (/ t_1 (* (sqrt t_1) (sqrt (* (* 2.0 F) (+ A A))))))
(if (<= t_3 -4e-214)
(/ (sqrt (* (* F t_1) (* 2.0 (- A (sqrt (fma A A (* B B))))))) (- t_1))
(- (/ (sqrt (* (* 2.0 t_1) (* F (+ A A)))) t_0))))))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 = fma(B, B, 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 <= -((double) INFINITY)) {
tmp = -1.0 / (t_1 / (sqrt(t_1) * sqrt(((2.0 * F) * (A + A)))));
} else if (t_3 <= -4e-214) {
tmp = sqrt(((F * t_1) * (2.0 * (A - sqrt(fma(A, A, (B * B))))))) / -t_1;
} else {
tmp = -(sqrt(((2.0 * t_1) * (F * (A + A)))) / t_0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = fma(B, B, 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 <= Float64(-Inf)) tmp = Float64(-1.0 / Float64(t_1 / Float64(sqrt(t_1) * sqrt(Float64(Float64(2.0 * F) * Float64(A + A)))))); elseif (t_3 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(F * t_1) * Float64(2.0 * Float64(A - sqrt(fma(A, A, Float64(B * B))))))) / Float64(-t_1)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * t_1) * Float64(F * Float64(A + A)))) / 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B * B + t$95$0), $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, (-Infinity)], N[(-1.0 / N[(t$95$1 / N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -4e-214], N[(N[Sqrt[N[(N[(F * t$95$1), $MachinePrecision] * N[(2.0 * N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], (-N[(N[Sqrt[N[(N[(2.0 * t$95$1), $MachinePrecision] * N[(F * N[(A + A), $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 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \mathsf{fma}\left(B, B, t\_0\right)\\
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 -\infty:\\
\;\;\;\;\frac{-1}{\frac{t\_1}{\sqrt{t\_1} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)}}}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_1\right) \cdot \left(2 \cdot \left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right)\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot t\_1\right) \cdot \left(F \cdot \left(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 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites14.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites25.8%
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))) < -3.99999999999999965e-214Initial program 96.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6438.0
Applied rewrites38.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites38.0%
Taylor expanded in C around 0
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6476.0
Applied rewrites76.0%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6413.6
Applied rewrites13.6%
Final simplification28.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 B B (* -4.0 (* A C))))
(t_1 (* (* 2.0 F) (+ A A)))
(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 -5e+168)
(/ -1.0 (/ t_0 (* (sqrt t_0) (sqrt t_1))))
(if (<= t_3 -2e-153)
(*
(sqrt
(/
(* F (- (+ A C) (sqrt (fma B B (* (- A C) (- A C))))))
(fma (* A C) -4.0 (* B B))))
(- (sqrt 2.0)))
(* (/ -1.0 t_0) (sqrt (* t_0 t_1)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double t_1 = (2.0 * F) * (A + A);
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 <= -5e+168) {
tmp = -1.0 / (t_0 / (sqrt(t_0) * sqrt(t_1)));
} else if (t_3 <= -2e-153) {
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 = (-1.0 / t_0) * sqrt((t_0 * t_1));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_1 = Float64(Float64(2.0 * F) * Float64(A + A)) 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 <= -5e+168) tmp = Float64(-1.0 / Float64(t_0 / Float64(sqrt(t_0) * sqrt(t_1)))); elseif (t_3 <= -2e-153) 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(Float64(-1.0 / t_0) * sqrt(Float64(t_0 * t_1))); 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $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, -5e+168], N[(-1.0 / N[(t$95$0 / N[(N[Sqrt[t$95$0], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -2e-153], 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[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(t$95$0 * t$95$1), $MachinePrecision]], $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, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := \left(2 \cdot F\right) \cdot \left(A + A\right)\\
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 -5 \cdot 10^{+168}:\\
\;\;\;\;\frac{-1}{\frac{t\_0}{\sqrt{t\_0} \cdot \sqrt{t\_1}}}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-153}:\\
\;\;\;\;\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{-1}{t\_0} \cdot \sqrt{t\_0 \cdot t\_1}\\
\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))) < -4.99999999999999967e168Initial program 8.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.3
Applied rewrites20.3%
Applied rewrites20.2%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
unpow-prod-downN/A
lower-*.f64N/A
pow1/2N/A
lower-sqrt.f64N/A
Applied rewrites30.4%
if -4.99999999999999967e168 < (/.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.00000000000000008e-153Initial program 96.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites98.5%
if -2.00000000000000008e-153 < (/.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 11.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.3
Applied rewrites12.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites12.9%
Applied rewrites12.9%
Final simplification30.2%
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 (* -4.0 (* A C))))
(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 -5e+168)
(/
(* (sqrt (fma (* A C) -8.0 (* 2.0 (* B B)))) (sqrt (* F (+ A A))))
(- t_0))
(if (<= t_2 -2e-153)
(*
(sqrt
(/
(* F (- (+ A C) (sqrt (fma B B (* (- A C) (- A C))))))
(fma (* A C) -4.0 (* B B))))
(- (sqrt 2.0)))
(* (/ -1.0 t_0) (sqrt (* t_0 (* (* 2.0 F) (+ A A)))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
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 <= -5e+168) {
tmp = (sqrt(fma((A * C), -8.0, (2.0 * (B * B)))) * sqrt((F * (A + A)))) / -t_0;
} else if (t_2 <= -2e-153) {
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 = (-1.0 / t_0) * sqrt((t_0 * ((2.0 * F) * (A + A))));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) 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 <= -5e+168) tmp = Float64(Float64(sqrt(fma(Float64(A * C), -8.0, Float64(2.0 * Float64(B * B)))) * sqrt(Float64(F * Float64(A + A)))) / Float64(-t_0)); elseif (t_2 <= -2e-153) 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(Float64(-1.0 / t_0) * sqrt(Float64(t_0 * Float64(Float64(2.0 * F) * Float64(A + A))))); 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[(-4.0 * N[(A * C), $MachinePrecision]), $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, -5e+168], N[(N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * -8.0 + N[(2.0 * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[t$95$2, -2e-153], 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[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(t$95$0 * N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $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, -4 \cdot \left(A \cdot C\right)\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 -5 \cdot 10^{+168}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -8, 2 \cdot \left(B \cdot B\right)\right)} \cdot \sqrt{F \cdot \left(A + A\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq -2 \cdot 10^{-153}:\\
\;\;\;\;\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{-1}{t\_0} \cdot \sqrt{t\_0 \cdot \left(\left(2 \cdot F\right) \cdot \left(A + A\right)\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))) < -4.99999999999999967e168Initial program 8.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.3
Applied rewrites20.3%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites20.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
Applied rewrites30.4%
if -4.99999999999999967e168 < (/.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.00000000000000008e-153Initial program 96.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites98.5%
if -2.00000000000000008e-153 < (/.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 11.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.3
Applied rewrites12.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites12.9%
Applied rewrites12.9%
Final simplification30.2%
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 (fma B B 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))))
(t_4 (* F (+ A A))))
(if (<= t_3 -5e-30)
(/ (* (sqrt (fma (* A C) -8.0 (* 2.0 (* B B)))) (sqrt t_4)) (- t_1))
(if (<= t_3 -4e-214)
(- (/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) B))
(- (/ (sqrt (* (* 2.0 t_1) t_4)) t_0))))))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 = fma(B, B, 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 t_4 = F * (A + A);
double tmp;
if (t_3 <= -5e-30) {
tmp = (sqrt(fma((A * C), -8.0, (2.0 * (B * B)))) * sqrt(t_4)) / -t_1;
} else if (t_3 <= -4e-214) {
tmp = -((sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / B);
} else {
tmp = -(sqrt(((2.0 * t_1) * t_4)) / t_0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = fma(B, B, 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))) t_4 = Float64(F * Float64(A + A)) tmp = 0.0 if (t_3 <= -5e-30) tmp = Float64(Float64(sqrt(fma(Float64(A * C), -8.0, Float64(2.0 * Float64(B * B)))) * sqrt(t_4)) / Float64(-t_1)); elseif (t_3 <= -4e-214) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / B)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * t_1) * t_4)) / 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B * B + t$95$0), $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]}, Block[{t$95$4 = N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -5e-30], N[(N[(N[Sqrt[N[(N[(A * C), $MachinePrecision] * -8.0 + N[(2.0 * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$4], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$3, -4e-214], (-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[(N[(2.0 * t$95$1), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision])]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \mathsf{fma}\left(B, B, t\_0\right)\\
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}}\\
t_4 := F \cdot \left(A + A\right)\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-30}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(A \cdot C, -8, 2 \cdot \left(B \cdot B\right)\right)} \cdot \sqrt{t\_4}}{-t\_1}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{B}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot t\_1\right) \cdot t\_4}}{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))) < -4.99999999999999972e-30Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.3
Applied rewrites29.3%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites29.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
Applied rewrites36.0%
if -4.99999999999999972e-30 < (/.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))) < -3.99999999999999965e-214Initial program 96.4%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites36.8%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6413.6
Applied rewrites13.6%
Final simplification22.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 (* -4.0 (* A C)))
(t_1 (fma B B 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 -5e-30)
(/ (* (sqrt t_1) (sqrt (* (* 2.0 F) (+ A A)))) (- t_1))
(if (<= t_3 -4e-214)
(- (/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) B))
(- (/ (sqrt (* (* 2.0 t_1) (* F (+ A A)))) t_0))))))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 = fma(B, B, 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 <= -5e-30) {
tmp = (sqrt(t_1) * sqrt(((2.0 * F) * (A + A)))) / -t_1;
} else if (t_3 <= -4e-214) {
tmp = -((sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / B);
} else {
tmp = -(sqrt(((2.0 * t_1) * (F * (A + A)))) / t_0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-4.0 * Float64(A * C)) t_1 = fma(B, B, 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 <= -5e-30) tmp = Float64(Float64(sqrt(t_1) * sqrt(Float64(Float64(2.0 * F) * Float64(A + A)))) / Float64(-t_1)); elseif (t_3 <= -4e-214) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / B)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * t_1) * Float64(F * Float64(A + A)))) / 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B * B + t$95$0), $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, -5e-30], N[(N[(N[Sqrt[t$95$1], $MachinePrecision] * N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$3, -4e-214], (-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[(N[(2.0 * t$95$1), $MachinePrecision] * N[(F * N[(A + A), $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 := -4 \cdot \left(A \cdot C\right)\\
t_1 := \mathsf{fma}\left(B, B, t\_0\right)\\
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 -5 \cdot 10^{-30}:\\
\;\;\;\;\frac{\sqrt{t\_1} \cdot \sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)}}{-t\_1}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{B}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot t\_1\right) \cdot \left(F \cdot \left(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))) < -4.99999999999999972e-30Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.3
Applied rewrites29.3%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites29.3%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
lift-sqrt.f64N/A
lift-*.f64N/A
associate-*r*N/A
Applied rewrites36.0%
if -4.99999999999999972e-30 < (/.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))) < -3.99999999999999965e-214Initial program 96.4%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites36.8%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6413.6
Applied rewrites13.6%
Final simplification22.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 (* (* 4.0 A) C))
(t_1
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_0) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B 2.0))))
(t_2 (* -4.0 (* A C)))
(t_3 (fma B B t_2)))
(if (<= t_1 -5e-30)
(* (sqrt (* (* 2.0 F) (+ A A))) (/ -1.0 (sqrt t_3)))
(if (<= t_1 -4e-214)
(- (/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) B))
(- (/ (sqrt (* (* 2.0 t_3) (* F (+ A 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 = sqrt(((2.0 * ((pow(B, 2.0) - t_0) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B, 2.0));
double t_2 = -4.0 * (A * C);
double t_3 = fma(B, B, t_2);
double tmp;
if (t_1 <= -5e-30) {
tmp = sqrt(((2.0 * F) * (A + A))) * (-1.0 / sqrt(t_3));
} else if (t_1 <= -4e-214) {
tmp = -((sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / B);
} else {
tmp = -(sqrt(((2.0 * t_3) * (F * (A + 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(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B ^ 2.0))) t_2 = Float64(-4.0 * Float64(A * C)) t_3 = fma(B, B, t_2) tmp = 0.0 if (t_1 <= -5e-30) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * Float64(A + A))) * Float64(-1.0 / sqrt(t_3))); elseif (t_1 <= -4e-214) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / B)); else tmp = Float64(-Float64(sqrt(Float64(Float64(2.0 * t_3) * Float64(F * Float64(A + 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[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $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$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(B * B + t$95$2), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-30], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[Sqrt[t$95$3], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e-214], (-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[(N[(2.0 * t$95$3), $MachinePrecision] * N[(F * N[(A + 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 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B}^{2}}\\
t_2 := -4 \cdot \left(A \cdot C\right)\\
t_3 := \mathsf{fma}\left(B, B, t\_2\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{-30}:\\
\;\;\;\;\sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)} \cdot \frac{-1}{\sqrt{t\_3}}\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{B}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{\left(2 \cdot t\_3\right) \cdot \left(F \cdot \left(A + 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))) < -4.99999999999999972e-30Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.3
Applied rewrites29.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites29.4%
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6429.4
lift-pow.f64N/A
pow2N/A
lower-*.f6429.4
Applied rewrites29.4%
Applied rewrites36.0%
if -4.99999999999999972e-30 < (/.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))) < -3.99999999999999965e-214Initial program 96.4%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites36.8%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites13.3%
Taylor expanded in B around 0
lower-*.f64N/A
lower-*.f6413.6
Applied rewrites13.6%
Final simplification22.2%
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 (* -4.0 (* A C))))
(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 -5e-30)
(* (sqrt (* (* 2.0 F) (+ A A))) (/ -1.0 (sqrt t_0)))
(if (<= t_2 -4e-214)
(- (/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) B))
(/ (sqrt (* (* F t_0) (* 2.0 (+ A A)))) t_1)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
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 <= -5e-30) {
tmp = sqrt(((2.0 * F) * (A + A))) * (-1.0 / sqrt(t_0));
} else if (t_2 <= -4e-214) {
tmp = -((sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / B);
} else {
tmp = sqrt(((F * t_0) * (2.0 * (A + A)))) / t_1;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) 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 <= -5e-30) tmp = Float64(sqrt(Float64(Float64(2.0 * F) * Float64(A + A))) * Float64(-1.0 / sqrt(t_0))); elseif (t_2 <= -4e-214) tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / B)); else tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + A)))) / t_1); 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[(-4.0 * N[(A * C), $MachinePrecision]), $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, -5e-30], N[(N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-214], (-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[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\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 -5 \cdot 10^{-30}:\\
\;\;\;\;\sqrt{\left(2 \cdot F\right) \cdot \left(A + A\right)} \cdot \frac{-1}{\sqrt{t\_0}}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{t\_1}\\
\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))) < -4.99999999999999972e-30Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.3
Applied rewrites29.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites29.4%
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f6429.4
lift-pow.f64N/A
pow2N/A
lower-*.f6429.4
Applied rewrites29.4%
Applied rewrites36.0%
if -4.99999999999999972e-30 < (/.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))) < -3.99999999999999965e-214Initial program 96.4%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites36.8%
if -3.99999999999999965e-214 < (/.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.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.7
Applied rewrites12.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites12.7%
Taylor expanded in B around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f6412.9
Applied rewrites12.9%
Final simplification21.8%
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 (* -4.0 (* A C))))))
(if (<= (pow B 2.0) 1e-132)
(/ (sqrt (* -16.0 (* F (* C (* A A))))) t_0)
(if (<= (pow B 2.0) 4e+164)
(/ (sqrt (* -2.0 (* F (* B (* B B))))) t_0)
(/
(sqrt (* (* F (+ A A)) (* 2.0 (* B B))))
(- (fma (* A C) -4.0 (* B B))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -fma(B, B, (-4.0 * (A * C)));
double tmp;
if (pow(B, 2.0) <= 1e-132) {
tmp = sqrt((-16.0 * (F * (C * (A * A))))) / t_0;
} else if (pow(B, 2.0) <= 4e+164) {
tmp = sqrt((-2.0 * (F * (B * (B * B))))) / t_0;
} else {
tmp = sqrt(((F * (A + A)) * (2.0 * (B * B)))) / -fma((A * C), -4.0, (B * B));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-fma(B, B, Float64(-4.0 * Float64(A * C)))) tmp = 0.0 if ((B ^ 2.0) <= 1e-132) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / t_0); elseif ((B ^ 2.0) <= 4e+164) tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B * Float64(B * B))))) / t_0); else tmp = Float64(sqrt(Float64(Float64(F * Float64(A + A)) * Float64(2.0 * Float64(B * B)))) / Float64(-fma(Float64(A * C), -4.0, Float64(B * 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-132], N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 4e+164], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $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, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;{B}^{2} \leq 10^{-132}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_0}\\
\mathbf{elif}\;{B}^{2} \leq 4 \cdot 10^{+164}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B \cdot \left(B \cdot B\right)\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \left(A + A\right)\right) \cdot \left(2 \cdot \left(B \cdot B\right)\right)}}{-\mathsf{fma}\left(A \cdot C, -4, B \cdot B\right)}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999999e-133Initial program 25.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.8
Applied rewrites25.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites25.8%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6420.0
Applied rewrites20.0%
if 9.9999999999999999e-133 < (pow.f64 B #s(literal 2 binary64)) < 4e164Initial program 44.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6426.1
Applied rewrites26.1%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites26.1%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.1
Applied rewrites11.1%
if 4e164 < (pow.f64 B #s(literal 2 binary64)) Initial program 9.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f642.1
Applied rewrites2.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites2.2%
lift--.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lift-*.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lower-fma.f642.2
lift-pow.f64N/A
pow2N/A
lower-*.f642.2
Applied rewrites2.2%
Taylor expanded in B around inf
unpow2N/A
lower-*.f642.2
Applied rewrites2.2%
Final simplification12.0%
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) 5e-23)
(/
(sqrt (* (* F (fma B B (* -4.0 (* A C)))) (* 2.0 (+ A A))))
(* (* 4.0 A) C))
(- (/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) 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) <= 5e-23) {
tmp = sqrt(((F * fma(B, B, (-4.0 * (A * C)))) * (2.0 * (A + A)))) / ((4.0 * A) * C);
} else {
tmp = -((sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / 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) <= 5e-23) tmp = Float64(sqrt(Float64(Float64(F * fma(B, B, Float64(-4.0 * Float64(A * C)))) * Float64(2.0 * Float64(A + A)))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(-Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / 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], 5e-23], N[(N[Sqrt[N[(N[(F * N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], (-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])]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 5 \cdot 10^{-23}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;-\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-23Initial program 26.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6426.7
Applied rewrites26.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites26.7%
Taylor expanded in B around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f6424.7
Applied rewrites24.7%
if 5.0000000000000002e-23 < (pow.f64 B #s(literal 2 binary64)) Initial program 23.6%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites16.7%
Final simplification20.7%
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) 5e-23)
(/
(sqrt (* (* F (fma B B (* -4.0 (* A C)))) (* 2.0 (+ A A))))
(* (* 4.0 A) C))
(- (* (sqrt (* F (- A (sqrt (fma B B (* A A)))))) (/ (sqrt 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) <= 5e-23) {
tmp = sqrt(((F * fma(B, B, (-4.0 * (A * C)))) * (2.0 * (A + A)))) / ((4.0 * A) * C);
} else {
tmp = -(sqrt((F * (A - sqrt(fma(B, B, (A * A)))))) * (sqrt(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) <= 5e-23) tmp = Float64(sqrt(Float64(Float64(F * fma(B, B, Float64(-4.0 * Float64(A * C)))) * Float64(2.0 * Float64(A + A)))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(-Float64(sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))) * Float64(sqrt(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], 5e-23], N[(N[Sqrt[N[(N[(F * N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision])]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 5 \cdot 10^{-23}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;-\sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)} \cdot \frac{\sqrt{2}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000002e-23Initial program 26.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6426.7
Applied rewrites26.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites26.7%
Taylor expanded in B around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f6424.7
Applied rewrites24.7%
if 5.0000000000000002e-23 < (pow.f64 B #s(literal 2 binary64)) Initial program 23.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f649.6
Applied rewrites9.6%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6416.6
Applied rewrites16.6%
Final simplification20.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 B B (* -4.0 (* A C)))))
(if (<= (pow B 2.0) 2e+123)
(/ (sqrt (* (* F t_0) (* 2.0 (+ A A)))) (* (* 4.0 A) C))
(/ (sqrt (* (* 2.0 t_0) (* F (+ A A)))) (- (* B B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double tmp;
if (pow(B, 2.0) <= 2e+123) {
tmp = sqrt(((F * t_0) * (2.0 * (A + A)))) / ((4.0 * A) * C);
} else {
tmp = sqrt(((2.0 * t_0) * (F * (A + A)))) / -(B * B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if ((B ^ 2.0) <= 2e+123) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + A)))) / Float64(Float64(4.0 * A) * C)); else tmp = Float64(sqrt(Float64(Float64(2.0 * t_0) * Float64(F * Float64(A + A)))) / Float64(-Float64(B * 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e+123], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B * 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, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{+123}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{\left(4 \cdot A\right) \cdot C}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot t\_0\right) \cdot \left(F \cdot \left(A + A\right)\right)}}{-B \cdot B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999996e123Initial program 30.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6427.3
Applied rewrites27.3%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites27.3%
Taylor expanded in B around 0
associate-*r*N/A
lower-*.f64N/A
lower-*.f6422.7
Applied rewrites22.7%
if 1.99999999999999996e123 < (pow.f64 B #s(literal 2 binary64)) Initial program 15.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.0
Applied rewrites3.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.2%
Taylor expanded in B around inf
unpow2N/A
lower-*.f643.2
Applied rewrites3.2%
Final simplification15.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 B B (* -4.0 (* A C))))))
(if (<= (pow B 2.0) 1e-132)
(/ (sqrt (* -16.0 (* F (* C (* A A))))) t_0)
(/ (sqrt (* -2.0 (* F (* B (* B B))))) t_0))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -fma(B, B, (-4.0 * (A * C)));
double tmp;
if (pow(B, 2.0) <= 1e-132) {
tmp = sqrt((-16.0 * (F * (C * (A * A))))) / t_0;
} else {
tmp = sqrt((-2.0 * (F * (B * (B * B))))) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-fma(B, B, Float64(-4.0 * Float64(A * C)))) tmp = 0.0 if ((B ^ 2.0) <= 1e-132) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / t_0); else tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B * Float64(B * B))))) / 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[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-132], N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B * N[(B * B), $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(B, B, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;{B}^{2} \leq 10^{-132}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B \cdot \left(B \cdot B\right)\right)\right)}}{t\_0}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999999e-133Initial program 25.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.8
Applied rewrites25.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites25.8%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6420.0
Applied rewrites20.0%
if 9.9999999999999999e-133 < (pow.f64 B #s(literal 2 binary64)) Initial program 24.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.6
Applied rewrites12.6%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites12.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f645.2
Applied rewrites5.2%
Final simplification11.5%
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 (* -4.0 (* A C)))) (t_1 (- t_0)))
(if (<= B 2e-65)
(/ (sqrt (* -16.0 (* F (* C (* A A))))) t_1)
(if (<= B 3.2e+82)
(/ (sqrt (* -2.0 (* F (* B (* B B))))) t_1)
(/ (sqrt (* (* 2.0 t_0) (* F (+ A A)))) (- (* B B)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double t_1 = -t_0;
double tmp;
if (B <= 2e-65) {
tmp = sqrt((-16.0 * (F * (C * (A * A))))) / t_1;
} else if (B <= 3.2e+82) {
tmp = sqrt((-2.0 * (F * (B * (B * B))))) / t_1;
} else {
tmp = sqrt(((2.0 * t_0) * (F * (A + A)))) / -(B * B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) t_1 = Float64(-t_0) tmp = 0.0 if (B <= 2e-65) tmp = Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / t_1); elseif (B <= 3.2e+82) tmp = Float64(sqrt(Float64(-2.0 * Float64(F * Float64(B * Float64(B * B))))) / t_1); else tmp = Float64(sqrt(Float64(Float64(2.0 * t_0) * Float64(F * Float64(A + A)))) / Float64(-Float64(B * 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[B, 2e-65], N[(N[Sqrt[N[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[B, 3.2e+82], N[(N[Sqrt[N[(-2.0 * N[(F * N[(B * N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B * 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, -4 \cdot \left(A \cdot C\right)\right)\\
t_1 := -t\_0\\
\mathbf{if}\;B \leq 2 \cdot 10^{-65}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{t\_1}\\
\mathbf{elif}\;B \leq 3.2 \cdot 10^{+82}:\\
\;\;\;\;\frac{\sqrt{-2 \cdot \left(F \cdot \left(B \cdot \left(B \cdot B\right)\right)\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot t\_0\right) \cdot \left(F \cdot \left(A + A\right)\right)}}{-B \cdot B}\\
\end{array}
\end{array}
if B < 1.99999999999999985e-65Initial program 25.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.5
Applied rewrites21.5%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites21.5%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.0
Applied rewrites16.0%
if 1.99999999999999985e-65 < B < 3.19999999999999975e82Initial program 41.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6422.8
Applied rewrites22.8%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites22.8%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
cube-multN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6422.4
Applied rewrites22.4%
if 3.19999999999999975e82 < B Initial program 13.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.1
Applied rewrites3.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites3.1%
Taylor expanded in B around inf
unpow2N/A
lower-*.f643.1
Applied rewrites3.1%
Final simplification14.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 B B (* -4.0 (* A C)))))
(if (<= B 1.95e+62)
(/ (sqrt (* (* A -8.0) (* (* C F) (+ A A)))) (- t_0))
(/ (sqrt (* (* 2.0 t_0) (* F (+ A A)))) (- (* B B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, (-4.0 * (A * C)));
double tmp;
if (B <= 1.95e+62) {
tmp = sqrt(((A * -8.0) * ((C * F) * (A + A)))) / -t_0;
} else {
tmp = sqrt(((2.0 * t_0) * (F * (A + A)))) / -(B * B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(-4.0 * Float64(A * C))) tmp = 0.0 if (B <= 1.95e+62) tmp = Float64(sqrt(Float64(Float64(A * -8.0) * Float64(Float64(C * F) * Float64(A + A)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(2.0 * t_0) * Float64(F * Float64(A + A)))) / Float64(-Float64(B * 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[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 1.95e+62], N[(N[Sqrt[N[(N[(A * -8.0), $MachinePrecision] * N[(N[(C * F), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(2.0 * t$95$0), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B * 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, -4 \cdot \left(A \cdot C\right)\right)\\
\mathbf{if}\;B \leq 1.95 \cdot 10^{+62}:\\
\;\;\;\;\frac{\sqrt{\left(A \cdot -8\right) \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot t\_0\right) \cdot \left(F \cdot \left(A + A\right)\right)}}{-B \cdot B}\\
\end{array}
\end{array}
if B < 1.95e62Initial program 27.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6421.9
Applied rewrites21.9%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites21.9%
Taylor expanded in C around inf
associate-*r*N/A
lower-*.f64N/A
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6416.9
Applied rewrites16.9%
if 1.95e62 < B Initial program 18.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
lower-*.f64N/A
Applied rewrites4.7%
Taylor expanded in B around inf
unpow2N/A
lower-*.f644.8
Applied rewrites4.8%
Final simplification14.3%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (/ (sqrt (* -16.0 (* F (* C (* A A))))) (- (fma B B (* -4.0 (* A C))))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((-16.0 * (F * (C * (A * A))))) / -fma(B, B, (-4.0 * (A * C)));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(-16.0 * Float64(F * Float64(C * Float64(A * A))))) / Float64(-fma(B, B, Float64(-4.0 * Float64(A * C))))) 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[(-16.0 * N[(F * N[(C * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(B * B + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{-16 \cdot \left(F \cdot \left(C \cdot \left(A \cdot A\right)\right)\right)}}{-\mathsf{fma}\left(B, B, -4 \cdot \left(A \cdot C\right)\right)}
\end{array}
Initial program 25.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6418.2
Applied rewrites18.2%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites18.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.8
Applied rewrites11.8%
Final simplification11.8%
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 25.2%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
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 25.2%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Applied rewrites1.8%
herbie shell --seed 2024219
(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))))