Random Jason Timeout Test 004

Average Error: 34.3 → 34.3

Time: 13.6s

Precision: 64

• could not determine a ground truth for program body

  1. a = -1.693185571362151e-83
  2. c = 6.49265952778414e+132

Math

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

↓

\[e^{\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]{\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)}}}\]

C

double f(double a, double c) {
        double r9415 = c;
        double r9416 = cosh(r9415);
        double r9417 = a;
        double r9418 = log1p(r9417);
        double r9419 = fmod(r9416, r9418);
        return r9419;
}

↓

double f(double a, double c) {
        double r9420 = c;
        double r9421 = cosh(r9420);
        double r9422 = a;
        double r9423 = log1p(r9422);
        double r9424 = fmod(r9421, r9423);
        double r9425 = log(r9424);
        double r9426 = cbrt(r9425);
        double r9427 = r9426 * r9426;
        double r9428 = r9427 * r9426;
        double r9429 = cbrt(r9428);
        double r9430 = r9427 * r9429;
        double r9431 = exp(r9430);
        return r9431;
}

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-exp-log 34.3

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

5. Applied add-cube-cbrt 34.3

   \[\leadsto e^{\color{blue}{\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)}}}\]
6. Using strategy rm

7. Applied add-cube-cbrt 34.3

   \[\leadsto e^{\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]{\color{blue}{\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)}}}}\]

8. Final simplification 34.3

   \[\leadsto e^{\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]{\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)}}}\]

Reproduce

herbie shell --seed 2020064 +o rules:numerics
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  :precision binary64
  (fmod (cosh c) (log1p a)))