\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 r16085 = c;
double r16086 = cosh(r16085);
double r16087 = a;
double r16088 = log1p(r16087);
double r16089 = fmod(r16086, r16088);
return r16089;
}
double f(double a, double c) {
double r16090 = c;
double r16091 = cosh(r16090);
double r16092 = a;
double r16093 = log1p(r16092);
double r16094 = fmod(r16091, r16093);
double r16095 = log(r16094);
double r16096 = cbrt(r16095);
double r16097 = r16096 * r16096;
double r16098 = exp(r16097);
double r16099 = r16097 * r16096;
double r16100 = cbrt(r16099);
double r16101 = pow(r16098, r16100);
return r16101;
}



Bits error versus a



Bits error versus c
Initial program 33.9
rmApplied add-exp-log33.9
rmApplied add-cube-cbrt33.9
Applied exp-prod33.9
rmApplied add-cube-cbrt33.9
Final simplification33.9
herbie shell --seed 2020046 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))