\cos^{-1} \left({\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)e^{\left(\sqrt[3]{\mathsf{log1p}\left(\mathsf{expm1}\left(\log \left(\cos^{-1} \left({\left(\log \left(e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)\right)\right)\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(\mathsf{expm1}\left(\log \left(\cos^{-1} \left({\left(\log \left(e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)\right)\right)\right)}\right) \cdot \sqrt[3]{\mathsf{log1p}\left(\mathsf{expm1}\left(\log \left(\cos^{-1} \left({\left(\log \left(e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)\right)\right)\right)}}double f(double a) {
double r4872 = a;
double r4873 = cosh(r4872);
double r4874 = r4872 * r4872;
double r4875 = fmod(r4873, r4874);
double r4876 = log1p(r4872);
double r4877 = pow(r4875, r4876);
double r4878 = acos(r4877);
return r4878;
}
double f(double a) {
double r4879 = a;
double r4880 = cosh(r4879);
double r4881 = r4879 * r4879;
double r4882 = fmod(r4880, r4881);
double r4883 = exp(r4882);
double r4884 = log(r4883);
double r4885 = log1p(r4879);
double r4886 = pow(r4884, r4885);
double r4887 = acos(r4886);
double r4888 = log(r4887);
double r4889 = expm1(r4888);
double r4890 = log1p(r4889);
double r4891 = cbrt(r4890);
double r4892 = r4891 * r4891;
double r4893 = r4892 * r4891;
double r4894 = exp(r4893);
return r4894;
}



Bits error versus a
Initial program 61.1
rmApplied add-log-exp60.2
rmApplied add-exp-log60.2
rmApplied log1p-expm1-u60.2
rmApplied add-cube-cbrt60.2
Final simplification60.2
herbie shell --seed 2020060 +o rules:numerics
(FPCore (a)
:name "Random Jason Timeout Test 012"
:precision binary64
(acos (pow (fmod (cosh a) (* a a)) (log1p a))))