\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 \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)}^{\left(\sqrt[3]{\sqrt[3]{{\left(\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)}^{3}}}\right)}double f(double a, double c) {
double r13518 = c;
double r13519 = cosh(r13518);
double r13520 = a;
double r13521 = log1p(r13520);
double r13522 = fmod(r13519, r13521);
return r13522;
}
double f(double a, double c) {
double r13523 = c;
double r13524 = cosh(r13523);
double r13525 = a;
double r13526 = log1p(r13525);
double r13527 = fmod(r13524, r13526);
double r13528 = log(r13527);
double r13529 = r13528 * r13528;
double r13530 = cbrt(r13529);
double r13531 = exp(r13530);
double r13532 = cbrt(r13528);
double r13533 = r13532 * r13532;
double r13534 = r13533 * r13532;
double r13535 = 3.0;
double r13536 = pow(r13534, r13535);
double r13537 = cbrt(r13536);
double r13538 = cbrt(r13537);
double r13539 = pow(r13531, r13538);
return r13539;
}



Bits error versus a



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