\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot e^{\log \left(\sqrt[3]{{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}^{\frac{2}{3}} \cdot \sqrt[3]{\left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}}\right)}double f(double a, double c) {
double r12080 = c;
double r12081 = cosh(r12080);
double r12082 = a;
double r12083 = log1p(r12082);
double r12084 = fmod(r12081, r12083);
return r12084;
}
double f(double a, double c) {
double r12085 = c;
double r12086 = cosh(r12085);
double r12087 = a;
double r12088 = log1p(r12087);
double r12089 = fmod(r12086, r12088);
double r12090 = cbrt(r12089);
double r12091 = r12090 * r12090;
double r12092 = 0.6666666666666666;
double r12093 = pow(r12089, r12092);
double r12094 = r12091 * r12090;
double r12095 = cbrt(r12094);
double r12096 = r12093 * r12095;
double r12097 = cbrt(r12096);
double r12098 = log(r12097);
double r12099 = exp(r12098);
double r12100 = r12091 * r12099;
return r12100;
}



Bits error versus a



Bits error versus c
Initial program 34.4
rmApplied add-cube-cbrt34.4
rmApplied add-exp-log34.4
rmApplied add-cube-cbrt34.4
Simplified34.4
rmApplied add-cube-cbrt34.4
Final simplification34.4
herbie shell --seed 2019310
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))