Average Error: 0.1 → 0
Time: 767.0ms
Precision: 64
\[\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1\]
\[{d1}^{10}\]
\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1
{d1}^{10}
double f(double d1) {
        double r187396 = d1;
        double r187397 = r187396 * r187396;
        double r187398 = r187396 * r187397;
        double r187399 = r187398 * r187396;
        double r187400 = r187399 * r187396;
        double r187401 = r187400 * r187397;
        double r187402 = r187401 * r187396;
        double r187403 = r187396 * r187402;
        double r187404 = r187403 * r187396;
        return r187404;
}

double f(double d1) {
        double r187405 = d1;
        double r187406 = 10.0;
        double r187407 = pow(r187405, r187406);
        return r187407;
}

Error

Bits error versus d1

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.1
Target0
Herbie0
\[{d1}^{10}\]

Derivation

  1. Initial program 0.1

    \[\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1\]
  2. Simplified0

    \[\leadsto \color{blue}{{d1}^{10}}\]
  3. Final simplification0

    \[\leadsto {d1}^{10}\]

Reproduce

herbie shell --seed 2020057 +o rules:numerics
(FPCore (d1)
  :name "FastMath test5"
  :precision binary64

  :herbie-target
  (pow d1 10)

  (* (* d1 (* (* (* (* (* d1 (* d1 d1)) d1) d1) (* d1 d1)) d1)) d1))