
(FPCore (r a b) :precision binary64 (/ (* r (sin b)) (cos (+ a b))))
double code(double r, double a, double b) {
return (r * sin(b)) / cos((a + b));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (r * sin(b)) / cos((a + b))
end function
public static double code(double r, double a, double b) {
return (r * Math.sin(b)) / Math.cos((a + b));
}
def code(r, a, b): return (r * math.sin(b)) / math.cos((a + b))
function code(r, a, b) return Float64(Float64(r * sin(b)) / cos(Float64(a + b))) end
function tmp = code(r, a, b) tmp = (r * sin(b)) / cos((a + b)); end
code[r_, a_, b_] := N[(N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision] / N[Cos[N[(a + b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r \cdot \sin b}{\cos \left(a + b\right)}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (r a b) :precision binary64 (/ (* r (sin b)) (cos (+ a b))))
double code(double r, double a, double b) {
return (r * sin(b)) / cos((a + b));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (r * sin(b)) / cos((a + b))
end function
public static double code(double r, double a, double b) {
return (r * Math.sin(b)) / Math.cos((a + b));
}
def code(r, a, b): return (r * math.sin(b)) / math.cos((a + b))
function code(r, a, b) return Float64(Float64(r * sin(b)) / cos(Float64(a + b))) end
function tmp = code(r, a, b) tmp = (r * sin(b)) / cos((a + b)); end
code[r_, a_, b_] := N[(N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision] / N[Cos[N[(a + b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r \cdot \sin b}{\cos \left(a + b\right)}
\end{array}
(FPCore (r a b) :precision binary64 (/ (* r (sin b)) (fma (cos b) (cos a) (* (sin b) (- (sin a))))))
double code(double r, double a, double b) {
return (r * sin(b)) / fma(cos(b), cos(a), (sin(b) * -sin(a)));
}
function code(r, a, b) return Float64(Float64(r * sin(b)) / fma(cos(b), cos(a), Float64(sin(b) * Float64(-sin(a))))) end
code[r_, a_, b_] := N[(N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision] / N[(N[Cos[b], $MachinePrecision] * N[Cos[a], $MachinePrecision] + N[(N[Sin[b], $MachinePrecision] * (-N[Sin[a], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r \cdot \sin b}{\mathsf{fma}\left(\cos b, \cos a, \sin b \cdot \left(-\sin a\right)\right)}
\end{array}
Initial program 80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
fma-neg99.6%
Applied egg-rr99.6%
Final simplification99.6%
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (- (* (cos b) (cos a)) (* (sin b) (sin a))))))
double code(double r, double a, double b) {
return r * (sin(b) / ((cos(b) * cos(a)) - (sin(b) * sin(a))));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * (sin(b) / ((cos(b) * cos(a)) - (sin(b) * sin(a))))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / ((Math.cos(b) * Math.cos(a)) - (Math.sin(b) * Math.sin(a))));
}
def code(r, a, b): return r * (math.sin(b) / ((math.cos(b) * math.cos(a)) - (math.sin(b) * math.sin(a))))
function code(r, a, b) return Float64(r * Float64(sin(b) / Float64(Float64(cos(b) * cos(a)) - Float64(sin(b) * sin(a))))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / ((cos(b) * cos(a)) - (sin(b) * sin(a)))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[(N[(N[Cos[b], $MachinePrecision] * N[Cos[a], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[b], $MachinePrecision] * N[Sin[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos b \cdot \cos a - \sin b \cdot \sin a}
\end{array}
Initial program 80.3%
associate-/l*80.2%
remove-double-neg80.2%
sin-neg80.2%
neg-mul-180.2%
associate-/r*80.2%
associate-/l*80.3%
*-commutative80.3%
associate-*l/80.3%
associate-/l*80.3%
sin-neg80.3%
distribute-lft-neg-in80.3%
distribute-rgt-neg-in80.3%
associate-/l*80.3%
metadata-eval80.3%
/-rgt-identity80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
Applied egg-rr99.5%
Final simplification99.5%
(FPCore (r a b) :precision binary64 (* r (/ (sin b) (* (cos b) (cos a)))))
double code(double r, double a, double b) {
return r * (sin(b) / (cos(b) * cos(a)));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * (sin(b) / (cos(b) * cos(a)))
end function
public static double code(double r, double a, double b) {
return r * (Math.sin(b) / (Math.cos(b) * Math.cos(a)));
}
def code(r, a, b): return r * (math.sin(b) / (math.cos(b) * math.cos(a)))
function code(r, a, b) return Float64(r * Float64(sin(b) / Float64(cos(b) * cos(a)))) end
function tmp = code(r, a, b) tmp = r * (sin(b) / (cos(b) * cos(a))); end
code[r_, a_, b_] := N[(r * N[(N[Sin[b], $MachinePrecision] / N[(N[Cos[b], $MachinePrecision] * N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \frac{\sin b}{\cos b \cdot \cos a}
\end{array}
Initial program 80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
fma-neg99.6%
Applied egg-rr99.6%
sin-mult81.1%
div-sub81.1%
cos-sum81.9%
sub-neg81.9%
add-sqr-sqrt49.0%
sqrt-unprod80.7%
sqr-neg80.7%
sqrt-unprod46.5%
add-sqr-sqrt80.2%
cos-diff80.8%
Applied egg-rr80.8%
+-inverses80.8%
Simplified80.8%
Taylor expanded in r around 0 80.8%
*-commutative80.8%
associate-*r/80.8%
*-commutative80.8%
Simplified80.8%
Final simplification80.8%
(FPCore (r a b) :precision binary64 (* (/ r (cos a)) (/ (sin b) (cos b))))
double code(double r, double a, double b) {
return (r / cos(a)) * (sin(b) / cos(b));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (r / cos(a)) * (sin(b) / cos(b))
end function
public static double code(double r, double a, double b) {
return (r / Math.cos(a)) * (Math.sin(b) / Math.cos(b));
}
def code(r, a, b): return (r / math.cos(a)) * (math.sin(b) / math.cos(b))
function code(r, a, b) return Float64(Float64(r / cos(a)) * Float64(sin(b) / cos(b))) end
function tmp = code(r, a, b) tmp = (r / cos(a)) * (sin(b) / cos(b)); end
code[r_, a_, b_] := N[(N[(r / N[Cos[a], $MachinePrecision]), $MachinePrecision] * N[(N[Sin[b], $MachinePrecision] / N[Cos[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r}{\cos a} \cdot \frac{\sin b}{\cos b}
\end{array}
Initial program 80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
fma-neg99.6%
Applied egg-rr99.6%
sin-mult81.1%
div-sub81.1%
cos-sum81.9%
sub-neg81.9%
add-sqr-sqrt49.0%
sqrt-unprod80.7%
sqr-neg80.7%
sqrt-unprod46.5%
add-sqr-sqrt80.2%
cos-diff80.8%
Applied egg-rr80.8%
+-inverses80.8%
Simplified80.8%
associate-/l*80.7%
associate-/r/80.8%
metadata-eval80.8%
fma-udef80.8%
+-rgt-identity80.8%
Applied egg-rr80.8%
Taylor expanded in r around 0 80.8%
times-frac80.8%
Simplified80.8%
Final simplification80.8%
(FPCore (r a b) :precision binary64 (* (sin b) (/ r (* (cos b) (cos a)))))
double code(double r, double a, double b) {
return sin(b) * (r / (cos(b) * cos(a)));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = sin(b) * (r / (cos(b) * cos(a)))
end function
public static double code(double r, double a, double b) {
return Math.sin(b) * (r / (Math.cos(b) * Math.cos(a)));
}
def code(r, a, b): return math.sin(b) * (r / (math.cos(b) * math.cos(a)))
function code(r, a, b) return Float64(sin(b) * Float64(r / Float64(cos(b) * cos(a)))) end
function tmp = code(r, a, b) tmp = sin(b) * (r / (cos(b) * cos(a))); end
code[r_, a_, b_] := N[(N[Sin[b], $MachinePrecision] * N[(r / N[(N[Cos[b], $MachinePrecision] * N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin b \cdot \frac{r}{\cos b \cdot \cos a}
\end{array}
Initial program 80.3%
+-commutative80.3%
Simplified80.3%
cos-sum99.5%
fma-neg99.6%
Applied egg-rr99.6%
sin-mult81.1%
div-sub81.1%
cos-sum81.9%
sub-neg81.9%
add-sqr-sqrt49.0%
sqrt-unprod80.7%
sqr-neg80.7%
sqrt-unprod46.5%
add-sqr-sqrt80.2%
cos-diff80.8%
Applied egg-rr80.8%
+-inverses80.8%
Simplified80.8%
associate-/l*80.7%
associate-/r/80.8%
metadata-eval80.8%
fma-udef80.8%
+-rgt-identity80.8%
Applied egg-rr80.8%
Final simplification80.8%
(FPCore (r a b) :precision binary64 (* (sin b) (/ r (cos (+ b a)))))
double code(double r, double a, double b) {
return sin(b) * (r / cos((b + a)));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = sin(b) * (r / cos((b + a)))
end function
public static double code(double r, double a, double b) {
return Math.sin(b) * (r / Math.cos((b + a)));
}
def code(r, a, b): return math.sin(b) * (r / math.cos((b + a)))
function code(r, a, b) return Float64(sin(b) * Float64(r / cos(Float64(b + a)))) end
function tmp = code(r, a, b) tmp = sin(b) * (r / cos((b + a))); end
code[r_, a_, b_] := N[(N[Sin[b], $MachinePrecision] * N[(r / N[Cos[N[(b + a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\sin b \cdot \frac{r}{\cos \left(b + a\right)}
\end{array}
Initial program 80.3%
associate-/l*80.2%
+-commutative80.2%
Simplified80.2%
associate-/r/80.3%
Applied egg-rr80.3%
Final simplification80.3%
(FPCore (r a b) :precision binary64 (if (or (<= b -4.8e-6) (not (<= b 5.6e-5))) (* r (tan b)) (* r (/ b (cos a)))))
double code(double r, double a, double b) {
double tmp;
if ((b <= -4.8e-6) || !(b <= 5.6e-5)) {
tmp = r * tan(b);
} else {
tmp = r * (b / cos(a));
}
return tmp;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((b <= (-4.8d-6)) .or. (.not. (b <= 5.6d-5))) then
tmp = r * tan(b)
else
tmp = r * (b / cos(a))
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if ((b <= -4.8e-6) || !(b <= 5.6e-5)) {
tmp = r * Math.tan(b);
} else {
tmp = r * (b / Math.cos(a));
}
return tmp;
}
def code(r, a, b): tmp = 0 if (b <= -4.8e-6) or not (b <= 5.6e-5): tmp = r * math.tan(b) else: tmp = r * (b / math.cos(a)) return tmp
function code(r, a, b) tmp = 0.0 if ((b <= -4.8e-6) || !(b <= 5.6e-5)) tmp = Float64(r * tan(b)); else tmp = Float64(r * Float64(b / cos(a))); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if ((b <= -4.8e-6) || ~((b <= 5.6e-5))) tmp = r * tan(b); else tmp = r * (b / cos(a)); end tmp_2 = tmp; end
code[r_, a_, b_] := If[Or[LessEqual[b, -4.8e-6], N[Not[LessEqual[b, 5.6e-5]], $MachinePrecision]], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision], N[(r * N[(b / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -4.8 \cdot 10^{-6} \lor \neg \left(b \leq 5.6 \cdot 10^{-5}\right):\\
\;\;\;\;r \cdot \tan b\\
\mathbf{else}:\\
\;\;\;\;r \cdot \frac{b}{\cos a}\\
\end{array}
\end{array}
if b < -4.7999999999999998e-6 or 5.59999999999999992e-5 < b Initial program 59.2%
associate-/l*59.1%
remove-double-neg59.1%
sin-neg59.1%
neg-mul-159.1%
associate-/r*59.1%
associate-/l*59.2%
*-commutative59.2%
associate-*l/59.2%
associate-/l*59.2%
sin-neg59.2%
distribute-lft-neg-in59.2%
distribute-rgt-neg-in59.2%
associate-/l*59.2%
metadata-eval59.2%
/-rgt-identity59.2%
+-commutative59.2%
Simplified59.2%
Taylor expanded in a around 0 58.2%
expm1-log1p-u41.4%
expm1-udef41.3%
quot-tan41.3%
Applied egg-rr41.3%
expm1-def41.5%
expm1-log1p58.3%
Simplified58.3%
if -4.7999999999999998e-6 < b < 5.59999999999999992e-5Initial program 99.4%
associate-/l*99.4%
remove-double-neg99.4%
sin-neg99.4%
neg-mul-199.4%
associate-/r*99.4%
associate-/l*99.4%
*-commutative99.4%
associate-*l/99.5%
associate-/l*99.5%
sin-neg99.5%
distribute-lft-neg-in99.5%
distribute-rgt-neg-in99.5%
associate-/l*99.5%
metadata-eval99.5%
/-rgt-identity99.5%
+-commutative99.5%
Simplified99.5%
Taylor expanded in b around 0 99.5%
Final simplification79.9%
(FPCore (r a b) :precision binary64 (if (or (<= b -0.00011) (not (<= b 5.7e-5))) (* r (tan b)) (* b (/ r (cos a)))))
double code(double r, double a, double b) {
double tmp;
if ((b <= -0.00011) || !(b <= 5.7e-5)) {
tmp = r * tan(b);
} else {
tmp = b * (r / cos(a));
}
return tmp;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((b <= (-0.00011d0)) .or. (.not. (b <= 5.7d-5))) then
tmp = r * tan(b)
else
tmp = b * (r / cos(a))
end if
code = tmp
end function
public static double code(double r, double a, double b) {
double tmp;
if ((b <= -0.00011) || !(b <= 5.7e-5)) {
tmp = r * Math.tan(b);
} else {
tmp = b * (r / Math.cos(a));
}
return tmp;
}
def code(r, a, b): tmp = 0 if (b <= -0.00011) or not (b <= 5.7e-5): tmp = r * math.tan(b) else: tmp = b * (r / math.cos(a)) return tmp
function code(r, a, b) tmp = 0.0 if ((b <= -0.00011) || !(b <= 5.7e-5)) tmp = Float64(r * tan(b)); else tmp = Float64(b * Float64(r / cos(a))); end return tmp end
function tmp_2 = code(r, a, b) tmp = 0.0; if ((b <= -0.00011) || ~((b <= 5.7e-5))) tmp = r * tan(b); else tmp = b * (r / cos(a)); end tmp_2 = tmp; end
code[r_, a_, b_] := If[Or[LessEqual[b, -0.00011], N[Not[LessEqual[b, 5.7e-5]], $MachinePrecision]], N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision], N[(b * N[(r / N[Cos[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -0.00011 \lor \neg \left(b \leq 5.7 \cdot 10^{-5}\right):\\
\;\;\;\;r \cdot \tan b\\
\mathbf{else}:\\
\;\;\;\;b \cdot \frac{r}{\cos a}\\
\end{array}
\end{array}
if b < -1.10000000000000004e-4 or 5.7000000000000003e-5 < b Initial program 59.2%
associate-/l*59.1%
remove-double-neg59.1%
sin-neg59.1%
neg-mul-159.1%
associate-/r*59.1%
associate-/l*59.2%
*-commutative59.2%
associate-*l/59.2%
associate-/l*59.2%
sin-neg59.2%
distribute-lft-neg-in59.2%
distribute-rgt-neg-in59.2%
associate-/l*59.2%
metadata-eval59.2%
/-rgt-identity59.2%
+-commutative59.2%
Simplified59.2%
Taylor expanded in a around 0 58.2%
expm1-log1p-u41.4%
expm1-udef41.3%
quot-tan41.3%
Applied egg-rr41.3%
expm1-def41.5%
expm1-log1p58.3%
Simplified58.3%
if -1.10000000000000004e-4 < b < 5.7000000000000003e-5Initial program 99.4%
+-commutative99.4%
Simplified99.4%
cos-sum99.8%
fma-neg99.8%
Applied egg-rr99.8%
Taylor expanded in b around 0 99.4%
*-commutative99.4%
associate-/l*99.4%
associate-/r/99.5%
Simplified99.5%
Final simplification79.9%
(FPCore (r a b) :precision binary64 (* r (sin b)))
double code(double r, double a, double b) {
return r * sin(b);
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * sin(b)
end function
public static double code(double r, double a, double b) {
return r * Math.sin(b);
}
def code(r, a, b): return r * math.sin(b)
function code(r, a, b) return Float64(r * sin(b)) end
function tmp = code(r, a, b) tmp = r * sin(b); end
code[r_, a_, b_] := N[(r * N[Sin[b], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \sin b
\end{array}
Initial program 80.3%
associate-/l*80.2%
+-commutative80.2%
Simplified80.2%
Taylor expanded in b around 0 57.2%
Taylor expanded in a around 0 41.1%
*-commutative41.1%
Simplified41.1%
Final simplification41.1%
(FPCore (r a b) :precision binary64 (* r (tan b)))
double code(double r, double a, double b) {
return r * tan(b);
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * tan(b)
end function
public static double code(double r, double a, double b) {
return r * Math.tan(b);
}
def code(r, a, b): return r * math.tan(b)
function code(r, a, b) return Float64(r * tan(b)) end
function tmp = code(r, a, b) tmp = r * tan(b); end
code[r_, a_, b_] := N[(r * N[Tan[b], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
r \cdot \tan b
\end{array}
Initial program 80.3%
associate-/l*80.2%
remove-double-neg80.2%
sin-neg80.2%
neg-mul-180.2%
associate-/r*80.2%
associate-/l*80.3%
*-commutative80.3%
associate-*l/80.3%
associate-/l*80.3%
sin-neg80.3%
distribute-lft-neg-in80.3%
distribute-rgt-neg-in80.3%
associate-/l*80.3%
metadata-eval80.3%
/-rgt-identity80.3%
+-commutative80.3%
Simplified80.3%
Taylor expanded in a around 0 63.0%
expm1-log1p-u55.0%
expm1-udef34.4%
quot-tan34.5%
Applied egg-rr34.5%
expm1-def55.0%
expm1-log1p63.0%
Simplified63.0%
Final simplification63.0%
(FPCore (r a b) :precision binary64 (/ r (+ (* b -0.3333333333333333) (/ 1.0 b))))
double code(double r, double a, double b) {
return r / ((b * -0.3333333333333333) + (1.0 / b));
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r / ((b * (-0.3333333333333333d0)) + (1.0d0 / b))
end function
public static double code(double r, double a, double b) {
return r / ((b * -0.3333333333333333) + (1.0 / b));
}
def code(r, a, b): return r / ((b * -0.3333333333333333) + (1.0 / b))
function code(r, a, b) return Float64(r / Float64(Float64(b * -0.3333333333333333) + Float64(1.0 / b))) end
function tmp = code(r, a, b) tmp = r / ((b * -0.3333333333333333) + (1.0 / b)); end
code[r_, a_, b_] := N[(r / N[(N[(b * -0.3333333333333333), $MachinePrecision] + N[(1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{r}{b \cdot -0.3333333333333333 + \frac{1}{b}}
\end{array}
Initial program 80.3%
associate-/l*80.2%
+-commutative80.2%
Simplified80.2%
Taylor expanded in b around 0 55.0%
+-commutative55.0%
neg-mul-155.0%
unsub-neg55.0%
fma-def55.0%
distribute-rgt-out--55.0%
metadata-eval55.0%
Simplified55.0%
Taylor expanded in a around 0 37.8%
Final simplification37.8%
(FPCore (r a b) :precision binary64 (* r b))
double code(double r, double a, double b) {
return r * b;
}
real(8) function code(r, a, b)
real(8), intent (in) :: r
real(8), intent (in) :: a
real(8), intent (in) :: b
code = r * b
end function
public static double code(double r, double a, double b) {
return r * b;
}
def code(r, a, b): return r * b
function code(r, a, b) return Float64(r * b) end
function tmp = code(r, a, b) tmp = r * b; end
code[r_, a_, b_] := N[(r * b), $MachinePrecision]
\begin{array}{l}
\\
r \cdot b
\end{array}
Initial program 80.3%
associate-/l*80.2%
remove-double-neg80.2%
sin-neg80.2%
neg-mul-180.2%
associate-/r*80.2%
associate-/l*80.3%
*-commutative80.3%
associate-*l/80.3%
associate-/l*80.3%
sin-neg80.3%
distribute-lft-neg-in80.3%
distribute-rgt-neg-in80.3%
associate-/l*80.3%
metadata-eval80.3%
/-rgt-identity80.3%
+-commutative80.3%
Simplified80.3%
Taylor expanded in b around 0 54.1%
Taylor expanded in a around 0 37.3%
*-commutative37.3%
Simplified37.3%
Final simplification37.3%
herbie shell --seed 2024019
(FPCore (r a b)
:name "rsin A (should all be same)"
:precision binary64
(/ (* r (sin b)) (cos (+ a b))))