Average Error: 34.5 → 34.5
Time: 13.7s
Precision: 64
\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
↓
\[{e}^{\left(\left(\sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}\]
\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)
↓
{e}^{\left(\left(\sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}
double code(double a, double c) {
	return fmod(cosh(c), log1p(a));
}
↓
double code(double a, double c) {
	return pow(((double) M_E), ((cbrt(log(fmod(exp(log(cosh(c))), log1p(a)))) * cbrt(log(fmod(exp(log(cosh(c))), log1p(a))))) * cbrt(log(fmod(exp(log(cosh(c))), log1p(a))))));
}

Error

Bits error versus a

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 34.5

    \[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
  2. Using strategy rm

  3. Applied add-exp-log34.5

    \[\leadsto \left(\color{blue}{\left(e^{\log \left(\cosh c\right)}\right)} \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
  4. Using strategy rm

  5. Applied add-exp-log34.5

    \[\leadsto \color{blue}{e^{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]
  6. Using strategy rm

  7. Applied pow134.5

    \[\leadsto e^{\log \color{blue}{\left({\left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}^{1}\right)}}\]

  8. Applied log-pow34.5

    \[\leadsto e^{\color{blue}{1 \cdot \log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]

  9. Applied exp-prod34.5

    \[\leadsto \color{blue}{{\left(e^{1}\right)}^{\left(\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}}\]

  10. Simplified34.5

    \[\leadsto {\color{blue}{e}}^{\left(\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}\]
  11. Using strategy rm

  12. Applied add-cube-cbrt34.5

    \[\leadsto {e}^{\color{blue}{\left(\left(\sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}}\]

  13. Final simplification34.5

    \[\leadsto {e}^{\left(\left(\sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\log \left(\left(e^{\log \left(\cosh c\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}\]

Reproduce

herbie shell --seed 2020065 
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  :precision binary64
  (fmod (cosh c) (log1p a)))