\cos^{-1} \left({\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)\cos^{-1} \left(\left(\sqrt[3]{{\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)}} \cdot \sqrt[3]{{\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) \cdot \sqrt[3]{{\left(2 \cdot \log \left(\sqrt[3]{e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}}\right) + \log \left(\sqrt[3]{e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}}\right)double f(double a) {
double r13119 = a;
double r13120 = cosh(r13119);
double r13121 = r13119 * r13119;
double r13122 = fmod(r13120, r13121);
double r13123 = log1p(r13119);
double r13124 = pow(r13122, r13123);
double r13125 = acos(r13124);
return r13125;
}
double f(double a) {
double r13126 = a;
double r13127 = cosh(r13126);
double r13128 = r13126 * r13126;
double r13129 = fmod(r13127, r13128);
double r13130 = exp(r13129);
double r13131 = log(r13130);
double r13132 = log1p(r13126);
double r13133 = pow(r13131, r13132);
double r13134 = cbrt(r13133);
double r13135 = r13134 * r13134;
double r13136 = 2.0;
double r13137 = cbrt(r13130);
double r13138 = log(r13137);
double r13139 = r13136 * r13138;
double r13140 = r13139 + r13138;
double r13141 = pow(r13140, r13132);
double r13142 = cbrt(r13141);
double r13143 = r13135 * r13142;
double r13144 = acos(r13143);
return r13144;
}



Bits error versus a
Initial program 61.2
rmApplied add-log-exp60.2
rmApplied add-cube-cbrt60.2
rmApplied add-cube-cbrt60.2
Applied log-prod60.2
Simplified60.2
Final simplification60.2
herbie shell --seed 2019303
(FPCore (a)
:name "Random Jason Timeout Test 012"
:precision binary64
(acos (pow (fmod (cosh a) (* a a)) (log1p a))))