\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)e^{\left(\sqrt[3]{\log \left(\left(e^{\log \left(\frac{1}{24} \cdot {c}^{4}\right)} + \left(\frac{1}{2} \cdot {c}^{2} + 1\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\frac{1}{24} \cdot {c}^{4}\right)} + \left(\frac{1}{2} \cdot {c}^{2} + 1\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\frac{1}{24} \cdot {c}^{4}\right)} + \left(\frac{1}{2} \cdot {c}^{2} + 1\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}double code(double a, double c) {
return ((double) fmod(((double) cosh(c)), ((double) log1p(a))));
}
double code(double a, double c) {
return ((double) exp(((double) (((double) (((double) cbrt(((double) log(((double) fmod(((double) (((double) exp(((double) log(((double) (0.041666666666666664 * ((double) pow(c, 4.0)))))))) + ((double) (((double) (0.5 * ((double) pow(c, 2.0)))) + 1.0)))), ((double) log1p(a)))))))) * ((double) cbrt(((double) log(((double) fmod(((double) (((double) exp(((double) log(((double) (0.041666666666666664 * ((double) pow(c, 4.0)))))))) + ((double) (((double) (0.5 * ((double) pow(c, 2.0)))) + 1.0)))), ((double) log1p(a)))))))))) * ((double) cbrt(((double) log(((double) fmod(((double) (((double) exp(((double) log(((double) (0.041666666666666664 * ((double) pow(c, 4.0)))))))) + ((double) (((double) (0.5 * ((double) pow(c, 2.0)))) + 1.0)))), ((double) log1p(a))))))))))));
}



Bits error versus a



Bits error versus c
Results
Initial program 34.4
Taylor expanded around 0 34.5
rmApplied add-exp-log49.0
Applied pow-exp49.0
Applied add-exp-log49.0
Applied prod-exp49.0
Simplified34.5
rmApplied add-exp-log34.5
rmApplied add-cube-cbrt34.5
Final simplification34.5
herbie shell --seed 2020123
(FPCore (a c)
:name "Random Jason Timeout Test 004"
:precision binary64
(fmod (cosh c) (log1p a)))