\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\sqrt{\left(\left(\cosh c\right) \bmod \left(\left(\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}\right) \cdot \left(\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}\right)\right)\right)} \cdot \sqrt{\left(\left(\cosh c\right) \bmod \left(\left(\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}\right) \cdot \left(\sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)} \cdot \sqrt[3]{\mathsf{log1p}\left(a\right)}} \cdot \sqrt[3]{\sqrt[3]{\mathsf{log1p}\left(a\right)}}\right)\right)\right)}double f(double a, double c) {
double r22076 = c;
double r22077 = cosh(r22076);
double r22078 = a;
double r22079 = log1p(r22078);
double r22080 = fmod(r22077, r22079);
return r22080;
}
double f(double a, double c) {
double r22081 = c;
double r22082 = cosh(r22081);
double r22083 = a;
double r22084 = log1p(r22083);
double r22085 = cbrt(r22084);
double r22086 = r22085 * r22085;
double r22087 = cbrt(r22086);
double r22088 = cbrt(r22085);
double r22089 = r22087 * r22088;
double r22090 = r22086 * r22089;
double r22091 = fmod(r22082, r22090);
double r22092 = sqrt(r22091);
double r22093 = r22092 * r22092;
return r22093;
}



Bits error versus a



Bits error versus c
Initial program 34.8
rmApplied add-cube-cbrt34.5
rmApplied add-cube-cbrt34.5
Applied cbrt-prod34.5
rmApplied add-sqr-sqrt34.5
Final simplification34.5
herbie shell --seed 2020034
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))