\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot e^{\log \left(\sqrt[3]{{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}^{\frac{2}{3}} \cdot \sqrt[3]{\left(\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}}\right)}double f(double a, double c) {
double r12361 = c;
double r12362 = cosh(r12361);
double r12363 = a;
double r12364 = log1p(r12363);
double r12365 = fmod(r12362, r12364);
return r12365;
}
double f(double a, double c) {
double r12366 = c;
double r12367 = cosh(r12366);
double r12368 = a;
double r12369 = log1p(r12368);
double r12370 = fmod(r12367, r12369);
double r12371 = cbrt(r12370);
double r12372 = r12371 * r12371;
double r12373 = 0.6666666666666666;
double r12374 = pow(r12370, r12373);
double r12375 = r12372 * r12371;
double r12376 = cbrt(r12375);
double r12377 = r12374 * r12376;
double r12378 = cbrt(r12377);
double r12379 = log(r12378);
double r12380 = exp(r12379);
double r12381 = r12372 * r12380;
return r12381;
}



Bits error versus a



Bits error versus c
Initial program 34.4
rmApplied add-cube-cbrt34.4
rmApplied add-exp-log34.4
rmApplied add-cube-cbrt34.4
Simplified34.4
rmApplied add-cube-cbrt34.4
Final simplification34.4
herbie shell --seed 2019310 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))