
(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 17 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) (- A C) (* B B)))
(t_1 (* C (* A 4.0)))
(t_2 (* (* F (- (pow B 2.0) t_1)) 2.0))
(t_3 (- t_1 (pow B 2.0)))
(t_4
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))) t_2))
t_3))
(t_5 (fma (* -4.0 C) A (* B B))))
(if (<= t_4 (- INFINITY))
(/ (* (sqrt (* (+ A A) F)) (* (sqrt 2.0) (sqrt t_5))) t_3)
(if (<= t_4 -5e-195)
(/
(sqrt (* (fma (fma C C (- t_0)) (/ 1.0 (+ (sqrt t_0) C)) A) t_2))
t_3)
(/
(sqrt (* (* (* F 2.0) t_5) (+ (+ (* (/ (* B B) C) -0.5) A) A)))
(- t_5))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((A - C), (A - C), (B * B));
double t_1 = C * (A * 4.0);
double t_2 = (F * (pow(B, 2.0) - t_1)) * 2.0;
double t_3 = t_1 - pow(B, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * t_2)) / t_3;
double t_5 = fma((-4.0 * C), A, (B * B));
double tmp;
if (t_4 <= -((double) INFINITY)) {
tmp = (sqrt(((A + A) * F)) * (sqrt(2.0) * sqrt(t_5))) / t_3;
} else if (t_4 <= -5e-195) {
tmp = sqrt((fma(fma(C, C, -t_0), (1.0 / (sqrt(t_0) + C)), A) * t_2)) / t_3;
} else {
tmp = sqrt((((F * 2.0) * t_5) * (((((B * B) / C) * -0.5) + A) + A))) / -t_5;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(A - C), Float64(A - C), Float64(B * B)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(Float64(F * Float64((B ^ 2.0) - t_1)) * 2.0) t_3 = Float64(t_1 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * t_2)) / t_3) t_5 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if (t_4 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * Float64(sqrt(2.0) * sqrt(t_5))) / t_3); elseif (t_4 <= -5e-195) tmp = Float64(sqrt(Float64(fma(fma(C, C, Float64(-t_0)), Float64(1.0 / Float64(sqrt(t_0) + C)), A) * t_2)) / t_3); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_5) * Float64(Float64(Float64(Float64(Float64(B * B) / C) * -0.5) + A) + A))) / Float64(-t_5)); 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] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[t$95$5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -5e-195], N[(N[Sqrt[N[(N[(N[(C * C + (-t$95$0)), $MachinePrecision] * N[(1.0 / N[(N[Sqrt[t$95$0], $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision] + A), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$5), $MachinePrecision] * N[(N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$5)), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(A - C, A - C, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \left(F \cdot \left({B}^{2} - t\_1\right)\right) \cdot 2\\
t_3 := t\_1 - {B}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot t\_2}}{t\_3}\\
t_5 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;t\_4 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot F} \cdot \left(\sqrt{2} \cdot \sqrt{t\_5}\right)}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\mathsf{fma}\left(C, C, -t\_0\right), \frac{1}{\sqrt{t\_0} + C}, A\right) \cdot t\_2}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_5\right) \cdot \left(\left(\frac{B \cdot B}{C} \cdot -0.5 + A\right) + A\right)}}{-t\_5}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.5
Applied rewrites28.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites36.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites36.2%
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))) < -5.00000000000000009e-195Initial program 96.4%
lift--.f64N/A
lift-+.f64N/A
associate--l+N/A
+-commutativeN/A
flip--N/A
div-invN/A
lower-fma.f64N/A
Applied rewrites70.0%
if -5.00000000000000009e-195 < (/.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 7.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites14.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6416.4
Applied rewrites16.4%
Final simplification29.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 (* C (* A 4.0)))
(t_1 (* (* F (- (pow B 2.0) t_0)) 2.0))
(t_2 (- t_0 (pow B 2.0)))
(t_3
(/
(sqrt (* (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))) t_1))
t_2))
(t_4 (fma (* -4.0 C) A (* B B))))
(if (<= t_3 (- INFINITY))
(/ (* (sqrt (* (+ A A) F)) (* (sqrt 2.0) (sqrt t_4))) t_2)
(if (<= t_3 -5e-195)
(/
(sqrt
(*
(fma
(* (- C A) (+ C A))
(/ 1.0 (- C A))
(- (sqrt (fma (- A C) (- A C) (* B B)))))
t_1))
t_2)
(/
(sqrt (* (* (* F 2.0) t_4) (+ (+ (* (/ (* B B) C) -0.5) A) A)))
(- t_4))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = (F * (pow(B, 2.0) - t_0)) * 2.0;
double t_2 = t_0 - pow(B, 2.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * t_1)) / t_2;
double t_4 = fma((-4.0 * C), A, (B * B));
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = (sqrt(((A + A) * F)) * (sqrt(2.0) * sqrt(t_4))) / t_2;
} else if (t_3 <= -5e-195) {
tmp = sqrt((fma(((C - A) * (C + A)), (1.0 / (C - A)), -sqrt(fma((A - C), (A - C), (B * B)))) * t_1)) / t_2;
} else {
tmp = sqrt((((F * 2.0) * t_4) * (((((B * B) / C) * -0.5) + A) + A))) / -t_4;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = Float64(Float64(F * Float64((B ^ 2.0) - t_0)) * 2.0) t_2 = Float64(t_0 - (B ^ 2.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * t_1)) / t_2) t_4 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * Float64(sqrt(2.0) * sqrt(t_4))) / t_2); elseif (t_3 <= -5e-195) tmp = Float64(sqrt(Float64(fma(Float64(Float64(C - A) * Float64(C + A)), Float64(1.0 / Float64(C - A)), Float64(-sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B))))) * t_1)) / t_2); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_4) * Float64(Float64(Float64(Float64(Float64(B * B) / C) * -0.5) + A) + A))) / Float64(-t_4)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[t$95$4], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, -5e-195], N[(N[Sqrt[N[(N[(N[(N[(C - A), $MachinePrecision] * N[(C + A), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(C - A), $MachinePrecision]), $MachinePrecision] + (-N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$4), $MachinePrecision] * N[(N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$4)), $MachinePrecision]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := \left(F \cdot \left({B}^{2} - t\_0\right)\right) \cdot 2\\
t_2 := t\_0 - {B}^{2}\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot t\_1}}{t\_2}\\
t_4 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot F} \cdot \left(\sqrt{2} \cdot \sqrt{t\_4}\right)}{t\_2}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\mathsf{fma}\left(\left(C - A\right) \cdot \left(C + A\right), \frac{1}{C - A}, -\sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right) \cdot t\_1}}{t\_2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_4\right) \cdot \left(\left(\frac{B \cdot B}{C} \cdot -0.5 + A\right) + A\right)}}{-t\_4}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -inf.0Initial program 3.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.5
Applied rewrites28.5%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites36.1%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites36.2%
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))) < -5.00000000000000009e-195Initial program 96.4%
lift--.f64N/A
sub-negN/A
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
div-invN/A
lower-fma.f64N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-neg.f6496.5
lift-+.f64N/A
lift-pow.f64N/A
unpow2N/A
lower-fma.f6496.5
Applied rewrites96.5%
if -5.00000000000000009e-195 < (/.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 7.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites14.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6416.4
Applied rewrites16.4%
Final simplification33.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B B)))
(t_1 (fma (* -4.0 C) A (* B B)))
(t_2 (* C (* A 4.0)))
(t_3 (- t_2 (pow B 2.0)))
(t_4
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_2)) 2.0)))
t_3)))
(if (<= t_4 -1e+280)
(/ (* (sqrt (* (+ A A) F)) (* (sqrt 2.0) (sqrt t_1))) t_3)
(if (<= t_4 -5e-195)
(/
(sqrt
(*
(* t_0 (* F 2.0))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(/
(sqrt (* (* (* F 2.0) t_1) (+ (+ (* (/ (* B B) C) -0.5) A) A)))
(- t_1))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B * B));
double t_1 = fma((-4.0 * C), A, (B * B));
double t_2 = C * (A * 4.0);
double t_3 = t_2 - pow(B, 2.0);
double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_2)) * 2.0))) / t_3;
double tmp;
if (t_4 <= -1e+280) {
tmp = (sqrt(((A + A) * F)) * (sqrt(2.0) * sqrt(t_1))) / t_3;
} else if (t_4 <= -5e-195) {
tmp = sqrt(((t_0 * (F * 2.0)) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else {
tmp = sqrt((((F * 2.0) * t_1) * (((((B * B) / C) * -0.5) + A) + 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(C * A), Float64(B * B)) t_1 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(t_2 - (B ^ 2.0)) t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_2)) * 2.0))) / t_3) tmp = 0.0 if (t_4 <= -1e+280) tmp = Float64(Float64(sqrt(Float64(Float64(A + A) * F)) * Float64(sqrt(2.0) * sqrt(t_1))) / t_3); elseif (t_4 <= -5e-195) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * Float64(Float64(Float64(Float64(Float64(B * B) / C) * -0.5) + A) + A))) / Float64(-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[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $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[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, -1e+280], N[(N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, -5e-195], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := t\_2 - {B}^{2}\\
t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_3}\\
\mathbf{if}\;t\_4 \leq -1 \cdot 10^{+280}:\\
\;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot F} \cdot \left(\sqrt{2} \cdot \sqrt{t\_1}\right)}{t\_3}\\
\mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot \left(\left(\frac{B \cdot B}{C} \cdot -0.5 + A\right) + 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))) < -1e280Initial program 4.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.4
Applied rewrites29.4%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites36.9%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
unpow-prod-downN/A
lower-*.f64N/A
Applied rewrites37.0%
if -1e280 < (/.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.00000000000000009e-195Initial program 96.9%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites96.9%
if -5.00000000000000009e-195 < (/.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 7.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites14.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6416.4
Applied rewrites16.4%
Final simplification33.6%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma -4.0 (* C A) (* B B)))
(t_1 (fma (* -4.0 C) A (* B B)))
(t_2 (* C (* A 4.0)))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_2)) 2.0)))
(- t_2 (pow B 2.0)))))
(if (<= t_3 -1e+280)
(/
(* (sqrt (* (* F 2.0) (+ A A))) (sqrt t_1))
(* (- (* C 4.0) (/ (* B B) A)) A))
(if (<= t_3 -5e-195)
(/
(sqrt
(*
(* t_0 (* F 2.0))
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))))
(- t_0))
(/
(sqrt (* (* (* F 2.0) t_1) (+ (+ (* (/ (* B B) C) -0.5) A) A)))
(- t_1))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma(-4.0, (C * A), (B * B));
double t_1 = fma((-4.0 * C), A, (B * B));
double t_2 = C * (A * 4.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -1e+280) {
tmp = (sqrt(((F * 2.0) * (A + A))) * sqrt(t_1)) / (((C * 4.0) - ((B * B) / A)) * A);
} else if (t_3 <= -5e-195) {
tmp = sqrt(((t_0 * (F * 2.0)) * ((C + A) - sqrt(fma((A - C), (A - C), (B * B)))))) / -t_0;
} else {
tmp = sqrt((((F * 2.0) * t_1) * (((((B * B) / C) * -0.5) + A) + 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(C * A), Float64(B * B)) t_1 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= -1e+280) tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * Float64(A + A))) * sqrt(t_1)) / Float64(Float64(Float64(C * 4.0) - Float64(Float64(B * B) / A)) * A)); elseif (t_3 <= -5e-195) tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * Float64(Float64(Float64(Float64(Float64(B * B) / C) * -0.5) + A) + A))) / Float64(-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[(C * A), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+280], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(C * 4.0), $MachinePrecision] - N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * A), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-195], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * N[(N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+280}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot \left(A + A\right)} \cdot \sqrt{t\_1}}{\left(C \cdot 4 - \frac{B \cdot B}{A}\right) \cdot A}\\
\mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot \left(\left(\frac{B \cdot B}{C} \cdot -0.5 + A\right) + 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))) < -1e280Initial program 4.7%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6429.4
Applied rewrites29.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites29.4%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6429.3
Applied rewrites29.3%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
Applied rewrites36.8%
if -1e280 < (/.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.00000000000000009e-195Initial program 96.9%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
Applied rewrites96.9%
if -5.00000000000000009e-195 < (/.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 7.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites14.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6416.4
Applied rewrites16.4%
Final simplification33.5%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B B)))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0))))
(t_3 (- t_0)))
(if (<= t_2 -2e+236)
(/
(* (sqrt (* (* F 2.0) (+ A A))) (sqrt t_0))
(* (- (* C 4.0) (/ (* B B) A)) A))
(if (<= t_2 -5e-195)
(/
(sqrt
(*
(* (* (- (+ C A) (sqrt (fma B B (* (- C A) (- C A))))) F) 2.0)
t_0))
t_3)
(/
(sqrt (* (* (* F 2.0) t_0) (+ (+ (* (/ (* B B) C) -0.5) A) A)))
t_3)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double t_1 = C * (A * 4.0);
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double t_3 = -t_0;
double tmp;
if (t_2 <= -2e+236) {
tmp = (sqrt(((F * 2.0) * (A + A))) * sqrt(t_0)) / (((C * 4.0) - ((B * B) / A)) * A);
} else if (t_2 <= -5e-195) {
tmp = sqrt((((((C + A) - sqrt(fma(B, B, ((C - A) * (C - A))))) * F) * 2.0) * t_0)) / t_3;
} else {
tmp = sqrt((((F * 2.0) * t_0) * (((((B * B) / C) * -0.5) + A) + A))) / t_3;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B ^ 2.0))) t_3 = Float64(-t_0) tmp = 0.0 if (t_2 <= -2e+236) tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * Float64(A + A))) * sqrt(t_0)) / Float64(Float64(Float64(C * 4.0) - Float64(Float64(B * B) / A)) * A)); elseif (t_2 <= -5e-195) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(C + A) - sqrt(fma(B, B, Float64(Float64(C - A) * Float64(C - A))))) * F) * 2.0) * t_0)) / t_3); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(Float64(Float64(Float64(B * B) / C) * -0.5) + A) + A))) / t_3); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-t$95$0)}, If[LessEqual[t$95$2, -2e+236], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(C * 4.0), $MachinePrecision] - N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * A), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-195], N[(N[Sqrt[N[(N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(B * B + N[(N[(C - A), $MachinePrecision] * N[(C - A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B}^{2}}\\
t_3 := -t\_0\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+236}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot \left(A + A\right)} \cdot \sqrt{t\_0}}{\left(C \cdot 4 - \frac{B \cdot B}{A}\right) \cdot A}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-195}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(C + A\right) - \sqrt{\mathsf{fma}\left(B, B, \left(C - A\right) \cdot \left(C - A\right)\right)}\right) \cdot F\right) \cdot 2\right) \cdot t\_0}}{t\_3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(\frac{B \cdot B}{C} \cdot -0.5 + A\right) + A\right)}}{t\_3}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -2.00000000000000011e236Initial program 6.5%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6428.9
Applied rewrites28.9%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites28.9%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6428.8
Applied rewrites28.8%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
Applied rewrites36.2%
if -2.00000000000000011e236 < (/.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.00000000000000009e-195Initial program 96.8%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
pow1/2N/A
lower-*.f64N/A
Applied rewrites96.9%
Applied rewrites96.6%
Applied rewrites97.0%
if -5.00000000000000009e-195 < (/.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 7.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6414.7
Applied rewrites14.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites14.7%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6416.4
Applied rewrites16.4%
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 (* -4.0 C) A (* B B)))
(t_1 (* C (* A 4.0)))
(t_2
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_1)) 2.0)))
(- t_1 (pow B 2.0)))))
(if (<= t_2 -1e+135)
(/
(* (sqrt (* (* F 2.0) (+ A A))) (sqrt t_0))
(* (- (* C 4.0) (/ (* B B) A)) A))
(if (<= t_2 -1e-173)
(*
(sqrt
(*
(/
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))
(fma (* -4.0 A) C (* B B)))
F))
(- (sqrt 2.0)))
(/
(sqrt (* (* (* F 2.0) t_0) (+ (+ (* (/ (* B B) C) -0.5) A) A)))
(- t_0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double t_1 = C * (A * 4.0);
double t_2 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B, 2.0));
double tmp;
if (t_2 <= -1e+135) {
tmp = (sqrt(((F * 2.0) * (A + A))) * sqrt(t_0)) / (((C * 4.0) - ((B * B) / A)) * A);
} else if (t_2 <= -1e-173) {
tmp = sqrt(((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) / fma((-4.0 * A), C, (B * B))) * F)) * -sqrt(2.0);
} else {
tmp = sqrt((((F * 2.0) * t_0) * (((((B * B) / C) * -0.5) + A) + A))) / -t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_1 = Float64(C * Float64(A * 4.0)) t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B ^ 2.0))) tmp = 0.0 if (t_2 <= -1e+135) tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * Float64(A + A))) * sqrt(t_0)) / Float64(Float64(Float64(C * 4.0) - Float64(Float64(B * B) / A)) * A)); elseif (t_2 <= -1e-173) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) / fma(Float64(-4.0 * A), C, Float64(B * B))) * F)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(Float64(Float64(Float64(Float64(B * B) / C) * -0.5) + A) + A))) / Float64(-t_0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+135], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(C * 4.0), $MachinePrecision] - N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * A), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-173], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(N[(N[(N[(N[(B * B), $MachinePrecision] / C), $MachinePrecision] * -0.5), $MachinePrecision] + A), $MachinePrecision] + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_1 := C \cdot \left(A \cdot 4\right)\\
t_2 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B}^{2}}\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+135}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot \left(A + A\right)} \cdot \sqrt{t\_0}}{\left(C \cdot 4 - \frac{B \cdot B}{A}\right) \cdot A}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-173}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}}{\mathsf{fma}\left(-4 \cdot A, C, B \cdot B\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(\frac{B \cdot B}{C} \cdot -0.5 + A\right) + A\right)}}{-t\_0}\\
\end{array}
\end{array}
if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.99999999999999962e134Initial program 14.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6431.6
Applied rewrites31.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites31.6%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6431.4
Applied rewrites31.4%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
Applied rewrites38.3%
if -9.99999999999999962e134 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-173Initial program 98.4%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites95.1%
if -1e-173 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6415.1
Applied rewrites15.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites15.1%
Taylor expanded in C around inf
lower--.f64N/A
lower-+.f64N/A
lower-*.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6416.8
Applied rewrites16.8%
Final simplification31.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 (* C (* A 4.0)))
(t_1
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_0)) 2.0)))
(- t_0 (pow B 2.0)))))
(if (<= t_1 -1e+135)
(/
(* (sqrt (* (* F 2.0) (+ A A))) (sqrt (fma (* -4.0 C) A (* B B))))
(* (- (* C 4.0) (/ (* B B) A)) A))
(if (<= t_1 -1e-140)
(*
(sqrt
(*
(/
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))
(fma (* -4.0 A) C (* B B)))
F))
(- (sqrt 2.0)))
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) (* (* C A) 4.0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = C * (A * 4.0);
double t_1 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_0)) * 2.0))) / (t_0 - pow(B, 2.0));
double tmp;
if (t_1 <= -1e+135) {
tmp = (sqrt(((F * 2.0) * (A + A))) * sqrt(fma((-4.0 * C), A, (B * B)))) / (((C * 4.0) - ((B * B) / A)) * A);
} else if (t_1 <= -1e-140) {
tmp = sqrt(((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) / fma((-4.0 * A), C, (B * B))) * F)) * -sqrt(2.0);
} else {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / ((C * A) * 4.0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(C * Float64(A * 4.0)) t_1 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_0)) * 2.0))) / Float64(t_0 - (B ^ 2.0))) tmp = 0.0 if (t_1 <= -1e+135) tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * Float64(A + A))) * sqrt(fma(Float64(-4.0 * C), A, Float64(B * B)))) / Float64(Float64(Float64(C * 4.0) - Float64(Float64(B * B) / A)) * A)); elseif (t_1 <= -1e-140) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) / fma(Float64(-4.0 * A), C, Float64(B * B))) * F)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(Float64(C * A) * 4.0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+135], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(C * 4.0), $MachinePrecision] - N[(N[(B * B), $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] * A), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-140], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := C \cdot \left(A \cdot 4\right)\\
t_1 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_0\right)\right) \cdot 2\right)}}{t\_0 - {B}^{2}}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+135}:\\
\;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot \left(A + A\right)} \cdot \sqrt{\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)}}{\left(C \cdot 4 - \frac{B \cdot B}{A}\right) \cdot A}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-140}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}}{\mathsf{fma}\left(-4 \cdot A, C, B \cdot B\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{\left(C \cdot A\right) \cdot 4}\\
\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))) < -9.99999999999999962e134Initial program 14.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6431.6
Applied rewrites31.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites31.6%
Taylor expanded in A around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower--.f64N/A
lower-/.f64N/A
unpow2N/A
lower-*.f64N/A
lower-*.f6431.4
Applied rewrites31.4%
lift-sqrt.f64N/A
pow1/2N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
unpow-prod-downN/A
Applied rewrites38.3%
if -9.99999999999999962e134 < (/.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.9999999999999998e-141Initial program 98.3%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites97.9%
if -9.9999999999999998e-141 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6415.7
Applied rewrites15.7%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites15.7%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6415.3
Applied rewrites15.3%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6417.4
Applied rewrites17.4%
Final simplification32.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 (* -4.0 C) A (* B B)))
(t_1 (* (+ A A) F))
(t_2 (* C (* A 4.0)))
(t_3
(/
(sqrt
(*
(- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))
(* (* F (- (pow B 2.0) t_2)) 2.0)))
(- t_2 (pow B 2.0)))))
(if (<= t_3 -1e+135)
(/ (* (- (sqrt (* t_0 2.0))) (sqrt t_1)) t_0)
(if (<= t_3 -1e-173)
(*
(sqrt
(*
(/
(- (+ C A) (sqrt (fma (- A C) (- A C) (* B B))))
(fma (* -4.0 A) C (* B B)))
F))
(- (sqrt 2.0)))
(/ (sqrt (* (* (* t_1 C) A) -8.0)) (* (* C A) 4.0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double t_1 = (A + A) * F;
double t_2 = C * (A * 4.0);
double t_3 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))) * ((F * (pow(B, 2.0) - t_2)) * 2.0))) / (t_2 - pow(B, 2.0));
double tmp;
if (t_3 <= -1e+135) {
tmp = (-sqrt((t_0 * 2.0)) * sqrt(t_1)) / t_0;
} else if (t_3 <= -1e-173) {
tmp = sqrt(((((C + A) - sqrt(fma((A - C), (A - C), (B * B)))) / fma((-4.0 * A), C, (B * B))) * F)) * -sqrt(2.0);
} else {
tmp = sqrt((((t_1 * C) * A) * -8.0)) / ((C * A) * 4.0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) t_1 = Float64(Float64(A + A) * F) t_2 = Float64(C * Float64(A * 4.0)) t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))) * Float64(Float64(F * Float64((B ^ 2.0) - t_2)) * 2.0))) / Float64(t_2 - (B ^ 2.0))) tmp = 0.0 if (t_3 <= -1e+135) tmp = Float64(Float64(Float64(-sqrt(Float64(t_0 * 2.0))) * sqrt(t_1)) / t_0); elseif (t_3 <= -1e-173) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C + A) - sqrt(fma(Float64(A - C), Float64(A - C), Float64(B * B)))) / fma(Float64(-4.0 * A), C, Float64(B * B))) * F)) * Float64(-sqrt(2.0))); else tmp = Float64(sqrt(Float64(Float64(Float64(t_1 * C) * A) * -8.0)) / Float64(Float64(C * A) * 4.0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision]}, Block[{t$95$2 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$2 - N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+135], N[(N[((-N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]) * N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[t$95$3, -1e-173], N[(N[Sqrt[N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[(A - C), $MachinePrecision] * N[(A - C), $MachinePrecision] + N[(B * B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B * B), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(t$95$1 * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
t_1 := \left(A + A\right) \cdot F\\
t_2 := C \cdot \left(A \cdot 4\right)\\
t_3 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(\left(F \cdot \left({B}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B}^{2}}\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+135}:\\
\;\;\;\;\frac{\left(-\sqrt{t\_0 \cdot 2}\right) \cdot \sqrt{t\_1}}{t\_0}\\
\mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-173}:\\
\;\;\;\;\sqrt{\frac{\left(C + A\right) - \sqrt{\mathsf{fma}\left(A - C, A - C, B \cdot B\right)}}{\mathsf{fma}\left(-4 \cdot A, C, B \cdot B\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_1 \cdot C\right) \cdot A\right) \cdot -8}}{\left(C \cdot A\right) \cdot 4}\\
\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))) < -9.99999999999999962e134Initial program 14.3%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6431.6
Applied rewrites31.6%
lift-sqrt.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
associate-*l*N/A
sqrt-prodN/A
Applied rewrites38.3%
lift--.f64N/A
lift-pow.f64N/A
pow2N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
+-commutativeN/A
lift-fma.f6438.3
Applied rewrites38.3%
if -9.99999999999999962e134 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e-173Initial program 98.4%
Taylor expanded in F around 0
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites95.1%
if -1e-173 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) Initial program 8.0%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6415.1
Applied rewrites15.1%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites15.1%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6415.4
Applied rewrites15.4%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6417.5
Applied rewrites17.5%
Final simplification32.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 (* -4.0 C) A (* B B))))
(if (<= (pow B 2.0) 5e+53)
(/ (sqrt (* (* (* F 2.0) t_0) (+ A A))) (- t_0))
(* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (pow(B, 2.0) <= 5e+53) {
tmp = sqrt((((F * 2.0) * t_0) * (A + A))) / -t_0;
} else {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-sqrt(2.0) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if ((B ^ 2.0) <= 5e+53) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_0) * Float64(A + A))) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 5e+53], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;{B}^{2} \leq 5 \cdot 10^{+53}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(A + A\right)}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000004e53Initial program 26.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6433.2
Applied rewrites33.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites33.2%
if 5.0000000000000004e53 < (pow.f64 B #s(literal 2 binary64)) Initial program 14.1%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f647.8
Applied rewrites7.8%
Final simplification22.1%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(if (<= B 6.2e+20)
(/
(sqrt (* (* (* (fma (* -4.0 C) A (* B B)) F) 2.0) (+ A A)))
(* C (* A 4.0)))
(* (sqrt (* (- A (sqrt (fma B B (* A A)))) F)) (/ (- (sqrt 2.0)) B))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double tmp;
if (B <= 6.2e+20) {
tmp = sqrt((((fma((-4.0 * C), A, (B * B)) * F) * 2.0) * (A + A))) / (C * (A * 4.0));
} else {
tmp = sqrt(((A - sqrt(fma(B, B, (A * A)))) * F)) * (-sqrt(2.0) / B);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) tmp = 0.0 if (B <= 6.2e+20) tmp = Float64(sqrt(Float64(Float64(Float64(fma(Float64(-4.0 * C), A, Float64(B * B)) * F) * 2.0) * Float64(A + A))) / Float64(C * Float64(A * 4.0))); else tmp = Float64(sqrt(Float64(Float64(A - sqrt(fma(B, B, Float64(A * A)))) * F)) * Float64(Float64(-sqrt(2.0)) / B)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := If[LessEqual[B, 6.2e+20], N[(N[Sqrt[N[(N[(N[(N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(A - N[Sqrt[N[(B * B + N[(A * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[((-N[Sqrt[2.0], $MachinePrecision]) / B), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B \leq 6.2 \cdot 10^{+20}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right) \cdot F\right) \cdot 2\right) \cdot \left(A + A\right)}}{C \cdot \left(A \cdot 4\right)}\\
\mathbf{else}:\\
\;\;\;\;\sqrt{\left(A - \sqrt{\mathsf{fma}\left(B, B, A \cdot A\right)}\right) \cdot F} \cdot \frac{-\sqrt{2}}{B}\\
\end{array}
\end{array}
if B < 6.2e20Initial program 25.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.2
Applied rewrites25.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites25.2%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6423.1
Applied rewrites23.1%
Applied rewrites23.1%
if 6.2e20 < B Initial program 7.6%
Taylor expanded in C around 0
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
unpow2N/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6413.4
Applied rewrites13.4%
Final simplification20.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
:precision binary64
(let* ((t_0 (fma (* -4.0 C) A (* B B))))
(if (<= B 6.2e+20)
(/ (sqrt (* (* (* t_0 F) 2.0) (+ A A))) (* C (* A 4.0)))
(if (<= B 1.26e+91)
(/ (sqrt (* (* (* (* B B) B) F) -2.0)) (- t_0))
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) (* (* C A) 4.0))))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = fma((-4.0 * C), A, (B * B));
double tmp;
if (B <= 6.2e+20) {
tmp = sqrt((((t_0 * F) * 2.0) * (A + A))) / (C * (A * 4.0));
} else if (B <= 1.26e+91) {
tmp = sqrt(((((B * B) * B) * F) * -2.0)) / -t_0;
} else {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / ((C * A) * 4.0);
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if (B <= 6.2e+20) tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(A + A))) / Float64(C * Float64(A * 4.0))); elseif (B <= 1.26e+91) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.0)) / Float64(-t_0)); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(Float64(C * A) * 4.0)); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 6.2e+20], N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 1.26e+91], N[(N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;B \leq 6.2 \cdot 10^{+20}:\\
\;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(A + A\right)}}{C \cdot \left(A \cdot 4\right)}\\
\mathbf{elif}\;B \leq 1.26 \cdot 10^{+91}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}}{-t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{\left(C \cdot A\right) \cdot 4}\\
\end{array}
\end{array}
if B < 6.2e20Initial program 25.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.2
Applied rewrites25.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites25.2%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6423.1
Applied rewrites23.1%
Applied rewrites23.1%
if 6.2e20 < B < 1.26e91Initial program 29.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6415.6
Applied rewrites15.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites15.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6420.7
Applied rewrites20.7%
if 1.26e91 < B Initial program 0.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.8
Applied rewrites0.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites0.8%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f641.2
Applied rewrites1.2%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f646.1
Applied rewrites6.1%
Final simplification20.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 (* (* C A) 4.0)) (t_1 (fma (* -4.0 C) A (* B B))))
(if (<= B 6.2e+20)
(/ (sqrt (* (* (* F 2.0) t_1) (+ A A))) t_0)
(if (<= B 1.26e+91)
(/ (sqrt (* (* (* (* B B) B) F) -2.0)) (- t_1))
(/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) t_0)))))assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
double t_0 = (C * A) * 4.0;
double t_1 = fma((-4.0 * C), A, (B * B));
double tmp;
if (B <= 6.2e+20) {
tmp = sqrt((((F * 2.0) * t_1) * (A + A))) / t_0;
} else if (B <= 1.26e+91) {
tmp = sqrt(((((B * B) * B) * F) * -2.0)) / -t_1;
} else {
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / t_0;
}
return tmp;
}
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) t_0 = Float64(Float64(C * A) * 4.0) t_1 = fma(Float64(-4.0 * C), A, Float64(B * B)) tmp = 0.0 if (B <= 6.2e+20) tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * Float64(A + A))) / t_0); elseif (B <= 1.26e+91) tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B * B) * B) * F) * -2.0)) / Float64(-t_1)); else tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / t_0); end return tmp end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-4.0 * C), $MachinePrecision] * A + N[(B * B), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B, 6.2e+20], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision], If[LessEqual[B, 1.26e+91], N[(N[Sqrt[N[(N[(N[(N[(B * B), $MachinePrecision] * B), $MachinePrecision] * F), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision]]]]]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\begin{array}{l}
t_0 := \left(C \cdot A\right) \cdot 4\\
t_1 := \mathsf{fma}\left(-4 \cdot C, A, B \cdot B\right)\\
\mathbf{if}\;B \leq 6.2 \cdot 10^{+20}:\\
\;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot \left(A + A\right)}}{t\_0}\\
\mathbf{elif}\;B \leq 1.26 \cdot 10^{+91}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(B \cdot B\right) \cdot B\right) \cdot F\right) \cdot -2}}{-t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{t\_0}\\
\end{array}
\end{array}
if B < 6.2e20Initial program 25.2%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6425.2
Applied rewrites25.2%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites25.2%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6423.1
Applied rewrites23.1%
if 6.2e20 < B < 1.26e91Initial program 29.9%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6415.6
Applied rewrites15.6%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites15.6%
Taylor expanded in B around inf
lower-*.f64N/A
lower-*.f64N/A
unpow3N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6420.7
Applied rewrites20.7%
if 1.26e91 < B Initial program 0.6%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f640.8
Applied rewrites0.8%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites0.8%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f641.2
Applied rewrites1.2%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f646.1
Applied rewrites6.1%
Final simplification19.9%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (/ (sqrt (* (* (* (* (+ A A) F) C) A) -8.0)) (* (* C A) 4.0)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((((((A + A) * F) * C) * A) * -8.0)) / ((C * A) * 4.0);
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((((((a + a) * f) * c) * a) * (-8.0d0))) / ((c * a) * 4.0d0)
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((((((A + A) * F) * C) * A) * -8.0)) / ((C * A) * 4.0);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((((((A + A) * F) * C) * A) * -8.0)) / ((C * A) * 4.0)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(Float64(C * A) * 4.0)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / ((C * A) * 4.0);
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{\left(C \cdot A\right) \cdot 4}
\end{array}
Initial program 21.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.4
Applied rewrites20.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites20.4%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6418.1
Applied rewrites18.1%
Taylor expanded in C around inf
rem-square-sqrtN/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower--.f64N/A
mul-1-negN/A
lower-neg.f6419.1
Applied rewrites19.1%
Final simplification19.1%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (/ (sqrt (* (* (* (* A A) C) F) -16.0)) (* (* C A) 4.0)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt(((((A * A) * C) * F) * -16.0)) / ((C * A) * 4.0);
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((((a * a) * c) * f) * (-16.0d0))) / ((c * a) * 4.0d0)
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt(((((A * A) * C) * F) * -16.0)) / ((C * A) * 4.0);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt(((((A * A) * C) * F) * -16.0)) / ((C * A) * 4.0)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / Float64(Float64(C * A) * 4.0)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt(((((A * A) * C) * F) * -16.0)) / ((C * A) * 4.0);
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{\left(C \cdot A\right) \cdot 4}
\end{array}
Initial program 21.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.4
Applied rewrites20.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites20.4%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6418.1
Applied rewrites18.1%
Taylor expanded in A around -inf
lower-*.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6414.8
Applied rewrites14.8%
Final simplification14.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (/ (sqrt (* (* (* (* C C) F) A) -16.0)) (* (* C A) 4.0)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt(((((C * C) * F) * A) * -16.0)) / ((C * A) * 4.0);
}
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(((((c * c) * f) * a) * (-16.0d0))) / ((c * a) * 4.0d0)
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt(((((C * C) * F) * A) * -16.0)) / ((C * A) * 4.0);
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt(((((C * C) * F) * A) * -16.0)) / ((C * A) * 4.0)
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) / Float64(Float64(C * A) * 4.0)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt(((((C * C) * F) * A) * -16.0)) / ((C * A) * 4.0);
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[(N[Sqrt[N[(N[(N[(N[(C * C), $MachinePrecision] * F), $MachinePrecision] * A), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\frac{\sqrt{\left(\left(\left(C \cdot C\right) \cdot F\right) \cdot A\right) \cdot -16}}{\left(C \cdot A\right) \cdot 4}
\end{array}
Initial program 21.1%
Taylor expanded in C around inf
cancel-sign-sub-invN/A
metadata-evalN/A
*-lft-identityN/A
lower-+.f6420.4
Applied rewrites20.4%
lift-/.f64N/A
lift-neg.f64N/A
distribute-frac-negN/A
distribute-frac-neg2N/A
lower-/.f64N/A
Applied rewrites20.4%
Taylor expanded in C around inf
lower-*.f64N/A
lower-*.f6418.1
Applied rewrites18.1%
Taylor expanded in C around -inf
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f648.7
Applied rewrites8.7%
Final simplification8.7%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (sqrt (/ 2.0 (/ B F))))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt((2.0 / (B / F)));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt((2.0d0 / (b / f)))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt((2.0 / (B / F)));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt((2.0 / (B / F)))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(2.0 / Float64(B / F))) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt((2.0 / (B / F)));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[Sqrt[N[(2.0 / N[(B / F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{\frac{2}{\frac{B}{F}}}
\end{array}
Initial program 21.1%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Applied rewrites1.8%
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. (FPCore (A B C F) :precision binary64 (sqrt (* (/ 2.0 B) F)))
assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
return sqrt(((2.0 / B) * F));
}
NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b, c, f)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: f
code = sqrt(((2.0d0 / b) * f))
end function
assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
return Math.sqrt(((2.0 / B) * F));
}
[A, B, C, F] = sort([A, B, C, F]) def code(A, B, C, F): return math.sqrt(((2.0 / B) * F))
A, B, C, F = sort([A, B, C, F]) function code(A, B, C, F) return sqrt(Float64(Float64(2.0 / B) * F)) end
A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp = code(A, B, C, F)
tmp = sqrt(((2.0 / B) * F));
end
NOTE: A, B, C, and F should be sorted in increasing order before calling this function. code[A_, B_, C_, F_] := N[Sqrt[N[(N[(2.0 / B), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}
[A, B, C, F] = \mathsf{sort}([A, B, C, F])\\
\\
\sqrt{\frac{2}{B} \cdot F}
\end{array}
Initial program 21.1%
Taylor expanded in B around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
unpow2N/A
rem-square-sqrtN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-/.f641.8
Applied rewrites1.8%
Applied rewrites1.8%
Applied rewrites1.8%
Final simplification1.8%
herbie shell --seed 2024236
(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))))