
(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 19 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 (* C (* A 4.0)))
(t_1 (* (* F (- (pow B 2.0) t_0)) 2.0))
(t_2 (- t_0 (pow B 2.0)))
(t_3
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))) t_1))
t_2))
(t_4 (+ (fma (/ (* B B) C) -0.5 A) A)))
(if (<= t_3 (- INFINITY))
(/
(* (sqrt (fma (* C A) -4.0 (* B B))) (pow (* (* F 2.0) t_4) 0.5))
(- (fma (* -4.0 C) A (* B B))))
(if (<= t_3 -1e-191)
(/
(*
(sqrt (* (- (+ C A) (sqrt (fma (- A C) (- A C) (* B B)))) F))
(sqrt (* (fma -4.0 (* C A) (* B B)) 2.0)))
t_2)
(if (<= t_3 INFINITY)
(/ (sqrt (* t_4 t_1)) t_2)
(*
(/ (* (* (sqrt 2.0) (sqrt (/ 1.0 A))) 0.25) C)
(sqrt (fma (* (* -4.0 C) (* F 2.0)) A (* (* (* F 2.0) B) B)))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = (F * (pow(B, 2.0) - t_0)) * 2.0;
double t_2 = t_0 - pow(B, 2.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * t_1)) / t_2;
double t_4 = fma(((B * B) / C), -0.5, A) + A;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma((C * A), -4.0, (B * B))) * pow(((F * 2.0) * t_4), 0.5)) / -fma((-4.0 * C), A, (B * B));
} else if (t_3 <= -1e-191) {
tmp = (sqrt((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) * F)) * sqrt((fma(-4.0, (C * A), (B * B)) * 2.0))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt((t_4 * t_1)) / t_2;
} else {
tmp = (((sqrt(2.0) * sqrt((1.0 / A))) * 0.25) / C) * sqrt(fma(((-4.0 * C) * (F * 2.0)), A, (((F * 2.0) * B) * B)));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = Float64(Float64(F * Float64((B ^ 2.0) - t_0)) * 2.0) t_2 = Float64(t_0 - (B ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * t_1)) / t_2) t_4 = Float64(fma(Float64(Float64(B * B) / C), -0.5, A) + A) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(Float64(C * A), -4.0, Float64(B * B))) * (Float64(Float64(F * 2.0) * t_4) ^ 0.5)) / Float64(-fma(Float64(-4.0 * C), A, Float64(B * B)))); elseif (t_3 <= -1e-191) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * F)) * sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B * B)) * 2.0))) / t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(t_4 * t_1)) / t_2); else tmp = Float64(Float64(Float64(Float64(sqrt(2.0) * sqrt(Float64(1.0 / A))) * 0.25) / C) * sqrt(fma(Float64(Float64(-4.0 * C) * Float64(F * 2.0)), A, Float64(Float64(Float64(F * 2.0) * 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B, 2.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] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[N[(N[(F * 2.0), $MachinePrecision] * t$95$4), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] / (-N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, -1e-191], N[(N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $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$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(t$95$4 * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * A + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := \left(F \cdot \left({B}^{2} - t\_0\right)\right) \cdot 2\\
t_2 := t\_0 - {B}^{2}\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot t\_1}}{t\_2}\\
t_4 := \mathsf{fma}\left(\frac{B \cdot B}{C}, -0.5, A\right) + A\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)} \cdot {\left(\left(F \cdot 2\right) \cdot t\_4\right)}^{0.5}}{-\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot F} \cdot \sqrt{\mathsf{fma}\left(-4, C \cdot A, B \cdot B\right) \cdot 2}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{t\_4 \cdot t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \sqrt{\frac{1}{A}}\right) \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(\left(-4 \cdot C\right) \cdot \left(F \cdot 2\right), A, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\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 3.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-*.f6419.4
Applied rewrites19.4%
Applied rewrites19.4%
lift-sqrt.f64N/A
pow1/2N/A
Applied rewrites32.5%
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))) < -1e-191Initial program 99.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 rewrites99.2%
if -1e-191 < (/.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 20.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-*.f6419.3
Applied rewrites19.3%
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))) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites2.1%
Taylor expanded in C around inf
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites4.7%
Final simplification25.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 (* C (* A 4.0)))
(t_1 (/ (* B B) C))
(t_2 (- t_0 (pow B 2.0)))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_0)) 2.0)))
t_2))
(t_4 (fma (* -4.0 C) A (* B B)))
(t_5 (- t_4)))
(if (<= t_3 (- INFINITY))
(/
(*
(sqrt (fma (* C A) -4.0 (* B B)))
(pow (* (* F 2.0) (+ (fma t_1 -0.5 A) A)) 0.5))
t_5)
(if (<= t_3 -1e-191)
(/
(*
(sqrt (* (- (+ C A) (sqrt (fma (- A C) (- A C) (* B B)))) F))
(sqrt (* (fma -4.0 (* C A) (* B B)) 2.0)))
t_2)
(if (<= t_3 INFINITY)
(/ (sqrt (* (+ (fma -0.5 t_1 A) A) (* t_4 (* F 2.0)))) t_5)
(*
(/ (* (* (sqrt 2.0) (sqrt (/ 1.0 A))) 0.25) C)
(sqrt (fma (* (* -4.0 C) (* F 2.0)) A (* (* (* F 2.0) B) B)))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = (B * B) / C;
double t_2 = t_0 - pow(B, 2.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_0)) * 2.0))) / t_2;
double t_4 = fma((-4.0 * C), A, (B * B));
double t_5 = -t_4;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(fma((C * A), -4.0, (B * B))) * pow(((F * 2.0) * (fma(t_1, -0.5, A) + A)), 0.5)) / t_5;
} else if (t_3 <= -1e-191) {
tmp = (sqrt((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) * F)) * sqrt((fma(-4.0, (C * A), (B * B)) * 2.0))) / t_2;
} else if (t_3 <= ((double) INFINITY)) {
tmp = sqrt(((fma(-0.5, t_1, A) + A) * (t_4 * (F * 2.0)))) / t_5;
} else {
tmp = (((sqrt(2.0) * sqrt((1.0 / A))) * 0.25) / C) * sqrt(fma(((-4.0 * C) * (F * 2.0)), A, (((F * 2.0) * B) * B)));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = Float64(Float64(B * B) / C) t_2 = Float64(t_0 - (B ^ 2.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_0)) * 2.0))) / t_2) t_4 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_5 = Float64(-t_4) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(Float64(C * A), -4.0, Float64(B * B))) * (Float64(Float64(F * 2.0) * Float64(fma(t_1, -0.5, A) + A)) ^ 0.5)) / t_5); elseif (t_3 <= -1e-191) tmp = Float64(Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * F)) * sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B * B)) * 2.0))) / t_2); elseif (t_3 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_1, A) + A) * Float64(t_4 * Float64(F * 2.0)))) / t_5); else tmp = Float64(Float64(Float64(Float64(sqrt(2.0) * sqrt(Float64(1.0 / A))) * 0.25) / C) * sqrt(fma(Float64(Float64(-4.0 * C) * Float64(F * 2.0)), A, Float64(Float64(Float64(F * 2.0) * 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B, 2.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$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[N[(N[(F * 2.0), $MachinePrecision] * N[(N[(t$95$1 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$3, -1e-191], N[(N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $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$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$1 + A), $MachinePrecision] + A), $MachinePrecision] * N[(t$95$4 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * A + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := \frac{B \cdot B}{C}\\
t_2 := t\_0 - {B}^{2}\\
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\_0\right)\right) \cdot 2\right)}}{t\_2}\\
t_4 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)} \cdot {\left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(t\_1, -0.5, A\right) + A\right)\right)}^{0.5}}{t\_5}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot F} \cdot \sqrt{\mathsf{fma}\left(-4, C \cdot A, B \cdot B\right) \cdot 2}}{t\_2}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_1, A\right) + A\right) \cdot \left(t\_4 \cdot \left(F \cdot 2\right)\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \sqrt{\frac{1}{A}}\right) \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(\left(-4 \cdot C\right) \cdot \left(F \cdot 2\right), A, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\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 3.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-*.f6419.4
Applied rewrites19.4%
Applied rewrites19.4%
lift-sqrt.f64N/A
pow1/2N/A
Applied rewrites32.5%
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))) < -1e-191Initial program 99.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 rewrites99.2%
if -1e-191 < (/.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 20.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-*.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
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))) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites2.1%
Taylor expanded in C around inf
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites4.7%
Final simplification25.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
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0))))
(t_3 (/ (* B B) C))
(t_4 (fma (* -4.0 C) A (* B B)))
(t_5 (- t_4)))
(if (<= t_2 (- INFINITY))
(/
(*
(sqrt (fma (* C A) -4.0 (* B B)))
(pow (* (* F 2.0) (+ (fma t_3 -0.5 A) A)) 0.5))
t_5)
(if (<= t_2 -1e-191)
(/
(sqrt
(*
(* t_0 (* F 2.0))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(if (<= t_2 INFINITY)
(/ (sqrt (* (+ (fma -0.5 t_3 A) A) (* t_4 (* F 2.0)))) t_5)
(*
(/ (* (* (sqrt 2.0) (sqrt (/ 1.0 A))) 0.25) C)
(sqrt (fma (* (* -4.0 C) (* F 2.0)) A (* (* (* F 2.0) B) 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 t_1 = C * (A * 4.0);
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double t_3 = (B * B) / C;
double t_4 = fma((-4.0 * C), A, (B * B));
double t_5 = -t_4;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt(fma((C * A), -4.0, (B * B))) * pow(((F * 2.0) * (fma(t_3, -0.5, A) + A)), 0.5)) / t_5;
} else if (t_2 <= -1e-191) {
tmp = sqrt(((t_0 * (F * 2.0)) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(-0.5, t_3, A) + A) * (t_4 * (F * 2.0)))) / t_5;
} else {
tmp = (((sqrt(2.0) * sqrt((1.0 / A))) * 0.25) / C) * sqrt(fma(((-4.0 * C) * (F * 2.0)), A, (((F * 2.0) * B) * B)));
}
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(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))) / Float64(t_1 - (B ^ 2.0))) t_3 = Float64(Float64(B * B) / C) t_4 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_5 = Float64(-t_4) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(Float64(C * A), -4.0, Float64(B * B))) * (Float64(Float64(F * 2.0) * Float64(fma(t_3, -0.5, A) + A)) ^ 0.5)) / t_5); elseif (t_2 <= -1e-191) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_3, A) + A) * Float64(t_4 * Float64(F * 2.0)))) / t_5); else tmp = Float64(Float64(Float64(Float64(sqrt(2.0) * sqrt(Float64(1.0 / A))) * 0.25) / C) * sqrt(fma(Float64(Float64(-4.0 * C) * Float64(F * 2.0)), A, Float64(Float64(Float64(F * 2.0) * 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[(-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[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] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Power[N[(N[(F * 2.0), $MachinePrecision] * N[(N[(t$95$3 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$2, -1e-191], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $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], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$3 + A), $MachinePrecision] + A), $MachinePrecision] * N[(t$95$4 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * A + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $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, C \cdot A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \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\_1 - {B}^{2}}\\
t_3 := \frac{B \cdot B}{C}\\
t_4 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)} \cdot {\left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(t\_3, -0.5, A\right) + A\right)\right)}^{0.5}}{t\_5}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_3, A\right) + A\right) \cdot \left(t\_4 \cdot \left(F \cdot 2\right)\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \sqrt{\frac{1}{A}}\right) \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(\left(-4 \cdot C\right) \cdot \left(F \cdot 2\right), A, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\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 3.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-*.f6419.4
Applied rewrites19.4%
Applied rewrites19.4%
lift-sqrt.f64N/A
pow1/2N/A
Applied rewrites32.5%
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))) < -1e-191Initial program 99.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.0%
if -1e-191 < (/.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 20.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-*.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
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))) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites2.1%
Taylor expanded in C around inf
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites4.7%
Final simplification25.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
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0))))
(t_3 (/ (* B B) C))
(t_4 (fma (* -4.0 C) A (* B B)))
(t_5 (- t_4)))
(if (<= t_2 (- INFINITY))
(/
(*
(sqrt (* (fma (* C A) -4.0 (* B B)) 2.0))
(pow (* (+ (fma t_3 -0.5 A) A) F) 0.5))
t_5)
(if (<= t_2 -1e-191)
(/
(sqrt
(*
(* t_0 (* F 2.0))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(if (<= t_2 INFINITY)
(/ (sqrt (* (+ (fma -0.5 t_3 A) A) (* t_4 (* F 2.0)))) t_5)
(*
(/ (* (* (sqrt 2.0) (sqrt (/ 1.0 A))) 0.25) C)
(sqrt (fma (* (* -4.0 C) (* F 2.0)) A (* (* (* F 2.0) B) 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 t_1 = C * (A * 4.0);
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double t_3 = (B * B) / C;
double t_4 = fma((-4.0 * C), A, (B * B));
double t_5 = -t_4;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = (sqrt((fma((C * A), -4.0, (B * B)) * 2.0)) * pow(((fma(t_3, -0.5, A) + A) * F), 0.5)) / t_5;
} else if (t_2 <= -1e-191) {
tmp = sqrt(((t_0 * (F * 2.0)) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(-0.5, t_3, A) + A) * (t_4 * (F * 2.0)))) / t_5;
} else {
tmp = (((sqrt(2.0) * sqrt((1.0 / A))) * 0.25) / C) * sqrt(fma(((-4.0 * C) * (F * 2.0)), A, (((F * 2.0) * B) * B)));
}
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(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))) / Float64(t_1 - (B ^ 2.0))) t_3 = Float64(Float64(B * B) / C) t_4 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_5 = Float64(-t_4) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(fma(Float64(C * A), -4.0, Float64(B * B)) * 2.0)) * (Float64(Float64(fma(t_3, -0.5, A) + A) * F) ^ 0.5)) / t_5); elseif (t_2 <= -1e-191) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_3, A) + A) * Float64(t_4 * Float64(F * 2.0)))) / t_5); else tmp = Float64(Float64(Float64(Float64(sqrt(2.0) * sqrt(Float64(1.0 / A))) * 0.25) / C) * sqrt(fma(Float64(Float64(-4.0 * C) * Float64(F * 2.0)), A, Float64(Float64(Float64(F * 2.0) * 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[(-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[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] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[(N[Sqrt[N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Power[N[(N[(N[(t$95$3 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$2, -1e-191], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $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], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$3 + A), $MachinePrecision] + A), $MachinePrecision] * N[(t$95$4 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * A + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $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, C \cdot A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \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\_1 - {B}^{2}}\\
t_3 := \frac{B \cdot B}{C}\\
t_4 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot 2} \cdot {\left(\left(\mathsf{fma}\left(t\_3, -0.5, A\right) + A\right) \cdot F\right)}^{0.5}}{t\_5}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_3, A\right) + A\right) \cdot \left(t\_4 \cdot \left(F \cdot 2\right)\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \sqrt{\frac{1}{A}}\right) \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(\left(-4 \cdot C\right) \cdot \left(F \cdot 2\right), A, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\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 3.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-*.f6419.4
Applied rewrites19.4%
Applied rewrites19.4%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-*r*N/A
Applied rewrites32.5%
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))) < -1e-191Initial program 99.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.0%
if -1e-191 < (/.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 20.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-*.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
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))) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites2.1%
Taylor expanded in C around inf
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites4.7%
Final simplification25.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
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0))))
(t_3 (/ (* B B) C))
(t_4 (fma (* -4.0 C) A (* B B)))
(t_5 (- t_4)))
(if (<= t_2 (- INFINITY))
(/
(sqrt
(* (fma (* C A) -4.0 (* B B)) (* (* F 2.0) (+ (fma t_3 -0.5 A) A))))
t_5)
(if (<= t_2 -1e-191)
(/
(sqrt
(*
(* t_0 (* F 2.0))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(if (<= t_2 INFINITY)
(/ (sqrt (* (+ (fma -0.5 t_3 A) A) (* t_4 (* F 2.0)))) t_5)
(*
(/ (* (* (sqrt 2.0) (sqrt (/ 1.0 A))) 0.25) C)
(sqrt (fma (* (* -4.0 C) (* F 2.0)) A (* (* (* F 2.0) B) 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 t_1 = C * (A * 4.0);
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double t_3 = (B * B) / C;
double t_4 = fma((-4.0 * C), A, (B * B));
double t_5 = -t_4;
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = sqrt((fma((C * A), -4.0, (B * B)) * ((F * 2.0) * (fma(t_3, -0.5, A) + A)))) / t_5;
} else if (t_2 <= -1e-191) {
tmp = sqrt(((t_0 * (F * 2.0)) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((fma(-0.5, t_3, A) + A) * (t_4 * (F * 2.0)))) / t_5;
} else {
tmp = (((sqrt(2.0) * sqrt((1.0 / A))) * 0.25) / C) * sqrt(fma(((-4.0 * C) * (F * 2.0)), A, (((F * 2.0) * B) * B)));
}
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(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))) / Float64(t_1 - (B ^ 2.0))) t_3 = Float64(Float64(B * B) / C) t_4 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_5 = Float64(-t_4) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(fma(Float64(C * A), -4.0, Float64(B * B)) * Float64(Float64(F * 2.0) * Float64(fma(t_3, -0.5, A) + A)))) / t_5); elseif (t_2 <= -1e-191) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_3, A) + A) * Float64(t_4 * Float64(F * 2.0)))) / t_5); else tmp = Float64(Float64(Float64(Float64(sqrt(2.0) * sqrt(Float64(1.0 / A))) * 0.25) / C) * sqrt(fma(Float64(Float64(-4.0 * C) * Float64(F * 2.0)), A, Float64(Float64(Float64(F * 2.0) * 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[(-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[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] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = (-t$95$4)}, If[LessEqual[t$95$2, (-Infinity)], N[(N[Sqrt[N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(t$95$3 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], If[LessEqual[t$95$2, -1e-191], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $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], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$3 + A), $MachinePrecision] + A), $MachinePrecision] * N[(t$95$4 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$5), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * A + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $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, C \cdot A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \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\_1 - {B}^{2}}\\
t_3 := \frac{B \cdot B}{C}\\
t_4 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_5 := -t\_4\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(t\_3, -0.5, A\right) + A\right)\right)}}{t\_5}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_3, A\right) + A\right) \cdot \left(t\_4 \cdot \left(F \cdot 2\right)\right)}}{t\_5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \sqrt{\frac{1}{A}}\right) \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(\left(-4 \cdot C\right) \cdot \left(F \cdot 2\right), A, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\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 3.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-*.f6419.4
Applied rewrites19.4%
Applied rewrites19.4%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
Applied rewrites21.5%
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))) < -1e-191Initial program 99.0%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites99.0%
if -1e-191 < (/.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 20.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-*.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
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))) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites2.1%
Taylor expanded in C around inf
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites4.7%
Final simplification23.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 (* C (* A 4.0)))
(t_1
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_0)) 2.0)))
(- t_0 (pow B 2.0))))
(t_2 (/ (* B B) C))
(t_3 (fma (* -4.0 C) A (* B B)))
(t_4 (- t_3)))
(if (<= t_1 (- INFINITY))
(/
(sqrt
(* (fma (* C A) -4.0 (* B B)) (* (* F 2.0) (+ (fma t_2 -0.5 A) A))))
t_4)
(if (<= t_1 -1e-191)
(/
(sqrt
(*
(* (* t_3 F) (- (+ C A) (sqrt (fma (- A C) (- A C) (* B B)))))
2.0))
t_4)
(if (<= t_1 INFINITY)
(/ (sqrt (* (+ (fma -0.5 t_2 A) A) (* t_3 (* F 2.0)))) t_4)
(*
(/ (* (* (sqrt 2.0) (sqrt (/ 1.0 A))) 0.25) C)
(sqrt (fma (* (* -4.0 C) (* F 2.0)) A (* (* (* F 2.0) B) B)))))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_0)) * 2.0))) / (t_0 - pow(B, 2.0));
double t_2 = (B * B) / C;
double t_3 = fma((-4.0 * C), A, (B * B));
double t_4 = -t_3;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = sqrt((fma((C * A), -4.0, (B * B)) * ((F * 2.0) * (fma(t_2, -0.5, A) + A)))) / t_4;
} else if (t_1 <= -1e-191) {
tmp = sqrt((((t_3 * F) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B))))) * 2.0)) / t_4;
} else if (t_1 <= ((double) INFINITY)) {
tmp = sqrt(((fma(-0.5, t_2, A) + A) * (t_3 * (F * 2.0)))) / t_4;
} else {
tmp = (((sqrt(2.0) * sqrt((1.0 / A))) * 0.25) / C) * sqrt(fma(((-4.0 * C) * (F * 2.0)), A, (((F * 2.0) * B) * B)));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = 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_0)) * 2.0))) / Float64(t_0 - (B ^ 2.0))) t_2 = Float64(Float64(B * B) / C) t_3 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_4 = Float64(-t_3) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(sqrt(Float64(fma(Float64(C * A), -4.0, Float64(B * B)) * Float64(Float64(F * 2.0) * Float64(fma(t_2, -0.5, A) + A)))) / t_4); elseif (t_1 <= -1e-191) tmp = Float64(sqrt(Float64(Float64(Float64(t_3 * F) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) * 2.0)) / t_4); elseif (t_1 <= Inf) tmp = Float64(sqrt(Float64(Float64(fma(-0.5, t_2, A) + A) * Float64(t_3 * Float64(F * 2.0)))) / t_4); else tmp = Float64(Float64(Float64(Float64(sqrt(2.0) * sqrt(Float64(1.0 / A))) * 0.25) / C) * sqrt(fma(Float64(Float64(-4.0 * C) * Float64(F * 2.0)), A, Float64(Float64(Float64(F * 2.0) * 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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = 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$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision]}, Block[{t$95$3 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$3)}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Sqrt[N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * N[(N[(t$95$2 * -0.5 + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$1, -1e-191], N[(N[Sqrt[N[(N[(N[(t$95$3 * F), $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] * 2.0), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * t$95$2 + A), $MachinePrecision] + A), $MachinePrecision] * N[(t$95$3 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(1.0 / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(N[(-4.0 * C), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * A + N[(N[(N[(F * 2.0), $MachinePrecision] * B), $MachinePrecision] * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := \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\_0\right)\right) \cdot 2\right)}}{t\_0 - {B}^{2}}\\
t_2 := \frac{B \cdot B}{C}\\
t_3 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_4 := -t\_3\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot \left(\left(F \cdot 2\right) \cdot \left(\mathsf{fma}\left(t\_2, -0.5, A\right) + A\right)\right)}}{t\_4}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-191}:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_3 \cdot F\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)\right) \cdot 2}}{t\_4}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, t\_2, A\right) + A\right) \cdot \left(t\_3 \cdot \left(F \cdot 2\right)\right)}}{t\_4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(\sqrt{2} \cdot \sqrt{\frac{1}{A}}\right) \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(\left(-4 \cdot C\right) \cdot \left(F \cdot 2\right), A, \left(\left(F \cdot 2\right) \cdot B\right) \cdot B\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 3.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-*.f6419.4
Applied rewrites19.4%
Applied rewrites19.4%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
distribute-lft-inN/A
lift-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
Applied rewrites21.5%
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))) < -1e-191Initial program 99.0%
Applied rewrites0.0%
Applied rewrites98.9%
if -1e-191 < (/.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 20.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-*.f6419.3
Applied rewrites19.3%
Applied rewrites19.3%
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))) Initial program 0.0%
Applied rewrites0.0%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites2.1%
Taylor expanded in C around inf
Applied rewrites3.8%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
distribute-lft-inN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
Applied rewrites4.7%
Final simplification23.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 (* -4.0 C) A (* B B))))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0))))
(t_3 (/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) t_0)))
(if (<= t_2 -2e+153)
t_3
(if (<= t_2 -1e-164) (/ (sqrt (* (* (* (* B B) B) F) -2.0)) t_0) t_3))))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 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double t_3 = sqrt((((((A + A) * F) * C) * A) * -8.0)) / t_0;
double tmp;
if (t_2 <= -2e+153) {
tmp = t_3;
} else if (t_2 <= -1e-164) {
tmp = sqrt(((((B * B) * B) * F) * -2.0)) / t_0;
} else {
tmp = t_3;
}
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))) t_1 = Float64(C * Float64(A * 4.0)) t_2 = 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))) / Float64(t_1 - (B ^ 2.0))) t_3 = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / t_0) tmp = 0.0 if (t_2 <= -2e+153) tmp = t_3; elseif (t_2 <= -1e-164) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.0)) / t_0); else tmp = 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 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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]}, If[LessEqual[t$95$2, -2e+153], t$95$3, If[LessEqual[t$95$2, -1e-164], N[(N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], t$95$3]]]]]]
\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 := C \cdot \left(A \cdot 4\right)\\
t_2 := \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\_1 - {B}^{2}}\\
t_3 := \frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_0}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+153}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-164}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;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))) < -2e153 or -9.99999999999999962e-165 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 9.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-*.f6410.5
Applied rewrites10.5%
Applied rewrites10.5%
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.f649.4
Applied rewrites9.4%
if -2e153 < (/.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))) < -9.99999999999999962e-165Initial program 98.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-*.f647.6
Applied rewrites7.6%
Applied rewrites7.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.9
Applied rewrites16.9%
Final simplification10.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 (* -4.0 C) A (* B B))))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0))))
(t_3 (/ (sqrt (* (* (* (* A A) C) F) -16.0)) t_0)))
(if (<= t_2 -2e+153)
t_3
(if (<= t_2 -1e-164) (/ (sqrt (* (* (* (* B B) B) F) -2.0)) t_0) t_3))))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 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double t_3 = sqrt(((((A * A) * C) * F) * -16.0)) / t_0;
double tmp;
if (t_2 <= -2e+153) {
tmp = t_3;
} else if (t_2 <= -1e-164) {
tmp = sqrt(((((B * B) * B) * F) * -2.0)) / t_0;
} else {
tmp = t_3;
}
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))) t_1 = Float64(C * Float64(A * 4.0)) t_2 = 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))) / Float64(t_1 - (B ^ 2.0))) t_3 = Float64(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / t_0) tmp = 0.0 if (t_2 <= -2e+153) tmp = t_3; elseif (t_2 <= -1e-164) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.0)) / t_0); else tmp = 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 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision])}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+153], t$95$3, If[LessEqual[t$95$2, -1e-164], N[(N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], t$95$3]]]]]]
\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 := C \cdot \left(A \cdot 4\right)\\
t_2 := \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\_1 - {B}^{2}}\\
t_3 := \frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{t\_0}\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+153}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-164}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;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))) < -2e153 or -9.99999999999999962e-165 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 9.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-*.f6410.5
Applied rewrites10.5%
Applied rewrites10.5%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f647.5
Applied rewrites7.5%
if -2e153 < (/.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))) < -9.99999999999999962e-165Initial program 98.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-*.f647.6
Applied rewrites7.6%
Applied rewrites7.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6416.9
Applied rewrites16.9%
Final simplification8.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) 5e-41)
(/ (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) <= 5e-41) {
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) <= 5e-41) 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], 5e-41], 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 5 \cdot 10^{-41}:\\
\;\;\;\;\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)) < 4.9999999999999996e-41Initial program 24.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-*.f6416.9
Applied rewrites16.9%
Applied rewrites16.9%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6418.2
Applied rewrites18.2%
if 4.9999999999999996e-41 < (pow.f64 B #s(literal 2 binary64)) Initial program 13.9%
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-*.f648.8
Applied rewrites8.8%
Final simplification13.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 A (* -4.0 C) (* B B))) (t_1 (fma (* -4.0 C) A (* B B))))
(if (<= C -1.2e-250)
(/ (sqrt (* (+ A A) (* t_1 (* F 2.0)))) (- t_1))
(if (<= C 2.8e-74)
(*
(sqrt
(*
(/
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))
(fma (* -4.0 A) C (* B B)))
F))
(- (sqrt 2.0)))
(/
(sqrt (* (fma (* -0.5 B) (/ B C) (+ A A)) (* (* t_0 2.0) F)))
(- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(A, (-4.0 * C), (B * B));
double t_1 = fma((-4.0 * C), A, (B * B));
double tmp;
if (C <= -1.2e-250) {
tmp = sqrt(((A + A) * (t_1 * (F * 2.0)))) / -t_1;
} else if (C <= 2.8e-74) {
tmp = sqrt(((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) / fma((-4.0 * A), C, (B * B))) * F)) * -sqrt(2.0);
} else {
tmp = sqrt((fma((-0.5 * B), (B / C), (A + A)) * ((t_0 * 2.0) * F))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(A, Float64(-4.0 * C), Float64(B * B)) t_1 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if (C <= -1.2e-250) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_1 * Float64(F * 2.0)))) / Float64(-t_1)); elseif (C <= 2.8e-74) 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))); else tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B), Float64(B / C), Float64(A + A)) * Float64(Float64(t_0 * 2.0) * F))) / 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[(A * N[(-4.0 * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[C, -1.2e-250], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$1 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[C, 2.8e-74], 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], N[(N[Sqrt[N[(N[(N[(-0.5 * B), $MachinePrecision] * N[(B / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * 2.0), $MachinePrecision] * F), $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(A, -4 \cdot C, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;C \leq -1.2 \cdot 10^{-250}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_1 \cdot \left(F \cdot 2\right)\right)}}{-t\_1}\\
\mathbf{elif}\;C \leq 2.8 \cdot 10^{-74}:\\
\;\;\;\;\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)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5 \cdot B, \frac{B}{C}, A + A\right) \cdot \left(\left(t\_0 \cdot 2\right) \cdot F\right)}}{-t\_0}\\
\end{array}
\end{array}
if C < -1.1999999999999999e-250Initial program 21.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-*.f642.6
Applied rewrites2.6%
Applied rewrites2.6%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f643.8
Applied rewrites3.8%
if -1.1999999999999999e-250 < C < 2.79999999999999988e-74Initial program 34.1%
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 rewrites34.4%
if 2.79999999999999988e-74 < C Initial program 3.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-*.f6422.7
Applied rewrites22.7%
Applied rewrites22.7%
Applied rewrites22.7%
Final simplification16.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 (* -4.0 C) A (* B B))) (t_1 (- t_0)))
(if (<= C -1.2e-250)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) t_1)
(if (<= C 3e+49)
(*
(sqrt
(*
(/
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))
(fma (* -4.0 A) C (* B B)))
F))
(- (sqrt 2.0)))
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) t_1)))))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 = -t_0;
double tmp;
if (C <= -1.2e-250) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / t_1;
} else if (C <= 3e+49) {
tmp = sqrt(((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) / fma((-4.0 * A), C, (B * B))) * F)) * -sqrt(2.0);
} else {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / t_1;
}
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 = Float64(-t_0) tmp = 0.0 if (C <= -1.2e-250) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / t_1); elseif (C <= 3e+49) 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))); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[C, -1.2e-250], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[C, 3e+49], 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], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $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(-4 \cdot C, A, B \cdot B\right)\\
t_1 := -t\_0\\
\mathbf{if}\;C \leq -1.2 \cdot 10^{-250}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{t\_1}\\
\mathbf{elif}\;C \leq 3 \cdot 10^{+49}:\\
\;\;\;\;\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)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_1}\\
\end{array}
\end{array}
if C < -1.1999999999999999e-250Initial program 21.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-*.f642.6
Applied rewrites2.6%
Applied rewrites2.6%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f643.8
Applied rewrites3.8%
if -1.1999999999999999e-250 < C < 3.0000000000000002e49Initial program 27.4%
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.1%
if 3.0000000000000002e49 < C Initial program 1.4%
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-*.f6424.8
Applied rewrites24.8%
Applied rewrites24.8%
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.f6419.7
Applied rewrites19.7%
Final simplification14.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))) (t_1 (- t_0)))
(if (<= C -2.8e-225)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) t_1)
(if (<= C 9.5e-186)
(/
1.0
(*
(/ (- B) (sqrt 2.0))
(sqrt (/ 1.0 (* (- A (sqrt (fma A A (* B B)))) F)))))
(if (<= C 1.1e+49)
(-
(sqrt
(*
(*
(/ F (fma (* C A) -4.0 (* B B)))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B)))))
2.0)))
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) t_1))))))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 = -t_0;
double tmp;
if (C <= -2.8e-225) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / t_1;
} else if (C <= 9.5e-186) {
tmp = 1.0 / ((-B / sqrt(2.0)) * sqrt((1.0 / ((A - sqrt(fma(A, A, (B * B)))) * F))));
} else if (C <= 1.1e+49) {
tmp = -sqrt((((F / fma((C * A), -4.0, (B * B))) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B))))) * 2.0));
} else {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / t_1;
}
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 = Float64(-t_0) tmp = 0.0 if (C <= -2.8e-225) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / t_1); elseif (C <= 9.5e-186) tmp = Float64(1.0 / Float64(Float64(Float64(-B) / sqrt(2.0)) * sqrt(Float64(1.0 / Float64(Float64(A - sqrt(fma(A, A, Float64(B * B)))) * F))))); elseif (C <= 1.1e+49) tmp = Float64(-sqrt(Float64(Float64(Float64(F / fma(Float64(C * A), -4.0, Float64(B * B))) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) * 2.0))); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[C, -2.8e-225], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[C, 9.5e-186], N[(1.0 / N[(N[((-B) / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(N[(A - N[Sqrt[N[(A * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[C, 1.1e+49], (-N[Sqrt[N[(N[(N[(F / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]), $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] * 2.0), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $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(-4 \cdot C, A, B \cdot B\right)\\
t_1 := -t\_0\\
\mathbf{if}\;C \leq -2.8 \cdot 10^{-225}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{t\_1}\\
\mathbf{elif}\;C \leq 9.5 \cdot 10^{-186}:\\
\;\;\;\;\frac{1}{\frac{-B}{\sqrt{2}} \cdot \sqrt{\frac{1}{\left(A - \sqrt{\mathsf{fma}\left(A, A, B \cdot B\right)}\right) \cdot F}}}\\
\mathbf{elif}\;C \leq 1.1 \cdot 10^{+49}:\\
\;\;\;\;-\sqrt{\left(\frac{F}{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)} \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)\right) \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_1}\\
\end{array}
\end{array}
if C < -2.8e-225Initial program 20.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-*.f642.7
Applied rewrites2.7%
Applied rewrites2.7%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f644.1
Applied rewrites4.1%
if -2.8e-225 < C < 9.4999999999999998e-186Initial program 32.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-*.f641.7
Applied rewrites1.7%
Applied rewrites1.7%
Taylor expanded in C around 0
mul-1-negN/A
lower-neg.f64N/A
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-*.f6419.9
Applied rewrites19.9%
if 9.4999999999999998e-186 < C < 1.1e49Initial program 22.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-*.f6417.4
Applied rewrites17.4%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites23.7%
Applied rewrites25.8%
if 1.1e49 < C Initial program 1.4%
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-*.f6424.8
Applied rewrites24.8%
Applied rewrites24.8%
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.f6419.7
Applied rewrites19.7%
Final simplification14.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))) (t_1 (- t_0)))
(if (<= C -3.8e-223)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) t_1)
(if (<= C 3.2e-184)
(* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B))
(if (<= C 1.1e+49)
(-
(sqrt
(*
(*
(/ F (fma (* C A) -4.0 (* B B)))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B)))))
2.0)))
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) t_1))))))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 = -t_0;
double tmp;
if (C <= -3.8e-223) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / t_1;
} else if (C <= 3.2e-184) {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-sqrt(2.0) / B);
} else if (C <= 1.1e+49) {
tmp = -sqrt((((F / fma((C * A), -4.0, (B * B))) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B))))) * 2.0));
} else {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / t_1;
}
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 = Float64(-t_0) tmp = 0.0 if (C <= -3.8e-223) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / t_1); elseif (C <= 3.2e-184) tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(Float64(-sqrt(2.0)) / B)); elseif (C <= 1.1e+49) tmp = Float64(-sqrt(Float64(Float64(Float64(F / fma(Float64(C * A), -4.0, Float64(B * B))) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) * 2.0))); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.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[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[C, -3.8e-223], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[C, 3.2e-184], 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], If[LessEqual[C, 1.1e+49], (-N[Sqrt[N[(N[(N[(F / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]), $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] * 2.0), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $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(-4 \cdot C, A, B \cdot B\right)\\
t_1 := -t\_0\\
\mathbf{if}\;C \leq -3.8 \cdot 10^{-223}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{t\_1}\\
\mathbf{elif}\;C \leq 3.2 \cdot 10^{-184}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\mathbf{elif}\;C \leq 1.1 \cdot 10^{+49}:\\
\;\;\;\;-\sqrt{\left(\frac{F}{\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)} \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)\right) \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_1}\\
\end{array}
\end{array}
if C < -3.80000000000000012e-223Initial program 21.3%
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-*.f642.8
Applied rewrites2.8%
Applied rewrites2.8%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f644.1
Applied rewrites4.1%
if -3.80000000000000012e-223 < C < 3.2e-184Initial program 30.7%
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-*.f6419.5
Applied rewrites19.5%
if 3.2e-184 < C < 1.1e49Initial program 22.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-*.f6417.4
Applied rewrites17.4%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites23.7%
Applied rewrites25.8%
if 1.1e49 < C Initial program 1.4%
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-*.f6424.8
Applied rewrites24.8%
Applied rewrites24.8%
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.f6419.7
Applied rewrites19.7%
Final simplification14.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 (* -4.0 C) A (* B B))))
(if (<= A -3.1e-111)
(/ (sqrt (* (+ A A) (* t_0 (* F 2.0)))) (- t_0))
(if (<= A 4.1e-231)
(* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B))
(*
(/ (* (sqrt (/ 2.0 A)) 0.25) C)
(sqrt (* (fma -4.0 (* C A) (* 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 (A <= -3.1e-111) {
tmp = sqrt(((A + A) * (t_0 * (F * 2.0)))) / -t_0;
} else if (A <= 4.1e-231) {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-sqrt(2.0) / B);
} else {
tmp = ((sqrt((2.0 / A)) * 0.25) / C) * sqrt((fma(-4.0, (C * A), (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 (A <= -3.1e-111) tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(t_0 * Float64(F * 2.0)))) / Float64(-t_0)); elseif (A <= 4.1e-231) tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(Float64(-sqrt(2.0)) / B)); else tmp = Float64(Float64(Float64(sqrt(Float64(2.0 / A)) * 0.25) / C) * sqrt(Float64(fma(-4.0, Float64(C * A), Float64(B * B)) * Float64(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[A, -3.1e-111], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[A, 4.1e-231], 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], N[(N[(N[(N[Sqrt[N[(2.0 / A), $MachinePrecision]], $MachinePrecision] * 0.25), $MachinePrecision] / C), $MachinePrecision] * N[Sqrt[N[(N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision] * N[(F * 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}\;A \leq -3.1 \cdot 10^{-111}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(t\_0 \cdot \left(F \cdot 2\right)\right)}}{-t\_0}\\
\mathbf{elif}\;A \leq 4.1 \cdot 10^{-231}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\frac{2}{A}} \cdot 0.25}{C} \cdot \sqrt{\mathsf{fma}\left(-4, C \cdot A, B \cdot B\right) \cdot \left(F \cdot 2\right)}\\
\end{array}
\end{array}
if A < -3.10000000000000014e-111Initial program 15.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-*.f6416.3
Applied rewrites16.3%
Applied rewrites16.3%
Taylor expanded in C around inf
lower--.f64N/A
mul-1-negN/A
lower-neg.f6421.4
Applied rewrites21.4%
if -3.10000000000000014e-111 < A < 4.1000000000000002e-231Initial program 34.3%
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-*.f6412.7
Applied rewrites12.7%
if 4.1000000000000002e-231 < A Initial program 12.2%
Applied rewrites0.8%
Taylor expanded in C around inf
lower-/.f64N/A
Applied rewrites4.0%
Taylor expanded in C around inf
Applied rewrites7.3%
Applied rewrites7.3%
Final simplification12.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
(/
(sqrt (* (* (* (* (+ A A) F) C) A) -8.0))
(- (fma (* -4.0 C) A (* B B))))))
(if (<= C -2.6e-184)
t_0
(if (<= C 9e-141)
(* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B))
t_0))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = sqrt((((((A + A) * F) * C) * A) * -8.0)) / -fma((-4.0 * C), A, (B * B));
double tmp;
if (C <= -2.6e-184) {
tmp = t_0;
} else if (C <= 9e-141) {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-sqrt(2.0) / B);
} else {
tmp = t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(-fma(Float64(-4.0 * C), A, Float64(B * B)))) tmp = 0.0 if (C <= -2.6e-184) tmp = t_0; elseif (C <= 9e-141) tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(Float64(-sqrt(2.0)) / B)); else tmp = 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[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]}, If[LessEqual[C, -2.6e-184], t$95$0, If[LessEqual[C, 9e-141], 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], t$95$0]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \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{if}\;C \leq -2.6 \cdot 10^{-184}:\\
\;\;\;\;t\_0\\
\mathbf{elif}\;C \leq 9 \cdot 10^{-141}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\mathbf{else}:\\
\;\;\;\;t\_0\\
\end{array}
\end{array}
if C < -2.59999999999999978e-184 or 9.0000000000000001e-141 < C Initial program 15.4%
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%
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.f6411.2
Applied rewrites11.2%
if -2.59999999999999978e-184 < C < 9.0000000000000001e-141Initial program 28.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-*.f6419.1
Applied rewrites19.1%
Final simplification13.1%
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 18.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-*.f6410.2
Applied rewrites10.2%
Applied rewrites10.2%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f647.6
Applied rewrites7.6%
Final simplification7.6%
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) A) 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(((((C * C) * A) * 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(C * C) * A) * 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[(C * C), $MachinePrecision] * A), $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(C \cdot C\right) \cdot A\right) \cdot F\right) \cdot -16}}{-\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)}
\end{array}
Initial program 18.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-*.f6410.2
Applied rewrites10.2%
Applied rewrites10.2%
Taylor expanded in C around -inf
lower-*.f64N/A
associate-*r*N/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 18.5%
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-/.f641.9
Applied rewrites1.9%
Applied rewrites1.9%
Applied rewrites1.9%
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 18.5%
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-/.f641.9
Applied rewrites1.9%
Applied rewrites1.9%
Applied rewrites1.9%
Applied rewrites1.9%
Final simplification1.9%
herbie shell --seed 2024240
(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))))