
(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 9 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 (* s_m (* x_m c_m))))
(if (<= x_m 4e-33)
(/ (/ (/ (/ 1.0 x_m) s_m) c_m) (* c_m (* x_m s_m)))
(/ (/ (cos (* x_m -2.0)) 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 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 4e-33) {
tmp = (((1.0 / x_m) / s_m) / c_m) / (c_m * (x_m * s_m));
} else {
tmp = (cos((x_m * -2.0)) / t_0) / 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) :: tmp
t_0 = s_m * (x_m * c_m)
if (x_m <= 4d-33) then
tmp = (((1.0d0 / x_m) / s_m) / c_m) / (c_m * (x_m * s_m))
else
tmp = (cos((x_m * (-2.0d0))) / t_0) / 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 = s_m * (x_m * c_m);
double tmp;
if (x_m <= 4e-33) {
tmp = (((1.0 / x_m) / s_m) / c_m) / (c_m * (x_m * s_m));
} else {
tmp = (Math.cos((x_m * -2.0)) / t_0) / 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 = s_m * (x_m * c_m) tmp = 0 if x_m <= 4e-33: tmp = (((1.0 / x_m) / s_m) / c_m) / (c_m * (x_m * s_m)) else: tmp = (math.cos((x_m * -2.0)) / t_0) / 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(s_m * Float64(x_m * c_m)) tmp = 0.0 if (x_m <= 4e-33) tmp = Float64(Float64(Float64(Float64(1.0 / x_m) / s_m) / c_m) / Float64(c_m * Float64(x_m * s_m))); else tmp = Float64(Float64(cos(Float64(x_m * -2.0)) / t_0) / 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 = s_m * (x_m * c_m);
tmp = 0.0;
if (x_m <= 4e-33)
tmp = (((1.0 / x_m) / s_m) / c_m) / (c_m * (x_m * s_m));
else
tmp = (cos((x_m * -2.0)) / t_0) / 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[(s$95$m * N[(x$95$m * c$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x$95$m, 4e-33], N[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] / 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 := s\_m \cdot \left(x\_m \cdot c\_m\right)\\
\mathbf{if}\;x\_m \leq 4 \cdot 10^{-33}:\\
\;\;\;\;\frac{\frac{\frac{\frac{1}{x\_m}}{s\_m}}{c\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\cos \left(x\_m \cdot -2\right)}{t\_0}}{t\_0}\\
\end{array}
\end{array}
if x < 4.0000000000000002e-33Initial program 62.1%
add-cbrt-cube58.5%
pow358.5%
*-commutative58.5%
associate-*r*54.3%
unpow254.3%
associate-*l*54.2%
pow-prod-down65.0%
pow-prod-down72.3%
Applied egg-rr72.3%
rem-cbrt-cube96.1%
associate-*l*98.0%
*-commutative98.0%
unpow298.0%
associate-/r*98.0%
*-commutative98.0%
Applied egg-rr98.0%
*-rgt-identity98.0%
times-frac98.1%
*-commutative98.1%
Applied egg-rr98.1%
Taylor expanded in x around 0 85.4%
associate-*r*82.4%
associate-/l/82.3%
associate-/l/85.5%
Simplified85.5%
if 4.0000000000000002e-33 < x Initial program 60.4%
*-commutative60.4%
associate-*l*63.1%
associate-/r*63.2%
associate-/l/62.3%
associate-/l/60.6%
cos-neg60.6%
*-commutative60.6%
distribute-rgt-neg-in60.6%
metadata-eval60.6%
*-commutative60.6%
associate-*l*57.9%
unpow257.9%
Simplified57.9%
Taylor expanded in x around inf 60.2%
*-commutative60.2%
*-commutative60.2%
associate-*r*58.7%
unpow258.7%
unpow258.7%
swap-sqr72.7%
unpow272.7%
swap-sqr98.2%
unpow298.2%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
unpow299.5%
associate-*r*98.3%
associate-*r*96.6%
Applied egg-rr96.6%
*-un-lft-identity96.6%
associate-*l*98.3%
associate-*r*99.5%
times-frac99.4%
associate-*r*98.3%
*-commutative98.3%
associate-*r*98.2%
*-commutative98.2%
Applied egg-rr98.2%
associate-*l/98.3%
*-lft-identity98.3%
associate-*r*97.1%
*-commutative97.1%
*-commutative97.1%
associate-*r*98.2%
*-commutative98.2%
*-commutative98.2%
Simplified98.2%
Final simplification89.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 (cos (* x_m -2.0))) (t_1 (* c_m (* x_m s_m))))
(if (<= c_m 1e-175)
(/ t_0 (* x_m (* t_1 (* c_m s_m))))
(/ t_0 (* (* x_m s_m) (* c_m t_1))))))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 t_1 = c_m * (x_m * s_m);
double tmp;
if (c_m <= 1e-175) {
tmp = t_0 / (x_m * (t_1 * (c_m * s_m)));
} else {
tmp = t_0 / ((x_m * s_m) * (c_m * t_1));
}
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 = cos((x_m * (-2.0d0)))
t_1 = c_m * (x_m * s_m)
if (c_m <= 1d-175) then
tmp = t_0 / (x_m * (t_1 * (c_m * s_m)))
else
tmp = t_0 / ((x_m * s_m) * (c_m * t_1))
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 t_1 = c_m * (x_m * s_m);
double tmp;
if (c_m <= 1e-175) {
tmp = t_0 / (x_m * (t_1 * (c_m * s_m)));
} else {
tmp = t_0 / ((x_m * s_m) * (c_m * t_1));
}
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)) t_1 = c_m * (x_m * s_m) tmp = 0 if c_m <= 1e-175: tmp = t_0 / (x_m * (t_1 * (c_m * s_m))) else: tmp = t_0 / ((x_m * s_m) * (c_m * t_1)) 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)) t_1 = Float64(c_m * Float64(x_m * s_m)) tmp = 0.0 if (c_m <= 1e-175) tmp = Float64(t_0 / Float64(x_m * Float64(t_1 * Float64(c_m * s_m)))); else tmp = Float64(t_0 / Float64(Float64(x_m * s_m) * Float64(c_m * t_1))); 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));
t_1 = c_m * (x_m * s_m);
tmp = 0.0;
if (c_m <= 1e-175)
tmp = t_0 / (x_m * (t_1 * (c_m * s_m)));
else
tmp = t_0 / ((x_m * s_m) * (c_m * t_1));
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]}, Block[{t$95$1 = N[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c$95$m, 1e-175], N[(t$95$0 / N[(x$95$m * N[(t$95$1 * N[(c$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$95$m * t$95$1), $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 := \cos \left(x\_m \cdot -2\right)\\
t_1 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\mathbf{if}\;c\_m \leq 10^{-175}:\\
\;\;\;\;\frac{t\_0}{x\_m \cdot \left(t\_1 \cdot \left(c\_m \cdot s\_m\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot t\_1\right)}\\
\end{array}
\end{array}
if c < 1e-175Initial program 56.9%
*-commutative56.9%
associate-*l*58.3%
associate-/r*58.3%
associate-/l/57.2%
associate-/l/55.1%
cos-neg55.1%
*-commutative55.1%
distribute-rgt-neg-in55.1%
metadata-eval55.1%
*-commutative55.1%
associate-*l*52.1%
unpow252.1%
Simplified52.1%
Taylor expanded in x around inf 53.9%
*-commutative53.9%
*-commutative53.9%
associate-*r*53.1%
unpow253.1%
unpow253.1%
swap-sqr70.9%
unpow270.9%
swap-sqr95.2%
unpow295.2%
associate-*l*98.8%
*-commutative98.8%
Simplified98.8%
unpow298.8%
associate-*r*94.1%
associate-*r*88.5%
Applied egg-rr88.5%
if 1e-175 < c Initial program 68.3%
*-commutative68.3%
associate-*l*73.2%
associate-/r*73.2%
associate-/l/73.2%
associate-/l/71.4%
cos-neg71.4%
*-commutative71.4%
distribute-rgt-neg-in71.4%
metadata-eval71.4%
*-commutative71.4%
associate-*l*64.0%
unpow264.0%
Simplified64.0%
Taylor expanded in x around inf 63.9%
*-commutative63.9%
*-commutative63.9%
associate-*r*64.0%
unpow264.0%
unpow264.0%
swap-sqr82.1%
unpow282.1%
swap-sqr98.7%
unpow298.7%
associate-*l*97.8%
*-commutative97.8%
Simplified97.8%
unpow297.8%
associate-*r*97.8%
Applied egg-rr97.8%
Final simplification92.4%
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 (<= x_m 4e-32)
(/ (/ (/ (/ 1.0 x_m) s_m) c_m) t_0)
(/ (cos (* x_m -2.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 (x_m <= 4e-32) {
tmp = (((1.0 / x_m) / s_m) / c_m) / t_0;
} else {
tmp = cos((x_m * -2.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 (x_m <= 4d-32) then
tmp = (((1.0d0 / x_m) / s_m) / c_m) / t_0
else
tmp = cos((x_m * (-2.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 (x_m <= 4e-32) {
tmp = (((1.0 / x_m) / s_m) / c_m) / t_0;
} else {
tmp = Math.cos((x_m * -2.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 x_m <= 4e-32: tmp = (((1.0 / x_m) / s_m) / c_m) / t_0 else: tmp = math.cos((x_m * -2.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 (x_m <= 4e-32) tmp = Float64(Float64(Float64(Float64(1.0 / x_m) / s_m) / c_m) / t_0); else tmp = Float64(cos(Float64(x_m * -2.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 (x_m <= 4e-32)
tmp = (((1.0 / x_m) / s_m) / c_m) / t_0;
else
tmp = cos((x_m * -2.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[x$95$m, 4e-32], N[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / 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}\;x\_m \leq 4 \cdot 10^{-32}:\\
\;\;\;\;\frac{\frac{\frac{\frac{1}{x\_m}}{s\_m}}{c\_m}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\cos \left(x\_m \cdot -2\right)}{s\_m \cdot \left(t\_0 \cdot \left(x\_m \cdot c\_m\right)\right)}\\
\end{array}
\end{array}
if x < 4.00000000000000022e-32Initial program 62.1%
add-cbrt-cube58.5%
pow358.5%
*-commutative58.5%
associate-*r*54.3%
unpow254.3%
associate-*l*54.2%
pow-prod-down65.0%
pow-prod-down72.3%
Applied egg-rr72.3%
rem-cbrt-cube96.1%
associate-*l*98.0%
*-commutative98.0%
unpow298.0%
associate-/r*98.0%
*-commutative98.0%
Applied egg-rr98.0%
*-rgt-identity98.0%
times-frac98.1%
*-commutative98.1%
Applied egg-rr98.1%
Taylor expanded in x around 0 85.4%
associate-*r*82.4%
associate-/l/82.3%
associate-/l/85.5%
Simplified85.5%
if 4.00000000000000022e-32 < x Initial program 60.4%
*-commutative60.4%
associate-*l*63.1%
associate-/r*63.2%
associate-/l/62.3%
associate-/l/60.6%
cos-neg60.6%
*-commutative60.6%
distribute-rgt-neg-in60.6%
metadata-eval60.6%
*-commutative60.6%
associate-*l*57.9%
unpow257.9%
Simplified57.9%
Taylor expanded in x around inf 60.2%
*-commutative60.2%
*-commutative60.2%
associate-*r*58.7%
unpow258.7%
unpow258.7%
swap-sqr72.7%
unpow272.7%
swap-sqr98.2%
unpow298.2%
associate-*l*99.5%
*-commutative99.5%
Simplified99.5%
unpow299.5%
*-commutative99.5%
associate-*l*98.2%
associate-*r*91.6%
Applied egg-rr91.6%
Final simplification87.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 (/ (cos (* x_m -2.0)) (* (* x_m s_m) (* c_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 cos((x_m * -2.0)) / ((x_m * s_m) * (c_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 = cos((x_m * (-2.0d0))) / ((x_m * s_m) * (c_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 Math.cos((x_m * -2.0)) / ((x_m * s_m) * (c_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 math.cos((x_m * -2.0)) / ((x_m * s_m) * (c_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(cos(Float64(x_m * -2.0)) / Float64(Float64(x_m * s_m) * Float64(c_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 = cos((x_m * -2.0)) / ((x_m * s_m) * (c_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[(N[Cos[N[(x$95$m * -2.0), $MachinePrecision]], $MachinePrecision] / N[(N[(x$95$m * s$95$m), $MachinePrecision] * N[(c$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{\cos \left(x\_m \cdot -2\right)}{\left(x\_m \cdot s\_m\right) \cdot \left(c\_m \cdot \left(c\_m \cdot \left(x\_m \cdot s\_m\right)\right)\right)}
\end{array}
Initial program 61.6%
*-commutative61.6%
associate-*l*64.4%
associate-/r*64.4%
associate-/l/63.8%
associate-/l/61.9%
cos-neg61.9%
*-commutative61.9%
distribute-rgt-neg-in61.9%
metadata-eval61.9%
*-commutative61.9%
associate-*l*57.0%
unpow257.0%
Simplified57.0%
Taylor expanded in x around inf 58.0%
*-commutative58.0%
*-commutative58.0%
associate-*r*57.6%
unpow257.6%
unpow257.6%
swap-sqr75.5%
unpow275.5%
swap-sqr96.6%
unpow296.6%
associate-*l*98.4%
*-commutative98.4%
Simplified98.4%
unpow298.4%
associate-*r*94.1%
Applied egg-rr94.1%
Final simplification94.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 (/ (/ (/ (cos (* x_m 2.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 ((cos((x_m * 2.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 = ((cos((x_m * 2.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 ((Math.cos((x_m * 2.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 ((math.cos((x_m * 2.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(Float64(Float64(cos(Float64(x_m * 2.0)) / c_m) / 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 = ((cos((x_m * 2.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[(N[(N[(N[Cos[N[(x$95$m * 2.0), $MachinePrecision]], $MachinePrecision] / c$95$m), $MachinePrecision] / N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $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{\frac{\frac{\cos \left(x\_m \cdot 2\right)}{c\_m}}{x\_m \cdot s\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 61.6%
add-cbrt-cube58.1%
pow358.1%
*-commutative58.1%
associate-*r*55.0%
unpow255.0%
associate-*l*54.5%
pow-prod-down64.7%
pow-prod-down72.8%
Applied egg-rr72.8%
rem-cbrt-cube96.6%
associate-*l*98.4%
*-commutative98.4%
unpow298.4%
associate-/r*98.4%
*-commutative98.4%
Applied egg-rr98.4%
*-rgt-identity98.4%
times-frac98.4%
*-commutative98.4%
Applied egg-rr98.4%
un-div-inv98.5%
Applied egg-rr98.5%
Final simplification98.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 (/ 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 61.6%
Taylor expanded in x around 0 52.7%
*-commutative52.7%
associate-*r*52.4%
unpow252.4%
unpow252.4%
swap-sqr66.2%
unpow266.2%
swap-sqr79.3%
unpow279.3%
associate-*l*80.4%
*-commutative80.4%
Simplified80.4%
unpow280.4%
associate-*r*78.1%
associate-*l*75.6%
Applied egg-rr75.6%
Final simplification75.6%
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)))) (/ 1.0 (* 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 = c_m * (x_m * s_m);
return 1.0 / (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 = c_m * (x_m * s_m)
code = 1.0d0 / (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 = c_m * (x_m * s_m);
return 1.0 / (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 = c_m * (x_m * s_m) return 1.0 / (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(c_m * Float64(x_m * s_m)) return Float64(1.0 / 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 = c_m * (x_m * s_m);
tmp = 1.0 / (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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(1.0 / N[(t$95$0 * 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)\\
\frac{1}{t\_0 \cdot t\_0}
\end{array}
\end{array}
Initial program 61.6%
Taylor expanded in x around 0 52.7%
*-commutative52.7%
associate-*r*52.4%
unpow252.4%
unpow252.4%
swap-sqr66.2%
unpow266.2%
swap-sqr79.3%
unpow279.3%
associate-*l*80.4%
*-commutative80.4%
Simplified80.4%
unpow280.4%
Applied egg-rr80.4%
Final simplification80.4%
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)))) (/ (/ 1.0 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 = c_m * (x_m * s_m);
return (1.0 / 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 = c_m * (x_m * s_m)
code = (1.0d0 / 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 = c_m * (x_m * s_m);
return (1.0 / 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 = c_m * (x_m * s_m) return (1.0 / 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(c_m * Float64(x_m * s_m)) return Float64(Float64(1.0 / 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 = c_m * (x_m * s_m);
tmp = (1.0 / 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[(c$95$m * N[(x$95$m * s$95$m), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 / t$95$0), $MachinePrecision] / 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 := c\_m \cdot \left(x\_m \cdot s\_m\right)\\
\frac{\frac{1}{t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 61.6%
add-cbrt-cube58.1%
pow358.1%
*-commutative58.1%
associate-*r*55.0%
unpow255.0%
associate-*l*54.5%
pow-prod-down64.7%
pow-prod-down72.8%
Applied egg-rr72.8%
rem-cbrt-cube96.6%
associate-*l*98.4%
*-commutative98.4%
unpow298.4%
associate-/r*98.4%
*-commutative98.4%
Applied egg-rr98.4%
Taylor expanded in x around 0 80.4%
Final simplification80.4%
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 x_m) s_m) c_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 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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(Float64(Float64(Float64(1.0 / x_m) / s_m) / c_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 / x_m) / s_m) / c_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[(N[(N[(N[(1.0 / x$95$m), $MachinePrecision] / s$95$m), $MachinePrecision] / c$95$m), $MachinePrecision] / N[(c$95$m * N[(x$95$m * s$95$m), $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{\frac{\frac{\frac{1}{x\_m}}{s\_m}}{c\_m}}{c\_m \cdot \left(x\_m \cdot s\_m\right)}
\end{array}
Initial program 61.6%
add-cbrt-cube58.1%
pow358.1%
*-commutative58.1%
associate-*r*55.0%
unpow255.0%
associate-*l*54.5%
pow-prod-down64.7%
pow-prod-down72.8%
Applied egg-rr72.8%
rem-cbrt-cube96.6%
associate-*l*98.4%
*-commutative98.4%
unpow298.4%
associate-/r*98.4%
*-commutative98.4%
Applied egg-rr98.4%
*-rgt-identity98.4%
times-frac98.4%
*-commutative98.4%
Applied egg-rr98.4%
Taylor expanded in x around 0 80.4%
associate-*r*78.1%
associate-/l/78.1%
associate-/l/80.5%
Simplified80.5%
Final simplification80.5%
herbie shell --seed 2024040
(FPCore (x c s)
:name "mixedcos"
:precision binary64
(/ (cos (* 2.0 x)) (* (pow c 2.0) (* (* x (pow s 2.0)) x))))