
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
(/
(-
(sqrt
(*
(* 2.0 (* t_0 F))
(- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
t_0)))
double code(double A, double B, double C, double F) {
double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
real(8) :: t_0
t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F): t_0 = math.pow(B, 2.0) - ((4.0 * A) * C) return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F) t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C)) return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0) end
function tmp = code(A, B, C, F) t_0 = (B ^ 2.0) - ((4.0 * A) * C); tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0; end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma (* A C) -4.0 (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2 (* 2.0 (* (- (pow B 2.0) t_1) F)))
(t_3 (- t_1 (pow B 2.0)))
(t_4
(/
(sqrt (* t_2 (- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (fma 2.0 (* B B) (* -8.0 (* A C)))) (sqrt (* F (+ A A)))) t_3)
(if (<= t_4 -4e-214)
(/
(*
(sqrt (* 2.0 (fma B B (* C (* A -4.0)))))
(sqrt (* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
t_3)
(if (<= t_4 2e+63)
(/ (sqrt (* t_2 (+ A (fma (/ (* B B) C) -0.5 A)))) t_3)
(if (<= t_4 INFINITY)
(/ (* (sqrt (* A -16.0)) (sqrt (* A (* C F)))) (- t_0))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = 2.0 * ((pow(B, 2.0) - t_1) * F);
double t_3 = t_1 - pow(B, 2.0);
double t_4 = sqrt((t_2 * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(fma(2.0, (B * B), (-8.0 * (A * C)))) * sqrt((F * (A + A)))) / t_3;
} else if (t_4 <= -4e-214) {
tmp = (sqrt((2.0 * fma(B, B, (C * (A * -4.0))))) * sqrt((F * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))))))) / t_3;
} else if (t_4 <= 2e+63) {
tmp = sqrt((t_2 * (A + fma(((B * B) / C), -0.5, A)))) / t_3;
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt((A * -16.0)) * sqrt((A * (C * F)))) / -t_0;
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) t_3 = Float64(t_1 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(t_2 * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(2.0, Float64(B * B), Float64(-8.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(A + A)))) / t_3); elseif (t_4 <= -4e-214) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(B, B, Float64(C * Float64(A * -4.0))))) * sqrt(Float64(F * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))))) / t_3); elseif (t_4 <= 2e+63) tmp = Float64(sqrt(Float64(t_2 * Float64(A + fma(Float64(Float64(B * B) / C), -0.5, A)))) / t_3); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(A * -16.0)) * sqrt(Float64(A * Float64(C * F)))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$2 * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * N[(B * B), $MachinePrecision] + N[(-8.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -4e-214], N[(N[(N[Sqrt[N[(2.0 * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 2e+63], N[(N[Sqrt[N[(t$95$2 * N[(A + N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5 + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(A * -16.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := 2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\\
t_3 := t\_1 - {B}^{2}\\
t_4 := \frac{\sqrt{t\_2 \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, B \cdot B, -8 \cdot \left(A \cdot C\right)\right)} \cdot \sqrt{F \cdot \left(A + A\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)} \cdot \sqrt{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq 2 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{t\_2 \cdot \left(A + \mathsf{fma}\left(\frac{B \cdot B}{C}, -0.5, A\right)\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{A \cdot -16} \cdot \sqrt{A \cdot \left(C \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites25.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites97.6%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 2.00000000000000012e63Initial program 16.4%
Taylor expanded in C around inf
associate--l+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f6429.7
Applied rewrites29.7%
if 2.00000000000000012e63 < (/.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 30.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6430.5
Applied rewrites30.5%
Applied rewrites30.5%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6416.8
Applied rewrites16.8%
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6439.0
Applied rewrites39.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification34.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 (* A C) (* B B)))
(t_1 (fma (* A C) -4.0 (* B B)))
(t_2 (* (* 4.0 A) C))
(t_3 (- t_2 (pow B 2.0)))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (fma 2.0 (* B B) (* -8.0 (* A C)))) (sqrt (* F (+ A A)))) t_3)
(if (<= t_4 -4e-214)
(/
(*
(sqrt (* 2.0 (fma B B (* C (* A -4.0)))))
(sqrt (* F (- (+ A C) (sqrt (fma (- A C) (- A C) (* B B)))))))
t_3)
(if (<= t_4 1e+171)
(* (sqrt (* (* A F) t_0)) (/ (- 2.0) t_0))
(if (<= t_4 INFINITY)
(/ (* (sqrt (* A -16.0)) (sqrt (* A (* C F)))) (- t_1))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) 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, (A * C), (B * B));
double t_1 = fma((A * C), -4.0, (B * B));
double t_2 = (4.0 * A) * C;
double t_3 = t_2 - pow(B, 2.0);
double t_4 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(fma(2.0, (B * B), (-8.0 * (A * C)))) * sqrt((F * (A + A)))) / t_3;
} else if (t_4 <= -4e-214) {
tmp = (sqrt((2.0 * fma(B, B, (C * (A * -4.0))))) * sqrt((F * ((A + C) - sqrt(fma((A - C), (A - C), (B * B))))))) / t_3;
} else if (t_4 <= 1e+171) {
tmp = sqrt(((A * F) * t_0)) * (-2.0 / t_0);
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt((A * -16.0)) * sqrt((A * (C * F)))) / -t_1;
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_1;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B * B)) t_1 = fma(Float64(A * C), -4.0, Float64(B * B)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(t_2 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(2.0, Float64(B * B), Float64(-8.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(A + A)))) / t_3); elseif (t_4 <= -4e-214) tmp = Float64(Float64(sqrt(Float64(2.0 * fma(B, B, Float64(C * Float64(A * -4.0))))) * sqrt(Float64(F * Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))))) / t_3); elseif (t_4 <= 1e+171) tmp = Float64(sqrt(Float64(Float64(A * F) * t_0)) * Float64(Float64(-2.0) / t_0)); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(A * -16.0)) * sqrt(Float64(A * Float64(C * F)))) / Float64(-t_1)); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_1); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * N[(B * B), $MachinePrecision] + N[(-8.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -4e-214], N[(N[(N[Sqrt[N[(2.0 * N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 1e+171], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(A * -16.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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, A \cdot C, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(A \cdot C, -4, B \cdot B\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := t\_2 - {B}^{2}\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, B \cdot B, -8 \cdot \left(A \cdot C\right)\right)} \cdot \sqrt{F \cdot \left(A + A\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{2 \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)} \cdot \sqrt{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq 10^{+171}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_0} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{A \cdot -16} \cdot \sqrt{A \cdot \left(C \cdot F\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_1}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites25.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites97.6%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.99999999999999954e170Initial program 23.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6427.1
Applied rewrites27.1%
Applied rewrites29.4%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval29.3
Applied rewrites29.3%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites29.4%
if 9.99999999999999954e170 < (/.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 14.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.6
Applied rewrites25.6%
Applied rewrites25.6%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f648.9
Applied rewrites8.9%
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6436.1
Applied rewrites36.1%
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%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification34.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 C) -4.0 (* B B)))
(t_1 (fma -4.0 (* A C) (* B B)))
(t_2 (* (* 4.0 A) C))
(t_3 (- t_2 (pow B 2.0)))
(t_4
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
t_3)))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (fma 2.0 (* B B) (* -8.0 (* A C)))) (sqrt (* F (+ A A)))) t_3)
(if (<= t_4 -4e-214)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (fma B B (* C (* A -4.0))) (* 2.0 F))))
(fma B (- B) (* A (* 4.0 C))))
(if (<= t_4 1e+171)
(* (sqrt (* (* A F) t_1)) (/ (- 2.0) t_1))
(if (<= t_4 INFINITY)
(/ (* (sqrt (* A -16.0)) (sqrt (* A (* C F)))) (- t_0))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = fma(-4.0, (A * C), (B * B));
double t_2 = (4.0 * A) * C;
double t_3 = t_2 - pow(B, 2.0);
double t_4 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / t_3;
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(fma(2.0, (B * B), (-8.0 * (A * C)))) * sqrt((F * (A + A)))) / t_3;
} else if (t_4 <= -4e-214) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * (fma(B, B, (C * (A * -4.0))) * (2.0 * F)))) / fma(B, -B, (A * (4.0 * C)));
} else if (t_4 <= 1e+171) {
tmp = sqrt(((A * F) * t_1)) * (-2.0 / t_1);
} else if (t_4 <= ((double) INFINITY)) {
tmp = (sqrt((A * -16.0)) * sqrt((A * (C * F)))) / -t_0;
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = fma(-4.0, Float64(A * C), Float64(B * B)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(t_2 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / t_3) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(fma(2.0, Float64(B * B), Float64(-8.0 * Float64(A * C)))) * sqrt(Float64(F * Float64(A + A)))) / t_3); elseif (t_4 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(fma(B, B, Float64(C * Float64(A * -4.0))) * Float64(2.0 * F)))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); elseif (t_4 <= 1e+171) tmp = Float64(sqrt(Float64(Float64(A * F) * t_1)) * Float64(Float64(-2.0) / t_1)); elseif (t_4 <= Inf) tmp = Float64(Float64(sqrt(Float64(A * -16.0)) * sqrt(Float64(A * Float64(C * F)))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(2.0 * N[(B * B), $MachinePrecision] + N[(-8.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -4e-214], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 1e+171], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(A * -16.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := t\_2 - {B}^{2}\\
t_4 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(2, B \cdot B, -8 \cdot \left(A \cdot C\right)\right)} \cdot \sqrt{F \cdot \left(A + A\right)}}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right) \cdot \left(2 \cdot F\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{elif}\;t\_4 \leq 10^{+171}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_1} \cdot \frac{-2}{t\_1}\\
\mathbf{elif}\;t\_4 \leq \infty:\\
\;\;\;\;\frac{\sqrt{A \cdot -16} \cdot \sqrt{A \cdot \left(C \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Applied rewrites25.8%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites96.1%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.99999999999999954e170Initial program 23.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6427.1
Applied rewrites27.1%
Applied rewrites29.4%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval29.3
Applied rewrites29.3%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites29.4%
if 9.99999999999999954e170 < (/.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 14.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.6
Applied rewrites25.6%
Applied rewrites25.6%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f648.9
Applied rewrites8.9%
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6436.1
Applied rewrites36.1%
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%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification33.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* A C) (* B B)))
(t_1 (fma (* A C) -4.0 (* B B)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B 2.0)))))
(if (<= t_3 (- INFINITY))
(* -2.0 (sqrt (/ (* A F) t_0)))
(if (<= t_3 -4e-214)
(/
(sqrt
(*
(- (+ A C) (sqrt (fma (- A C) (- A C) (* B B))))
(* (fma B B (* C (* A -4.0))) (* 2.0 F))))
(fma B (- B) (* A (* 4.0 C))))
(if (<= t_3 1e+171)
(* (sqrt (* (* A F) t_0)) (/ (- 2.0) t_0))
(if (<= t_3 INFINITY)
(/ (* (sqrt (* A -16.0)) (sqrt (* A (* C F)))) (- t_1))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) 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, (A * C), (B * B));
double t_1 = fma((A * C), -4.0, (B * B));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = -2.0 * sqrt(((A * F) / t_0));
} else if (t_3 <= -4e-214) {
tmp = sqrt((((A + C) - sqrt(fma((A - C), (A - C), (B * B)))) * (fma(B, B, (C * (A * -4.0))) * (2.0 * F)))) / fma(B, -B, (A * (4.0 * C)));
} else if (t_3 <= 1e+171) {
tmp = sqrt(((A * F) * t_0)) * (-2.0 / t_0);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((A * -16.0)) * sqrt((A * (C * F)))) / -t_1;
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_1;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B * B)) t_1 = fma(Float64(A * C), -4.0, Float64(B * B)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_0))); elseif (t_3 <= -4e-214) tmp = Float64(sqrt(Float64(Float64(Float64(A + C) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) * Float64(fma(B, B, Float64(C * Float64(A * -4.0))) * Float64(2.0 * F)))) / fma(B, Float64(-B), Float64(A * Float64(4.0 * C)))); elseif (t_3 <= 1e+171) tmp = Float64(sqrt(Float64(Float64(A * F) * t_0)) * Float64(Float64(-2.0) / t_0)); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(A * -16.0)) * sqrt(Float64(A * Float64(C * F)))) / Float64(-t_1)); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_1); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -4e-214], N[(N[Sqrt[N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(B * B + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(B * (-B) + N[(A * N[(4.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 1e+171], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(A * -16.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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, A \cdot C, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(A \cdot C, -4, B \cdot B\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_0}}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{\left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot \left(\mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right) \cdot \left(2 \cdot F\right)\right)}}{\mathsf{fma}\left(B, -B, A \cdot \left(4 \cdot C\right)\right)}\\
\mathbf{elif}\;t\_3 \leq 10^{+171}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_0} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{A \cdot -16} \cdot \sqrt{A \cdot \left(C \cdot F\right)}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_1}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 2.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.9
Applied rewrites14.9%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6422.1
Applied rewrites22.1%
if -inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 96.0%
Applied rewrites96.1%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.99999999999999954e170Initial program 23.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6427.1
Applied rewrites27.1%
Applied rewrites29.4%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval29.3
Applied rewrites29.3%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites29.4%
if 9.99999999999999954e170 < (/.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 14.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.6
Applied rewrites25.6%
Applied rewrites25.6%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f648.9
Applied rewrites8.9%
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6436.1
Applied rewrites36.1%
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%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification33.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 (* A C) -4.0 (* B B)))
(t_1 (fma -4.0 (* A C) (* B B)))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B 2.0)))))
(if (<= t_3 -5e+168)
(* -2.0 (sqrt (/ (* A F) t_1)))
(if (<= t_3 -2e-153)
(*
(sqrt (/ (* F (- (+ A C) (sqrt (fma B B (* (- A C) (- A C)))))) t_0))
(- (sqrt 2.0)))
(if (<= t_3 1e+171)
(* (sqrt (* (* A F) t_1)) (/ (- 2.0) t_1))
(if (<= t_3 INFINITY)
(/ (* (sqrt (* A -16.0)) (sqrt (* A (* C F)))) (- t_0))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = fma(-4.0, (A * C), (B * B));
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -5e+168) {
tmp = -2.0 * sqrt(((A * F) / t_1));
} else if (t_3 <= -2e-153) {
tmp = sqrt(((F * ((A + C) - sqrt(fma(B, B, ((A - C) * (A - C)))))) / t_0)) * -sqrt(2.0);
} else if (t_3 <= 1e+171) {
tmp = sqrt(((A * F) * t_1)) * (-2.0 / t_1);
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((A * -16.0)) * sqrt((A * (C * F)))) / -t_0;
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = fma(-4.0, Float64(A * C), Float64(B * B)) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= -5e+168) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / t_1))); elseif (t_3 <= -2e-153) tmp = Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(fma(B, B, Float64(Float64(A - C) * Float64(A - C)))))) / t_0)) * Float64(-sqrt(2.0))); elseif (t_3 <= 1e+171) tmp = Float64(sqrt(Float64(Float64(A * F) * t_1)) * Float64(Float64(-2.0) / t_1)); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(A * -16.0)) * sqrt(Float64(A * Float64(C * F)))) / Float64(-t_0)); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -5e+168], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -2e-153], N[(N[Sqrt[N[(N[(F * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(B * B + N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$3, 1e+171], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(A * -16.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{+168}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{t\_1}}\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{-153}:\\
\;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) - \sqrt{\mathsf{fma}\left(B, B, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{t\_0}} \cdot \left(-\sqrt{2}\right)\\
\mathbf{elif}\;t\_3 \leq 10^{+171}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_1} \cdot \frac{-2}{t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{A \cdot -16} \cdot \sqrt{A \cdot \left(C \cdot F\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999967e168Initial program 8.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.3
Applied rewrites20.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6421.1
Applied rewrites21.1%
if -4.99999999999999967e168 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000008e-153Initial program 96.3%
Taylor expanded in F around 0
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
Applied rewrites98.5%
if -2.00000000000000008e-153 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 9.99999999999999954e170Initial program 33.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.0
Applied rewrites24.0%
Applied rewrites26.0%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval25.9
Applied rewrites25.9%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites26.0%
if 9.99999999999999954e170 < (/.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 14.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.6
Applied rewrites25.6%
Applied rewrites25.6%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f648.9
Applied rewrites8.9%
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6436.1
Applied rewrites36.1%
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%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification30.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 (* A C) -4.0 (* B B)))
(t_1 (- t_0))
(t_2 (* (* 4.0 A) C))
(t_3
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_2) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_2 (pow B 2.0)))))
(if (<= t_3 -5e-30)
(* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B)))))
(if (<= t_3 -4e-214)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(if (<= t_3 2e+63)
(/ (sqrt (* A (* (* A -16.0) (* C F)))) t_1)
(if (<= t_3 INFINITY)
(/ (* (sqrt (* A -16.0)) (sqrt (* A (* C F)))) t_1)
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = -t_0;
double t_2 = (4.0 * A) * C;
double t_3 = sqrt(((2.0 * ((pow(B, 2.0) - t_2) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -5e-30) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else if (t_3 <= -4e-214) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else if (t_3 <= 2e+63) {
tmp = sqrt((A * ((A * -16.0) * (C * F)))) / t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = (sqrt((A * -16.0)) * sqrt((A * (C * F)))) / t_1;
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = Float64(-t_0) t_2 = Float64(Float64(4.0 * A) * C) t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_2) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= -5e-30) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); elseif (t_3 <= -4e-214) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); elseif (t_3 <= 2e+63) tmp = Float64(sqrt(Float64(A * Float64(Float64(A * -16.0) * Float64(C * F)))) / t_1); elseif (t_3 <= Inf) tmp = Float64(Float64(sqrt(Float64(A * -16.0)) * sqrt(Float64(A * Float64(C * F)))) / t_1); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -5e-30], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -4e-214], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], If[LessEqual[t$95$3, 2e+63], N[(N[Sqrt[N[(A * N[(N[(A * -16.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(A * -16.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(A * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := -t\_0\\
t_2 := \left(4 \cdot A\right) \cdot C\\
t_3 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_2\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{-30}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+63}:\\
\;\;\;\;\frac{\sqrt{A \cdot \left(\left(A \cdot -16\right) \cdot \left(C \cdot F\right)\right)}}{t\_1}\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\frac{\sqrt{A \cdot -16} \cdot \sqrt{A \cdot \left(C \cdot F\right)}}{t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999972e-30Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.3
Applied rewrites29.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.8
Applied rewrites29.8%
if -4.99999999999999972e-30 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 96.4%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites36.8%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < 2.00000000000000012e63Initial program 16.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.6
Applied rewrites24.6%
Applied rewrites24.6%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6424.8
Applied rewrites24.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6424.9
Applied rewrites24.9%
if 2.00000000000000012e63 < (/.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 30.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6430.5
Applied rewrites30.5%
Applied rewrites30.5%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6416.8
Applied rewrites16.8%
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
metadata-evalN/A
lower-*.f64N/A
metadata-evalN/A
pow1/2N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f6439.0
Applied rewrites39.0%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification21.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 (* A C) -4.0 (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -5e-30)
(* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B)))))
(if (<= t_2 -4e-214)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(if (<= t_2 INFINITY)
(/ (sqrt (* (* F t_0) (* 2.0 (+ A A)))) (* 4.0 (* A C)))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -5e-30) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else if (t_2 <= -4e-214) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + A)))) / (4.0 * (A * C));
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -5e-30) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); elseif (t_2 <= -4e-214) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + A)))) / Float64(4.0 * Float64(A * C))); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-30], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-214], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-30}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.99999999999999972e-30Initial program 36.8%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.3
Applied rewrites29.3%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.8
Applied rewrites29.8%
if -4.99999999999999972e-30 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 96.4%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites36.8%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 21.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6426.7
Applied rewrites26.7%
Applied rewrites26.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6426.5
Applied rewrites26.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))) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification20.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 (* A C) -4.0 (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -5e-92)
(* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B)))))
(if (<= t_2 -4e-214)
(* (sqrt (* F (- C (sqrt (fma B B (* C C)))))) (- (/ (sqrt 2.0) B)))
(if (<= t_2 INFINITY)
(/ (sqrt (* (* F t_0) (* 2.0 (+ A A)))) (* 4.0 (* A C)))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -5e-92) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else if (t_2 <= -4e-214) {
tmp = sqrt((F * (C - sqrt(fma(B, B, (C * C)))))) * -(sqrt(2.0) / B);
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + A)))) / (4.0 * (A * C));
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -5e-92) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); elseif (t_2 <= -4e-214) tmp = Float64(sqrt(Float64(F * Float64(C - sqrt(fma(B, B, Float64(C * C)))))) * Float64(-Float64(sqrt(2.0) / B))); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + A)))) / Float64(4.0 * Float64(A * C))); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-92], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-214], N[(N[Sqrt[N[(F * N[(C - N[Sqrt[N[(B * B + N[(C * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-92}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-214}:\\
\;\;\;\;\sqrt{F \cdot \left(C - \sqrt{\mathsf{fma}\left(B, B, C \cdot C\right)}\right)} \cdot \left(-\frac{\sqrt{2}}{B}\right)\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -5.00000000000000011e-92Initial program 46.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6431.0
Applied rewrites31.0%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6431.3
Applied rewrites31.3%
if -5.00000000000000011e-92 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -3.99999999999999965e-214Initial program 95.9%
Taylor expanded in A around 0
mul-1-negN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
lower-*.f64N/A
Applied rewrites47.3%
if -3.99999999999999965e-214 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0Initial program 21.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6426.7
Applied rewrites26.7%
Applied rewrites26.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6426.5
Applied rewrites26.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))) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification21.3%
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 C) -4.0 (* B B)))
(t_1 (* (* 4.0 A) C))
(t_2
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_1) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -5e-172)
(* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B)))))
(if (<= t_2 INFINITY)
(/ (sqrt (* (* F t_0) (* 2.0 (+ A A)))) (* 4.0 (* A C)))
(/ (* (sqrt (* -16.0 (* C F))) (- A)) t_0)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A * C), -4.0, (B * B));
double t_1 = (4.0 * A) * C;
double t_2 = sqrt(((2.0 * ((pow(B, 2.0) - t_1) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -5e-172) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else if (t_2 <= ((double) INFINITY)) {
tmp = sqrt(((F * t_0) * (2.0 * (A + A)))) / (4.0 * (A * C));
} else {
tmp = (sqrt((-16.0 * (C * F))) * -A) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A * C), -4.0, Float64(B * B)) t_1 = Float64(Float64(4.0 * A) * C) t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -5e-172) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); elseif (t_2 <= Inf) tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(2.0 * Float64(A + A)))) / Float64(4.0 * Float64(A * C))); else tmp = Float64(Float64(sqrt(Float64(-16.0 * Float64(C * F))) * Float64(-A)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-172], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[Sqrt[N[(N[(F * t$95$0), $MachinePrecision] * N[(2.0 * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(-16.0 * N[(C * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-A)), $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 \cdot C, -4, B \cdot B\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-172}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(2 \cdot \left(A + A\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{-16 \cdot \left(C \cdot F\right)} \cdot \left(-A\right)}{t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999999e-172Initial program 50.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.8
Applied rewrites28.8%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.3
Applied rewrites29.3%
if -4.9999999999999999e-172 < (/.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 27.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.7
Applied rewrites24.7%
Applied rewrites24.7%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6424.4
Applied rewrites24.4%
if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f643.4
Applied rewrites3.4%
Applied rewrites3.4%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f644.7
Applied rewrites4.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
sqrt-prodN/A
lift-*.f64N/A
pow2N/A
sqrt-pow1N/A
metadata-evalN/A
unpow1N/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f645.5
Applied rewrites5.5%
Final simplification19.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 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_0) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B 2.0)))
-5e-172)
(* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B)))))
(/ (sqrt (* A (* (* A -16.0) (* C F)))) (- (fma (* A C) -4.0 (* B B)))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B, 2.0) - t_0) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B, 2.0))) <= -5e-172) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else {
tmp = sqrt((A * ((A * -16.0) * (C * F)))) / -fma((A * C), -4.0, (B * B));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B ^ 2.0))) <= -5e-172) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); else tmp = Float64(sqrt(Float64(A * Float64(Float64(A * -16.0) * Float64(C * F)))) / Float64(-fma(Float64(A * C), -4.0, Float64(B * B)))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-172], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(A * N[(N[(A * -16.0), $MachinePrecision] * N[(C * F), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(N[(A * C), $MachinePrecision] * -4.0 + N[(B * B), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B}^{2}} \leq -5 \cdot 10^{-172}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{A \cdot \left(\left(A \cdot -16\right) \cdot \left(C \cdot F\right)\right)}}{-\mathsf{fma}\left(A \cdot C, -4, B \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))) < -4.9999999999999999e-172Initial program 50.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.8
Applied rewrites28.8%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.3
Applied rewrites29.3%
if -4.9999999999999999e-172 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 11.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.3
Applied rewrites12.3%
Applied rewrites12.3%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6411.3
Applied rewrites11.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6412.7
Applied rewrites12.7%
Final simplification18.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 (* (* 4.0 A) C)))
(if (<=
(/
(sqrt
(*
(* 2.0 (* (- (pow B 2.0) t_0) F))
(- (+ A C) (sqrt (+ (pow B 2.0) (pow (- A C) 2.0))))))
(- t_0 (pow B 2.0)))
-5e-172)
(* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B)))))
(/ (sqrt (* (* C F) (* -16.0 (* A A)))) (* 4.0 (* A C))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (4.0 * A) * C;
double tmp;
if ((sqrt(((2.0 * ((pow(B, 2.0) - t_0) * F)) * ((A + C) - sqrt((pow(B, 2.0) + pow((A - C), 2.0)))))) / (t_0 - pow(B, 2.0))) <= -5e-172) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else {
tmp = sqrt(((C * F) * (-16.0 * (A * A)))) / (4.0 * (A * C));
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(4.0 * A) * C) tmp = 0.0 if (Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B ^ 2.0) - t_0) * F)) * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_0 - (B ^ 2.0))) <= -5e-172) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); else tmp = Float64(sqrt(Float64(Float64(C * F) * Float64(-16.0 * Float64(A * A)))) / Float64(4.0 * Float64(A * C))); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[B, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5e-172], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(C * F), $MachinePrecision] * N[(-16.0 * N[(A * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B}^{2}} \leq -5 \cdot 10^{-172}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(C \cdot F\right) \cdot \left(-16 \cdot \left(A \cdot A\right)\right)}}{4 \cdot \left(A \cdot C\right)}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -4.9999999999999999e-172Initial program 50.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.8
Applied rewrites28.8%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6429.3
Applied rewrites29.3%
if -4.9999999999999999e-172 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 11.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6412.3
Applied rewrites12.3%
Applied rewrites12.3%
Taylor expanded in A around inf
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6411.3
Applied rewrites11.3%
Taylor expanded in A around inf
lower-*.f64N/A
lower-*.f6411.8
Applied rewrites11.8%
Final simplification18.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 (* A C) (* B B))))
(if (<= (pow B 2.0) 2e+147)
(* (sqrt (* (* A F) t_0)) (/ (- 2.0) t_0))
(if (<= (pow B 2.0) 1e+306)
(/
(* B (sqrt (* 2.0 (* F (- A (sqrt (fma B B (* A A))))))))
(- (* C 0.0) (* B B)))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B * B));
double tmp;
if (pow(B, 2.0) <= 2e+147) {
tmp = sqrt(((A * F) * t_0)) * (-2.0 / t_0);
} else if (pow(B, 2.0) <= 1e+306) {
tmp = (B * sqrt((2.0 * (F * (A - sqrt(fma(B, B, (A * A)))))))) / ((C * 0.0) - (B * B));
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 2e+147) tmp = Float64(sqrt(Float64(Float64(A * F) * t_0)) * Float64(Float64(-2.0) / t_0)); elseif ((B ^ 2.0) <= 1e+306) tmp = Float64(Float64(B * sqrt(Float64(2.0 * Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))))) / Float64(Float64(C * 0.0) - Float64(B * B))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / 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[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e+147], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e+306], N[(N[(B * N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(C * 0.0), $MachinePrecision] - N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $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, A \cdot C, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{+147}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_0} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;{B}^{2} \leq 10^{+306}:\\
\;\;\;\;\frac{B \cdot \sqrt{2 \cdot \left(F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)\right)}}{C \cdot 0 - B \cdot B}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e147Initial program 31.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6427.3
Applied rewrites27.3%
Applied rewrites27.8%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval27.8
Applied rewrites27.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites27.9%
if 2e147 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e306Initial program 33.6%
Taylor expanded in C around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6434.8
Applied rewrites34.8%
Applied rewrites34.9%
if 1.00000000000000002e306 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in B around inf
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f644.8
Applied rewrites4.8%
Final simplification24.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 (* A C) (* B B))))
(if (<= (pow B 2.0) 2e+147)
(* (sqrt (* (* A F) t_0)) (/ (- 2.0) t_0))
(if (<= (pow B 2.0) 1e+306)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B * B));
double tmp;
if (pow(B, 2.0) <= 2e+147) {
tmp = sqrt(((A * F) * t_0)) * (-2.0 / t_0);
} else if (pow(B, 2.0) <= 1e+306) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 2e+147) tmp = Float64(sqrt(Float64(Float64(A * F) * t_0)) * Float64(Float64(-2.0) / t_0)); elseif ((B ^ 2.0) <= 1e+306) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / 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[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e+147], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 1e+306], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $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, A \cdot C, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{+147}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_0} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;{B}^{2} \leq 10^{+306}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 2e147Initial program 31.4%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6427.3
Applied rewrites27.3%
Applied rewrites27.8%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval27.8
Applied rewrites27.8%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites27.9%
if 2e147 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e306Initial program 33.6%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites34.9%
if 1.00000000000000002e306 < (pow.f64 B #s(literal 2 binary64)) Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in B around inf
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f644.8
Applied rewrites4.8%
Final simplification24.2%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (if (<= (pow B 2.0) 2e+267) (* -2.0 (sqrt (/ (* A F) (fma -4.0 (* A C) (* B B))))) (* -2.0 (/ (sqrt (* A F)) B))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (pow(B, 2.0) <= 2e+267) {
tmp = -2.0 * sqrt(((A * F) / fma(-4.0, (A * C), (B * B))));
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if ((B ^ 2.0) <= 2e+267) tmp = Float64(-2.0 * sqrt(Float64(Float64(A * F) / fma(-4.0, Float64(A * C), Float64(B * B))))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e+267], N[(-2.0 * N[Sqrt[N[(N[(A * F), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{+267}:\\
\;\;\;\;-2 \cdot \sqrt{\frac{A \cdot F}{\mathsf{fma}\left(-4, A \cdot C, B \cdot B\right)}}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e267Initial program 32.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6424.2
Applied rewrites24.2%
Taylor expanded in F around 0
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6417.0
Applied rewrites17.0%
if 1.9999999999999999e267 < (pow.f64 B #s(literal 2 binary64)) Initial program 4.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.5
Applied rewrites0.5%
Taylor expanded in B around inf
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f644.4
Applied rewrites4.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 (* A C) (* B B))))
(if (<= B 7e+73)
(* (sqrt (* (* A F) t_0)) (/ (- 2.0) t_0))
(if (<= B 1.35e+154)
(*
(* B (sqrt (* 2.0 (* F (- A (sqrt (fma B B (* A A))))))))
(/ -1.0 (fma C 0.0 (* B B))))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (A * C), (B * B));
double tmp;
if (B <= 7e+73) {
tmp = sqrt(((A * F) * t_0)) * (-2.0 / t_0);
} else if (B <= 1.35e+154) {
tmp = (B * sqrt((2.0 * (F * (A - sqrt(fma(B, B, (A * A)))))))) * (-1.0 / fma(C, 0.0, (B * B)));
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(-4.0, Float64(A * C), Float64(B * B)) tmp = 0.0 if (B <= 7e+73) tmp = Float64(sqrt(Float64(Float64(A * F) * t_0)) * Float64(Float64(-2.0) / t_0)); elseif (B <= 1.35e+154) tmp = Float64(Float64(B * sqrt(Float64(2.0 * Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A)))))))) * Float64(-1.0 / fma(C, 0.0, Float64(B * B)))); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / 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[(A * C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 7e+73], N[(N[Sqrt[N[(N[(A * F), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 1.35e+154], N[(N[(B * N[Sqrt[N[(2.0 * N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(C * 0.0 + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $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, A \cdot C, B \cdot B\right)\\
\mathbf{if}\;B \leq 7 \cdot 10^{+73}:\\
\;\;\;\;\sqrt{\left(A \cdot F\right) \cdot t\_0} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;B \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\left(B \cdot \sqrt{2 \cdot \left(F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)\right)}\right) \cdot \frac{-1}{\mathsf{fma}\left(C, 0, B \cdot B\right)}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if B < 7.00000000000000004e73Initial program 27.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6422.1
Applied rewrites22.1%
Applied rewrites22.6%
pow1/2N/A
sqr-powN/A
pow2N/A
lower-pow.f64N/A
lower-pow.f64N/A
metadata-eval22.5
Applied rewrites22.5%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
lower-sqrt.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
cancel-sign-sub-invN/A
Applied rewrites22.6%
if 7.00000000000000004e73 < B < 1.35000000000000003e154Initial program 36.1%
Taylor expanded in C around 0
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f64N/A
lower-sqrt.f6457.5
Applied rewrites57.5%
Applied rewrites57.6%
if 1.35000000000000003e154 < B Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in B around inf
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f646.4
Applied rewrites6.4%
Final simplification23.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma B B (* (* A C) -4.0))))
(if (<= B 3.4e+73)
(* (sqrt (* A (* F t_0))) (/ (- 2.0) t_0))
(if (<= B 1.35e+154)
(/ (* (sqrt 2.0) (sqrt (* F (- A (sqrt (fma B B (* A A))))))) (- B))
(* -2.0 (/ (sqrt (* A F)) B))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(B, B, ((A * C) * -4.0));
double tmp;
if (B <= 3.4e+73) {
tmp = sqrt((A * (F * t_0))) * (-2.0 / t_0);
} else if (B <= 1.35e+154) {
tmp = (sqrt(2.0) * sqrt((F * (A - sqrt(fma(B, B, (A * A))))))) / -B;
} else {
tmp = -2.0 * (sqrt((A * F)) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(B, B, Float64(Float64(A * C) * -4.0)) tmp = 0.0 if (B <= 3.4e+73) tmp = Float64(sqrt(Float64(A * Float64(F * t_0))) * Float64(Float64(-2.0) / t_0)); elseif (B <= 1.35e+154) tmp = Float64(Float64(sqrt(2.0) * sqrt(Float64(F * Float64(A - sqrt(fma(B, B, Float64(A * A))))))) / Float64(-B)); else tmp = Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(B * B + N[(N[(A * C), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 3.4e+73], N[(N[Sqrt[N[(A * N[(F * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-2.0) / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 1.35e+154], N[(N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B)), $MachinePrecision], N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $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(B, B, \left(A \cdot C\right) \cdot -4\right)\\
\mathbf{if}\;B \leq 3.4 \cdot 10^{+73}:\\
\;\;\;\;\sqrt{A \cdot \left(F \cdot t\_0\right)} \cdot \frac{-2}{t\_0}\\
\mathbf{elif}\;B \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right)}}{-B}\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \frac{\sqrt{A \cdot F}}{B}\\
\end{array}
\end{array}
if B < 3.4000000000000002e73Initial program 27.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6422.1
Applied rewrites22.1%
Applied rewrites22.6%
Taylor expanded in F around 0
mul-1-negN/A
lower-neg.f64N/A
lower-*.f64N/A
Applied rewrites22.0%
if 3.4000000000000002e73 < B < 1.35000000000000003e154Initial program 36.1%
Taylor expanded in C around 0
mul-1-negN/A
associate-*l/N/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites57.5%
if 1.35000000000000003e154 < B Initial program 0.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.0
Applied rewrites0.0%
Taylor expanded in B around inf
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f646.4
Applied rewrites6.4%
Final simplification23.4%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (* -2.0 (/ (sqrt (* A F)) B)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return -2.0 * (sqrt((A * F)) / B);
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = (-2.0d0) * (sqrt((a * f)) / b)
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return -2.0 * (Math.sqrt((A * F)) / B);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return -2.0 * (math.sqrt((A * F)) / B)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(-2.0 * Float64(sqrt(Float64(A * F)) / B)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = -2.0 * (sqrt((A * F)) / B);
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(-2.0 * N[(N[Sqrt[N[(A * F), $MachinePrecision]], $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
-2 \cdot \frac{\sqrt{A \cdot F}}{B}
\end{array}
Initial program 25.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6418.2
Applied rewrites18.2%
Taylor expanded in B around inf
lower-*.f64N/A
associate-*r/N/A
*-rgt-identityN/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-*.f644.0
Applied rewrites4.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 (* F (/ 2.0 B))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((F * (2.0 / B)));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((f * (2.0d0 / b)))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((F * (2.0 / B)));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((F * (2.0 / B)))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(F * Float64(2.0 / B))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((F * (2.0 / B)));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[Sqrt[N[(F * N[(2.0 / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{F \cdot \frac{2}{B}}
\end{array}
Initial program 25.2%
Taylor expanded in B around -inf
mul-1-negN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f641.8
Applied rewrites1.8%
lift-/.f64N/A
lift-sqrt.f64N/A
mul-1-negN/A
remove-double-negN/A
lift-sqrt.f64N/A
sqrt-unprodN/A
lower-sqrt.f64N/A
lower-*.f641.8
Applied rewrites1.8%
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f641.8
Applied rewrites1.8%
herbie shell --seed 2024219
(FPCore (A B C F)
:name "ABCF->ab-angle b"
:precision binary64
(/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))