\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right) \cdot \left(\left(\sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right) \cdot \left(\sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)\right)double f(double a, double c) {
double r1260720 = c;
double r1260721 = cosh(r1260720);
double r1260722 = a;
double r1260723 = log1p(r1260722);
double r1260724 = fmod(r1260721, r1260723);
return r1260724;
}
double f(double a, double c) {
double r1260725 = c;
double r1260726 = cosh(r1260725);
double r1260727 = a;
double r1260728 = log1p(r1260727);
double r1260729 = fmod(r1260726, r1260728);
double r1260730 = sqrt(r1260729);
double r1260731 = cbrt(r1260730);
double r1260732 = r1260731 * r1260731;
double r1260733 = r1260732 * r1260732;
double r1260734 = r1260732 * r1260733;
return r1260734;
}



Bits error versus a



Bits error versus c
Initial program 34.0
rmApplied add-sqr-sqrt34.0
rmApplied add-cube-cbrt34.0
Applied add-cube-cbrt34.0
Applied swap-sqr34.0
Final simplification34.0
herbie shell --seed 2019171 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
(fmod (cosh c) (log1p a)))