Random Jason Timeout Test 004

Average Error: 34.3 → 33.8

Time: 34.9s

Precision: 64

• could not determine a ground truth for program body

  1. a = -8.084874607089052e-106
  2. c = -2.0501759922108544e+40

Math

\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]

↓

\[\left(\sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\]

C

double f(double a, double c) {
        double r15747 = c;
        double r15748 = cosh(r15747);
        double r15749 = a;
        double r15750 = log1p(r15749);
        double r15751 = fmod(r15748, r15750);
        return r15751;
}

↓

double f(double a, double c) {
        double r15752 = 0.125;
        double r15753 = cbrt(r15752);
        double r15754 = c;
        double r15755 = -r15754;
        double r15756 = exp(r15755);
        double r15757 = exp(r15754);
        double r15758 = r15756 + r15757;
        double r15759 = r15753 * r15758;
        double r15760 = a;
        double r15761 = log1p(r15760);
        double r15762 = fmod(r15759, r15761);
        double r15763 = cbrt(r15762);
        double r15764 = r15763 * r15763;
        double r15765 = r15764 * r15763;
        return r15765;
}

Error

Bits error versus a

Bits error versus c

Derivation

1. Initial program 34.3

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

3. Applied add-cbrt-cube 34.3

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

4. Simplified 34.3

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

5. Taylor expanded around inf 34.3

   \[\leadsto \left(\left(\sqrt[3]{\color{blue}{\frac{1}{8} \cdot {\left(e^{c} + e^{-c}\right)}^{3}}}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
6. Using strategy rm

7. Applied cbrt-prod 34.1

   \[\leadsto \left(\color{blue}{\left(\sqrt[3]{\frac{1}{8}} \cdot \sqrt[3]{{\left(e^{c} + e^{-c}\right)}^{3}}\right)} \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]

8. Simplified 34.1

   \[\leadsto \left(\left(\sqrt[3]{\frac{1}{8}} \cdot \color{blue}{\left(e^{-c} + e^{c}\right)}\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
9. Using strategy rm

10. Applied add-cube-cbrt 33.8

    \[\leadsto \color{blue}{\left(\sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]

11. Final simplification 33.8

    \[\leadsto \left(\sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)} \cdot \sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right) \cdot \sqrt[3]{\left(\left(\sqrt[3]{\frac{1}{8}} \cdot \left(e^{-c} + e^{c}\right)\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\]

Reproduce

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