\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\left(\sqrt[3]{\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \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) \cdot \left(\sqrt[3]{\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \left(\sqrt[3]{\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt[3]{\sqrt[3]{\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\right)\right)double f(double a, double c) {
double r847904 = c;
double r847905 = cosh(r847904);
double r847906 = a;
double r847907 = log1p(r847906);
double r847908 = fmod(r847905, r847907);
return r847908;
}
double f(double a, double c) {
double r847909 = c;
double r847910 = cosh(r847909);
double r847911 = a;
double r847912 = log1p(r847911);
double r847913 = fmod(r847910, r847912);
double r847914 = cbrt(r847913);
double r847915 = r847914 * r847914;
double r847916 = r847914 * r847915;
double r847917 = cbrt(r847916);
double r847918 = r847917 * r847914;
double r847919 = cbrt(r847914);
double r847920 = r847919 * r847919;
double r847921 = r847919 * r847920;
double r847922 = r847918 * r847921;
return r847922;
}



Bits error versus a



Bits error versus c
Initial program 34.5
rmApplied add-cube-cbrt34.5
rmApplied add-cube-cbrt34.5
rmApplied add-cube-cbrt34.5
Final simplification34.5
herbie shell --seed 2019149 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
(fmod (cosh c) (log1p a)))