
(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 15 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 (/ (* B B) C))
(t_1 (* C (* A 4.0)))
(t_2 (* (* F (- (pow B 2.0) t_1)) 2.0))
(t_3 (- t_1 (pow B 2.0)))
(t_4
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))) t_2))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* (+ A A) F)) (sqrt (* (fma -4.0 (* C A) (* B B)) 2.0))) t_3)
(if (<= t_4 -2e-223)
(/
(sqrt
(*
(fma
(* (- C A) (+ C A))
(/ -1.0 (- A C))
(- (sqrt (fma (- A C) (- A C) (* B B)))))
(fma (* (* (* C A) -4.0) F) 2.0 (* (* (* F 2.0) B) B))))
t_3)
(/
(sqrt (* (+ (fma t_0 -0.5 A) A) t_2))
(- (* (- t_0 (* A 4.0)) C)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (B * B) / C;
double t_1 = C * (A * 4.0);
double t_2 = (F * (pow(B, 2.0) - t_1)) * 2.0;
double t_3 = t_1 - pow(B, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * t_2)) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(((A + A) * F)) * sqrt((fma(-4.0, (C * A), (B * B)) * 2.0))) / t_3;
} else if (t_4 <= -2e-223) {
tmp = sqrt((fma(((C - A) * (C + A)), (-1.0 / (A - C)), -sqrt(fma((A - C), (A - C), (B * B)))) * fma((((C * A) * -4.0) * F), 2.0, (((F * 2.0) * B) * B)))) / t_3;
} else {
tmp = sqrt(((fma(t_0, -0.5, A) + A) * t_2)) / -((t_0 - (A * 4.0)) * C);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(B * B) / C) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(Float64(F * Float64((B ^ 2.0) - t_1)) * 2.0) t_3 = Float64(t_1 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * t_2)) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B * B)) * 2.0))) / t_3); elseif (t_4 <= -2e-223) tmp = Float64(sqrt(Float64(fma(Float64(Float64(C - A) * Float64(C + A)), Float64(-1.0 / Float64(A - C)), Float64(-sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) * fma(Float64(Float64(Float64(C * A) * -4.0) * F), 2.0, Float64(Float64(Float64(F * 2.0) * B) * B)))) / t_3); else tmp = Float64(sqrt(Float64(Float64(fma(t_0, -0.5, A) + A) * t_2)) / Float64(-Float64(Float64(t_0 - Float64(A * 4.0)) * 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[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -2e-223], N[(N[Sqrt[N[(N[(N[(N[(C - A), $MachinePrecision] * N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(A - C), $MachinePrecision]), $MachinePrecision] + (-N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] * N[(N[(N[(N[(C * A), $MachinePrecision] * -4.0), $MachinePrecision] * F), $MachinePrecision] * 2.0 + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(t$95$0 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-N[(N[(t$95$0 - N[(A * 4.0), $MachinePrecision]), $MachinePrecision] * C), $MachinePrecision])), $MachinePrecision]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{B \cdot B}{C}\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \left(F \cdot \left({B}^{2} - t\_1\right)\right) \cdot 2\\
t_3 := t\_1 - {B}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot t\_2}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot F} \cdot \sqrt{\mathsf{fma}\left(-4, C \cdot A, B \cdot B\right) \cdot 2}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\left(C - A\right) \cdot \left(C + A\right), \frac{-1}{A - C}, -\sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \mathsf{fma}\left(\left(\left(C \cdot A\right) \cdot -4\right) \cdot F, 2, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\right)}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(t\_0, -0.5, A\right) + A\right) \cdot t\_2}}{-\left(t\_0 - A \cdot 4\right) \cdot C}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
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 rewrites26.1%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6425.8
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))) < -1.9999999999999999e-223Initial program 98.2%
lift--.f64N/A
sub-negN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
div-invN/A
lower-fma.f64N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-neg.f6498.2
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-fma.f6498.2
Applied rewrites98.2%
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lift--.f64N/A
lift-pow.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
distribute-rgt-inN/A
*-commutativeN/A
Applied rewrites98.4%
if -1.9999999999999999e-223 < (/.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 6.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.7
Applied rewrites12.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6412.7
Applied rewrites12.7%
Final simplification28.6%
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 -4.0 (* C A) (* B B)))
(t_1 (* C (* A 4.0)))
(t_2 (* (* F (- (pow B 2.0) t_1)) 2.0))
(t_3 (/ (* B B) C))
(t_4 (- t_1 (pow B 2.0)))
(t_5
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))) t_2))
t_4)))
(if (<= t_5 (- INFINITY))
(/ (* (sqrt (* (+ A A) F)) (sqrt (* t_0 2.0))) t_4)
(if (<= t_5 -2e-223)
(/
(sqrt
(*
(* (* F 2.0) t_0)
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(/
(sqrt (* (+ (fma t_3 -0.5 A) A) t_2))
(- (* (- t_3 (* A 4.0)) C)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B * B));
double t_1 = C * (A * 4.0);
double t_2 = (F * (pow(B, 2.0) - t_1)) * 2.0;
double t_3 = (B * B) / C;
double t_4 = t_1 - pow(B, 2.0);
double t_5 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * t_2)) / t_4;
double tmp;
if (t_5 <= -((double) INFINITY)) {
tmp = (sqrt(((A + A) * F)) * sqrt((t_0 * 2.0))) / t_4;
} else if (t_5 <= -2e-223) {
tmp = sqrt((((F * 2.0) * t_0) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else {
tmp = sqrt(((fma(t_3, -0.5, A) + A) * t_2)) / -((t_3 - (A * 4.0)) * C);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B * B)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(Float64(F * Float64((B ^ 2.0) - t_1)) * 2.0) t_3 = Float64(Float64(B * B) / C) t_4 = Float64(t_1 - (B ^ 2.0)) t_5 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * t_2)) / t_4) tmp = 0.0 if (t_5 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * sqrt(Float64(t_0 * 2.0))) / t_4); elseif (t_5 <= -2e-223) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(fma(t_3, -0.5, A) + A) * t_2)) / Float64(-Float64(Float64(t_3 - Float64(A * 4.0)) * 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$3 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, -2e-223], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(t$95$3 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / (-N[(N[(t$95$3 - N[(A * 4.0), $MachinePrecision]), $MachinePrecision] * C), $MachinePrecision])), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \left(F \cdot \left({B}^{2} - t\_1\right)\right) \cdot 2\\
t_3 := \frac{B \cdot B}{C}\\
t_4 := t\_1 - {B}^{2}\\
t_5 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot t\_2}}{t\_4}\\
\mathbf{if}\;t\_5 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot F} \cdot \sqrt{t\_0 \cdot 2}}{t\_4}\\
\mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(t\_3, -0.5, A\right) + A\right) \cdot t\_2}}{-\left(t\_3 - A \cdot 4\right) \cdot C}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
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 rewrites26.1%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6425.8
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))) < -1.9999999999999999e-223Initial program 98.2%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites98.2%
if -1.9999999999999999e-223 < (/.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 6.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.7
Applied rewrites12.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6412.7
Applied rewrites12.7%
Final simplification28.6%
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 -4.0 (* C A) (* B B)))
(t_1 (* C (* A 4.0)))
(t_2 (fma (* -4.0 C) A (* B B)))
(t_3 (- t_1 (pow B 2.0)))
(t_4
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* (+ A A) F)) (sqrt (* t_0 2.0))) t_3)
(if (<= t_4 -2e-223)
(/
(sqrt
(*
(* (* F 2.0) t_0)
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(/
(sqrt (* (* t_2 (* F 2.0)) (+ (fma -0.5 (/ (* B B) C) A) A)))
(- t_2))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B * B));
double t_1 = C * (A * 4.0);
double t_2 = fma((-4.0 * C), A, (B * B));
double t_3 = t_1 - pow(B, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(((A + A) * F)) * sqrt((t_0 * 2.0))) / t_3;
} else if (t_4 <= -2e-223) {
tmp = sqrt((((F * 2.0) * t_0) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else {
tmp = sqrt(((t_2 * (F * 2.0)) * (fma(-0.5, ((B * B) / C), A) + A))) / -t_2;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(C * A), Float64(B * B)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_3 = Float64(t_1 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_1)) * 2.0))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * sqrt(Float64(t_0 * 2.0))) / t_3); elseif (t_4 <= -2e-223) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(t_2 * Float64(F * 2.0)) * Float64(fma(-0.5, Float64(Float64(B * B) / C), A) + A))) / Float64(-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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -2e-223], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(t$95$2 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $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 := \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_3 := t\_1 - {B}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot F} \cdot \sqrt{t\_0 \cdot 2}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(t\_2 \cdot \left(F \cdot 2\right)\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\right)}}{-t\_2}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
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 rewrites26.1%
Taylor expanded in C around inf
lower-sqrt.f64N/A
lower-*.f64N/A
mul-1-negN/A
lower--.f64N/A
lower-neg.f6425.8
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))) < -1.9999999999999999e-223Initial program 98.2%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites98.2%
if -1.9999999999999999e-223 < (/.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 6.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.7
Applied rewrites12.7%
Applied rewrites12.7%
Final simplification28.6%
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 (* -4.0 C) A (* B B)))
(t_1 (fma -4.0 (* C A) (* B B)))
(t_2 (* C (* A 4.0)))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_2)) 2.0)))
(- t_2 (pow B 2.0))))
(t_4 (/ (* B B) C)))
(if (<= t_3 (- INFINITY))
(/ (* (- (sqrt (* t_0 2.0))) (sqrt (* (+ (fma t_4 -0.5 A) A) F))) t_0)
(if (<= t_3 -2e-223)
(/
(sqrt
(*
(* (* F 2.0) t_1)
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_1))
(/ (sqrt (* (* t_0 (* F 2.0)) (+ (fma -0.5 t_4 A) A))) (- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double t_1 = fma(-4.0, (C * A), (B * B));
double t_2 = C * (A * 4.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B, 2.0));
double t_4 = (B * B) / C;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (-sqrt((t_0 * 2.0)) * sqrt(((fma(t_4, -0.5, A) + A) * F))) / t_0;
} else if (t_3 <= -2e-223) {
tmp = sqrt((((F * 2.0) * t_1) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_1;
} else {
tmp = sqrt(((t_0 * (F * 2.0)) * (fma(-0.5, t_4, A) + A))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_1 = fma(-4.0, Float64(C * A), Float64(B * B)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B ^ 2.0))) t_4 = Float64(Float64(B * B) / C) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * 2.0))) * sqrt(Float64(Float64(fma(t_4, -0.5, A) + A) * F))) / t_0); elseif (t_3 <= -2e-223) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_1)); else tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(fma(-0.5, t_4, A) + A))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[((-N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[N[(N[(N[(t$95$4 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$3, -2e-223], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(-0.5 * t$95$4 + A), $MachinePrecision] + A), $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(-4 \cdot C, A, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B}^{2}}\\
t_4 := \frac{B \cdot B}{C}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{\left(\mathsf{fma}\left(t\_4, -0.5, A\right) + A\right) \cdot F}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(\mathsf{fma}\left(-0.5, t\_4, A\right) + A\right)}}{-t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.1%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.3
Applied rewrites21.3%
Applied rewrites21.3%
Applied rewrites27.4%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1.9999999999999999e-223Initial program 98.2%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites98.2%
if -1.9999999999999999e-223 < (/.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 6.0%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6412.7
Applied rewrites12.7%
Applied rewrites12.7%
Final simplification28.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B B))))
(if (<= (pow B 2.0) 2e-23)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) (- t_0))
(*
(sqrt
(*
(/
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))
(fma (* -4.0 A) C (* B B)))
F))
(- (sqrt 2.0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (pow(B, 2.0) <= 2e-23) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / -t_0;
} else {
tmp = sqrt(((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) / fma((-4.0 * A), C, (B * B))) * F)) * -sqrt(2.0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 2e-23) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) / fma(Float64(-4.0 * A), C, Float64(B * B))) * F)) * Float64(-sqrt(2.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e-23], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}}{\mathsf{fma}\left(-4 \cdot A, C, B \cdot B\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999992e-23Initial program 21.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.1
Applied rewrites21.1%
Applied rewrites21.1%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6420.1
Applied rewrites20.1%
if 1.99999999999999992e-23 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.2%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites28.8%
Final simplification24.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 (* -4.0 C) A (* B B))))
(if (<= (pow B 2.0) 1e-49)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) (- t_0))
(/
-1.0
(*
(sqrt (/ -1.0 (* (- (sqrt (fma A A (* B B))) A) F)))
(/ B (sqrt 2.0)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (pow(B, 2.0) <= 1e-49) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / -t_0;
} else {
tmp = -1.0 / (sqrt((-1.0 / ((sqrt(fma(A, A, (B * B))) - A) * F))) * (B / sqrt(2.0)));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 1e-49) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / Float64(-t_0)); else tmp = Float64(-1.0 / Float64(sqrt(Float64(-1.0 / Float64(Float64(sqrt(fma(A, A, Float64(B * B))) - A) * F))) * Float64(B / sqrt(2.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-49], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(-1.0 / N[(N[Sqrt[N[(-1.0 / N[(N[(N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - A), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(B / N[Sqrt[2.0], $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(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 10^{-49}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{\sqrt{\frac{-1}{\left(\sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)} - A\right) \cdot F}} \cdot \frac{B}{\sqrt{2}}}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999936e-50Initial program 21.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.3
Applied rewrites21.3%
Applied rewrites21.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6421.1
Applied rewrites21.1%
if 9.99999999999999936e-50 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
neg-mul-1N/A
clear-numN/A
un-div-invN/A
Applied rewrites18.1%
Taylor expanded in C around 0
lower-*.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6411.1
Applied rewrites11.1%
Final simplification16.0%
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 (* -4.0 C) A (* B B))))
(if (<= (pow B 2.0) 1e-49)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) (- t_0))
(* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (pow(B, 2.0) <= 1e-49) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / -t_0;
} else {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-sqrt(2.0) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 1e-49) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(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_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e-49], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * F), $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}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 10^{-49}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999936e-50Initial program 21.7%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.3
Applied rewrites21.3%
Applied rewrites21.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6421.1
Applied rewrites21.1%
if 9.99999999999999936e-50 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.1%
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
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6411.2
Applied rewrites11.2%
Final simplification15.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B B))))
(if (<= (pow B 2.0) 2e-23)
(/ (sqrt (* (* (* (* A A) C) F) -16.0)) (- t_0))
(* (/ -1.0 t_0) (sqrt (* (* (* (* B B) B) F) -2.0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (pow(B, 2.0) <= 2e-23) {
tmp = sqrt(((((A * A) * C) * F) * -16.0)) / -t_0;
} else {
tmp = (-1.0 / t_0) * sqrt(((((B * B) * B) * F) * -2.0));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 2e-23) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / Float64(-t_0)); else tmp = Float64(Float64(-1.0 / t_0) * sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e-23], N[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{t\_0} \cdot \sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999992e-23Initial program 21.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.1
Applied rewrites21.1%
Applied rewrites21.1%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6413.6
Applied rewrites13.6%
if 1.99999999999999992e-23 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f647.1
Applied rewrites7.1%
Applied rewrites7.1%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f646.3
Applied rewrites6.3%
Final simplification10.0%
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 (* -4.0 C) A (* B B)))))
(if (<= (pow B 2.0) 2e-23)
(/ (sqrt (* (* (* (* A A) C) F) -16.0)) t_0)
(/ (sqrt (* (* (* (* B B) B) F) -2.0)) t_0))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = -fma((-4.0 * C), A, (B * B));
double tmp;
if (pow(B, 2.0) <= 2e-23) {
tmp = sqrt(((((A * A) * C) * F) * -16.0)) / t_0;
} else {
tmp = sqrt(((((B * B) * B) * F) * -2.0)) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(-fma(Float64(-4.0 * C), A, Float64(B * B))) tmp = 0.0 if ((B ^ 2.0) <= 2e-23) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / t_0); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.0)) / 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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e-23], N[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $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(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{-23}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}}{t\_0}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999992e-23Initial program 21.5%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6421.1
Applied rewrites21.1%
Applied rewrites21.1%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6413.6
Applied rewrites13.6%
if 1.99999999999999992e-23 < (pow.f64 B #s(literal 2 binary64)) Initial program 18.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f647.1
Applied rewrites7.1%
Applied rewrites7.1%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f646.3
Applied rewrites6.3%
Final simplification10.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 (<= B 3e-24) (/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) (- (fma (* -4.0 C) A (* B B)))) (* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 3e-24) {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / -fma((-4.0 * C), A, (B * B));
} else {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-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 <= 3e-24) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(-fma(Float64(-4.0 * C), A, Float64(B * B)))); else tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(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[B, 3e-24], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * F), $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 \leq 3 \cdot 10^{-24}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{-\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 2.99999999999999995e-24Initial program 21.9%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6416.9
Applied rewrites16.9%
Applied rewrites16.9%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6414.4
Applied rewrites14.4%
if 2.99999999999999995e-24 < B Initial program 14.2%
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
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6420.3
Applied rewrites20.3%
Final simplification16.0%
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 (* -4.0 C) A (* B B))))
(if (<= B 3.1e-24)
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) (- t_0))
(* (/ -1.0 t_0) (sqrt (* (* (* (* B B) B) F) -2.0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (B <= 3.1e-24) {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / -t_0;
} else {
tmp = (-1.0 / t_0) * sqrt(((((B * B) * B) * F) * -2.0));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if (B <= 3.1e-24) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(-t_0)); else tmp = Float64(Float64(-1.0 / t_0) * sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 3.1e-24], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(-1.0 / t$95$0), $MachinePrecision] * N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;B \leq 3.1 \cdot 10^{-24}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{t\_0} \cdot \sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}\\
\end{array}
\end{array}
if B < 3.1e-24Initial program 21.9%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6416.9
Applied rewrites16.9%
Applied rewrites16.9%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6414.4
Applied rewrites14.4%
if 3.1e-24 < B Initial program 14.2%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f646.7
Applied rewrites6.7%
Applied rewrites6.7%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6412.2
Applied rewrites12.2%
Final simplification13.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 (* (* (* (* A A) C) F) -16.0)) (- (fma (* -4.0 C) A (* B B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt(((((A * A) * C) * F) * -16.0)) / -fma((-4.0 * C), A, (B * B));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / Float64(-fma(Float64(-4.0 * C), A, Float64(B * B)))) end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{-\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)}
\end{array}
Initial program 19.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.2
Applied rewrites14.2%
Applied rewrites14.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f648.3
Applied rewrites8.3%
Final simplification8.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 (* (* (* (* C C) F) A) -16.0)) (- (fma (* -4.0 C) A (* B B)))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt(((((C * C) * F) * A) * -16.0)) / -fma((-4.0 * C), A, (B * B));
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) / Float64(-fma(Float64(-4.0 * C), A, Float64(B * B)))) end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -16}}{-\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)}
\end{array}
Initial program 19.8%
Taylor expanded in C around inf
sub-negN/A
mul-1-negN/A
remove-double-negN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6414.2
Applied rewrites14.2%
Applied rewrites14.2%
Taylor expanded in C around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6411.3
Applied rewrites11.3%
Final simplification11.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 (/ 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 19.8%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.0
Applied rewrites2.0%
Applied rewrites2.0%
Applied rewrites2.0%
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(Float64(2.0 / 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[(N[(2.0 / B), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{\frac{2}{B} \cdot F}
\end{array}
Initial program 19.8%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f642.0
Applied rewrites2.0%
Applied rewrites2.0%
Applied rewrites2.0%
Final simplification2.0%
herbie shell --seed 2024235
(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))))