\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\left({\left(e^{\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}^{\left(\sqrt[3]{\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}\right)}^{\left(\sqrt[3]{\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}double f(double a, double c) {
double r12073 = c;
double r12074 = cosh(r12073);
double r12075 = a;
double r12076 = log1p(r12075);
double r12077 = fmod(r12074, r12076);
return r12077;
}
double f(double a, double c) {
double r12078 = c;
double r12079 = cosh(r12078);
double r12080 = a;
double r12081 = log1p(r12080);
double r12082 = fmod(r12079, r12081);
double r12083 = log(r12082);
double r12084 = cbrt(r12083);
double r12085 = r12084 * r12084;
double r12086 = exp(r12085);
double r12087 = cbrt(r12084);
double r12088 = r12087 * r12087;
double r12089 = pow(r12086, r12088);
double r12090 = pow(r12089, r12087);
return r12090;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-exp-log34.0
rmApplied add-cube-cbrt34.0
Applied exp-prod34.0
rmApplied add-cube-cbrt34.0
Applied pow-unpow34.0
Final simplification34.0
herbie shell --seed 2020044
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))