
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x c s) :precision binary64 (/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))
double code(double x, double c, double s) {
return cos((2.0 * x)) / (pow(c, 2.0) * ((x * pow(s, 2.0)) * x));
}
real(8) function code(x, c, s)
real(8), intent (in) :: x
real(8), intent (in) :: c
real(8), intent (in) :: s
code = cos((2.0d0 * x)) / ((c ** 2.0d0) * ((x * (s ** 2.0d0)) * x))
end function
public static double code(double x, double c, double s) {
return Math.cos((2.0 * x)) / (Math.pow(c, 2.0) * ((x * Math.pow(s, 2.0)) * x));
}
def code(x, c, s): return math.cos((2.0 * x)) / (math.pow(c, 2.0) * ((x * math.pow(s, 2.0)) * x))
function code(x, c, s) return Float64(cos(Float64(2.0 * x)) / Float64((c ^ 2.0) * Float64(Float64(x * (s ^ 2.0)) * x))) end
function tmp = code(x, c, s) tmp = cos((2.0 * x)) / ((c ^ 2.0) * ((x * (s ^ 2.0)) * x)); end
code[x_, c_, s_] := N[(N[Cos[N[(2.0 * x), $MachinePrecision]], $MachinePrecision] / N[(N[Power[c, 2.0], $MachinePrecision] * N[(N[(x * N[Power[s, 2.0], $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\cos \left(2 \cdot x\right)}{{c}^{2} \cdot \left(\left(x \cdot {s}^{2}\right) \cdot x\right)}
\end{array}
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (* x_m 2.0))))
(if (<= x_m 2e-77)
(/ (/ t_0 c_m) (* (* x_m s_m) (* c_m (* x_m s_m))))
(* t_0 (pow (* s_m (* x_m c_m)) -2.0)))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0));
double tmp;
if (x_m <= 2e-77) {
tmp = (t_0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
} else {
tmp = t_0 * pow((s_m * (x_m * c_m)), -2.0);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
if (x_m <= 2d-77) then
tmp = (t_0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)))
else
tmp = t_0 * ((s_m * (x_m * c_m)) ** (-2.0d0))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0));
double tmp;
if (x_m <= 2e-77) {
tmp = (t_0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
} else {
tmp = t_0 * Math.pow((s_m * (x_m * c_m)), -2.0);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) tmp = 0 if x_m <= 2e-77: tmp = (t_0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m))) else: tmp = t_0 * math.pow((s_m * (x_m * c_m)), -2.0) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (x_m <= 2e-77) tmp = Float64(Float64(t_0 / c_m) / Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m)))); else tmp = Float64(t_0 * (Float64(s_m * Float64(x_m * c_m)) ^ -2.0)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0));
tmp = 0.0;
if (x_m <= 2e-77)
tmp = (t_0 / c_m) / ((x_m * s_m) * (c_m * (x_m * s_m)));
else
tmp = t_0 * ((s_m * (x_m * c_m)) ^ -2.0);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x$95$m, 2e-77], N[(N[(t$95$0 / c$95$m), $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[Power[N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision], -2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;x\_m \leq 2 \cdot 10^{-77}:\\
\;\;\;\;\frac{\frac{t\_0}{c\_m}}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot {\left(s\_m \cdot \left(x\_m \cdot c\_m\right)\right)}^{-2}\\
\end{array}
\end{array}
if x < 1.9999999999999999e-77Initial program 65.8%
*-un-lft-identity65.8%
add-sqr-sqrt65.7%
times-frac65.7%
sqrt-prod65.8%
sqrt-pow139.6%
metadata-eval39.6%
pow139.6%
*-commutative39.6%
associate-*r*35.6%
unpow235.6%
pow-prod-down39.6%
sqrt-pow143.1%
metadata-eval43.1%
pow143.1%
*-commutative43.1%
Applied egg-rr97.0%
associate-*l/96.9%
*-un-lft-identity96.9%
associate-/r*97.0%
associate-/l/95.6%
*-commutative95.6%
Applied egg-rr95.6%
if 1.9999999999999999e-77 < x Initial program 64.6%
*-un-lft-identity64.6%
add-sqr-sqrt64.6%
times-frac64.6%
sqrt-prod64.6%
sqrt-pow146.1%
metadata-eval46.1%
pow146.1%
*-commutative46.1%
associate-*r*42.8%
unpow242.8%
pow-prod-down46.1%
sqrt-pow142.9%
metadata-eval42.9%
pow142.9%
*-commutative42.9%
Applied egg-rr98.3%
Taylor expanded in c around 0 58.1%
Simplified98.2%
Final simplification96.2%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))) (t_1 (cos (* x_m 2.0))))
(if (<= c_m 5e-202)
(/ (/ (/ t_1 (* s_m (* x_m c_m))) (* c_m s_m)) x_m)
(* (/ 1.0 t_0) (/ t_1 t_0)))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double t_1 = cos((x_m * 2.0));
double tmp;
if (c_m <= 5e-202) {
tmp = ((t_1 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m;
} else {
tmp = (1.0 / t_0) * (t_1 / t_0);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
t_1 = cos((x_m * 2.0d0))
if (c_m <= 5d-202) then
tmp = ((t_1 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m
else
tmp = (1.0d0 / t_0) * (t_1 / t_0)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double t_1 = Math.cos((x_m * 2.0));
double tmp;
if (c_m <= 5e-202) {
tmp = ((t_1 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m;
} else {
tmp = (1.0 / t_0) * (t_1 / t_0);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) t_1 = math.cos((x_m * 2.0)) tmp = 0 if c_m <= 5e-202: tmp = ((t_1 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m else: tmp = (1.0 / t_0) * (t_1 / t_0) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) t_1 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (c_m <= 5e-202) tmp = Float64(Float64(Float64(t_1 / Float64(s_m * Float64(x_m * c_m))) / Float64(c_m * s_m)) / x_m); else tmp = Float64(Float64(1.0 / t_0) * Float64(t_1 / t_0)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
t_1 = cos((x_m * 2.0));
tmp = 0.0;
if (c_m <= 5e-202)
tmp = ((t_1 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m;
else
tmp = (1.0 / t_0) * (t_1 / t_0);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 5e-202], N[(N[(N[(t$95$1 / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(1.0 / t$95$0), $MachinePrecision] * N[(t$95$1 / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
t_1 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;c\_m \leq 5 \cdot 10^{-202}:\\
\;\;\;\;\frac{\frac{\frac{t\_1}{s\_m \cdot \left(x\_m \cdot c\_m\right)}}{c\_m \cdot s\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{t\_0} \cdot \frac{t\_1}{t\_0}\\
\end{array}
\end{array}
if c < 4.99999999999999973e-202Initial program 64.0%
*-un-lft-identity64.0%
add-sqr-sqrt63.9%
times-frac64.0%
sqrt-prod64.0%
sqrt-pow121.1%
metadata-eval21.1%
pow121.1%
*-commutative21.1%
associate-*r*19.1%
unpow219.1%
pow-prod-down21.1%
sqrt-pow142.4%
metadata-eval42.4%
pow142.4%
*-commutative42.4%
Applied egg-rr95.6%
associate-*l/95.6%
*-un-lft-identity95.6%
*-commutative95.6%
associate-*r*93.4%
associate-/r*91.5%
*-commutative91.5%
Applied egg-rr91.5%
Taylor expanded in c around 0 91.5%
*-commutative91.5%
associate-*r*92.4%
Simplified92.4%
if 4.99999999999999973e-202 < c Initial program 67.5%
*-un-lft-identity67.5%
add-sqr-sqrt67.4%
times-frac67.4%
sqrt-prod67.5%
sqrt-pow167.5%
metadata-eval67.5%
pow167.5%
*-commutative67.5%
associate-*r*61.3%
unpow261.3%
pow-prod-down67.5%
sqrt-pow143.9%
metadata-eval43.9%
pow143.9%
*-commutative43.9%
Applied egg-rr99.5%
Final simplification95.5%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (cos (* x_m 2.0))))
(if (<= c_m 1.3e-201)
(/ (/ (/ t_0 (* s_m (* x_m c_m))) (* c_m s_m)) x_m)
(/ (/ (/ t_0 (* c_m (* x_m s_m))) c_m) (* x_m s_m)))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = cos((x_m * 2.0));
double tmp;
if (c_m <= 1.3e-201) {
tmp = ((t_0 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m;
} else {
tmp = ((t_0 / (c_m * (x_m * s_m))) / c_m) / (x_m * s_m);
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = cos((x_m * 2.0d0))
if (c_m <= 1.3d-201) then
tmp = ((t_0 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m
else
tmp = ((t_0 / (c_m * (x_m * s_m))) / c_m) / (x_m * s_m)
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = Math.cos((x_m * 2.0));
double tmp;
if (c_m <= 1.3e-201) {
tmp = ((t_0 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m;
} else {
tmp = ((t_0 / (c_m * (x_m * s_m))) / c_m) / (x_m * s_m);
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = math.cos((x_m * 2.0)) tmp = 0 if c_m <= 1.3e-201: tmp = ((t_0 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m else: tmp = ((t_0 / (c_m * (x_m * s_m))) / c_m) / (x_m * s_m) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = cos(Float64(x_m * 2.0)) tmp = 0.0 if (c_m <= 1.3e-201) tmp = Float64(Float64(Float64(t_0 / Float64(s_m * Float64(x_m * c_m))) / Float64(c_m * s_m)) / x_m); else tmp = Float64(Float64(Float64(t_0 / Float64(c_m * Float64(x_m * s_m))) / c_m) / Float64(x_m * s_m)); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = cos((x_m * 2.0));
tmp = 0.0;
if (c_m <= 1.3e-201)
tmp = ((t_0 / (s_m * (x_m * c_m))) / (c_m * s_m)) / x_m;
else
tmp = ((t_0 / (c_m * (x_m * s_m))) / c_m) / (x_m * s_m);
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[c$95$m, 1.3e-201], N[(N[(N[(t$95$0 / N[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(N[(t$95$0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \cos \left(x\_m \cdot 2\right)\\
\mathbf{if}\;c\_m \leq 1.3 \cdot 10^{-201}:\\
\;\;\;\;\frac{\frac{\frac{t\_0}{s\_m \cdot \left(x\_m \cdot c\_m\right)}}{c\_m \cdot s\_m}}{x\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{t\_0}{c\_m \cdot \left(x\_m \cdot s\_m\right)}}{c\_m}}{x\_m \cdot s\_m}\\
\end{array}
\end{array}
if c < 1.29999999999999991e-201Initial program 64.0%
*-un-lft-identity64.0%
add-sqr-sqrt63.9%
times-frac64.0%
sqrt-prod64.0%
sqrt-pow121.1%
metadata-eval21.1%
pow121.1%
*-commutative21.1%
associate-*r*19.1%
unpow219.1%
pow-prod-down21.1%
sqrt-pow142.4%
metadata-eval42.4%
pow142.4%
*-commutative42.4%
Applied egg-rr95.6%
associate-*l/95.6%
*-un-lft-identity95.6%
*-commutative95.6%
associate-*r*93.4%
associate-/r*91.5%
*-commutative91.5%
Applied egg-rr91.5%
Taylor expanded in c around 0 91.5%
*-commutative91.5%
associate-*r*92.4%
Simplified92.4%
if 1.29999999999999991e-201 < c Initial program 67.5%
*-un-lft-identity67.5%
add-sqr-sqrt67.4%
times-frac67.4%
sqrt-prod67.5%
sqrt-pow167.5%
metadata-eval67.5%
pow167.5%
*-commutative67.5%
associate-*r*61.3%
unpow261.3%
pow-prod-down67.5%
sqrt-pow143.9%
metadata-eval43.9%
pow143.9%
*-commutative43.9%
Applied egg-rr99.5%
associate-*l/99.5%
*-un-lft-identity99.5%
associate-/r*94.0%
*-commutative94.0%
Applied egg-rr94.0%
Final simplification93.1%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (/ 1.0 (* c_m (* x_m s_m)))))
(if (<= x_m 2.8e-57)
(* t_0 t_0)
(/ (/ (cos (* x_m 2.0)) (* (* x_m c_m) (* x_m (* c_m s_m)))) s_m))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (x_m <= 2.8e-57) {
tmp = t_0 * t_0;
} else {
tmp = (cos((x_m * 2.0)) / ((x_m * c_m) * (x_m * (c_m * s_m)))) / s_m;
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = 1.0d0 / (c_m * (x_m * s_m))
if (x_m <= 2.8d-57) then
tmp = t_0 * t_0
else
tmp = (cos((x_m * 2.0d0)) / ((x_m * c_m) * (x_m * (c_m * s_m)))) / s_m
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
double tmp;
if (x_m <= 2.8e-57) {
tmp = t_0 * t_0;
} else {
tmp = (Math.cos((x_m * 2.0)) / ((x_m * c_m) * (x_m * (c_m * s_m)))) / s_m;
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) tmp = 0 if x_m <= 2.8e-57: tmp = t_0 * t_0 else: tmp = (math.cos((x_m * 2.0)) / ((x_m * c_m) * (x_m * (c_m * s_m)))) / s_m return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) tmp = 0.0 if (x_m <= 2.8e-57) tmp = Float64(t_0 * t_0); else tmp = Float64(Float64(cos(Float64(x_m * 2.0)) / Float64(Float64(x_m * c_m) * Float64(x_m * Float64(c_m * s_m)))) / s_m); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = 1.0 / (c_m * (x_m * s_m));
tmp = 0.0;
if (x_m <= 2.8e-57)
tmp = t_0 * t_0;
else
tmp = (cos((x_m * 2.0)) / ((x_m * c_m) * (x_m * (c_m * s_m)))) / s_m;
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 2.8e-57], N[(t$95$0 * t$95$0), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * c$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / s$95$m), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{if}\;x\_m \leq 2.8 \cdot 10^{-57}:\\
\;\;\;\;t\_0 \cdot t\_0\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot 2\right)}{\left(x\_m \cdot c\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot s\_m\right)\right)}}{s\_m}\\
\end{array}
\end{array}
if x < 2.7999999999999999e-57Initial program 65.5%
Taylor expanded in x around 0 55.3%
associate-/r*55.3%
*-commutative55.3%
unpow255.3%
unpow255.3%
swap-sqr67.6%
unpow267.6%
associate-/r*67.6%
unpow267.6%
unpow267.6%
swap-sqr85.3%
unpow285.3%
*-commutative85.3%
Simplified85.3%
pow-flip85.5%
*-commutative85.5%
pow-flip85.3%
unpow285.3%
associate-/r*85.5%
un-div-inv85.5%
Applied egg-rr85.5%
if 2.7999999999999999e-57 < x Initial program 65.5%
*-un-lft-identity65.5%
add-sqr-sqrt65.4%
times-frac65.5%
sqrt-prod65.5%
sqrt-pow147.4%
metadata-eval47.4%
pow147.4%
*-commutative47.4%
associate-*r*43.8%
unpow243.8%
pow-prod-down47.4%
sqrt-pow143.9%
metadata-eval43.9%
pow143.9%
*-commutative43.9%
Applied egg-rr98.2%
associate-*l/98.2%
*-un-lft-identity98.2%
associate-/r*95.1%
*-commutative95.1%
Applied egg-rr95.1%
*-un-lft-identity95.1%
times-frac95.0%
Applied egg-rr95.0%
associate-/l/98.1%
frac-times98.2%
*-un-lft-identity98.2%
*-un-lft-identity98.2%
*-commutative98.2%
associate-*r*96.6%
*-commutative96.6%
times-frac93.5%
*-commutative93.5%
associate-*r*91.9%
Applied egg-rr91.9%
associate-*l/91.9%
*-lft-identity91.9%
associate-/l/91.9%
*-commutative91.9%
*-commutative91.9%
*-commutative91.9%
Simplified91.9%
Final simplification87.0%
x_m = (fabs.f64 x)
c_m = (fabs.f64 c)
s_m = (fabs.f64 s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
(FPCore (x_m c_m s_m)
:precision binary64
(let* ((t_0 (* c_m (* x_m s_m))))
(if (<= c_m 3.1e-68)
(/ 1.0 (* (* c_m s_m) (* x_m t_0)))
(/ 1.0 (* s_m (* t_0 (* x_m c_m)))))))x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (c_m <= 3.1e-68) {
tmp = 1.0 / ((c_m * s_m) * (x_m * t_0));
} else {
tmp = 1.0 / (s_m * (t_0 * (x_m * c_m)));
}
return tmp;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
real(8) :: tmp
t_0 = c_m * (x_m * s_m)
if (c_m <= 3.1d-68) then
tmp = 1.0d0 / ((c_m * s_m) * (x_m * t_0))
else
tmp = 1.0d0 / (s_m * (t_0 * (x_m * c_m)))
end if
code = tmp
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = c_m * (x_m * s_m);
double tmp;
if (c_m <= 3.1e-68) {
tmp = 1.0 / ((c_m * s_m) * (x_m * t_0));
} else {
tmp = 1.0 / (s_m * (t_0 * (x_m * c_m)));
}
return tmp;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = c_m * (x_m * s_m) tmp = 0 if c_m <= 3.1e-68: tmp = 1.0 / ((c_m * s_m) * (x_m * t_0)) else: tmp = 1.0 / (s_m * (t_0 * (x_m * c_m))) return tmp
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (c_m <= 3.1e-68) tmp = Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_m * t_0))); else tmp = Float64(1.0 / Float64(s_m * Float64(t_0 * Float64(x_m * c_m)))); end return tmp end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp_2 = code(x_m, c_m, s_m)
t_0 = c_m * (x_m * s_m);
tmp = 0.0;
if (c_m <= 3.1e-68)
tmp = 1.0 / ((c_m * s_m) * (x_m * t_0));
else
tmp = 1.0 / (s_m * (t_0 * (x_m * c_m)));
end
tmp_2 = tmp;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 3.1e-68], N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(s$95$m * N[(t$95$0 * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;c\_m \leq 3.1 \cdot 10^{-68}:\\
\;\;\;\;\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{s\_m \cdot \left(t\_0 \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if c < 3.0999999999999999e-68Initial program 64.4%
Taylor expanded in x around 0 53.8%
associate-/r*53.8%
*-commutative53.8%
unpow253.8%
unpow253.8%
swap-sqr64.9%
unpow264.9%
associate-/r*64.9%
unpow264.9%
unpow264.9%
swap-sqr78.4%
unpow278.4%
*-commutative78.4%
Simplified78.4%
unpow278.4%
associate-*r*77.3%
*-commutative77.3%
associate-*l*75.8%
Applied egg-rr75.8%
if 3.0999999999999999e-68 < c Initial program 67.8%
Taylor expanded in x around 0 54.3%
associate-/r*54.3%
*-commutative54.3%
unpow254.3%
unpow254.3%
swap-sqr67.5%
unpow267.5%
associate-/r*67.5%
unpow267.5%
unpow267.5%
swap-sqr86.6%
unpow286.6%
*-commutative86.6%
Simplified86.6%
*-commutative86.6%
*-commutative86.6%
*-commutative86.6%
unpow286.6%
associate-*r*86.4%
associate-*r*86.3%
Applied egg-rr86.3%
Final simplification79.3%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (let* ((t_0 (/ 1.0 (* c_m (* x_m s_m))))) (* t_0 t_0)))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
real(8) :: t_0
t_0 = 1.0d0 / (c_m * (x_m * s_m))
code = t_0 * t_0
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
double t_0 = 1.0 / (c_m * (x_m * s_m));
return t_0 * t_0;
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): t_0 = 1.0 / (c_m * (x_m * s_m)) return t_0 * t_0
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) t_0 = Float64(1.0 / Float64(c_m * Float64(x_m * s_m))) return Float64(t_0 * t_0) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
t_0 = 1.0 / (c_m * (x_m * s_m));
tmp = t_0 * t_0;
end
x_m = N[Abs[x], $MachinePrecision]
c_m = N[Abs[c], $MachinePrecision]
s_m = N[Abs[s], $MachinePrecision]
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
code[x$95$m_, c$95$m_, s$95$m_] := Block[{t$95$0 = N[(1.0 / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0), $MachinePrecision]]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\begin{array}{l}
t_0 := \frac{1}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
t\_0 \cdot t\_0
\end{array}
\end{array}
Initial program 65.5%
Taylor expanded in x around 0 53.9%
associate-/r*53.9%
*-commutative53.9%
unpow253.9%
unpow253.9%
swap-sqr65.7%
unpow265.7%
associate-/r*65.8%
unpow265.8%
unpow265.8%
swap-sqr81.1%
unpow281.1%
*-commutative81.1%
Simplified81.1%
pow-flip81.3%
*-commutative81.3%
pow-flip81.1%
unpow281.1%
associate-/r*81.3%
un-div-inv81.3%
Applied egg-rr81.3%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* c_m (* (* x_m s_m) (* c_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(c_m * Float64(Float64(x_m * s_m) * Float64(c_m * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / (c_m * ((x_m * s_m) * (c_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(c$95$m * N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{c\_m \cdot \left(\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 65.5%
Taylor expanded in x around 0 53.9%
associate-/r*53.9%
*-commutative53.9%
unpow253.9%
unpow253.9%
swap-sqr65.7%
unpow265.7%
associate-/r*65.8%
unpow265.8%
unpow265.8%
swap-sqr81.1%
unpow281.1%
*-commutative81.1%
Simplified81.1%
*-commutative81.1%
*-commutative81.1%
*-commutative81.1%
unpow281.1%
*-commutative81.1%
associate-*r*79.9%
Applied egg-rr79.9%
Final simplification79.9%
x_m = (fabs.f64 x) c_m = (fabs.f64 c) s_m = (fabs.f64 s) NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. (FPCore (x_m c_m s_m) :precision binary64 (/ 1.0 (* (* c_m s_m) (* x_m (* c_m (* x_m s_m))))))
x_m = fabs(x);
c_m = fabs(c);
s_m = fabs(s);
assert(x_m < c_m && c_m < s_m);
double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
}
x_m = abs(x)
c_m = abs(c)
s_m = abs(s)
NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function.
real(8) function code(x_m, c_m, s_m)
real(8), intent (in) :: x_m
real(8), intent (in) :: c_m
real(8), intent (in) :: s_m
code = 1.0d0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))))
end function
x_m = Math.abs(x);
c_m = Math.abs(c);
s_m = Math.abs(s);
assert x_m < c_m && c_m < s_m;
public static double code(double x_m, double c_m, double s_m) {
return 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
}
x_m = math.fabs(x) c_m = math.fabs(c) s_m = math.fabs(s) [x_m, c_m, s_m] = sort([x_m, c_m, s_m]) def code(x_m, c_m, s_m): return 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))))
x_m = abs(x) c_m = abs(c) s_m = abs(s) x_m, c_m, s_m = sort([x_m, c_m, s_m]) function code(x_m, c_m, s_m) return Float64(1.0 / Float64(Float64(c_m * s_m) * Float64(x_m * Float64(c_m * Float64(x_m * s_m))))) end
x_m = abs(x);
c_m = abs(c);
s_m = abs(s);
x_m, c_m, s_m = num2cell(sort([x_m, c_m, s_m])){:}
function tmp = code(x_m, c_m, s_m)
tmp = 1.0 / ((c_m * s_m) * (x_m * (c_m * (x_m * s_m))));
end
x_m = N[Abs[x], $MachinePrecision] c_m = N[Abs[c], $MachinePrecision] s_m = N[Abs[s], $MachinePrecision] NOTE: x_m, c_m, and s_m should be sorted in increasing order before calling this function. code[x$95$m_, c$95$m_, s$95$m_] := N[(1.0 / N[(N[(c$95$m * s$95$m), $MachinePrecision] * N[(x$95$m * N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
x_m = \left|x\right|
\\
c_m = \left|c\right|
\\
s_m = \left|s\right|
\\
[x_m, c_m, s_m] = \mathsf{sort}([x_m, c_m, s_m])\\
\\
\frac{1}{\left(c\_m \cdot s\_m\right) \cdot \left(x\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 65.5%
Taylor expanded in x around 0 53.9%
associate-/r*53.9%
*-commutative53.9%
unpow253.9%
unpow253.9%
swap-sqr65.7%
unpow265.7%
associate-/r*65.8%
unpow265.8%
unpow265.8%
swap-sqr81.1%
unpow281.1%
*-commutative81.1%
Simplified81.1%
unpow281.1%
associate-*r*79.0%
*-commutative79.0%
associate-*l*77.1%
Applied egg-rr77.1%
herbie shell --seed 2024088
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))