\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right){\left({e}^{\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)}\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 r10670 = c;
double r10671 = cosh(r10670);
double r10672 = a;
double r10673 = log1p(r10672);
double r10674 = fmod(r10671, r10673);
return r10674;
}
double f(double a, double c) {
double r10675 = exp(1.0);
double r10676 = c;
double r10677 = cosh(r10676);
double r10678 = a;
double r10679 = log1p(r10678);
double r10680 = fmod(r10677, r10679);
double r10681 = log(r10680);
double r10682 = cbrt(r10681);
double r10683 = r10682 * r10682;
double r10684 = pow(r10675, r10683);
double r10685 = r10683 * r10682;
double r10686 = cbrt(r10685);
double r10687 = pow(r10684, r10686);
return r10687;
}



Bits error versus a



Bits error versus c
Initial program 34.7
rmApplied add-exp-log34.7
rmApplied pow134.7
Applied log-pow34.7
Applied exp-prod34.7
Simplified34.7
rmApplied add-cube-cbrt34.7
Applied pow-unpow34.7
rmApplied add-cube-cbrt34.7
Final simplification34.7
herbie shell --seed 2019362
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))