\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\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]{\left(\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) \cdot \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 r19023 = c;
double r19024 = cosh(r19023);
double r19025 = a;
double r19026 = log1p(r19025);
double r19027 = fmod(r19024, r19026);
return r19027;
}
double f(double a, double c) {
double r19028 = c;
double r19029 = cosh(r19028);
double r19030 = a;
double r19031 = log1p(r19030);
double r19032 = fmod(r19029, r19031);
double r19033 = log(r19032);
double r19034 = cbrt(r19033);
double r19035 = r19034 * r19034;
double r19036 = exp(r19035);
double r19037 = r19035 * r19034;
double r19038 = cbrt(r19037);
double r19039 = pow(r19036, r19038);
return r19039;
}



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
Final simplification34.0
herbie shell --seed 2020081 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))