\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 \sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\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 r13015 = c;
double r13016 = cosh(r13015);
double r13017 = a;
double r13018 = log1p(r13017);
double r13019 = fmod(r13016, r13018);
return r13019;
}
double f(double a, double c) {
double r13020 = c;
double r13021 = cosh(r13020);
double r13022 = a;
double r13023 = log1p(r13022);
double r13024 = fmod(r13021, r13023);
double r13025 = log(r13024);
double r13026 = cbrt(r13025);
double r13027 = r13026 * r13026;
double r13028 = exp(r13027);
double r13029 = r13027 * r13026;
double r13030 = cbrt(r13029);
double r13031 = pow(r13028, r13030);
return r13031;
}



Bits error versus a



Bits error versus c
Initial program 33.7
rmApplied add-exp-log33.7
rmApplied add-cube-cbrt33.7
Applied exp-prod33.7
rmApplied add-cube-cbrt33.7
Final simplification33.7
herbie shell --seed 2020042 +o rules:numerics
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))